./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 e2fb8bed 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-?-e2fb8be-m [2025-03-08 22:11:33,518 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:11:33,563 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-08 22:11:33,571 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:11:33,571 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:11:33,593 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:11:33,593 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:11:33,593 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:11:33,594 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:11:33,594 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:11:33,594 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:11:33,594 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:11:33,594 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:11:33,594 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:11:33,594 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 22:11:33,594 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:11:33,595 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:11:33,595 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:11:33,595 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:11:33,595 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 22:11:33,595 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:11:33,595 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 22:11:33,595 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-08 22:11:33,595 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:11:33,595 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:11:33,595 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 22:11:33,595 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:11:33,596 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:11:33,596 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:11:33,596 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:11:33,596 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:11:33,596 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:11:33,596 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:11:33,596 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:11:33,596 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 22:11:33,596 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 22:11:33,596 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:11:33,596 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:11:33,597 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:11:33,597 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:11:33,597 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:11:33,597 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:11:33,597 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-08 22:11:33,808 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:11:33,814 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:11:33,816 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:11:33,818 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:11:33,818 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:11:33,819 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-08 22:11:34,964 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18b478d62/94d2d332580e422bbbcdec010378bbd4/FLAG3ebf3acb8 [2025-03-08 22:11:35,219 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:11:35,220 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-array-const-race-3.i [2025-03-08 22:11:35,233 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18b478d62/94d2d332580e422bbbcdec010378bbd4/FLAG3ebf3acb8 [2025-03-08 22:11:35,522 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18b478d62/94d2d332580e422bbbcdec010378bbd4 [2025-03-08 22:11:35,524 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:11:35,525 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:11:35,526 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:11:35,526 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:11:35,530 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:11:35,531 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:11:35" (1/1) ... [2025-03-08 22:11:35,532 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29f69db7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:11:35, skipping insertion in model container [2025-03-08 22:11:35,533 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:11:35" (1/1) ... [2025-03-08 22:11:35,561 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:11:35,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:11:35,805 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:11:35,854 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:11:35,883 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:11:35,883 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:11:35 WrapperNode [2025-03-08 22:11:35,883 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:11:35,884 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:11:35,884 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:11:35,884 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:11:35,888 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:11:35" (1/1) ... [2025-03-08 22:11:35,896 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:11:35" (1/1) ... [2025-03-08 22:11:35,915 INFO L138 Inliner]: procedures = 158, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 68 [2025-03-08 22:11:35,916 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:11:35,916 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:11:35,916 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:11:35,916 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:11:35,924 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:11:35" (1/1) ... [2025-03-08 22:11:35,924 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:11:35" (1/1) ... [2025-03-08 22:11:35,927 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:11:35" (1/1) ... [2025-03-08 22:11:35,931 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:11:35" (1/1) ... [2025-03-08 22:11:35,940 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:11:35" (1/1) ... [2025-03-08 22:11:35,941 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:11:35" (1/1) ... [2025-03-08 22:11:35,942 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:11:35" (1/1) ... [2025-03-08 22:11:35,942 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:11:35" (1/1) ... [2025-03-08 22:11:35,947 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:11:35,948 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:11:35,949 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:11:35,949 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:11:35,950 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:11:35" (1/1) ... [2025-03-08 22:11:35,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:11:35,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:11:35,973 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-08 22:11:35,974 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-08 22:11:35,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-08 22:11:35,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-08 22:11:35,989 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-08 22:11:35,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 22:11:35,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 22:11:35,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 22:11:35,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 22:11:35,989 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-03-08 22:11:35,990 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-03-08 22:11:35,990 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-08 22:11:35,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:11:35,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:11:35,990 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 22:11:36,070 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:11:36,071 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:11:36,190 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L691: havoc main_~#tids~0#1.base, main_~#tids~0#1.offset; [2025-03-08 22:11:36,190 INFO L1307 $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-08 22:11:36,212 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 22:11:36,212 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:11:36,231 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:11:36,232 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:11:36,232 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:11:36 BoogieIcfgContainer [2025-03-08 22:11:36,233 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:11:36,234 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:11:36,235 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:11:36,238 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:11:36,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:11:35" (1/3) ... [2025-03-08 22:11:36,239 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ecf381c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:11:36, skipping insertion in model container [2025-03-08 22:11:36,239 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:11:35" (2/3) ... [2025-03-08 22:11:36,239 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ecf381c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:11:36, skipping insertion in model container [2025-03-08 22:11:36,239 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:11:36" (3/3) ... [2025-03-08 22:11:36,240 INFO L128 eAbstractionObserver]: Analyzing ICFG thread-join-array-const-race-3.i [2025-03-08 22:11:36,252 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:11:36,256 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-08 22:11:36,257 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 22:11:36,304 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-08 22:11:36,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 109 transitions, 232 flow [2025-03-08 22:11:36,420 INFO L124 PetriNetUnfolderBase]: 2/219 cut-off events. [2025-03-08 22:11:36,422 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-08 22:11:36,425 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-08 22:11:36,425 INFO L82 GeneralOperation]: Start removeDead. Operand has 113 places, 109 transitions, 232 flow [2025-03-08 22:11:36,428 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 108 transitions, 229 flow [2025-03-08 22:11:36,441 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:11:36,452 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;@62364992, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:11:36,454 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-03-08 22:11:36,466 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 22:11:36,466 INFO L124 PetriNetUnfolderBase]: 0/34 cut-off events. [2025-03-08 22:11:36,466 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 22:11:36,466 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:36,467 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-08 22:11:36,468 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-08 22:11:36,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:36,473 INFO L85 PathProgramCache]: Analyzing trace with hash -830835481, now seen corresponding path program 1 times [2025-03-08 22:11:36,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:36,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569026547] [2025-03-08 22:11:36,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:36,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:36,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 22:11:36,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 22:11:36,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:36,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:37,034 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-08 22:11:37,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:37,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569026547] [2025-03-08 22:11:37,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569026547] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:37,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:37,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:11:37,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423656041] [2025-03-08 22:11:37,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:37,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:11:37,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:37,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:11:37,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:11:37,225 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 109 [2025-03-08 22:11:37,227 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-08 22:11:37,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:37,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 109 [2025-03-08 22:11:37,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:37,415 INFO L124 PetriNetUnfolderBase]: 138/786 cut-off events. [2025-03-08 22:11:37,415 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-03-08 22:11:37,417 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-08 22:11:37,421 INFO L140 encePairwiseOnDemand]: 103/109 looper letters, 33 selfloop transitions, 5 changer transitions 0/115 dead transitions. [2025-03-08 22:11:37,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 115 transitions, 319 flow [2025-03-08 22:11:37,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:11:37,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:11:37,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 507 transitions. [2025-03-08 22:11:37,434 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7752293577981652 [2025-03-08 22:11:37,436 INFO L175 Difference]: Start difference. First operand has 112 places, 108 transitions, 229 flow. Second operand 6 states and 507 transitions. [2025-03-08 22:11:37,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 115 transitions, 319 flow [2025-03-08 22:11:37,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 115 transitions, 315 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:11:37,444 INFO L231 Difference]: Finished difference. Result has 114 places, 107 transitions, 233 flow [2025-03-08 22:11:37,446 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-08 22:11:37,450 INFO L279 CegarLoopForPetriNet]: 112 programPoint places, 2 predicate places. [2025-03-08 22:11:37,450 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 107 transitions, 233 flow [2025-03-08 22:11:37,450 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-08 22:11:37,450 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:37,451 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-08 22:11:37,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 22:11:37,451 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-08 22:11:37,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:37,452 INFO L85 PathProgramCache]: Analyzing trace with hash 390208220, now seen corresponding path program 1 times [2025-03-08 22:11:37,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:37,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694362286] [2025-03-08 22:11:37,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:37,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:37,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 22:11:37,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 22:11:37,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:37,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:37,512 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-08 22:11:37,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:37,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694362286] [2025-03-08 22:11:37,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694362286] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:37,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:37,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:11:37,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046454937] [2025-03-08 22:11:37,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:37,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:11:37,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:37,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:11:37,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:11:37,554 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 109 [2025-03-08 22:11:37,555 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-08 22:11:37,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:37,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 109 [2025-03-08 22:11:37,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:37,635 INFO L124 PetriNetUnfolderBase]: 33/416 cut-off events. [2025-03-08 22:11:37,635 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-03-08 22:11:37,636 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-08 22:11:37,637 INFO L140 encePairwiseOnDemand]: 104/109 looper letters, 17 selfloop transitions, 4 changer transitions 0/113 dead transitions. [2025-03-08 22:11:37,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 113 transitions, 287 flow [2025-03-08 22:11:37,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:11:37,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 22:11:37,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 398 transitions. [2025-03-08 22:11:37,643 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9128440366972477 [2025-03-08 22:11:37,644 INFO L175 Difference]: Start difference. First operand has 114 places, 107 transitions, 233 flow. Second operand 4 states and 398 transitions. [2025-03-08 22:11:37,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 113 transitions, 287 flow [2025-03-08 22:11:37,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 113 transitions, 277 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:11:37,652 INFO L231 Difference]: Finished difference. Result has 113 places, 107 transitions, 235 flow [2025-03-08 22:11:37,652 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-08 22:11:37,652 INFO L279 CegarLoopForPetriNet]: 112 programPoint places, 1 predicate places. [2025-03-08 22:11:37,653 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 107 transitions, 235 flow [2025-03-08 22:11:37,653 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-08 22:11:37,653 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:37,653 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-08 22:11:37,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 22:11:37,653 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-08 22:11:37,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:37,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1683771978, now seen corresponding path program 1 times [2025-03-08 22:11:37,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:37,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503277390] [2025-03-08 22:11:37,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:37,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:37,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 22:11:37,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 22:11:37,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:37,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:37,688 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-08 22:11:37,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:37,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503277390] [2025-03-08 22:11:37,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503277390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:37,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:37,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:11:37,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501577698] [2025-03-08 22:11:37,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:37,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:11:37,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:37,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:11:37,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:11:37,700 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 109 [2025-03-08 22:11:37,700 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-08 22:11:37,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:37,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 109 [2025-03-08 22:11:37,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:37,783 INFO L124 PetriNetUnfolderBase]: 112/709 cut-off events. [2025-03-08 22:11:37,783 INFO L125 PetriNetUnfolderBase]: For 28/38 co-relation queries the response was YES. [2025-03-08 22:11:37,785 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-08 22:11:37,787 INFO L140 encePairwiseOnDemand]: 103/109 looper letters, 18 selfloop transitions, 5 changer transitions 0/115 dead transitions. [2025-03-08 22:11:37,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 115 transitions, 299 flow [2025-03-08 22:11:37,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:11:37,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:11:37,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 306 transitions. [2025-03-08 22:11:37,789 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9357798165137615 [2025-03-08 22:11:37,789 INFO L175 Difference]: Start difference. First operand has 113 places, 107 transitions, 235 flow. Second operand 3 states and 306 transitions. [2025-03-08 22:11:37,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 115 transitions, 299 flow [2025-03-08 22:11:37,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 115 transitions, 291 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-08 22:11:37,791 INFO L231 Difference]: Finished difference. Result has 114 places, 111 transitions, 265 flow [2025-03-08 22:11:37,791 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-08 22:11:37,791 INFO L279 CegarLoopForPetriNet]: 112 programPoint places, 2 predicate places. [2025-03-08 22:11:37,791 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 111 transitions, 265 flow [2025-03-08 22:11:37,792 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-08 22:11:37,792 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:37,792 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-08 22:11:37,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 22:11:37,792 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-08 22:11:37,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:37,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1724812119, now seen corresponding path program 1 times [2025-03-08 22:11:37,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:37,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603816895] [2025-03-08 22:11:37,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:37,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:37,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 22:11:37,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 22:11:37,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:37,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 22:11:37,819 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 22:11:37,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 22:11:37,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 22:11:37,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:37,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 22:11:37,849 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 22:11:37,849 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 22:11:37,849 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2025-03-08 22:11:37,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2025-03-08 22:11:37,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2025-03-08 22:11:37,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2025-03-08 22:11:37,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2025-03-08 22:11:37,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 9 remaining) [2025-03-08 22:11:37,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2025-03-08 22:11:37,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2025-03-08 22:11:37,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2025-03-08 22:11:37,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 22:11:37,851 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-08 22:11:37,854 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-08 22:11:37,854 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-08 22:11:37,880 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-08 22:11:37,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 145 transitions, 322 flow [2025-03-08 22:11:37,922 INFO L124 PetriNetUnfolderBase]: 7/386 cut-off events. [2025-03-08 22:11:37,922 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-08 22:11:37,924 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-08 22:11:37,924 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 145 transitions, 322 flow [2025-03-08 22:11:37,926 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 131 places, 126 transitions, 274 flow [2025-03-08 22:11:37,926 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:11:37,929 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;@62364992, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:11:37,929 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-03-08 22:11:37,933 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 22:11:37,933 INFO L124 PetriNetUnfolderBase]: 0/34 cut-off events. [2025-03-08 22:11:37,933 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 22:11:37,933 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:37,933 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-08 22:11:37,933 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-08 22:11:37,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:37,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1843808921, now seen corresponding path program 1 times [2025-03-08 22:11:37,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:37,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391678946] [2025-03-08 22:11:37,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:37,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:37,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 22:11:37,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 22:11:37,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:37,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:38,150 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-08 22:11:38,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:38,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391678946] [2025-03-08 22:11:38,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391678946] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:38,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:38,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:11:38,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267378304] [2025-03-08 22:11:38,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:38,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:11:38,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:38,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:11:38,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:11:38,264 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 145 [2025-03-08 22:11:38,265 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-08 22:11:38,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:38,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 145 [2025-03-08 22:11:38,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:38,582 INFO L124 PetriNetUnfolderBase]: 879/3345 cut-off events. [2025-03-08 22:11:38,582 INFO L125 PetriNetUnfolderBase]: For 166/166 co-relation queries the response was YES. [2025-03-08 22:11:38,590 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-08 22:11:38,601 INFO L140 encePairwiseOnDemand]: 139/145 looper letters, 45 selfloop transitions, 5 changer transitions 0/141 dead transitions. [2025-03-08 22:11:38,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 141 transitions, 404 flow [2025-03-08 22:11:38,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:11:38,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:11:38,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 687 transitions. [2025-03-08 22:11:38,603 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7896551724137931 [2025-03-08 22:11:38,603 INFO L175 Difference]: Start difference. First operand has 131 places, 126 transitions, 274 flow. Second operand 6 states and 687 transitions. [2025-03-08 22:11:38,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 141 transitions, 404 flow [2025-03-08 22:11:38,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 141 transitions, 400 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:11:38,606 INFO L231 Difference]: Finished difference. Result has 133 places, 125 transitions, 278 flow [2025-03-08 22:11:38,607 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-08 22:11:38,607 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 2 predicate places. [2025-03-08 22:11:38,607 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 125 transitions, 278 flow [2025-03-08 22:11:38,607 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-08 22:11:38,607 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:38,607 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-08 22:11:38,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 22:11:38,608 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-08 22:11:38,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:38,608 INFO L85 PathProgramCache]: Analyzing trace with hash -947197220, now seen corresponding path program 1 times [2025-03-08 22:11:38,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:38,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158818520] [2025-03-08 22:11:38,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:38,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:38,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 22:11:38,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 22:11:38,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:38,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:38,646 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-08 22:11:38,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:38,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158818520] [2025-03-08 22:11:38,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158818520] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:38,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:38,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:11:38,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688777313] [2025-03-08 22:11:38,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:38,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:11:38,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:38,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:11:38,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:11:38,677 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 145 [2025-03-08 22:11:38,677 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-08 22:11:38,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:38,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 145 [2025-03-08 22:11:38,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:38,830 INFO L124 PetriNetUnfolderBase]: 253/1589 cut-off events. [2025-03-08 22:11:38,830 INFO L125 PetriNetUnfolderBase]: For 133/133 co-relation queries the response was YES. [2025-03-08 22:11:38,834 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-08 22:11:38,838 INFO L140 encePairwiseOnDemand]: 140/145 looper letters, 24 selfloop transitions, 4 changer transitions 0/134 dead transitions. [2025-03-08 22:11:38,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 134 transitions, 352 flow [2025-03-08 22:11:38,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:11:38,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 22:11:38,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 517 transitions. [2025-03-08 22:11:38,842 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8913793103448275 [2025-03-08 22:11:38,842 INFO L175 Difference]: Start difference. First operand has 133 places, 125 transitions, 278 flow. Second operand 4 states and 517 transitions. [2025-03-08 22:11:38,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 134 transitions, 352 flow [2025-03-08 22:11:38,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 134 transitions, 342 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:11:38,846 INFO L231 Difference]: Finished difference. Result has 132 places, 126 transitions, 284 flow [2025-03-08 22:11:38,847 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-08 22:11:38,847 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 1 predicate places. [2025-03-08 22:11:38,848 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 126 transitions, 284 flow [2025-03-08 22:11:38,848 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-08 22:11:38,848 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:38,848 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-08 22:11:38,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 22:11:38,848 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-08 22:11:38,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:38,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1321164474, now seen corresponding path program 1 times [2025-03-08 22:11:38,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:38,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759644208] [2025-03-08 22:11:38,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:38,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:38,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 22:11:38,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 22:11:38,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:38,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:38,876 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-08 22:11:38,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:38,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759644208] [2025-03-08 22:11:38,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759644208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:38,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:38,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:11:38,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986775952] [2025-03-08 22:11:38,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:38,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:11:38,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:38,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:11:38,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:11:38,895 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 145 [2025-03-08 22:11:38,896 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-08 22:11:38,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:38,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 145 [2025-03-08 22:11:38,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:39,217 INFO L124 PetriNetUnfolderBase]: 1070/3962 cut-off events. [2025-03-08 22:11:39,219 INFO L125 PetriNetUnfolderBase]: For 341/341 co-relation queries the response was YES. [2025-03-08 22:11:39,229 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-08 22:11:39,245 INFO L140 encePairwiseOnDemand]: 138/145 looper letters, 27 selfloop transitions, 6 changer transitions 0/139 dead transitions. [2025-03-08 22:11:39,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 139 transitions, 386 flow [2025-03-08 22:11:39,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:11:39,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:11:39,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 394 transitions. [2025-03-08 22:11:39,247 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9057471264367816 [2025-03-08 22:11:39,247 INFO L175 Difference]: Start difference. First operand has 132 places, 126 transitions, 284 flow. Second operand 3 states and 394 transitions. [2025-03-08 22:11:39,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 139 transitions, 386 flow [2025-03-08 22:11:39,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 139 transitions, 380 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:11:39,252 INFO L231 Difference]: Finished difference. Result has 134 places, 131 transitions, 324 flow [2025-03-08 22:11:39,252 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-08 22:11:39,253 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 3 predicate places. [2025-03-08 22:11:39,253 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 131 transitions, 324 flow [2025-03-08 22:11:39,253 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-08 22:11:39,253 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:39,253 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-08 22:11:39,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 22:11:39,253 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-08 22:11:39,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:39,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1821806118, now seen corresponding path program 1 times [2025-03-08 22:11:39,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:39,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426097420] [2025-03-08 22:11:39,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:39,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:39,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 22:11:39,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 22:11:39,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:39,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:39,346 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-08 22:11:39,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:39,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426097420] [2025-03-08 22:11:39,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426097420] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:39,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:39,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 22:11:39,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837940123] [2025-03-08 22:11:39,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:39,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:11:39,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:39,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:11:39,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:11:39,414 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 145 [2025-03-08 22:11:39,415 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-08 22:11:39,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:39,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 145 [2025-03-08 22:11:39,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:39,704 INFO L124 PetriNetUnfolderBase]: 640/3440 cut-off events. [2025-03-08 22:11:39,704 INFO L125 PetriNetUnfolderBase]: For 292/304 co-relation queries the response was YES. [2025-03-08 22:11:39,715 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-08 22:11:39,725 INFO L140 encePairwiseOnDemand]: 138/145 looper letters, 33 selfloop transitions, 7 changer transitions 0/149 dead transitions. [2025-03-08 22:11:39,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 149 transitions, 440 flow [2025-03-08 22:11:39,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 22:11:39,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-08 22:11:39,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 881 transitions. [2025-03-08 22:11:39,727 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8679802955665025 [2025-03-08 22:11:39,727 INFO L175 Difference]: Start difference. First operand has 134 places, 131 transitions, 324 flow. Second operand 7 states and 881 transitions. [2025-03-08 22:11:39,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 149 transitions, 440 flow [2025-03-08 22:11:39,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 149 transitions, 428 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:11:39,730 INFO L231 Difference]: Finished difference. Result has 141 places, 133 transitions, 342 flow [2025-03-08 22:11:39,730 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-08 22:11:39,731 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 10 predicate places. [2025-03-08 22:11:39,731 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 133 transitions, 342 flow [2025-03-08 22:11:39,731 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-08 22:11:39,731 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:39,731 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-08 22:11:39,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 22:11:39,732 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-08 22:11:39,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:39,732 INFO L85 PathProgramCache]: Analyzing trace with hash 484914875, now seen corresponding path program 1 times [2025-03-08 22:11:39,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:39,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545190328] [2025-03-08 22:11:39,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:39,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:39,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-08 22:11:39,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 22:11:39,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:39,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:39,761 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-08 22:11:39,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:39,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545190328] [2025-03-08 22:11:39,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545190328] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:39,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:39,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:11:39,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415921341] [2025-03-08 22:11:39,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:39,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:11:39,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:39,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:11:39,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:11:39,785 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 145 [2025-03-08 22:11:39,785 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-08 22:11:39,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:39,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 145 [2025-03-08 22:11:39,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:40,193 INFO L124 PetriNetUnfolderBase]: 1661/6017 cut-off events. [2025-03-08 22:11:40,193 INFO L125 PetriNetUnfolderBase]: For 1158/1202 co-relation queries the response was YES. [2025-03-08 22:11:40,207 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-08 22:11:40,225 INFO L140 encePairwiseOnDemand]: 138/145 looper letters, 28 selfloop transitions, 9 changer transitions 0/147 dead transitions. [2025-03-08 22:11:40,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 147 transitions, 459 flow [2025-03-08 22:11:40,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:11:40,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:11:40,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 393 transitions. [2025-03-08 22:11:40,226 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.903448275862069 [2025-03-08 22:11:40,227 INFO L175 Difference]: Start difference. First operand has 141 places, 133 transitions, 342 flow. Second operand 3 states and 393 transitions. [2025-03-08 22:11:40,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 147 transitions, 459 flow [2025-03-08 22:11:40,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 147 transitions, 449 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-03-08 22:11:40,234 INFO L231 Difference]: Finished difference. Result has 142 places, 140 transitions, 408 flow [2025-03-08 22:11:40,234 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-08 22:11:40,235 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 11 predicate places. [2025-03-08 22:11:40,236 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 140 transitions, 408 flow [2025-03-08 22:11:40,236 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-08 22:11:40,236 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:40,236 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-08 22:11:40,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 22:11:40,236 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-08 22:11:40,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:40,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1384773304, now seen corresponding path program 1 times [2025-03-08 22:11:40,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:40,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747646213] [2025-03-08 22:11:40,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:40,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:40,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-08 22:11:40,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-08 22:11:40,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:40,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 22:11:40,259 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 22:11:40,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-08 22:11:40,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-08 22:11:40,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:40,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 22:11:40,278 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 22:11:40,278 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 22:11:40,279 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-03-08 22:11:40,279 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2025-03-08 22:11:40,279 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2025-03-08 22:11:40,279 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2025-03-08 22:11:40,279 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2025-03-08 22:11:40,279 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 11 remaining) [2025-03-08 22:11:40,279 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2025-03-08 22:11:40,279 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2025-03-08 22:11:40,279 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2025-03-08 22:11:40,279 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2025-03-08 22:11:40,279 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2025-03-08 22:11:40,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 22:11:40,280 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-08 22:11:40,280 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-08 22:11:40,280 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-08 22:11:40,311 INFO L143 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2025-03-08 22:11:40,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 189 places, 181 transitions, 416 flow [2025-03-08 22:11:40,354 INFO L124 PetriNetUnfolderBase]: 20/657 cut-off events. [2025-03-08 22:11:40,355 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-03-08 22:11:40,357 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-08 22:11:40,357 INFO L82 GeneralOperation]: Start removeDead. Operand has 189 places, 181 transitions, 416 flow [2025-03-08 22:11:40,359 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 150 places, 144 transitions, 321 flow [2025-03-08 22:11:40,362 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:11:40,362 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;@62364992, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:11:40,362 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-03-08 22:11:40,364 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 22:11:40,364 INFO L124 PetriNetUnfolderBase]: 0/34 cut-off events. [2025-03-08 22:11:40,364 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 22:11:40,364 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:40,364 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-08 22:11:40,365 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-08 22:11:40,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:40,365 INFO L85 PathProgramCache]: Analyzing trace with hash 616415243, now seen corresponding path program 1 times [2025-03-08 22:11:40,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:40,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364611984] [2025-03-08 22:11:40,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:40,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:40,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 22:11:40,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 22:11:40,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:40,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:40,554 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-08 22:11:40,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:40,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364611984] [2025-03-08 22:11:40,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364611984] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:40,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:40,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:11:40,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591925645] [2025-03-08 22:11:40,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:40,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:11:40,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:40,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:11:40,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:11:40,668 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 181 [2025-03-08 22:11:40,669 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-08 22:11:40,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:40,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 181 [2025-03-08 22:11:40,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:41,769 INFO L124 PetriNetUnfolderBase]: 4640/13687 cut-off events. [2025-03-08 22:11:41,769 INFO L125 PetriNetUnfolderBase]: For 903/903 co-relation queries the response was YES. [2025-03-08 22:11:41,797 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-08 22:11:41,833 INFO L140 encePairwiseOnDemand]: 175/181 looper letters, 57 selfloop transitions, 5 changer transitions 0/167 dead transitions. [2025-03-08 22:11:41,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 167 transitions, 491 flow [2025-03-08 22:11:41,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:11:41,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:11:41,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 867 transitions. [2025-03-08 22:11:41,835 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7983425414364641 [2025-03-08 22:11:41,835 INFO L175 Difference]: Start difference. First operand has 150 places, 144 transitions, 321 flow. Second operand 6 states and 867 transitions. [2025-03-08 22:11:41,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 167 transitions, 491 flow [2025-03-08 22:11:41,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 167 transitions, 487 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:11:41,838 INFO L231 Difference]: Finished difference. Result has 152 places, 143 transitions, 325 flow [2025-03-08 22:11:41,838 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-08 22:11:41,839 INFO L279 CegarLoopForPetriNet]: 150 programPoint places, 2 predicate places. [2025-03-08 22:11:41,839 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 143 transitions, 325 flow [2025-03-08 22:11:41,839 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-08 22:11:41,839 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:41,840 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-08 22:11:41,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 22:11:41,840 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-08 22:11:41,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:41,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1989659300, now seen corresponding path program 1 times [2025-03-08 22:11:41,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:41,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036426594] [2025-03-08 22:11:41,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:41,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:41,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 22:11:41,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 22:11:41,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:41,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:41,873 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-08 22:11:41,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:41,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036426594] [2025-03-08 22:11:41,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036426594] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:41,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:41,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:11:41,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973040669] [2025-03-08 22:11:41,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:41,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:11:41,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:41,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:11:41,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:11:41,895 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 181 [2025-03-08 22:11:41,896 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-08 22:11:41,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:41,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 181 [2025-03-08 22:11:41,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:42,449 INFO L124 PetriNetUnfolderBase]: 1406/6341 cut-off events. [2025-03-08 22:11:42,449 INFO L125 PetriNetUnfolderBase]: For 782/782 co-relation queries the response was YES. [2025-03-08 22:11:42,470 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-08 22:11:42,490 INFO L140 encePairwiseOnDemand]: 176/181 looper letters, 30 selfloop transitions, 4 changer transitions 0/154 dead transitions. [2025-03-08 22:11:42,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 154 transitions, 415 flow [2025-03-08 22:11:42,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:11:42,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 22:11:42,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 635 transitions. [2025-03-08 22:11:42,492 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8770718232044199 [2025-03-08 22:11:42,492 INFO L175 Difference]: Start difference. First operand has 152 places, 143 transitions, 325 flow. Second operand 4 states and 635 transitions. [2025-03-08 22:11:42,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 154 transitions, 415 flow [2025-03-08 22:11:42,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 154 transitions, 405 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:11:42,495 INFO L231 Difference]: Finished difference. Result has 151 places, 144 transitions, 331 flow [2025-03-08 22:11:42,496 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-08 22:11:42,496 INFO L279 CegarLoopForPetriNet]: 150 programPoint places, 1 predicate places. [2025-03-08 22:11:42,496 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 144 transitions, 331 flow [2025-03-08 22:11:42,496 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-08 22:11:42,496 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:42,497 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-08 22:11:42,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 22:11:42,497 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-08 22:11:42,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:42,497 INFO L85 PathProgramCache]: Analyzing trace with hash 2125502206, now seen corresponding path program 1 times [2025-03-08 22:11:42,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:42,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638901283] [2025-03-08 22:11:42,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:42,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:42,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 22:11:42,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 22:11:42,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:42,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:42,523 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-08 22:11:42,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:42,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638901283] [2025-03-08 22:11:42,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638901283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:42,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:42,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:11:42,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272072749] [2025-03-08 22:11:42,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:42,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:11:42,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:42,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:11:42,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:11:42,549 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 181 [2025-03-08 22:11:42,550 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-08 22:11:42,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:42,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 181 [2025-03-08 22:11:42,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:44,324 INFO L124 PetriNetUnfolderBase]: 7632/23898 cut-off events. [2025-03-08 22:11:44,324 INFO L125 PetriNetUnfolderBase]: For 2850/2940 co-relation queries the response was YES. [2025-03-08 22:11:44,379 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-08 22:11:44,446 INFO L140 encePairwiseOnDemand]: 173/181 looper letters, 36 selfloop transitions, 7 changer transitions 0/162 dead transitions. [2025-03-08 22:11:44,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 162 transitions, 473 flow [2025-03-08 22:11:44,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:11:44,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:11:44,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 482 transitions. [2025-03-08 22:11:44,448 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8876611418047882 [2025-03-08 22:11:44,448 INFO L175 Difference]: Start difference. First operand has 151 places, 144 transitions, 331 flow. Second operand 3 states and 482 transitions. [2025-03-08 22:11:44,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 162 transitions, 473 flow [2025-03-08 22:11:44,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 162 transitions, 467 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:11:44,455 INFO L231 Difference]: Finished difference. Result has 153 places, 150 transitions, 379 flow [2025-03-08 22:11:44,455 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-08 22:11:44,456 INFO L279 CegarLoopForPetriNet]: 150 programPoint places, 3 predicate places. [2025-03-08 22:11:44,456 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 150 transitions, 379 flow [2025-03-08 22:11:44,456 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-08 22:11:44,456 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:44,456 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-08 22:11:44,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 22:11:44,457 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-08 22:11:44,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:44,457 INFO L85 PathProgramCache]: Analyzing trace with hash -961407010, now seen corresponding path program 1 times [2025-03-08 22:11:44,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:44,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834757067] [2025-03-08 22:11:44,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:44,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:44,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 22:11:44,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 22:11:44,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:44,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:44,517 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-08 22:11:44,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:44,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834757067] [2025-03-08 22:11:44,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834757067] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:44,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:44,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 22:11:44,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922226493] [2025-03-08 22:11:44,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:44,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:11:44,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:44,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:11:44,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:11:44,575 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 181 [2025-03-08 22:11:44,576 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-08 22:11:44,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:44,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 181 [2025-03-08 22:11:44,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:46,286 INFO L124 PetriNetUnfolderBase]: 4543/18575 cut-off events. [2025-03-08 22:11:46,286 INFO L125 PetriNetUnfolderBase]: For 1933/2089 co-relation queries the response was YES. [2025-03-08 22:11:46,380 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-08 22:11:46,446 INFO L140 encePairwiseOnDemand]: 174/181 looper letters, 41 selfloop transitions, 7 changer transitions 0/172 dead transitions. [2025-03-08 22:11:46,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 172 transitions, 521 flow [2025-03-08 22:11:46,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 22:11:46,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-08 22:11:46,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1085 transitions. [2025-03-08 22:11:46,448 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.856353591160221 [2025-03-08 22:11:46,449 INFO L175 Difference]: Start difference. First operand has 153 places, 150 transitions, 379 flow. Second operand 7 states and 1085 transitions. [2025-03-08 22:11:46,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 172 transitions, 521 flow [2025-03-08 22:11:46,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 172 transitions, 507 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:11:46,460 INFO L231 Difference]: Finished difference. Result has 160 places, 153 transitions, 401 flow [2025-03-08 22:11:46,461 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-08 22:11:46,461 INFO L279 CegarLoopForPetriNet]: 150 programPoint places, 10 predicate places. [2025-03-08 22:11:46,461 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 153 transitions, 401 flow [2025-03-08 22:11:46,462 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-08 22:11:46,462 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:46,462 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-08 22:11:46,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 22:11:46,462 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-08 22:11:46,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:46,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1592662085, now seen corresponding path program 1 times [2025-03-08 22:11:46,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:46,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125167777] [2025-03-08 22:11:46,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:46,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:46,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-08 22:11:46,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 22:11:46,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:46,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:46,493 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-08 22:11:46,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:46,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125167777] [2025-03-08 22:11:46,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125167777] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:46,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:46,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:11:46,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927336608] [2025-03-08 22:11:46,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:46,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:11:46,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:46,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:11:46,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:11:46,516 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 181 [2025-03-08 22:11:46,517 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-08 22:11:46,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:46,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 181 [2025-03-08 22:11:46,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:48,776 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-08 22:11:48,777 INFO L294 olderBase$Statistics]: this new event has 130 ancestors and is cut-off event [2025-03-08 22:11:48,777 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-08 22:11:48,777 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2025-03-08 22:11:48,777 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-08 22:11:48,777 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-08 22:11:48,777 INFO L294 olderBase$Statistics]: this new event has 132 ancestors and is cut-off event [2025-03-08 22:11:48,777 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2025-03-08 22:11:48,777 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2025-03-08 22:11:48,777 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2025-03-08 22:11:49,045 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-08 22:11:49,045 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2025-03-08 22:11:49,045 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-03-08 22:11:49,045 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2025-03-08 22:11:49,053 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-03-08 22:11:49,053 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-08 22:11:49,053 INFO L294 olderBase$Statistics]: this new event has 138 ancestors and is cut-off event [2025-03-08 22:11:49,054 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2025-03-08 22:11:49,054 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2025-03-08 22:11:49,054 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2025-03-08 22:11:49,436 INFO L124 PetriNetUnfolderBase]: 13096/40137 cut-off events. [2025-03-08 22:11:49,436 INFO L125 PetriNetUnfolderBase]: For 9397/10150 co-relation queries the response was YES. [2025-03-08 22:11:49,610 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-08 22:11:49,749 INFO L140 encePairwiseOnDemand]: 173/181 looper letters, 38 selfloop transitions, 11 changer transitions 0/173 dead transitions. [2025-03-08 22:11:49,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 173 transitions, 568 flow [2025-03-08 22:11:49,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:11:49,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:11:49,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 481 transitions. [2025-03-08 22:11:49,750 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8858195211786372 [2025-03-08 22:11:49,751 INFO L175 Difference]: Start difference. First operand has 160 places, 153 transitions, 401 flow. Second operand 3 states and 481 transitions. [2025-03-08 22:11:49,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 173 transitions, 568 flow [2025-03-08 22:11:49,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 173 transitions, 558 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-03-08 22:11:49,769 INFO L231 Difference]: Finished difference. Result has 161 places, 162 transitions, 487 flow [2025-03-08 22:11:49,769 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-08 22:11:49,769 INFO L279 CegarLoopForPetriNet]: 150 programPoint places, 11 predicate places. [2025-03-08 22:11:49,769 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 162 transitions, 487 flow [2025-03-08 22:11:49,770 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-08 22:11:49,770 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:49,770 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-08 22:11:49,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 22:11:49,770 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-08 22:11:49,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:49,771 INFO L85 PathProgramCache]: Analyzing trace with hash 80686011, now seen corresponding path program 1 times [2025-03-08 22:11:49,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:49,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889897307] [2025-03-08 22:11:49,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:49,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:49,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-08 22:11:49,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-08 22:11:49,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:49,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:49,859 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-08 22:11:49,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:49,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889897307] [2025-03-08 22:11:49,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889897307] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:49,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:49,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 22:11:49,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164052294] [2025-03-08 22:11:49,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:49,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 22:11:49,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:49,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 22:11:49,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:11:49,923 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 181 [2025-03-08 22:11:49,924 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-08 22:11:49,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:49,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 181 [2025-03-08 22:11:49,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:52,721 INFO L124 PetriNetUnfolderBase]: 7011/27275 cut-off events. [2025-03-08 22:11:52,721 INFO L125 PetriNetUnfolderBase]: For 6368/14183 co-relation queries the response was YES. [2025-03-08 22:11:52,882 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-08 22:11:52,999 INFO L140 encePairwiseOnDemand]: 174/181 looper letters, 53 selfloop transitions, 10 changer transitions 0/196 dead transitions. [2025-03-08 22:11:53,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 196 transitions, 685 flow [2025-03-08 22:11:53,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 22:11:53,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-08 22:11:53,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1544 transitions. [2025-03-08 22:11:53,003 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8530386740331491 [2025-03-08 22:11:53,003 INFO L175 Difference]: Start difference. First operand has 161 places, 162 transitions, 487 flow. Second operand 10 states and 1544 transitions. [2025-03-08 22:11:53,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 196 transitions, 685 flow [2025-03-08 22:11:53,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 196 transitions, 663 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:11:53,027 INFO L231 Difference]: Finished difference. Result has 171 places, 164 transitions, 505 flow [2025-03-08 22:11:53,027 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-08 22:11:53,027 INFO L279 CegarLoopForPetriNet]: 150 programPoint places, 21 predicate places. [2025-03-08 22:11:53,028 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 164 transitions, 505 flow [2025-03-08 22:11:53,028 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-08 22:11:53,028 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:53,028 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-08 22:11:53,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 22:11:53,029 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-08 22:11:53,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:53,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1810862049, now seen corresponding path program 1 times [2025-03-08 22:11:53,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:53,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429622002] [2025-03-08 22:11:53,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:53,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:53,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-08 22:11:53,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-08 22:11:53,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:53,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:53,106 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-08 22:11:53,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:53,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429622002] [2025-03-08 22:11:53,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429622002] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:53,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:53,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:11:53,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479055314] [2025-03-08 22:11:53,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:53,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:11:53,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:53,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:11:53,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:11:53,116 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 181 [2025-03-08 22:11:53,117 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-08 22:11:53,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:53,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 181 [2025-03-08 22:11:53,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:53,828 INFO L124 PetriNetUnfolderBase]: 577/5856 cut-off events. [2025-03-08 22:11:53,828 INFO L125 PetriNetUnfolderBase]: For 1022/1266 co-relation queries the response was YES. [2025-03-08 22:11:53,843 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-08 22:11:53,852 INFO L140 encePairwiseOnDemand]: 173/181 looper letters, 16 selfloop transitions, 8 changer transitions 0/162 dead transitions. [2025-03-08 22:11:53,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 162 transitions, 536 flow [2025-03-08 22:11:53,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:11:53,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:11:53,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions. [2025-03-08 22:11:53,854 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9134438305709024 [2025-03-08 22:11:53,854 INFO L175 Difference]: Start difference. First operand has 171 places, 164 transitions, 505 flow. Second operand 3 states and 496 transitions. [2025-03-08 22:11:53,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 162 transitions, 536 flow [2025-03-08 22:11:53,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 162 transitions, 510 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-03-08 22:11:53,860 INFO L231 Difference]: Finished difference. Result has 167 places, 155 transitions, 441 flow [2025-03-08 22:11:53,860 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-08 22:11:53,860 INFO L279 CegarLoopForPetriNet]: 150 programPoint places, 17 predicate places. [2025-03-08 22:11:53,860 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 155 transitions, 441 flow [2025-03-08 22:11:53,861 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-08 22:11:53,861 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:53,861 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-08 22:11:53,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 22:11:53,861 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-08 22:11:53,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:53,861 INFO L85 PathProgramCache]: Analyzing trace with hash 297162125, now seen corresponding path program 1 times [2025-03-08 22:11:53,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:53,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390168605] [2025-03-08 22:11:53,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:53,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:53,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 22:11:53,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 22:11:53,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:53,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:53,887 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-08 22:11:53,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:53,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390168605] [2025-03-08 22:11:53,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390168605] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:53,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:53,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:11:53,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467829876] [2025-03-08 22:11:53,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:53,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:11:53,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:53,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:11:53,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:11:53,911 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 181 [2025-03-08 22:11:53,911 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-08 22:11:53,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:53,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 181 [2025-03-08 22:11:53,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:54,389 INFO L124 PetriNetUnfolderBase]: 1009/6373 cut-off events. [2025-03-08 22:11:54,389 INFO L125 PetriNetUnfolderBase]: For 2996/2996 co-relation queries the response was YES. [2025-03-08 22:11:54,413 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-08 22:11:54,425 INFO L140 encePairwiseOnDemand]: 176/181 looper letters, 30 selfloop transitions, 4 changer transitions 0/162 dead transitions. [2025-03-08 22:11:54,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 162 transitions, 535 flow [2025-03-08 22:11:54,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:11:54,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:11:54,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 471 transitions. [2025-03-08 22:11:54,427 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8674033149171271 [2025-03-08 22:11:54,427 INFO L175 Difference]: Start difference. First operand has 167 places, 155 transitions, 441 flow. Second operand 3 states and 471 transitions. [2025-03-08 22:11:54,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 162 transitions, 535 flow [2025-03-08 22:11:54,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 162 transitions, 527 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:11:54,430 INFO L231 Difference]: Finished difference. Result has 170 places, 158 transitions, 467 flow [2025-03-08 22:11:54,430 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-08 22:11:54,431 INFO L279 CegarLoopForPetriNet]: 150 programPoint places, 20 predicate places. [2025-03-08 22:11:54,431 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 158 transitions, 467 flow [2025-03-08 22:11:54,431 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-08 22:11:54,431 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:54,431 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-08 22:11:54,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 22:11:54,431 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-08 22:11:54,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:54,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1479450042, now seen corresponding path program 1 times [2025-03-08 22:11:54,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:54,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940069801] [2025-03-08 22:11:54,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:54,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:54,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 22:11:54,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 22:11:54,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:54,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 22:11:54,449 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 22:11:54,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 22:11:54,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 22:11:54,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:54,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 22:11:54,476 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 22:11:54,476 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 22:11:54,476 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-03-08 22:11:54,477 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining) [2025-03-08 22:11:54,477 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining) [2025-03-08 22:11:54,477 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining) [2025-03-08 22:11:54,477 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining) [2025-03-08 22:11:54,477 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 13 remaining) [2025-03-08 22:11:54,477 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining) [2025-03-08 22:11:54,477 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining) [2025-03-08 22:11:54,477 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining) [2025-03-08 22:11:54,477 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining) [2025-03-08 22:11:54,477 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining) [2025-03-08 22:11:54,477 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining) [2025-03-08 22:11:54,477 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining) [2025-03-08 22:11:54,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 22:11:54,481 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:11:54,482 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-08 22:11:54,482 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-08 22:11:54,512 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2025-03-08 22:11:54,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 227 places, 217 transitions, 514 flow [2025-03-08 22:11:54,582 INFO L124 PetriNetUnfolderBase]: 53/1140 cut-off events. [2025-03-08 22:11:54,582 INFO L125 PetriNetUnfolderBase]: For 96/96 co-relation queries the response was YES. [2025-03-08 22:11:54,587 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-08 22:11:54,587 INFO L82 GeneralOperation]: Start removeDead. Operand has 227 places, 217 transitions, 514 flow [2025-03-08 22:11:54,591 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 169 places, 162 transitions, 370 flow [2025-03-08 22:11:54,591 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:11:54,592 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;@62364992, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:11:54,592 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-03-08 22:11:54,593 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 22:11:54,593 INFO L124 PetriNetUnfolderBase]: 0/34 cut-off events. [2025-03-08 22:11:54,593 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 22:11:54,593 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:54,593 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-08 22:11:54,593 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-08 22:11:54,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:54,594 INFO L85 PathProgramCache]: Analyzing trace with hash -2040097581, now seen corresponding path program 1 times [2025-03-08 22:11:54,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:54,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575069389] [2025-03-08 22:11:54,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:54,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:54,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 22:11:54,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 22:11:54,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:54,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:54,768 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-08 22:11:54,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:54,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575069389] [2025-03-08 22:11:54,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575069389] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:54,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:54,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:11:54,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268769325] [2025-03-08 22:11:54,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:54,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:11:54,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:54,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:11:54,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:11:54,854 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 217 [2025-03-08 22:11:54,855 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-08 22:11:54,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:54,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 217 [2025-03-08 22:11:54,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:12:00,632 INFO L124 PetriNetUnfolderBase]: 22557/56260 cut-off events. [2025-03-08 22:12:00,632 INFO L125 PetriNetUnfolderBase]: For 4409/4409 co-relation queries the response was YES. [2025-03-08 22:12:00,907 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-08 22:12:01,307 INFO L140 encePairwiseOnDemand]: 211/217 looper letters, 69 selfloop transitions, 5 changer transitions 0/193 dead transitions. [2025-03-08 22:12:01,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 193 transitions, 580 flow [2025-03-08 22:12:01,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:12:01,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:12:01,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1047 transitions. [2025-03-08 22:12:01,309 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.804147465437788 [2025-03-08 22:12:01,309 INFO L175 Difference]: Start difference. First operand has 169 places, 162 transitions, 370 flow. Second operand 6 states and 1047 transitions. [2025-03-08 22:12:01,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 193 transitions, 580 flow [2025-03-08 22:12:01,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 193 transitions, 576 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:12:01,316 INFO L231 Difference]: Finished difference. Result has 171 places, 161 transitions, 374 flow [2025-03-08 22:12:01,316 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-08 22:12:01,316 INFO L279 CegarLoopForPetriNet]: 169 programPoint places, 2 predicate places. [2025-03-08 22:12:01,316 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 161 transitions, 374 flow [2025-03-08 22:12:01,317 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-08 22:12:01,317 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:12:01,317 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-08 22:12:01,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 22:12:01,317 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-08 22:12:01,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:12:01,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1557789276, now seen corresponding path program 1 times [2025-03-08 22:12:01,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:12:01,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404380153] [2025-03-08 22:12:01,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:12:01,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:12:01,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 22:12:01,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 22:12:01,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:12:01,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:12:01,355 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-08 22:12:01,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:12:01,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404380153] [2025-03-08 22:12:01,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404380153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:12:01,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:12:01,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:12:01,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591385746] [2025-03-08 22:12:01,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:12:01,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:12:01,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:12:01,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:12:01,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:12:01,384 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 217 [2025-03-08 22:12:01,384 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-08 22:12:01,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:12:01,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 217 [2025-03-08 22:12:01,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:12:03,566 INFO L124 PetriNetUnfolderBase]: 6974/24532 cut-off events. [2025-03-08 22:12:03,566 INFO L125 PetriNetUnfolderBase]: For 4016/4016 co-relation queries the response was YES. [2025-03-08 22:12:03,647 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-08 22:12:03,719 INFO L140 encePairwiseOnDemand]: 212/217 looper letters, 36 selfloop transitions, 4 changer transitions 0/174 dead transitions. [2025-03-08 22:12:03,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 174 transitions, 480 flow [2025-03-08 22:12:03,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:12:03,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 22:12:03,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 753 transitions. [2025-03-08 22:12:03,721 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8675115207373272 [2025-03-08 22:12:03,721 INFO L175 Difference]: Start difference. First operand has 171 places, 161 transitions, 374 flow. Second operand 4 states and 753 transitions. [2025-03-08 22:12:03,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 174 transitions, 480 flow [2025-03-08 22:12:03,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 174 transitions, 470 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:12:03,724 INFO L231 Difference]: Finished difference. Result has 170 places, 162 transitions, 380 flow [2025-03-08 22:12:03,724 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-08 22:12:03,724 INFO L279 CegarLoopForPetriNet]: 169 programPoint places, 1 predicate places. [2025-03-08 22:12:03,725 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 162 transitions, 380 flow [2025-03-08 22:12:03,725 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-08 22:12:03,725 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:12:03,725 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-08 22:12:03,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 22:12:03,725 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-08 22:12:03,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:12:03,725 INFO L85 PathProgramCache]: Analyzing trace with hash 849889910, now seen corresponding path program 1 times [2025-03-08 22:12:03,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:12:03,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141760222] [2025-03-08 22:12:03,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:12:03,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:12:03,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 22:12:03,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 22:12:03,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:12:03,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:12:03,741 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-08 22:12:03,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:12:03,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141760222] [2025-03-08 22:12:03,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141760222] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:12:03,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:12:03,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:12:03,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990129892] [2025-03-08 22:12:03,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:12:03,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:12:03,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:12:03,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:12:03,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:12:03,773 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 217 [2025-03-08 22:12:03,774 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-08 22:12:03,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:12:03,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 217 [2025-03-08 22:12:03,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:12:15,055 INFO L124 PetriNetUnfolderBase]: 48754/121632 cut-off events. [2025-03-08 22:12:15,055 INFO L125 PetriNetUnfolderBase]: For 18880/18880 co-relation queries the response was YES. [2025-03-08 22:12:15,768 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-08 22:12:16,292 INFO L140 encePairwiseOnDemand]: 208/217 looper letters, 45 selfloop transitions, 8 changer transitions 0/185 dead transitions. [2025-03-08 22:12:16,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 185 transitions, 564 flow [2025-03-08 22:12:16,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:12:16,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:12:16,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 570 transitions. [2025-03-08 22:12:16,294 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8755760368663594 [2025-03-08 22:12:16,294 INFO L175 Difference]: Start difference. First operand has 170 places, 162 transitions, 380 flow. Second operand 3 states and 570 transitions. [2025-03-08 22:12:16,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 185 transitions, 564 flow [2025-03-08 22:12:16,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 185 transitions, 558 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:12:16,439 INFO L231 Difference]: Finished difference. Result has 172 places, 169 transitions, 436 flow [2025-03-08 22:12:16,439 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-08 22:12:16,439 INFO L279 CegarLoopForPetriNet]: 169 programPoint places, 3 predicate places. [2025-03-08 22:12:16,439 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 169 transitions, 436 flow [2025-03-08 22:12:16,439 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-08 22:12:16,440 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:12:16,440 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-08 22:12:16,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 22:12:16,440 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-08 22:12:16,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:12:16,440 INFO L85 PathProgramCache]: Analyzing trace with hash 387346310, now seen corresponding path program 1 times [2025-03-08 22:12:16,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:12:16,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320397850] [2025-03-08 22:12:16,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:12:16,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:12:16,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 22:12:16,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 22:12:16,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:12:16,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:12:16,490 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-08 22:12:16,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:12:16,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320397850] [2025-03-08 22:12:16,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320397850] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:12:16,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:12:16,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 22:12:16,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138518379] [2025-03-08 22:12:16,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:12:16,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:12:16,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:12:16,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:12:16,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:12:16,533 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 217 [2025-03-08 22:12:16,534 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-08 22:12:16,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:12:16,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 217 [2025-03-08 22:12:16,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand