./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/thread-join-array-const-race-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 735b3cc8 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-race-challenges/thread-join-array-const-race-3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fa0ecdfec37b7bd940900ff854c772fdadeb6c6111223868a85a6141c0a777e6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:49:42,312 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:49:42,371 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-14 01:49:42,376 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:49:42,376 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:49:42,397 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:49:42,397 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:49:42,398 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:49:42,398 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:49:42,398 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:49:42,398 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:49:42,398 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:49:42,398 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:49:42,398 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:49:42,398 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:49:42,398 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:49:42,398 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:49:42,398 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:49:42,398 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:49:42,399 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:49:42,399 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:49:42,399 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:49:42,399 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-14 01:49:42,399 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-14 01:49:42,399 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:49:42,399 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:49:42,399 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:49:42,399 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:49:42,399 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:49:42,399 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:49:42,399 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:49:42,399 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:49:42,399 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:49:42,399 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:49:42,399 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:49:42,401 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:49:42,401 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:49:42,401 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:49:42,401 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:49:42,401 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:49:42,401 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:49:42,402 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:49:42,402 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fa0ecdfec37b7bd940900ff854c772fdadeb6c6111223868a85a6141c0a777e6 [2025-03-14 01:49:42,649 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:49:42,654 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:49:42,656 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:49:42,657 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:49:42,658 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:49:42,658 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/thread-join-array-const-race-3.i [2025-03-14 01:49:43,920 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/864d1e11e/4f9ab364f7b5409cabb71ad0163fe4a0/FLAG03b50c106 [2025-03-14 01:49:44,160 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:49:44,162 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-array-const-race-3.i [2025-03-14 01:49:44,172 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/864d1e11e/4f9ab364f7b5409cabb71ad0163fe4a0/FLAG03b50c106 [2025-03-14 01:49:44,475 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/864d1e11e/4f9ab364f7b5409cabb71ad0163fe4a0 [2025-03-14 01:49:44,476 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:49:44,478 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:49:44,479 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:49:44,479 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:49:44,482 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:49:44,483 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:49:44" (1/1) ... [2025-03-14 01:49:44,485 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@504d5b7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:49:44, skipping insertion in model container [2025-03-14 01:49:44,485 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:49:44" (1/1) ... [2025-03-14 01:49:44,509 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:49:44,744 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:49:44,757 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:49:44,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:49:44,832 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:49:44,832 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:49:44 WrapperNode [2025-03-14 01:49:44,833 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:49:44,833 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:49:44,833 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:49:44,833 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:49:44,838 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:49:44" (1/1) ... [2025-03-14 01:49:44,848 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:49:44" (1/1) ... [2025-03-14 01:49:44,862 INFO L138 Inliner]: procedures = 158, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 68 [2025-03-14 01:49:44,863 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:49:44,864 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:49:44,864 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:49:44,864 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:49:44,868 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:49:44" (1/1) ... [2025-03-14 01:49:44,868 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:49:44" (1/1) ... [2025-03-14 01:49:44,870 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:49:44" (1/1) ... [2025-03-14 01:49:44,870 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:49:44" (1/1) ... [2025-03-14 01:49:44,876 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:49:44" (1/1) ... [2025-03-14 01:49:44,877 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:49:44" (1/1) ... [2025-03-14 01:49:44,878 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:49:44" (1/1) ... [2025-03-14 01:49:44,878 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:49:44" (1/1) ... [2025-03-14 01:49:44,882 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:49:44,882 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:49:44,883 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:49:44,883 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:49:44,884 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:49:44" (1/1) ... [2025-03-14 01:49:44,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:49:44,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:49:44,912 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-14 01:49:44,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-14 01:49:44,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-14 01:49:44,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-14 01:49:44,932 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-14 01:49:44,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:49:44,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-14 01:49:44,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-14 01:49:44,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 01:49:44,932 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-03-14 01:49:44,932 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-03-14 01:49:44,932 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-14 01:49:44,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:49:44,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:49:44,933 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:49:45,013 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:49:45,014 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:49:45,155 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L691: havoc main_~#tids~0#1.base, main_~#tids~0#1.offset; [2025-03-14 01:49:45,156 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L691-1: SUMMARY for call ULTIMATE.dealloc(main_~#tids~0#1.base, main_~#tids~0#1.offset); srcloc: null [2025-03-14 01:49:45,178 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:49:45,179 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:49:45,179 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:49:45,191 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:49:45,192 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:49:45 BoogieIcfgContainer [2025-03-14 01:49:45,192 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:49:45,193 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:49:45,193 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:49:45,196 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:49:45,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:49:44" (1/3) ... [2025-03-14 01:49:45,197 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eced413 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:49:45, skipping insertion in model container [2025-03-14 01:49:45,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:49:44" (2/3) ... [2025-03-14 01:49:45,197 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eced413 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:49:45, skipping insertion in model container [2025-03-14 01:49:45,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:49:45" (3/3) ... [2025-03-14 01:49:45,198 INFO L128 eAbstractionObserver]: Analyzing ICFG thread-join-array-const-race-3.i [2025-03-14 01:49:45,207 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:49:45,208 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG thread-join-array-const-race-3.i that has 2 procedures, 90 locations, 1 initial locations, 2 loop locations, and 5 error locations. [2025-03-14 01:49:45,209 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:49:45,255 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-14 01:49:45,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 109 transitions, 232 flow [2025-03-14 01:49:45,348 INFO L124 PetriNetUnfolderBase]: 2/219 cut-off events. [2025-03-14 01:49:45,349 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-14 01:49:45,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 219 events. 2/219 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 601 event pairs, 0 based on Foata normal form. 0/198 useless extension candidates. Maximal degree in co-relation 61. Up to 5 conditions per place. [2025-03-14 01:49:45,353 INFO L82 GeneralOperation]: Start removeDead. Operand has 113 places, 109 transitions, 232 flow [2025-03-14 01:49:45,358 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 108 transitions, 229 flow [2025-03-14 01:49:45,364 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:49:45,374 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;@5891aa22, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:49:45,375 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-03-14 01:49:45,383 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:49:45,383 INFO L124 PetriNetUnfolderBase]: 0/34 cut-off events. [2025-03-14 01:49:45,383 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:49:45,383 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:49:45,384 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] [2025-03-14 01:49:45,384 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-14 01:49:45,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:49:45,389 INFO L85 PathProgramCache]: Analyzing trace with hash -830835481, now seen corresponding path program 1 times [2025-03-14 01:49:45,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:49:45,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643889648] [2025-03-14 01:49:45,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:49:45,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:49:45,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-14 01:49:45,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-14 01:49:45,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:49:45,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:49:46,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:49:46,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:49:46,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643889648] [2025-03-14 01:49:46,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643889648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:49:46,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:49:46,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:49:46,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337785910] [2025-03-14 01:49:46,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:49:46,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:49:46,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:49:46,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:49:46,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:49:46,309 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 109 [2025-03-14 01:49:46,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 108 transitions, 229 flow. Second operand has 6 states, 6 states have (on average 79.5) internal successors, (477), 6 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:49:46,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:49:46,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 109 [2025-03-14 01:49:46,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:49:46,540 INFO L124 PetriNetUnfolderBase]: 138/786 cut-off events. [2025-03-14 01:49:46,540 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-03-14 01:49:46,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1116 conditions, 786 events. 138/786 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 4905 event pairs, 87 based on Foata normal form. 0/702 useless extension candidates. Maximal degree in co-relation 826. Up to 276 conditions per place. [2025-03-14 01:49:46,548 INFO L140 encePairwiseOnDemand]: 103/109 looper letters, 33 selfloop transitions, 5 changer transitions 0/115 dead transitions. [2025-03-14 01:49:46,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 115 transitions, 319 flow [2025-03-14 01:49:46,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:49:46,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:49:46,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 507 transitions. [2025-03-14 01:49:46,562 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7752293577981652 [2025-03-14 01:49:46,563 INFO L175 Difference]: Start difference. First operand has 112 places, 108 transitions, 229 flow. Second operand 6 states and 507 transitions. [2025-03-14 01:49:46,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 115 transitions, 319 flow [2025-03-14 01:49:46,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 115 transitions, 315 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:49:46,571 INFO L231 Difference]: Finished difference. Result has 114 places, 107 transitions, 233 flow [2025-03-14 01:49:46,573 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=233, PETRI_PLACES=114, PETRI_TRANSITIONS=107} [2025-03-14 01:49:46,575 INFO L279 CegarLoopForPetriNet]: 112 programPoint places, 2 predicate places. [2025-03-14 01:49:46,576 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 107 transitions, 233 flow [2025-03-14 01:49:46,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 79.5) internal successors, (477), 6 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:49:46,576 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:49:46,576 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] [2025-03-14 01:49:46,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:49:46,577 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-14 01:49:46,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:49:46,577 INFO L85 PathProgramCache]: Analyzing trace with hash 390208220, now seen corresponding path program 1 times [2025-03-14 01:49:46,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:49:46,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730309581] [2025-03-14 01:49:46,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:49:46,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:49:46,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-14 01:49:46,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 01:49:46,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:49:46,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:49:46,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:49:46,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:49:46,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730309581] [2025-03-14 01:49:46,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730309581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:49:46,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:49:46,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 01:49:46,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73244538] [2025-03-14 01:49:46,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:49:46,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 01:49:46,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:49:46,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 01:49:46,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-14 01:49:46,673 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 109 [2025-03-14 01:49:46,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 107 transitions, 233 flow. Second operand has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:49:46,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:49:46,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 109 [2025-03-14 01:49:46,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:49:46,734 INFO L124 PetriNetUnfolderBase]: 33/416 cut-off events. [2025-03-14 01:49:46,735 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-03-14 01:49:46,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 522 conditions, 416 events. 33/416 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1806 event pairs, 9 based on Foata normal form. 1/376 useless extension candidates. Maximal degree in co-relation 459. Up to 43 conditions per place. [2025-03-14 01:49:46,738 INFO L140 encePairwiseOnDemand]: 104/109 looper letters, 17 selfloop transitions, 4 changer transitions 0/113 dead transitions. [2025-03-14 01:49:46,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 113 transitions, 287 flow [2025-03-14 01:49:46,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 01:49:46,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 01:49:46,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 398 transitions. [2025-03-14 01:49:46,740 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9128440366972477 [2025-03-14 01:49:46,740 INFO L175 Difference]: Start difference. First operand has 114 places, 107 transitions, 233 flow. Second operand 4 states and 398 transitions. [2025-03-14 01:49:46,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 113 transitions, 287 flow [2025-03-14 01:49:46,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 113 transitions, 277 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:49:46,743 INFO L231 Difference]: Finished difference. Result has 113 places, 107 transitions, 235 flow [2025-03-14 01:49:46,743 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=235, PETRI_PLACES=113, PETRI_TRANSITIONS=107} [2025-03-14 01:49:46,744 INFO L279 CegarLoopForPetriNet]: 112 programPoint places, 1 predicate places. [2025-03-14 01:49:46,744 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 107 transitions, 235 flow [2025-03-14 01:49:46,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:49:46,745 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:49:46,745 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:49:46,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:49:46,745 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-14 01:49:46,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:49:46,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1683771978, now seen corresponding path program 1 times [2025-03-14 01:49:46,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:49:46,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265094785] [2025-03-14 01:49:46,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:49:46,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:49:46,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-14 01:49:46,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-14 01:49:46,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:49:46,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:49:46,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:49:46,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:49:46,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265094785] [2025-03-14 01:49:46,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265094785] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:49:46,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:49:46,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:49:46,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377757597] [2025-03-14 01:49:46,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:49:46,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:49:46,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:49:46,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:49:46,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:49:46,817 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 109 [2025-03-14 01:49:46,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 107 transitions, 235 flow. Second operand has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:49:46,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:49:46,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 109 [2025-03-14 01:49:46,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:49:46,894 INFO L124 PetriNetUnfolderBase]: 112/709 cut-off events. [2025-03-14 01:49:46,894 INFO L125 PetriNetUnfolderBase]: For 28/38 co-relation queries the response was YES. [2025-03-14 01:49:46,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 967 conditions, 709 events. 112/709 cut-off events. For 28/38 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 4282 event pairs, 59 based on Foata normal form. 1/628 useless extension candidates. Maximal degree in co-relation 910. Up to 182 conditions per place. [2025-03-14 01:49:46,898 INFO L140 encePairwiseOnDemand]: 103/109 looper letters, 18 selfloop transitions, 5 changer transitions 0/115 dead transitions. [2025-03-14 01:49:46,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 115 transitions, 299 flow [2025-03-14 01:49:46,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:49:46,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:49:46,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 306 transitions. [2025-03-14 01:49:46,901 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9357798165137615 [2025-03-14 01:49:46,901 INFO L175 Difference]: Start difference. First operand has 113 places, 107 transitions, 235 flow. Second operand 3 states and 306 transitions. [2025-03-14 01:49:46,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 115 transitions, 299 flow [2025-03-14 01:49:46,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 115 transitions, 291 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-14 01:49:46,904 INFO L231 Difference]: Finished difference. Result has 114 places, 111 transitions, 265 flow [2025-03-14 01:49:46,904 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=265, PETRI_PLACES=114, PETRI_TRANSITIONS=111} [2025-03-14 01:49:46,905 INFO L279 CegarLoopForPetriNet]: 112 programPoint places, 2 predicate places. [2025-03-14 01:49:46,905 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 111 transitions, 265 flow [2025-03-14 01:49:46,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:49:46,905 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:49:46,905 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] [2025-03-14 01:49:46,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:49:46,907 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-14 01:49:46,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:49:46,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1724812119, now seen corresponding path program 1 times [2025-03-14 01:49:46,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:49:46,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495875253] [2025-03-14 01:49:46,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:49:46,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:49:46,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-14 01:49:46,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-14 01:49:46,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:49:46,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:49:46,935 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 01:49:46,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-14 01:49:46,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-14 01:49:46,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:49:46,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:49:46,970 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 01:49:46,970 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 01:49:46,971 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2025-03-14 01:49:46,974 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2025-03-14 01:49:46,975 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2025-03-14 01:49:46,975 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2025-03-14 01:49:46,975 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2025-03-14 01:49:46,975 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 9 remaining) [2025-03-14 01:49:46,975 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2025-03-14 01:49:46,975 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2025-03-14 01:49:46,975 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2025-03-14 01:49:46,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:49:46,976 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-14 01:49:46,978 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 01:49:46,979 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-14 01:49:47,004 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-14 01:49:47,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 145 transitions, 322 flow [2025-03-14 01:49:47,042 INFO L124 PetriNetUnfolderBase]: 7/386 cut-off events. [2025-03-14 01:49:47,042 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-14 01:49:47,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 414 conditions, 386 events. 7/386 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1328 event pairs, 1 based on Foata normal form. 0/348 useless extension candidates. Maximal degree in co-relation 409. Up to 12 conditions per place. [2025-03-14 01:49:47,043 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 145 transitions, 322 flow [2025-03-14 01:49:47,045 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 131 places, 126 transitions, 274 flow [2025-03-14 01:49:47,045 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:49:47,046 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5891aa22, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:49:47,046 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-03-14 01:49:47,048 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:49:47,048 INFO L124 PetriNetUnfolderBase]: 0/34 cut-off events. [2025-03-14 01:49:47,048 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:49:47,048 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:49:47,048 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] [2025-03-14 01:49:47,049 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-14 01:49:47,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:49:47,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1843808921, now seen corresponding path program 1 times [2025-03-14 01:49:47,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:49:47,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44871015] [2025-03-14 01:49:47,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:49:47,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:49:47,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-14 01:49:47,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-14 01:49:47,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:49:47,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:49:47,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:49:47,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:49:47,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44871015] [2025-03-14 01:49:47,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44871015] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:49:47,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:49:47,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:49:47,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962124038] [2025-03-14 01:49:47,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:49:47,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:49:47,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:49:47,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:49:47,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:49:47,409 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 145 [2025-03-14 01:49:47,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 126 transitions, 274 flow. Second operand has 6 states, 6 states have (on average 107.5) internal successors, (645), 6 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:49:47,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:49:47,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 145 [2025-03-14 01:49:47,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:49:47,778 INFO L124 PetriNetUnfolderBase]: 879/3345 cut-off events. [2025-03-14 01:49:47,779 INFO L125 PetriNetUnfolderBase]: For 166/166 co-relation queries the response was YES. [2025-03-14 01:49:47,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4952 conditions, 3345 events. 879/3345 cut-off events. For 166/166 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 29366 event pairs, 505 based on Foata normal form. 0/3021 useless extension candidates. Maximal degree in co-relation 1438. Up to 1365 conditions per place. [2025-03-14 01:49:47,797 INFO L140 encePairwiseOnDemand]: 139/145 looper letters, 45 selfloop transitions, 5 changer transitions 0/141 dead transitions. [2025-03-14 01:49:47,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 141 transitions, 404 flow [2025-03-14 01:49:47,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:49:47,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:49:47,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 687 transitions. [2025-03-14 01:49:47,799 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7896551724137931 [2025-03-14 01:49:47,799 INFO L175 Difference]: Start difference. First operand has 131 places, 126 transitions, 274 flow. Second operand 6 states and 687 transitions. [2025-03-14 01:49:47,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 141 transitions, 404 flow [2025-03-14 01:49:47,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 141 transitions, 400 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:49:47,804 INFO L231 Difference]: Finished difference. Result has 133 places, 125 transitions, 278 flow [2025-03-14 01:49:47,804 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=278, PETRI_PLACES=133, PETRI_TRANSITIONS=125} [2025-03-14 01:49:47,805 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 2 predicate places. [2025-03-14 01:49:47,806 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 125 transitions, 278 flow [2025-03-14 01:49:47,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 107.5) internal successors, (645), 6 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:49:47,806 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:49:47,806 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] [2025-03-14 01:49:47,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:49:47,807 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-14 01:49:47,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:49:47,809 INFO L85 PathProgramCache]: Analyzing trace with hash -947197220, now seen corresponding path program 1 times [2025-03-14 01:49:47,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:49:47,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231500824] [2025-03-14 01:49:47,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:49:47,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:49:47,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-14 01:49:47,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 01:49:47,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:49:47,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:49:47,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:49:47,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:49:47,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231500824] [2025-03-14 01:49:47,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231500824] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:49:47,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:49:47,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 01:49:47,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498989918] [2025-03-14 01:49:47,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:49:47,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 01:49:47,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:49:47,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 01:49:47,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-14 01:49:47,876 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 145 [2025-03-14 01:49:47,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 125 transitions, 278 flow. Second operand has 4 states, 4 states have (on average 123.25) internal successors, (493), 4 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:49:47,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:49:47,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 145 [2025-03-14 01:49:47,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:49:48,037 INFO L124 PetriNetUnfolderBase]: 253/1589 cut-off events. [2025-03-14 01:49:48,037 INFO L125 PetriNetUnfolderBase]: For 133/133 co-relation queries the response was YES. [2025-03-14 01:49:48,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2112 conditions, 1589 events. 253/1589 cut-off events. For 133/133 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 11722 event pairs, 101 based on Foata normal form. 1/1437 useless extension candidates. Maximal degree in co-relation 1094. Up to 267 conditions per place. [2025-03-14 01:49:48,044 INFO L140 encePairwiseOnDemand]: 140/145 looper letters, 24 selfloop transitions, 4 changer transitions 0/134 dead transitions. [2025-03-14 01:49:48,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 134 transitions, 352 flow [2025-03-14 01:49:48,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 01:49:48,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 01:49:48,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 517 transitions. [2025-03-14 01:49:48,045 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8913793103448275 [2025-03-14 01:49:48,045 INFO L175 Difference]: Start difference. First operand has 133 places, 125 transitions, 278 flow. Second operand 4 states and 517 transitions. [2025-03-14 01:49:48,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 134 transitions, 352 flow [2025-03-14 01:49:48,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 134 transitions, 342 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:49:48,048 INFO L231 Difference]: Finished difference. Result has 132 places, 126 transitions, 284 flow [2025-03-14 01:49:48,048 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=284, PETRI_PLACES=132, PETRI_TRANSITIONS=126} [2025-03-14 01:49:48,048 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 1 predicate places. [2025-03-14 01:49:48,048 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 126 transitions, 284 flow [2025-03-14 01:49:48,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.25) internal successors, (493), 4 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:49:48,049 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:49:48,049 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:49:48,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:49:48,049 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-14 01:49:48,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:49:48,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1321164474, now seen corresponding path program 1 times [2025-03-14 01:49:48,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:49:48,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384283692] [2025-03-14 01:49:48,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:49:48,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:49:48,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-14 01:49:48,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-14 01:49:48,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:49:48,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:49:48,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:49:48,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:49:48,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384283692] [2025-03-14 01:49:48,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384283692] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:49:48,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:49:48,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:49:48,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913662428] [2025-03-14 01:49:48,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:49:48,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:49:48,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:49:48,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:49:48,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:49:48,100 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 145 [2025-03-14 01:49:48,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 126 transitions, 284 flow. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:49:48,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:49:48,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 145 [2025-03-14 01:49:48,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:49:48,456 INFO L124 PetriNetUnfolderBase]: 1070/3962 cut-off events. [2025-03-14 01:49:48,456 INFO L125 PetriNetUnfolderBase]: For 341/341 co-relation queries the response was YES. [2025-03-14 01:49:48,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5831 conditions, 3962 events. 1070/3962 cut-off events. For 341/341 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 37129 event pairs, 701 based on Foata normal form. 0/3518 useless extension candidates. Maximal degree in co-relation 5709. Up to 1393 conditions per place. [2025-03-14 01:49:48,484 INFO L140 encePairwiseOnDemand]: 138/145 looper letters, 27 selfloop transitions, 6 changer transitions 0/139 dead transitions. [2025-03-14 01:49:48,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 139 transitions, 386 flow [2025-03-14 01:49:48,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:49:48,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:49:48,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 394 transitions. [2025-03-14 01:49:48,486 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9057471264367816 [2025-03-14 01:49:48,486 INFO L175 Difference]: Start difference. First operand has 132 places, 126 transitions, 284 flow. Second operand 3 states and 394 transitions. [2025-03-14 01:49:48,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 139 transitions, 386 flow [2025-03-14 01:49:48,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 139 transitions, 380 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:49:48,489 INFO L231 Difference]: Finished difference. Result has 134 places, 131 transitions, 324 flow [2025-03-14 01:49:48,489 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=324, PETRI_PLACES=134, PETRI_TRANSITIONS=131} [2025-03-14 01:49:48,490 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 3 predicate places. [2025-03-14 01:49:48,490 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 131 transitions, 324 flow [2025-03-14 01:49:48,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:49:48,490 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:49:48,490 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:49:48,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:49:48,491 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-14 01:49:48,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:49:48,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1821806118, now seen corresponding path program 1 times [2025-03-14 01:49:48,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:49:48,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156999172] [2025-03-14 01:49:48,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:49:48,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:49:48,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-14 01:49:48,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-14 01:49:48,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:49:48,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:49:48,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:49:48,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:49:48,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156999172] [2025-03-14 01:49:48,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156999172] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:49:48,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:49:48,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 01:49:48,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077466191] [2025-03-14 01:49:48,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:49:48,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:49:48,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:49:48,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:49:48,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:49:48,671 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 145 [2025-03-14 01:49:48,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 131 transitions, 324 flow. Second operand has 6 states, 6 states have (on average 121.5) internal successors, (729), 6 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:49:48,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:49:48,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 145 [2025-03-14 01:49:48,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:49:49,010 INFO L124 PetriNetUnfolderBase]: 640/3440 cut-off events. [2025-03-14 01:49:49,010 INFO L125 PetriNetUnfolderBase]: For 292/304 co-relation queries the response was YES. [2025-03-14 01:49:49,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4874 conditions, 3440 events. 640/3440 cut-off events. For 292/304 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 31050 event pairs, 147 based on Foata normal form. 3/2997 useless extension candidates. Maximal degree in co-relation 2772. Up to 401 conditions per place. [2025-03-14 01:49:49,029 INFO L140 encePairwiseOnDemand]: 138/145 looper letters, 33 selfloop transitions, 7 changer transitions 0/149 dead transitions. [2025-03-14 01:49:49,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 149 transitions, 440 flow [2025-03-14 01:49:49,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-14 01:49:49,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-14 01:49:49,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 881 transitions. [2025-03-14 01:49:49,033 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8679802955665025 [2025-03-14 01:49:49,033 INFO L175 Difference]: Start difference. First operand has 134 places, 131 transitions, 324 flow. Second operand 7 states and 881 transitions. [2025-03-14 01:49:49,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 149 transitions, 440 flow [2025-03-14 01:49:49,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 149 transitions, 428 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:49:49,036 INFO L231 Difference]: Finished difference. Result has 141 places, 133 transitions, 342 flow [2025-03-14 01:49:49,037 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=342, PETRI_PLACES=141, PETRI_TRANSITIONS=133} [2025-03-14 01:49:49,038 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 10 predicate places. [2025-03-14 01:49:49,038 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 133 transitions, 342 flow [2025-03-14 01:49:49,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.5) internal successors, (729), 6 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:49:49,039 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:49:49,039 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] [2025-03-14 01:49:49,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:49:49,039 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-14 01:49:49,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:49:49,040 INFO L85 PathProgramCache]: Analyzing trace with hash 484914875, now seen corresponding path program 1 times [2025-03-14 01:49:49,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:49:49,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994810890] [2025-03-14 01:49:49,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:49:49,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:49:49,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-14 01:49:49,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-14 01:49:49,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:49:49,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:49:49,081 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 01:49:49,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:49:49,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994810890] [2025-03-14 01:49:49,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994810890] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:49:49,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:49:49,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:49:49,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878867369] [2025-03-14 01:49:49,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:49:49,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:49:49,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:49:49,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:49:49,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:49:49,105 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 145 [2025-03-14 01:49:49,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 133 transitions, 342 flow. Second operand has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:49:49,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:49:49,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 145 [2025-03-14 01:49:49,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:49:49,722 INFO L124 PetriNetUnfolderBase]: 1661/6017 cut-off events. [2025-03-14 01:49:49,722 INFO L125 PetriNetUnfolderBase]: For 1158/1202 co-relation queries the response was YES. [2025-03-14 01:49:49,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9998 conditions, 6017 events. 1661/6017 cut-off events. For 1158/1202 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 60391 event pairs, 951 based on Foata normal form. 2/5317 useless extension candidates. Maximal degree in co-relation 9889. Up to 2039 conditions per place. [2025-03-14 01:49:49,768 INFO L140 encePairwiseOnDemand]: 138/145 looper letters, 28 selfloop transitions, 9 changer transitions 0/147 dead transitions. [2025-03-14 01:49:49,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 147 transitions, 459 flow [2025-03-14 01:49:49,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:49:49,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:49:49,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 393 transitions. [2025-03-14 01:49:49,772 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.903448275862069 [2025-03-14 01:49:49,772 INFO L175 Difference]: Start difference. First operand has 141 places, 133 transitions, 342 flow. Second operand 3 states and 393 transitions. [2025-03-14 01:49:49,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 147 transitions, 459 flow [2025-03-14 01:49:49,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 147 transitions, 449 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-03-14 01:49:49,782 INFO L231 Difference]: Finished difference. Result has 142 places, 140 transitions, 408 flow [2025-03-14 01:49:49,783 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=408, PETRI_PLACES=142, PETRI_TRANSITIONS=140} [2025-03-14 01:49:49,785 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 11 predicate places. [2025-03-14 01:49:49,786 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 140 transitions, 408 flow [2025-03-14 01:49:49,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:49:49,786 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:49:49,786 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:49:49,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 01:49:49,786 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-14 01:49:49,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:49:49,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1384773304, now seen corresponding path program 1 times [2025-03-14 01:49:49,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:49:49,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558766898] [2025-03-14 01:49:49,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:49:49,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:49:49,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-14 01:49:49,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-14 01:49:49,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:49:49,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:49:49,807 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 01:49:49,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-14 01:49:49,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-14 01:49:49,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:49:49,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:49:49,854 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 01:49:49,854 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 01:49:49,854 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-03-14 01:49:49,854 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2025-03-14 01:49:49,855 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2025-03-14 01:49:49,855 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2025-03-14 01:49:49,855 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2025-03-14 01:49:49,855 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 11 remaining) [2025-03-14 01:49:49,855 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2025-03-14 01:49:49,855 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2025-03-14 01:49:49,855 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2025-03-14 01:49:49,855 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2025-03-14 01:49:49,855 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2025-03-14 01:49:49,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 01:49:49,855 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-14 01:49:49,855 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 01:49:49,855 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-14 01:49:49,876 INFO L143 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2025-03-14 01:49:49,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 189 places, 181 transitions, 416 flow [2025-03-14 01:49:49,921 INFO L124 PetriNetUnfolderBase]: 20/657 cut-off events. [2025-03-14 01:49:49,921 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-03-14 01:49:49,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 713 conditions, 657 events. 20/657 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2746 event pairs, 6 based on Foata normal form. 0/590 useless extension candidates. Maximal degree in co-relation 706. Up to 32 conditions per place. [2025-03-14 01:49:49,923 INFO L82 GeneralOperation]: Start removeDead. Operand has 189 places, 181 transitions, 416 flow [2025-03-14 01:49:49,925 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 150 places, 144 transitions, 321 flow [2025-03-14 01:49:49,926 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:49:49,926 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;@5891aa22, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:49:49,926 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-03-14 01:49:49,928 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:49:49,929 INFO L124 PetriNetUnfolderBase]: 0/34 cut-off events. [2025-03-14 01:49:49,929 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:49:49,929 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:49:49,929 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] [2025-03-14 01:49:49,930 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-14 01:49:49,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:49:49,930 INFO L85 PathProgramCache]: Analyzing trace with hash 616415243, now seen corresponding path program 1 times [2025-03-14 01:49:49,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:49:49,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892932176] [2025-03-14 01:49:49,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:49:49,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:49:49,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-14 01:49:49,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-14 01:49:49,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:49:49,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:49:50,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:49:50,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:49:50,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892932176] [2025-03-14 01:49:50,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892932176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:49:50,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:49:50,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:49:50,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177183921] [2025-03-14 01:49:50,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:49:50,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:49:50,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:49:50,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:49:50,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:49:50,241 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 181 [2025-03-14 01:49:50,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 144 transitions, 321 flow. Second operand has 6 states, 6 states have (on average 135.5) internal successors, (813), 6 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:49:50,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:49:50,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 181 [2025-03-14 01:49:50,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:49:51,456 INFO L124 PetriNetUnfolderBase]: 4640/13687 cut-off events. [2025-03-14 01:49:51,456 INFO L125 PetriNetUnfolderBase]: For 903/903 co-relation queries the response was YES. [2025-03-14 01:49:51,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21098 conditions, 13687 events. 4640/13687 cut-off events. For 903/903 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 142615 event pairs, 2591 based on Foata normal form. 0/12582 useless extension candidates. Maximal degree in co-relation 4944. Up to 6402 conditions per place. [2025-03-14 01:49:51,533 INFO L140 encePairwiseOnDemand]: 175/181 looper letters, 57 selfloop transitions, 5 changer transitions 0/167 dead transitions. [2025-03-14 01:49:51,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 167 transitions, 491 flow [2025-03-14 01:49:51,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:49:51,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:49:51,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 867 transitions. [2025-03-14 01:49:51,535 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7983425414364641 [2025-03-14 01:49:51,535 INFO L175 Difference]: Start difference. First operand has 150 places, 144 transitions, 321 flow. Second operand 6 states and 867 transitions. [2025-03-14 01:49:51,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 167 transitions, 491 flow [2025-03-14 01:49:51,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 167 transitions, 487 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:49:51,541 INFO L231 Difference]: Finished difference. Result has 152 places, 143 transitions, 325 flow [2025-03-14 01:49:51,541 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=325, PETRI_PLACES=152, PETRI_TRANSITIONS=143} [2025-03-14 01:49:51,542 INFO L279 CegarLoopForPetriNet]: 150 programPoint places, 2 predicate places. [2025-03-14 01:49:51,542 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 143 transitions, 325 flow [2025-03-14 01:49:51,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 135.5) internal successors, (813), 6 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:49:51,543 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:49:51,543 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] [2025-03-14 01:49:51,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 01:49:51,543 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-14 01:49:51,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:49:51,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1989659300, now seen corresponding path program 1 times [2025-03-14 01:49:51,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:49:51,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659946877] [2025-03-14 01:49:51,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:49:51,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:49:51,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-14 01:49:51,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 01:49:51,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:49:51,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:49:51,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:49:51,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:49:51,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659946877] [2025-03-14 01:49:51,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659946877] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:49:51,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:49:51,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 01:49:51,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371884206] [2025-03-14 01:49:51,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:49:51,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 01:49:51,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:49:51,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 01:49:51,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-14 01:49:51,610 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 181 [2025-03-14 01:49:51,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 143 transitions, 325 flow. Second operand has 4 states, 4 states have (on average 151.25) internal successors, (605), 4 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:49:51,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:49:51,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 181 [2025-03-14 01:49:51,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:49:52,197 INFO L124 PetriNetUnfolderBase]: 1406/6341 cut-off events. [2025-03-14 01:49:52,197 INFO L125 PetriNetUnfolderBase]: For 782/782 co-relation queries the response was YES. [2025-03-14 01:49:52,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8798 conditions, 6341 events. 1406/6341 cut-off events. For 782/782 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 62237 event pairs, 529 based on Foata normal form. 1/5725 useless extension candidates. Maximal degree in co-relation 2746. Up to 1304 conditions per place. [2025-03-14 01:49:52,228 INFO L140 encePairwiseOnDemand]: 176/181 looper letters, 30 selfloop transitions, 4 changer transitions 0/154 dead transitions. [2025-03-14 01:49:52,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 154 transitions, 415 flow [2025-03-14 01:49:52,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 01:49:52,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 01:49:52,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 635 transitions. [2025-03-14 01:49:52,230 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8770718232044199 [2025-03-14 01:49:52,230 INFO L175 Difference]: Start difference. First operand has 152 places, 143 transitions, 325 flow. Second operand 4 states and 635 transitions. [2025-03-14 01:49:52,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 154 transitions, 415 flow [2025-03-14 01:49:52,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 154 transitions, 405 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:49:52,233 INFO L231 Difference]: Finished difference. Result has 151 places, 144 transitions, 331 flow [2025-03-14 01:49:52,234 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=331, PETRI_PLACES=151, PETRI_TRANSITIONS=144} [2025-03-14 01:49:52,235 INFO L279 CegarLoopForPetriNet]: 150 programPoint places, 1 predicate places. [2025-03-14 01:49:52,235 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 144 transitions, 331 flow [2025-03-14 01:49:52,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 151.25) internal successors, (605), 4 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:49:52,236 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:49:52,236 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:49:52,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-14 01:49:52,236 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-14 01:49:52,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:49:52,236 INFO L85 PathProgramCache]: Analyzing trace with hash 2125502206, now seen corresponding path program 1 times [2025-03-14 01:49:52,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:49:52,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907565276] [2025-03-14 01:49:52,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:49:52,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:49:52,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-14 01:49:52,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-14 01:49:52,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:49:52,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:49:52,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:49:52,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:49:52,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907565276] [2025-03-14 01:49:52,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907565276] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:49:52,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:49:52,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:49:52,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919588380] [2025-03-14 01:49:52,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:49:52,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:49:52,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:49:52,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:49:52,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:49:52,296 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 181 [2025-03-14 01:49:52,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 144 transitions, 331 flow. Second operand has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:49:52,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:49:52,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 181 [2025-03-14 01:49:52,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:49:54,426 INFO L124 PetriNetUnfolderBase]: 7632/23898 cut-off events. [2025-03-14 01:49:54,426 INFO L125 PetriNetUnfolderBase]: For 2850/2940 co-relation queries the response was YES. [2025-03-14 01:49:54,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35893 conditions, 23898 events. 7632/23898 cut-off events. For 2850/2940 co-relation queries the response was YES. Maximal size of possible extension queue 763. Compared 284826 event pairs, 4688 based on Foata normal form. 3/21137 useless extension candidates. Maximal degree in co-relation 35344. Up to 8983 conditions per place. [2025-03-14 01:49:54,554 INFO L140 encePairwiseOnDemand]: 173/181 looper letters, 36 selfloop transitions, 7 changer transitions 0/162 dead transitions. [2025-03-14 01:49:54,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 162 transitions, 473 flow [2025-03-14 01:49:54,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:49:54,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:49:54,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 482 transitions. [2025-03-14 01:49:54,556 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8876611418047882 [2025-03-14 01:49:54,556 INFO L175 Difference]: Start difference. First operand has 151 places, 144 transitions, 331 flow. Second operand 3 states and 482 transitions. [2025-03-14 01:49:54,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 162 transitions, 473 flow [2025-03-14 01:49:54,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 162 transitions, 467 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:49:54,564 INFO L231 Difference]: Finished difference. Result has 153 places, 150 transitions, 379 flow [2025-03-14 01:49:54,564 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=379, PETRI_PLACES=153, PETRI_TRANSITIONS=150} [2025-03-14 01:49:54,566 INFO L279 CegarLoopForPetriNet]: 150 programPoint places, 3 predicate places. [2025-03-14 01:49:54,566 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 150 transitions, 379 flow [2025-03-14 01:49:54,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:49:54,566 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:49:54,566 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:49:54,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-14 01:49:54,567 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-14 01:49:54,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:49:54,567 INFO L85 PathProgramCache]: Analyzing trace with hash -961407010, now seen corresponding path program 1 times [2025-03-14 01:49:54,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:49:54,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848043113] [2025-03-14 01:49:54,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:49:54,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:49:54,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-14 01:49:54,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-14 01:49:54,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:49:54,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:49:54,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:49:54,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:49:54,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848043113] [2025-03-14 01:49:54,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848043113] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:49:54,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:49:54,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 01:49:54,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369580102] [2025-03-14 01:49:54,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:49:54,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:49:54,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:49:54,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:49:54,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:49:54,719 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 181 [2025-03-14 01:49:54,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 150 transitions, 379 flow. Second operand has 6 states, 6 states have (on average 149.5) internal successors, (897), 6 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:49:54,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:49:54,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 181 [2025-03-14 01:49:54,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:49:56,273 INFO L124 PetriNetUnfolderBase]: 4543/18575 cut-off events. [2025-03-14 01:49:56,273 INFO L125 PetriNetUnfolderBase]: For 1933/2089 co-relation queries the response was YES. [2025-03-14 01:49:56,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27207 conditions, 18575 events. 4543/18575 cut-off events. For 1933/2089 co-relation queries the response was YES. Maximal size of possible extension queue 527. Compared 225632 event pairs, 1506 based on Foata normal form. 3/15979 useless extension candidates. Maximal degree in co-relation 7600. Up to 2942 conditions per place. [2025-03-14 01:49:56,391 INFO L140 encePairwiseOnDemand]: 174/181 looper letters, 41 selfloop transitions, 7 changer transitions 0/172 dead transitions. [2025-03-14 01:49:56,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 172 transitions, 521 flow [2025-03-14 01:49:56,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-14 01:49:56,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-14 01:49:56,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1085 transitions. [2025-03-14 01:49:56,393 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.856353591160221 [2025-03-14 01:49:56,393 INFO L175 Difference]: Start difference. First operand has 153 places, 150 transitions, 379 flow. Second operand 7 states and 1085 transitions. [2025-03-14 01:49:56,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 172 transitions, 521 flow [2025-03-14 01:49:56,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 172 transitions, 507 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:49:56,405 INFO L231 Difference]: Finished difference. Result has 160 places, 153 transitions, 401 flow [2025-03-14 01:49:56,405 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=401, PETRI_PLACES=160, PETRI_TRANSITIONS=153} [2025-03-14 01:49:56,405 INFO L279 CegarLoopForPetriNet]: 150 programPoint places, 10 predicate places. [2025-03-14 01:49:56,406 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 153 transitions, 401 flow [2025-03-14 01:49:56,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 149.5) internal successors, (897), 6 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:49:56,406 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:49:56,406 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] [2025-03-14 01:49:56,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-14 01:49:56,407 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-14 01:49:56,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:49:56,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1592662085, now seen corresponding path program 1 times [2025-03-14 01:49:56,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:49:56,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3929875] [2025-03-14 01:49:56,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:49:56,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:49:56,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-14 01:49:56,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-14 01:49:56,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:49:56,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:49:56,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 01:49:56,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:49:56,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3929875] [2025-03-14 01:49:56,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3929875] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:49:56,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:49:56,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:49:56,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795324206] [2025-03-14 01:49:56,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:49:56,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:49:56,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:49:56,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:49:56,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:49:56,460 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 181 [2025-03-14 01:49:56,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 153 transitions, 401 flow. Second operand has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:49:56,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:49:56,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 181 [2025-03-14 01:49:56,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:49:59,259 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([416] L699-3-->L699-1: Formula: (= |v_#race~data~0_3| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_3|} AuxVars[] AssignedVars[#race~data~0][161], [73#threadENTRYtrue, 6#L685-2true, 210#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), Black: 201#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 149#L685-2true, Black: 205#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 183#true, 182#true, 116#L699-1true, 180#true, Black: 211#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 219#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|)), 223#true, Black: 217#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|) (= |ULTIMATE.start_main_#t~post7#1| 0))]) [2025-03-14 01:49:59,259 INFO L294 olderBase$Statistics]: this new event has 130 ancestors and is cut-off event [2025-03-14 01:49:59,259 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-14 01:49:59,259 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2025-03-14 01:49:59,260 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-14 01:49:59,260 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([416] L699-3-->L699-1: Formula: (= |v_#race~data~0_3| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_3|} AuxVars[] AssignedVars[#race~data~0][161], [6#L685-2true, 210#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), Black: 201#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 149#L685-2true, Black: 205#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 183#true, 182#true, 116#L699-1true, 49#L684true, 180#true, Black: 211#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 219#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|)), 223#true, Black: 217#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|) (= |ULTIMATE.start_main_#t~post7#1| 0))]) [2025-03-14 01:49:59,260 INFO L294 olderBase$Statistics]: this new event has 132 ancestors and is cut-off event [2025-03-14 01:49:59,260 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2025-03-14 01:49:59,260 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2025-03-14 01:49:59,260 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2025-03-14 01:49:59,563 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([416] L699-3-->L699-1: Formula: (= |v_#race~data~0_3| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_3|} AuxVars[] AssignedVars[#race~data~0][161], [111#L686true, 6#L685-2true, 210#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), Black: 201#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 149#L685-2true, Black: 205#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 183#true, 182#true, 116#L699-1true, 180#true, Black: 211#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 219#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|)), 223#true, Black: 217#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|) (= |ULTIMATE.start_main_#t~post7#1| 0))]) [2025-03-14 01:49:59,563 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2025-03-14 01:49:59,563 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-03-14 01:49:59,563 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2025-03-14 01:49:59,563 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-03-14 01:49:59,563 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([416] L699-3-->L699-1: Formula: (= |v_#race~data~0_3| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_3|} AuxVars[] AssignedVars[#race~data~0][161], [210#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), 6#L685-2true, Black: 201#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 149#L685-2true, Black: 205#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 183#true, 182#true, 116#L699-1true, 180#true, 48#L685-1true, Black: 211#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 223#true, Black: 219#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|)), Black: 217#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|) (= |ULTIMATE.start_main_#t~post7#1| 0))]) [2025-03-14 01:49:59,563 INFO L294 olderBase$Statistics]: this new event has 138 ancestors and is cut-off event [2025-03-14 01:49:59,564 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2025-03-14 01:49:59,564 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2025-03-14 01:49:59,564 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2025-03-14 01:50:00,172 INFO L124 PetriNetUnfolderBase]: 13096/40137 cut-off events. [2025-03-14 01:50:00,173 INFO L125 PetriNetUnfolderBase]: For 9397/10150 co-relation queries the response was YES. [2025-03-14 01:50:00,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67560 conditions, 40137 events. 13096/40137 cut-off events. For 9397/10150 co-relation queries the response was YES. Maximal size of possible extension queue 1401. Compared 514651 event pairs, 6801 based on Foata normal form. 29/35212 useless extension candidates. Maximal degree in co-relation 66468. Up to 14649 conditions per place. [2025-03-14 01:50:00,413 INFO L140 encePairwiseOnDemand]: 173/181 looper letters, 38 selfloop transitions, 11 changer transitions 0/173 dead transitions. [2025-03-14 01:50:00,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 173 transitions, 568 flow [2025-03-14 01:50:00,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:50:00,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:50:00,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 481 transitions. [2025-03-14 01:50:00,415 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8858195211786372 [2025-03-14 01:50:00,415 INFO L175 Difference]: Start difference. First operand has 160 places, 153 transitions, 401 flow. Second operand 3 states and 481 transitions. [2025-03-14 01:50:00,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 173 transitions, 568 flow [2025-03-14 01:50:00,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 173 transitions, 558 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-03-14 01:50:00,432 INFO L231 Difference]: Finished difference. Result has 161 places, 162 transitions, 487 flow [2025-03-14 01:50:00,432 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=487, PETRI_PLACES=161, PETRI_TRANSITIONS=162} [2025-03-14 01:50:00,433 INFO L279 CegarLoopForPetriNet]: 150 programPoint places, 11 predicate places. [2025-03-14 01:50:00,433 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 162 transitions, 487 flow [2025-03-14 01:50:00,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:50:00,433 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:50:00,433 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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] [2025-03-14 01:50:00,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-14 01:50:00,434 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-14 01:50:00,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:50:00,434 INFO L85 PathProgramCache]: Analyzing trace with hash 80686011, now seen corresponding path program 1 times [2025-03-14 01:50:00,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:50:00,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513797261] [2025-03-14 01:50:00,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:50:00,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:50:00,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-14 01:50:00,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-14 01:50:00,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:50:00,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:50:00,541 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 01:50:00,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:50:00,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513797261] [2025-03-14 01:50:00,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513797261] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:50:00,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:50:00,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-14 01:50:00,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725271133] [2025-03-14 01:50:00,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:50:00,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 01:50:00,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:50:00,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 01:50:00,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-14 01:50:00,604 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 181 [2025-03-14 01:50:00,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 162 transitions, 487 flow. Second operand has 8 states, 8 states have (on average 149.625) internal successors, (1197), 8 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:50:00,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:50:00,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 181 [2025-03-14 01:50:00,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:50:03,487 INFO L124 PetriNetUnfolderBase]: 7011/27275 cut-off events. [2025-03-14 01:50:03,487 INFO L125 PetriNetUnfolderBase]: For 6368/14183 co-relation queries the response was YES. [2025-03-14 01:50:03,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44729 conditions, 27275 events. 7011/27275 cut-off events. For 6368/14183 co-relation queries the response was YES. Maximal size of possible extension queue 806. Compared 351625 event pairs, 1470 based on Foata normal form. 31/23392 useless extension candidates. Maximal degree in co-relation 23973. Up to 3883 conditions per place. [2025-03-14 01:50:03,665 INFO L140 encePairwiseOnDemand]: 174/181 looper letters, 53 selfloop transitions, 10 changer transitions 0/196 dead transitions. [2025-03-14 01:50:03,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 196 transitions, 685 flow [2025-03-14 01:50:03,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 01:50:03,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 01:50:03,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1544 transitions. [2025-03-14 01:50:03,669 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8530386740331491 [2025-03-14 01:50:03,669 INFO L175 Difference]: Start difference. First operand has 161 places, 162 transitions, 487 flow. Second operand 10 states and 1544 transitions. [2025-03-14 01:50:03,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 196 transitions, 685 flow [2025-03-14 01:50:03,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 196 transitions, 663 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:50:03,692 INFO L231 Difference]: Finished difference. Result has 171 places, 164 transitions, 505 flow [2025-03-14 01:50:03,692 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=465, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=505, PETRI_PLACES=171, PETRI_TRANSITIONS=164} [2025-03-14 01:50:03,692 INFO L279 CegarLoopForPetriNet]: 150 programPoint places, 21 predicate places. [2025-03-14 01:50:03,693 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 164 transitions, 505 flow [2025-03-14 01:50:03,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 149.625) internal successors, (1197), 8 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:50:03,693 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:50:03,693 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, 1, 1, 1] [2025-03-14 01:50:03,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-14 01:50:03,694 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-14 01:50:03,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:50:03,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1810862049, now seen corresponding path program 1 times [2025-03-14 01:50:03,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:50:03,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530841928] [2025-03-14 01:50:03,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:50:03,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:50:03,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-14 01:50:03,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-14 01:50:03,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:50:03,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:50:03,777 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 01:50:03,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:50:03,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530841928] [2025-03-14 01:50:03,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530841928] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:50:03,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:50:03,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:50:03,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995815439] [2025-03-14 01:50:03,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:50:03,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:50:03,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:50:03,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:50:03,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:50:03,787 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 181 [2025-03-14 01:50:03,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 164 transitions, 505 flow. Second operand has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:50:03,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:50:03,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 181 [2025-03-14 01:50:03,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:50:04,259 INFO L124 PetriNetUnfolderBase]: 577/5856 cut-off events. [2025-03-14 01:50:04,259 INFO L125 PetriNetUnfolderBase]: For 1022/1266 co-relation queries the response was YES. [2025-03-14 01:50:04,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8283 conditions, 5856 events. 577/5856 cut-off events. For 1022/1266 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 63824 event pairs, 252 based on Foata normal form. 164/5331 useless extension candidates. Maximal degree in co-relation 4006. Up to 528 conditions per place. [2025-03-14 01:50:04,301 INFO L140 encePairwiseOnDemand]: 173/181 looper letters, 16 selfloop transitions, 8 changer transitions 0/162 dead transitions. [2025-03-14 01:50:04,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 162 transitions, 536 flow [2025-03-14 01:50:04,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:50:04,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:50:04,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions. [2025-03-14 01:50:04,302 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9134438305709024 [2025-03-14 01:50:04,302 INFO L175 Difference]: Start difference. First operand has 171 places, 164 transitions, 505 flow. Second operand 3 states and 496 transitions. [2025-03-14 01:50:04,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 162 transitions, 536 flow [2025-03-14 01:50:04,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 162 transitions, 510 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-03-14 01:50:04,309 INFO L231 Difference]: Finished difference. Result has 167 places, 155 transitions, 441 flow [2025-03-14 01:50:04,309 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=425, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=441, PETRI_PLACES=167, PETRI_TRANSITIONS=155} [2025-03-14 01:50:04,309 INFO L279 CegarLoopForPetriNet]: 150 programPoint places, 17 predicate places. [2025-03-14 01:50:04,310 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 155 transitions, 441 flow [2025-03-14 01:50:04,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:50:04,310 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:50:04,310 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-14 01:50:04,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-14 01:50:04,310 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-14 01:50:04,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:50:04,311 INFO L85 PathProgramCache]: Analyzing trace with hash 297162125, now seen corresponding path program 1 times [2025-03-14 01:50:04,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:50:04,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809489239] [2025-03-14 01:50:04,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:50:04,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:50:04,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-14 01:50:04,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-14 01:50:04,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:50:04,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:50:04,338 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:50:04,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:50:04,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809489239] [2025-03-14 01:50:04,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809489239] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:50:04,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:50:04,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:50:04,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232960454] [2025-03-14 01:50:04,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:50:04,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:50:04,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:50:04,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:50:04,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:50:04,361 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 181 [2025-03-14 01:50:04,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 155 transitions, 441 flow. Second operand has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:50:04,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:50:04,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 181 [2025-03-14 01:50:04,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:50:04,917 INFO L124 PetriNetUnfolderBase]: 1009/6373 cut-off events. [2025-03-14 01:50:04,917 INFO L125 PetriNetUnfolderBase]: For 2996/2996 co-relation queries the response was YES. [2025-03-14 01:50:04,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10918 conditions, 6373 events. 1009/6373 cut-off events. For 2996/2996 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 70752 event pairs, 785 based on Foata normal form. 0/5746 useless extension candidates. Maximal degree in co-relation 10619. Up to 1702 conditions per place. [2025-03-14 01:50:04,952 INFO L140 encePairwiseOnDemand]: 176/181 looper letters, 30 selfloop transitions, 4 changer transitions 0/162 dead transitions. [2025-03-14 01:50:04,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 162 transitions, 535 flow [2025-03-14 01:50:04,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:50:04,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:50:04,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 471 transitions. [2025-03-14 01:50:04,953 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8674033149171271 [2025-03-14 01:50:04,953 INFO L175 Difference]: Start difference. First operand has 167 places, 155 transitions, 441 flow. Second operand 3 states and 471 transitions. [2025-03-14 01:50:04,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 162 transitions, 535 flow [2025-03-14 01:50:04,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 162 transitions, 527 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:50:04,958 INFO L231 Difference]: Finished difference. Result has 170 places, 158 transitions, 467 flow [2025-03-14 01:50:04,958 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=467, PETRI_PLACES=170, PETRI_TRANSITIONS=158} [2025-03-14 01:50:04,959 INFO L279 CegarLoopForPetriNet]: 150 programPoint places, 20 predicate places. [2025-03-14 01:50:04,959 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 158 transitions, 467 flow [2025-03-14 01:50:04,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:50:04,959 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:50:04,959 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:50:04,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-14 01:50:04,959 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-14 01:50:04,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:50:04,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1479450042, now seen corresponding path program 1 times [2025-03-14 01:50:04,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:50:04,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646172090] [2025-03-14 01:50:04,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:50:04,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:50:04,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-14 01:50:04,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-14 01:50:04,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:50:04,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:50:04,975 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 01:50:04,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-14 01:50:04,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-14 01:50:04,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:50:04,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:50:04,991 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 01:50:04,991 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 01:50:04,991 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-03-14 01:50:04,991 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining) [2025-03-14 01:50:04,991 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining) [2025-03-14 01:50:04,991 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining) [2025-03-14 01:50:04,991 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining) [2025-03-14 01:50:04,991 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 13 remaining) [2025-03-14 01:50:04,992 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining) [2025-03-14 01:50:04,992 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining) [2025-03-14 01:50:04,992 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining) [2025-03-14 01:50:04,992 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining) [2025-03-14 01:50:04,992 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining) [2025-03-14 01:50:04,992 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining) [2025-03-14 01:50:04,992 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining) [2025-03-14 01:50:04,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-14 01:50:04,992 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:50:04,992 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 01:50:04,993 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-14 01:50:05,018 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2025-03-14 01:50:05,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 227 places, 217 transitions, 514 flow [2025-03-14 01:50:05,088 INFO L124 PetriNetUnfolderBase]: 53/1140 cut-off events. [2025-03-14 01:50:05,088 INFO L125 PetriNetUnfolderBase]: For 96/96 co-relation queries the response was YES. [2025-03-14 01:50:05,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1253 conditions, 1140 events. 53/1140 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 5826 event pairs, 23 based on Foata normal form. 0/1020 useless extension candidates. Maximal degree in co-relation 1244. Up to 80 conditions per place. [2025-03-14 01:50:05,092 INFO L82 GeneralOperation]: Start removeDead. Operand has 227 places, 217 transitions, 514 flow [2025-03-14 01:50:05,095 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 169 places, 162 transitions, 370 flow [2025-03-14 01:50:05,096 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:50:05,097 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;@5891aa22, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:50:05,097 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-03-14 01:50:05,098 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:50:05,098 INFO L124 PetriNetUnfolderBase]: 0/34 cut-off events. [2025-03-14 01:50:05,098 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:50:05,098 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:50:05,098 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] [2025-03-14 01:50:05,098 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-14 01:50:05,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:50:05,098 INFO L85 PathProgramCache]: Analyzing trace with hash -2040097581, now seen corresponding path program 1 times [2025-03-14 01:50:05,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:50:05,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182626564] [2025-03-14 01:50:05,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:50:05,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:50:05,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-14 01:50:05,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-14 01:50:05,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:50:05,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:50:05,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:50:05,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:50:05,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182626564] [2025-03-14 01:50:05,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182626564] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:50:05,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:50:05,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:50:05,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537846907] [2025-03-14 01:50:05,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:50:05,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:50:05,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:50:05,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:50:05,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:50:05,293 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 217 [2025-03-14 01:50:05,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 162 transitions, 370 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-03-14 01:50:05,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:50:05,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 217 [2025-03-14 01:50:05,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:50:10,892 INFO L124 PetriNetUnfolderBase]: 22557/56260 cut-off events. [2025-03-14 01:50:10,892 INFO L125 PetriNetUnfolderBase]: For 4409/4409 co-relation queries the response was YES. [2025-03-14 01:50:11,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89470 conditions, 56260 events. 22557/56260 cut-off events. For 4409/4409 co-relation queries the response was YES. Maximal size of possible extension queue 1517. Compared 670817 event pairs, 4473 based on Foata normal form. 0/51761 useless extension candidates. Maximal degree in co-relation 21203. Up to 29151 conditions per place. [2025-03-14 01:50:11,419 INFO L140 encePairwiseOnDemand]: 211/217 looper letters, 69 selfloop transitions, 5 changer transitions 0/193 dead transitions. [2025-03-14 01:50:11,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 193 transitions, 580 flow [2025-03-14 01:50:11,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:50:11,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:50:11,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1047 transitions. [2025-03-14 01:50:11,421 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.804147465437788 [2025-03-14 01:50:11,421 INFO L175 Difference]: Start difference. First operand has 169 places, 162 transitions, 370 flow. Second operand 6 states and 1047 transitions. [2025-03-14 01:50:11,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 193 transitions, 580 flow [2025-03-14 01:50:11,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 193 transitions, 576 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:50:11,427 INFO L231 Difference]: Finished difference. Result has 171 places, 161 transitions, 374 flow [2025-03-14 01:50:11,427 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=374, PETRI_PLACES=171, PETRI_TRANSITIONS=161} [2025-03-14 01:50:11,427 INFO L279 CegarLoopForPetriNet]: 169 programPoint places, 2 predicate places. [2025-03-14 01:50:11,428 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 161 transitions, 374 flow [2025-03-14 01:50:11,428 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-03-14 01:50:11,428 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:50:11,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] [2025-03-14 01:50:11,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-14 01:50:11,428 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-14 01:50:11,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:50:11,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1557789276, now seen corresponding path program 1 times [2025-03-14 01:50:11,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:50:11,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849118637] [2025-03-14 01:50:11,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:50:11,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:50:11,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-14 01:50:11,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 01:50:11,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:50:11,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:50:11,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:50:11,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:50:11,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849118637] [2025-03-14 01:50:11,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849118637] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:50:11,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:50:11,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 01:50:11,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792314065] [2025-03-14 01:50:11,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:50:11,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 01:50:11,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:50:11,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 01:50:11,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-14 01:50:11,478 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 217 [2025-03-14 01:50:11,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 161 transitions, 374 flow. Second operand has 4 states, 4 states have (on average 179.25) internal successors, (717), 4 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:50:11,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:50:11,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 217 [2025-03-14 01:50:11,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:50:14,026 INFO L124 PetriNetUnfolderBase]: 6974/24532 cut-off events. [2025-03-14 01:50:14,026 INFO L125 PetriNetUnfolderBase]: For 4016/4016 co-relation queries the response was YES. [2025-03-14 01:50:14,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35624 conditions, 24532 events. 6974/24532 cut-off events. For 4016/4016 co-relation queries the response was YES. Maximal size of possible extension queue 617. Compared 287815 event pairs, 3483 based on Foata normal form. 1/22333 useless extension candidates. Maximal degree in co-relation 19152. Up to 5916 conditions per place. [2025-03-14 01:50:14,173 INFO L140 encePairwiseOnDemand]: 212/217 looper letters, 36 selfloop transitions, 4 changer transitions 0/174 dead transitions. [2025-03-14 01:50:14,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 174 transitions, 480 flow [2025-03-14 01:50:14,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 01:50:14,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 01:50:14,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 753 transitions. [2025-03-14 01:50:14,175 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8675115207373272 [2025-03-14 01:50:14,175 INFO L175 Difference]: Start difference. First operand has 171 places, 161 transitions, 374 flow. Second operand 4 states and 753 transitions. [2025-03-14 01:50:14,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 174 transitions, 480 flow [2025-03-14 01:50:14,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 174 transitions, 470 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:50:14,178 INFO L231 Difference]: Finished difference. Result has 170 places, 162 transitions, 380 flow [2025-03-14 01:50:14,178 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=380, PETRI_PLACES=170, PETRI_TRANSITIONS=162} [2025-03-14 01:50:14,178 INFO L279 CegarLoopForPetriNet]: 169 programPoint places, 1 predicate places. [2025-03-14 01:50:14,179 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 162 transitions, 380 flow [2025-03-14 01:50:14,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 179.25) internal successors, (717), 4 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:50:14,179 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:50:14,179 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:50:14,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-14 01:50:14,179 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-14 01:50:14,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:50:14,179 INFO L85 PathProgramCache]: Analyzing trace with hash 849889910, now seen corresponding path program 1 times [2025-03-14 01:50:14,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:50:14,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500450147] [2025-03-14 01:50:14,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:50:14,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:50:14,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-14 01:50:14,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-14 01:50:14,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:50:14,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:50:14,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:50:14,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:50:14,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500450147] [2025-03-14 01:50:14,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500450147] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:50:14,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:50:14,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:50:14,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004646234] [2025-03-14 01:50:14,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:50:14,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:50:14,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:50:14,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:50:14,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:50:14,229 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 217 [2025-03-14 01:50:14,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 162 transitions, 380 flow. Second operand has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:50:14,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:50:14,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 217 [2025-03-14 01:50:14,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:50:25,277 INFO L124 PetriNetUnfolderBase]: 48754/121632 cut-off events. [2025-03-14 01:50:25,277 INFO L125 PetriNetUnfolderBase]: For 18880/18880 co-relation queries the response was YES. [2025-03-14 01:50:25,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192937 conditions, 121632 events. 48754/121632 cut-off events. For 18880/18880 co-relation queries the response was YES. Maximal size of possible extension queue 3512. Compared 1634970 event pairs, 34341 based on Foata normal form. 0/109071 useless extension candidates. Maximal degree in co-relation 191895. Up to 54063 conditions per place. [2025-03-14 01:50:26,584 INFO L140 encePairwiseOnDemand]: 208/217 looper letters, 45 selfloop transitions, 8 changer transitions 0/185 dead transitions. [2025-03-14 01:50:26,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 185 transitions, 564 flow [2025-03-14 01:50:26,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:50:26,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:50:26,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 570 transitions. [2025-03-14 01:50:26,585 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8755760368663594 [2025-03-14 01:50:26,586 INFO L175 Difference]: Start difference. First operand has 170 places, 162 transitions, 380 flow. Second operand 3 states and 570 transitions. [2025-03-14 01:50:26,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 185 transitions, 564 flow [2025-03-14 01:50:26,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 185 transitions, 558 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:50:26,749 INFO L231 Difference]: Finished difference. Result has 172 places, 169 transitions, 436 flow [2025-03-14 01:50:26,749 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=436, PETRI_PLACES=172, PETRI_TRANSITIONS=169} [2025-03-14 01:50:26,750 INFO L279 CegarLoopForPetriNet]: 169 programPoint places, 3 predicate places. [2025-03-14 01:50:26,750 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 169 transitions, 436 flow [2025-03-14 01:50:26,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:50:26,750 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:50:26,750 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:50:26,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-14 01:50:26,750 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-14 01:50:26,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:50:26,750 INFO L85 PathProgramCache]: Analyzing trace with hash 387346310, now seen corresponding path program 1 times [2025-03-14 01:50:26,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:50:26,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888278031] [2025-03-14 01:50:26,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:50:26,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:50:26,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-14 01:50:26,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-14 01:50:26,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:50:26,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:50:26,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:50:26,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:50:26,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888278031] [2025-03-14 01:50:26,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888278031] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:50:26,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:50:26,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 01:50:26,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037642215] [2025-03-14 01:50:26,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:50:26,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:50:26,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:50:26,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:50:26,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:50:26,859 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 217 [2025-03-14 01:50:26,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 169 transitions, 436 flow. Second operand has 6 states, 6 states have (on average 177.5) internal successors, (1065), 6 states have internal predecessors, (1065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:50:26,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:50:26,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 217 [2025-03-14 01:50:26,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand