./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread/queue.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 798a7b37 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/queue.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 4d771c5dc4ab027f123135a7de4324b9be0c6bae288f44d0eaffc15d1836bd60 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:22:45,293 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:22:45,352 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:22:45,357 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:22:45,357 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:22:45,383 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:22:45,384 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:22:45,384 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:22:45,384 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:22:45,384 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:22:45,385 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:22:45,385 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:22:45,385 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:22:45,385 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:22:45,386 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:22:45,386 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:22:45,386 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:22:45,386 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:22:45,386 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:22:45,386 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:22:45,386 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:22:45,386 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:22:45,386 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:22:45,387 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:22:45,387 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:22:45,387 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:22:45,387 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:22:45,387 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:22:45,387 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:22:45,387 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:22:45,387 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:22:45,388 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:22:45,388 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:22:45,388 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:22:45,388 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:22:45,388 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:22:45,388 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:22:45,388 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:22:45,388 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:22:45,388 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:22:45,388 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:22:45,389 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:22:45,389 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 -> 4d771c5dc4ab027f123135a7de4324b9be0c6bae288f44d0eaffc15d1836bd60 [2025-03-04 06:22:45,599 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:22:45,606 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:22:45,608 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:22:45,609 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:22:45,609 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:22:45,611 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/queue.i [2025-03-04 06:22:46,739 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23b58c483/38933a7a8abe4d159342c631247189fe/FLAGa8355a38f [2025-03-04 06:22:47,003 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:22:47,004 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue.i [2025-03-04 06:22:47,014 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23b58c483/38933a7a8abe4d159342c631247189fe/FLAGa8355a38f [2025-03-04 06:22:47,024 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23b58c483/38933a7a8abe4d159342c631247189fe [2025-03-04 06:22:47,026 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:22:47,027 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:22:47,027 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:22:47,027 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:22:47,030 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:22:47,031 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:22:47" (1/1) ... [2025-03-04 06:22:47,031 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cf2993d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:22:47, skipping insertion in model container [2025-03-04 06:22:47,031 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:22:47" (1/1) ... [2025-03-04 06:22:47,060 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:22:47,345 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:22:47,355 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:22:47,410 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:22:47,452 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:22:47,452 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:22:47 WrapperNode [2025-03-04 06:22:47,453 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:22:47,454 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:22:47,454 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:22:47,454 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:22:47,458 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:22:47" (1/1) ... [2025-03-04 06:22:47,478 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:22:47" (1/1) ... [2025-03-04 06:22:47,521 INFO L138 Inliner]: procedures = 274, calls = 107, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 518 [2025-03-04 06:22:47,522 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:22:47,522 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:22:47,522 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:22:47,522 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:22:47,527 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:22:47" (1/1) ... [2025-03-04 06:22:47,527 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:22:47" (1/1) ... [2025-03-04 06:22:47,532 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:22:47" (1/1) ... [2025-03-04 06:22:47,533 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:22:47" (1/1) ... [2025-03-04 06:22:47,560 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:22:47" (1/1) ... [2025-03-04 06:22:47,562 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:22:47" (1/1) ... [2025-03-04 06:22:47,564 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:22:47" (1/1) ... [2025-03-04 06:22:47,565 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:22:47" (1/1) ... [2025-03-04 06:22:47,568 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:22:47,569 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:22:47,569 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:22:47,570 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:22:47,574 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:22:47" (1/1) ... [2025-03-04 06:22:47,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:22:47,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:22:47,607 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-04 06:22:47,610 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-04 06:22:47,625 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-04 06:22:47,625 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-04 06:22:47,626 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-04 06:22:47,626 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-04 06:22:47,626 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 06:22:47,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 06:22:47,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 06:22:47,626 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 06:22:47,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:22:47,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:22:47,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:22:47,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:22:47,627 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 06:22:47,750 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:22:47,751 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:22:48,381 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:22:48,382 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:22:48,418 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:22:48,421 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:22:48,422 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:22:48 BoogieIcfgContainer [2025-03-04 06:22:48,422 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:22:48,424 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:22:48,424 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:22:48,432 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:22:48,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:22:47" (1/3) ... [2025-03-04 06:22:48,433 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ddad9f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:22:48, skipping insertion in model container [2025-03-04 06:22:48,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:22:47" (2/3) ... [2025-03-04 06:22:48,433 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ddad9f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:22:48, skipping insertion in model container [2025-03-04 06:22:48,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:22:48" (3/3) ... [2025-03-04 06:22:48,434 INFO L128 eAbstractionObserver]: Analyzing ICFG queue.i [2025-03-04 06:22:48,453 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:22:48,454 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG queue.i that has 3 procedures, 577 locations, 1 initial locations, 2 loop locations, and 42 error locations. [2025-03-04 06:22:48,454 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:22:48,600 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 06:22:48,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 583 places, 592 transitions, 1198 flow [2025-03-04 06:22:48,800 INFO L124 PetriNetUnfolderBase]: 16/590 cut-off events. [2025-03-04 06:22:48,802 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 06:22:48,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 599 conditions, 590 events. 16/590 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 780 event pairs, 0 based on Foata normal form. 0/532 useless extension candidates. Maximal degree in co-relation 451. Up to 2 conditions per place. [2025-03-04 06:22:48,821 INFO L82 GeneralOperation]: Start removeDead. Operand has 583 places, 592 transitions, 1198 flow [2025-03-04 06:22:48,832 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 570 places, 577 transitions, 1163 flow [2025-03-04 06:22:48,843 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:22:48,882 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;@1c5d352a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:22:48,882 INFO L334 AbstractCegarLoop]: Starting to check reachability of 79 error locations. [2025-03-04 06:22:48,894 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:22:48,895 INFO L124 PetriNetUnfolderBase]: 0/78 cut-off events. [2025-03-04 06:22:48,895 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:22:48,895 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:22:48,896 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:22:48,896 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-04 06:22:48,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:22:48,901 INFO L85 PathProgramCache]: Analyzing trace with hash 660549691, now seen corresponding path program 1 times [2025-03-04 06:22:48,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:22:48,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698848348] [2025-03-04 06:22:48,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:22:48,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:22:48,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-04 06:22:48,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-04 06:22:48,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:22:48,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:22:49,126 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-04 06:22:49,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:22:49,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698848348] [2025-03-04 06:22:49,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698848348] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:22:49,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:22:49,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:22:49,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357815948] [2025-03-04 06:22:49,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:22:49,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:22:49,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:22:49,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:22:49,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:22:49,192 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 562 out of 592 [2025-03-04 06:22:49,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 570 places, 577 transitions, 1163 flow. Second operand has 3 states, 3 states have (on average 563.3333333333334) internal successors, (1690), 3 states have internal predecessors, (1690), 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-04 06:22:49,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:22:49,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 562 of 592 [2025-03-04 06:22:49,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:22:49,521 INFO L124 PetriNetUnfolderBase]: 61/1686 cut-off events. [2025-03-04 06:22:49,521 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-03-04 06:22:49,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1781 conditions, 1686 events. 61/1686 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 7648 event pairs, 27 based on Foata normal form. 24/1533 useless extension candidates. Maximal degree in co-relation 1595. Up to 70 conditions per place. [2025-03-04 06:22:49,537 INFO L140 encePairwiseOnDemand]: 585/592 looper letters, 15 selfloop transitions, 2 changer transitions 0/568 dead transitions. [2025-03-04 06:22:49,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 567 places, 568 transitions, 1179 flow [2025-03-04 06:22:49,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:22:49,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:22:49,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1708 transitions. [2025-03-04 06:22:49,558 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9617117117117117 [2025-03-04 06:22:49,563 INFO L175 Difference]: Start difference. First operand has 570 places, 577 transitions, 1163 flow. Second operand 3 states and 1708 transitions. [2025-03-04 06:22:49,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 567 places, 568 transitions, 1179 flow [2025-03-04 06:22:49,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 564 places, 568 transitions, 1174 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 06:22:49,578 INFO L231 Difference]: Finished difference. Result has 564 places, 568 transitions, 1144 flow [2025-03-04 06:22:49,580 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=592, PETRI_DIFFERENCE_MINUEND_FLOW=1140, PETRI_DIFFERENCE_MINUEND_PLACES=562, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=568, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=566, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1144, PETRI_PLACES=564, PETRI_TRANSITIONS=568} [2025-03-04 06:22:49,586 INFO L279 CegarLoopForPetriNet]: 570 programPoint places, -6 predicate places. [2025-03-04 06:22:49,586 INFO L471 AbstractCegarLoop]: Abstraction has has 564 places, 568 transitions, 1144 flow [2025-03-04 06:22:49,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 563.3333333333334) internal successors, (1690), 3 states have internal predecessors, (1690), 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-04 06:22:49,587 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:22:49,587 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:22:49,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:22:49,587 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-04 06:22:49,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:22:49,588 INFO L85 PathProgramCache]: Analyzing trace with hash 549712237, now seen corresponding path program 1 times [2025-03-04 06:22:49,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:22:49,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904702175] [2025-03-04 06:22:49,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:22:49,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:22:49,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-04 06:22:49,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-04 06:22:49,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:22:49,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:22:49,689 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-04 06:22:49,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:22:49,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904702175] [2025-03-04 06:22:49,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904702175] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:22:49,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:22:49,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:22:49,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913772760] [2025-03-04 06:22:49,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:22:49,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:22:49,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:22:49,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:22:49,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:22:49,718 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 562 out of 592 [2025-03-04 06:22:49,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 564 places, 568 transitions, 1144 flow. Second operand has 3 states, 3 states have (on average 563.3333333333334) internal successors, (1690), 3 states have internal predecessors, (1690), 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-04 06:22:49,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:22:49,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 562 of 592 [2025-03-04 06:22:49,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:22:50,075 INFO L124 PetriNetUnfolderBase]: 69/1960 cut-off events. [2025-03-04 06:22:50,075 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-04 06:22:50,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2053 conditions, 1960 events. 69/1960 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 9634 event pairs, 29 based on Foata normal form. 0/1755 useless extension candidates. Maximal degree in co-relation 1968. Up to 74 conditions per place. [2025-03-04 06:22:50,088 INFO L140 encePairwiseOnDemand]: 589/592 looper letters, 15 selfloop transitions, 2 changer transitions 0/567 dead transitions. [2025-03-04 06:22:50,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 565 places, 567 transitions, 1176 flow [2025-03-04 06:22:50,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:22:50,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:22:50,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1704 transitions. [2025-03-04 06:22:50,096 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9594594594594594 [2025-03-04 06:22:50,097 INFO L175 Difference]: Start difference. First operand has 564 places, 568 transitions, 1144 flow. Second operand 3 states and 1704 transitions. [2025-03-04 06:22:50,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 565 places, 567 transitions, 1176 flow [2025-03-04 06:22:50,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 567 transitions, 1172 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:22:50,105 INFO L231 Difference]: Finished difference. Result has 563 places, 567 transitions, 1142 flow [2025-03-04 06:22:50,106 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=592, PETRI_DIFFERENCE_MINUEND_FLOW=1138, PETRI_DIFFERENCE_MINUEND_PLACES=561, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=567, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=565, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1142, PETRI_PLACES=563, PETRI_TRANSITIONS=567} [2025-03-04 06:22:50,107 INFO L279 CegarLoopForPetriNet]: 570 programPoint places, -7 predicate places. [2025-03-04 06:22:50,108 INFO L471 AbstractCegarLoop]: Abstraction has has 563 places, 567 transitions, 1142 flow [2025-03-04 06:22:50,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 563.3333333333334) internal successors, (1690), 3 states have internal predecessors, (1690), 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-04 06:22:50,109 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:22:50,109 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:22:50,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:22:50,109 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-04 06:22:50,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:22:50,111 INFO L85 PathProgramCache]: Analyzing trace with hash 58637508, now seen corresponding path program 1 times [2025-03-04 06:22:50,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:22:50,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203082155] [2025-03-04 06:22:50,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:22:50,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:22:50,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 06:22:50,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 06:22:50,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:22:50,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:22:50,655 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-04 06:22:50,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:22:50,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203082155] [2025-03-04 06:22:50,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203082155] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:22:50,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:22:50,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:22:50,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205853188] [2025-03-04 06:22:50,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:22:50,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:22:50,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:22:50,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:22:50,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:22:51,561 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 437 out of 592 [2025-03-04 06:22:51,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 563 places, 567 transitions, 1142 flow. Second operand has 6 states, 6 states have (on average 438.3333333333333) internal successors, (2630), 6 states have internal predecessors, (2630), 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-04 06:22:51,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:22:51,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 437 of 592 [2025-03-04 06:22:51,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:22:53,703 INFO L124 PetriNetUnfolderBase]: 3671/15096 cut-off events. [2025-03-04 06:22:53,704 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-03-04 06:22:53,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22144 conditions, 15096 events. 3671/15096 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 136636 event pairs, 3314 based on Foata normal form. 0/13635 useless extension candidates. Maximal degree in co-relation 22055. Up to 6868 conditions per place. [2025-03-04 06:22:53,807 INFO L140 encePairwiseOnDemand]: 586/592 looper letters, 138 selfloop transitions, 5 changer transitions 0/566 dead transitions. [2025-03-04 06:22:53,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 567 places, 566 transitions, 1426 flow [2025-03-04 06:22:53,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:22:53,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:22:53,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2766 transitions. [2025-03-04 06:22:53,814 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7787162162162162 [2025-03-04 06:22:53,814 INFO L175 Difference]: Start difference. First operand has 563 places, 567 transitions, 1142 flow. Second operand 6 states and 2766 transitions. [2025-03-04 06:22:53,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 567 places, 566 transitions, 1426 flow [2025-03-04 06:22:53,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 565 places, 566 transitions, 1422 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:22:53,823 INFO L231 Difference]: Finished difference. Result has 565 places, 566 transitions, 1146 flow [2025-03-04 06:22:53,824 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=592, PETRI_DIFFERENCE_MINUEND_FLOW=1136, PETRI_DIFFERENCE_MINUEND_PLACES=560, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=566, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=561, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1146, PETRI_PLACES=565, PETRI_TRANSITIONS=566} [2025-03-04 06:22:53,825 INFO L279 CegarLoopForPetriNet]: 570 programPoint places, -5 predicate places. [2025-03-04 06:22:53,825 INFO L471 AbstractCegarLoop]: Abstraction has has 565 places, 566 transitions, 1146 flow [2025-03-04 06:22:53,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 438.3333333333333) internal successors, (2630), 6 states have internal predecessors, (2630), 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-04 06:22:53,827 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:22:53,827 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:22:53,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:22:53,827 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-04 06:22:53,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:22:53,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1420314719, now seen corresponding path program 1 times [2025-03-04 06:22:53,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:22:53,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624061900] [2025-03-04 06:22:53,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:22:53,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:22:53,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-04 06:22:53,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-04 06:22:53,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:22:53,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:22:54,289 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-04 06:22:54,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:22:54,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624061900] [2025-03-04 06:22:54,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624061900] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:22:54,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:22:54,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:22:54,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533552406] [2025-03-04 06:22:54,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:22:54,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:22:54,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:22:54,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:22:54,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:22:55,001 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 437 out of 592 [2025-03-04 06:22:55,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 565 places, 566 transitions, 1146 flow. Second operand has 6 states, 6 states have (on average 438.3333333333333) internal successors, (2630), 6 states have internal predecessors, (2630), 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-04 06:22:55,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:22:55,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 437 of 592 [2025-03-04 06:22:55,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:22:57,045 INFO L124 PetriNetUnfolderBase]: 3671/15095 cut-off events. [2025-03-04 06:22:57,045 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-03-04 06:22:57,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22146 conditions, 15095 events. 3671/15095 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 136781 event pairs, 3314 based on Foata normal form. 0/13635 useless extension candidates. Maximal degree in co-relation 22041. Up to 6868 conditions per place. [2025-03-04 06:22:57,110 INFO L140 encePairwiseOnDemand]: 586/592 looper letters, 138 selfloop transitions, 5 changer transitions 0/565 dead transitions. [2025-03-04 06:22:57,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 569 places, 565 transitions, 1430 flow [2025-03-04 06:22:57,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:22:57,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:22:57,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2766 transitions. [2025-03-04 06:22:57,115 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7787162162162162 [2025-03-04 06:22:57,115 INFO L175 Difference]: Start difference. First operand has 565 places, 566 transitions, 1146 flow. Second operand 6 states and 2766 transitions. [2025-03-04 06:22:57,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 569 places, 565 transitions, 1430 flow [2025-03-04 06:22:57,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 564 places, 565 transitions, 1420 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:22:57,124 INFO L231 Difference]: Finished difference. Result has 564 places, 565 transitions, 1144 flow [2025-03-04 06:22:57,125 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=592, PETRI_DIFFERENCE_MINUEND_FLOW=1134, PETRI_DIFFERENCE_MINUEND_PLACES=559, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=565, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=560, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1144, PETRI_PLACES=564, PETRI_TRANSITIONS=565} [2025-03-04 06:22:57,126 INFO L279 CegarLoopForPetriNet]: 570 programPoint places, -6 predicate places. [2025-03-04 06:22:57,127 INFO L471 AbstractCegarLoop]: Abstraction has has 564 places, 565 transitions, 1144 flow [2025-03-04 06:22:57,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 438.3333333333333) internal successors, (2630), 6 states have internal predecessors, (2630), 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-04 06:22:57,128 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:22:57,128 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:22:57,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:22:57,129 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-04 06:22:57,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:22:57,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1125698543, now seen corresponding path program 1 times [2025-03-04 06:22:57,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:22:57,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681181600] [2025-03-04 06:22:57,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:22:57,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:22:57,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 06:22:57,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 06:22:57,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:22:57,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:22:57,540 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-04 06:22:57,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:22:57,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681181600] [2025-03-04 06:22:57,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681181600] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:22:57,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:22:57,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:22:57,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109602126] [2025-03-04 06:22:57,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:22:57,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:22:57,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:22:57,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:22:57,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:22:58,030 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 437 out of 592 [2025-03-04 06:22:58,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 564 places, 565 transitions, 1144 flow. Second operand has 6 states, 6 states have (on average 438.3333333333333) internal successors, (2630), 6 states have internal predecessors, (2630), 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-04 06:22:58,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:22:58,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 437 of 592 [2025-03-04 06:22:58,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:23:00,418 INFO L124 PetriNetUnfolderBase]: 3671/15094 cut-off events. [2025-03-04 06:23:00,418 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-03-04 06:23:00,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22145 conditions, 15094 events. 3671/15094 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 136978 event pairs, 3314 based on Foata normal form. 0/13635 useless extension candidates. Maximal degree in co-relation 22032. Up to 6868 conditions per place. [2025-03-04 06:23:00,484 INFO L140 encePairwiseOnDemand]: 586/592 looper letters, 138 selfloop transitions, 5 changer transitions 0/564 dead transitions. [2025-03-04 06:23:00,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 568 places, 564 transitions, 1428 flow [2025-03-04 06:23:00,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:23:00,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:23:00,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2766 transitions. [2025-03-04 06:23:00,490 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7787162162162162 [2025-03-04 06:23:00,490 INFO L175 Difference]: Start difference. First operand has 564 places, 565 transitions, 1144 flow. Second operand 6 states and 2766 transitions. [2025-03-04 06:23:00,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 568 places, 564 transitions, 1428 flow [2025-03-04 06:23:00,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 564 transitions, 1418 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:23:00,496 INFO L231 Difference]: Finished difference. Result has 563 places, 564 transitions, 1142 flow [2025-03-04 06:23:00,497 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=592, PETRI_DIFFERENCE_MINUEND_FLOW=1132, PETRI_DIFFERENCE_MINUEND_PLACES=558, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=564, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=559, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1142, PETRI_PLACES=563, PETRI_TRANSITIONS=564} [2025-03-04 06:23:00,498 INFO L279 CegarLoopForPetriNet]: 570 programPoint places, -7 predicate places. [2025-03-04 06:23:00,498 INFO L471 AbstractCegarLoop]: Abstraction has has 563 places, 564 transitions, 1142 flow [2025-03-04 06:23:00,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 438.3333333333333) internal successors, (2630), 6 states have internal predecessors, (2630), 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-04 06:23:00,499 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:23:00,499 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:23:00,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:23:00,500 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-04 06:23:00,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:23:00,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1179369503, now seen corresponding path program 1 times [2025-03-04 06:23:00,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:23:00,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174863176] [2025-03-04 06:23:00,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:23:00,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:23:00,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 06:23:00,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 06:23:00,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:23:00,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:23:00,868 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-04 06:23:00,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:23:00,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174863176] [2025-03-04 06:23:00,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174863176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:23:00,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:23:00,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:23:00,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874159134] [2025-03-04 06:23:00,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:23:00,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:23:00,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:23:00,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:23:00,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:23:01,831 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 499 out of 592 [2025-03-04 06:23:01,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 563 places, 564 transitions, 1142 flow. Second operand has 6 states, 6 states have (on average 502.1666666666667) internal successors, (3013), 6 states have internal predecessors, (3013), 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-04 06:23:01,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:23:01,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 499 of 592 [2025-03-04 06:23:01,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:23:02,499 INFO L124 PetriNetUnfolderBase]: 831/5612 cut-off events. [2025-03-04 06:23:02,500 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-04 06:23:02,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7190 conditions, 5612 events. 831/5612 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 45618 event pairs, 674 based on Foata normal form. 0/5003 useless extension candidates. Maximal degree in co-relation 7059. Up to 1475 conditions per place. [2025-03-04 06:23:02,522 INFO L140 encePairwiseOnDemand]: 586/592 looper letters, 76 selfloop transitions, 5 changer transitions 0/563 dead transitions. [2025-03-04 06:23:02,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 567 places, 563 transitions, 1302 flow [2025-03-04 06:23:02,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:23:02,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:23:02,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3076 transitions. [2025-03-04 06:23:02,531 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.865990990990991 [2025-03-04 06:23:02,531 INFO L175 Difference]: Start difference. First operand has 563 places, 564 transitions, 1142 flow. Second operand 6 states and 3076 transitions. [2025-03-04 06:23:02,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 567 places, 563 transitions, 1302 flow [2025-03-04 06:23:02,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 562 places, 563 transitions, 1292 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:23:02,537 INFO L231 Difference]: Finished difference. Result has 562 places, 563 transitions, 1140 flow [2025-03-04 06:23:02,538 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=592, PETRI_DIFFERENCE_MINUEND_FLOW=1130, PETRI_DIFFERENCE_MINUEND_PLACES=557, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=563, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=558, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1140, PETRI_PLACES=562, PETRI_TRANSITIONS=563} [2025-03-04 06:23:02,540 INFO L279 CegarLoopForPetriNet]: 570 programPoint places, -8 predicate places. [2025-03-04 06:23:02,540 INFO L471 AbstractCegarLoop]: Abstraction has has 562 places, 563 transitions, 1140 flow [2025-03-04 06:23:02,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 502.1666666666667) internal successors, (3013), 6 states have internal predecessors, (3013), 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-04 06:23:02,542 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:23:02,542 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:23:02,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:23:02,542 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-04 06:23:02,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:23:02,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1298725753, now seen corresponding path program 1 times [2025-03-04 06:23:02,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:23:02,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545016927] [2025-03-04 06:23:02,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:23:02,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:23:02,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 06:23:02,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 06:23:02,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:23:02,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:23:02,879 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-04 06:23:02,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:23:02,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545016927] [2025-03-04 06:23:02,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545016927] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:23:02,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:23:02,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:23:02,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532900498] [2025-03-04 06:23:02,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:23:02,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:23:02,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:23:02,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:23:02,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:23:03,720 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 499 out of 592 [2025-03-04 06:23:03,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 562 places, 563 transitions, 1140 flow. Second operand has 6 states, 6 states have (on average 502.1666666666667) internal successors, (3013), 6 states have internal predecessors, (3013), 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-04 06:23:03,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:23:03,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 499 of 592 [2025-03-04 06:23:03,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:23:04,299 INFO L124 PetriNetUnfolderBase]: 831/5611 cut-off events. [2025-03-04 06:23:04,299 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-04 06:23:04,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7189 conditions, 5611 events. 831/5611 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 45465 event pairs, 674 based on Foata normal form. 0/5003 useless extension candidates. Maximal degree in co-relation 7020. Up to 1475 conditions per place. [2025-03-04 06:23:04,318 INFO L140 encePairwiseOnDemand]: 586/592 looper letters, 76 selfloop transitions, 5 changer transitions 0/562 dead transitions. [2025-03-04 06:23:04,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 566 places, 562 transitions, 1300 flow [2025-03-04 06:23:04,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:23:04,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:23:04,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3076 transitions. [2025-03-04 06:23:04,323 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.865990990990991 [2025-03-04 06:23:04,323 INFO L175 Difference]: Start difference. First operand has 562 places, 563 transitions, 1140 flow. Second operand 6 states and 3076 transitions. [2025-03-04 06:23:04,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 566 places, 562 transitions, 1300 flow [2025-03-04 06:23:04,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 561 places, 562 transitions, 1290 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:23:04,329 INFO L231 Difference]: Finished difference. Result has 561 places, 562 transitions, 1138 flow [2025-03-04 06:23:04,329 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=592, PETRI_DIFFERENCE_MINUEND_FLOW=1128, PETRI_DIFFERENCE_MINUEND_PLACES=556, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=562, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=557, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1138, PETRI_PLACES=561, PETRI_TRANSITIONS=562} [2025-03-04 06:23:04,330 INFO L279 CegarLoopForPetriNet]: 570 programPoint places, -9 predicate places. [2025-03-04 06:23:04,330 INFO L471 AbstractCegarLoop]: Abstraction has has 561 places, 562 transitions, 1138 flow [2025-03-04 06:23:04,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 502.1666666666667) internal successors, (3013), 6 states have internal predecessors, (3013), 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-04 06:23:04,331 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:23:04,331 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:23:04,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:23:04,332 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-04 06:23:04,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:23:04,332 INFO L85 PathProgramCache]: Analyzing trace with hash -208833624, now seen corresponding path program 1 times [2025-03-04 06:23:04,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:23:04,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878672740] [2025-03-04 06:23:04,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:23:04,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:23:04,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-04 06:23:04,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-04 06:23:04,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:23:04,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:23:04,428 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 06:23:04,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:23:04,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878672740] [2025-03-04 06:23:04,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878672740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:23:04,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:23:04,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:23:04,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128528080] [2025-03-04 06:23:04,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:23:04,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:23:04,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:23:04,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:23:04,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:23:04,446 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 592 [2025-03-04 06:23:04,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 561 places, 562 transitions, 1138 flow. Second operand has 3 states, 3 states have (on average 568.0) internal successors, (1704), 3 states have internal predecessors, (1704), 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-04 06:23:04,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:23:04,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 592 [2025-03-04 06:23:04,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:23:04,712 INFO L124 PetriNetUnfolderBase]: 114/2678 cut-off events. [2025-03-04 06:23:04,712 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-03-04 06:23:04,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2845 conditions, 2678 events. 114/2678 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 13939 event pairs, 25 based on Foata normal form. 0/2382 useless extension candidates. Maximal degree in co-relation 2695. Up to 88 conditions per place. [2025-03-04 06:23:04,730 INFO L140 encePairwiseOnDemand]: 587/592 looper letters, 22 selfloop transitions, 4 changer transitions 0/573 dead transitions. [2025-03-04 06:23:04,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 563 places, 573 transitions, 1213 flow [2025-03-04 06:23:04,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:23:04,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:23:04,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1725 transitions. [2025-03-04 06:23:04,732 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9712837837837838 [2025-03-04 06:23:04,732 INFO L175 Difference]: Start difference. First operand has 561 places, 562 transitions, 1138 flow. Second operand 3 states and 1725 transitions. [2025-03-04 06:23:04,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 563 places, 573 transitions, 1213 flow [2025-03-04 06:23:04,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 558 places, 573 transitions, 1203 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:23:04,743 INFO L231 Difference]: Finished difference. Result has 560 places, 566 transitions, 1162 flow [2025-03-04 06:23:04,745 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=592, PETRI_DIFFERENCE_MINUEND_FLOW=1128, PETRI_DIFFERENCE_MINUEND_PLACES=556, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=562, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=558, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1162, PETRI_PLACES=560, PETRI_TRANSITIONS=566} [2025-03-04 06:23:04,747 INFO L279 CegarLoopForPetriNet]: 570 programPoint places, -10 predicate places. [2025-03-04 06:23:04,747 INFO L471 AbstractCegarLoop]: Abstraction has has 560 places, 566 transitions, 1162 flow [2025-03-04 06:23:04,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 568.0) internal successors, (1704), 3 states have internal predecessors, (1704), 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-04 06:23:04,749 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:23:04,749 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:23:04,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:23:04,749 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err22ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-04 06:23:04,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:23:04,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1308442786, now seen corresponding path program 1 times [2025-03-04 06:23:04,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:23:04,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764018158] [2025-03-04 06:23:04,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:23:04,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:23:04,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-04 06:23:04,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-04 06:23:04,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:23:04,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:23:05,083 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 06:23:05,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:23:05,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764018158] [2025-03-04 06:23:05,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764018158] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:23:05,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:23:05,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:23:05,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404689348] [2025-03-04 06:23:05,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:23:05,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:23:05,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:23:05,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:23:05,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:23:06,017 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 470 out of 592 [2025-03-04 06:23:06,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 560 places, 566 transitions, 1162 flow. Second operand has 6 states, 6 states have (on average 473.5) internal successors, (2841), 6 states have internal predecessors, (2841), 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-04 06:23:06,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:23:06,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 470 of 592 [2025-03-04 06:23:06,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:23:08,249 INFO L124 PetriNetUnfolderBase]: 3091/15503 cut-off events. [2025-03-04 06:23:08,249 INFO L125 PetriNetUnfolderBase]: For 128/128 co-relation queries the response was YES. [2025-03-04 06:23:08,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21715 conditions, 15503 events. 3091/15503 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 143894 event pairs, 1173 based on Foata normal form. 0/13921 useless extension candidates. Maximal degree in co-relation 20891. Up to 4480 conditions per place. [2025-03-04 06:23:08,334 INFO L140 encePairwiseOnDemand]: 538/592 looper letters, 125 selfloop transitions, 84 changer transitions 0/664 dead transitions. [2025-03-04 06:23:08,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 565 places, 664 transitions, 1784 flow [2025-03-04 06:23:08,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:23:08,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:23:08,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3035 transitions. [2025-03-04 06:23:08,338 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8544481981981982 [2025-03-04 06:23:08,338 INFO L175 Difference]: Start difference. First operand has 560 places, 566 transitions, 1162 flow. Second operand 6 states and 3035 transitions. [2025-03-04 06:23:08,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 565 places, 664 transitions, 1784 flow [2025-03-04 06:23:08,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 664 transitions, 1776 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:23:08,347 INFO L231 Difference]: Finished difference. Result has 568 places, 646 transitions, 1750 flow [2025-03-04 06:23:08,347 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=592, PETRI_DIFFERENCE_MINUEND_FLOW=1154, PETRI_DIFFERENCE_MINUEND_PLACES=558, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=566, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=518, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1750, PETRI_PLACES=568, PETRI_TRANSITIONS=646} [2025-03-04 06:23:08,348 INFO L279 CegarLoopForPetriNet]: 570 programPoint places, -2 predicate places. [2025-03-04 06:23:08,348 INFO L471 AbstractCegarLoop]: Abstraction has has 568 places, 646 transitions, 1750 flow [2025-03-04 06:23:08,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 473.5) internal successors, (2841), 6 states have internal predecessors, (2841), 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-04 06:23:08,350 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:23:08,350 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:23:08,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:23:08,350 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-04 06:23:08,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:23:08,351 INFO L85 PathProgramCache]: Analyzing trace with hash -2131945807, now seen corresponding path program 1 times [2025-03-04 06:23:08,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:23:08,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047175773] [2025-03-04 06:23:08,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:23:08,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:23:08,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-04 06:23:08,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-04 06:23:08,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:23:08,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:23:08,516 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 06:23:08,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:23:08,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047175773] [2025-03-04 06:23:08,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047175773] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:23:08,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:23:08,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:23:08,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892349863] [2025-03-04 06:23:08,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:23:08,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:23:08,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:23:08,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:23:08,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:23:08,523 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 567 out of 592 [2025-03-04 06:23:08,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 568 places, 646 transitions, 1750 flow. Second operand has 3 states, 3 states have (on average 569.0) internal successors, (1707), 3 states have internal predecessors, (1707), 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-04 06:23:08,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:23:08,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 567 of 592 [2025-03-04 06:23:08,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:23:09,632 INFO L124 PetriNetUnfolderBase]: 991/8750 cut-off events. [2025-03-04 06:23:09,632 INFO L125 PetriNetUnfolderBase]: For 621/633 co-relation queries the response was YES. [2025-03-04 06:23:09,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12490 conditions, 8750 events. 991/8750 cut-off events. For 621/633 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 73964 event pairs, 110 based on Foata normal form. 24/7986 useless extension candidates. Maximal degree in co-relation 11810. Up to 966 conditions per place. [2025-03-04 06:23:09,683 INFO L140 encePairwiseOnDemand]: 588/592 looper letters, 18 selfloop transitions, 3 changer transitions 0/634 dead transitions. [2025-03-04 06:23:09,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 567 places, 634 transitions, 1719 flow [2025-03-04 06:23:09,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:23:09,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:23:09,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1723 transitions. [2025-03-04 06:23:09,685 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9701576576576577 [2025-03-04 06:23:09,685 INFO L175 Difference]: Start difference. First operand has 568 places, 646 transitions, 1750 flow. Second operand 3 states and 1723 transitions. [2025-03-04 06:23:09,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 567 places, 634 transitions, 1719 flow [2025-03-04 06:23:09,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 567 places, 634 transitions, 1705 flow, removed 7 selfloop flow, removed 0 redundant places. [2025-03-04 06:23:09,699 INFO L231 Difference]: Finished difference. Result has 568 places, 628 transitions, 1661 flow [2025-03-04 06:23:09,700 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=592, PETRI_DIFFERENCE_MINUEND_FLOW=1646, PETRI_DIFFERENCE_MINUEND_PLACES=565, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=627, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=624, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1661, PETRI_PLACES=568, PETRI_TRANSITIONS=628} [2025-03-04 06:23:09,700 INFO L279 CegarLoopForPetriNet]: 570 programPoint places, -2 predicate places. [2025-03-04 06:23:09,700 INFO L471 AbstractCegarLoop]: Abstraction has has 568 places, 628 transitions, 1661 flow [2025-03-04 06:23:09,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 569.0) internal successors, (1707), 3 states have internal predecessors, (1707), 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-04 06:23:09,701 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:23:09,702 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:23:09,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:23:09,702 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err21ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-04 06:23:09,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:23:09,702 INFO L85 PathProgramCache]: Analyzing trace with hash 300033979, now seen corresponding path program 1 times [2025-03-04 06:23:09,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:23:09,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211305949] [2025-03-04 06:23:09,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:23:09,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:23:09,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-04 06:23:09,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-04 06:23:09,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:23:09,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:23:10,044 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 06:23:10,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:23:10,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211305949] [2025-03-04 06:23:10,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211305949] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:23:10,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:23:10,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:23:10,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99224141] [2025-03-04 06:23:10,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:23:10,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:23:10,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:23:10,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:23:10,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:23:10,624 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 592 [2025-03-04 06:23:10,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 568 places, 628 transitions, 1661 flow. Second operand has 6 states, 6 states have (on average 423.8333333333333) internal successors, (2543), 6 states have internal predecessors, (2543), 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-04 06:23:10,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:23:10,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 592 [2025-03-04 06:23:10,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:23:14,411 INFO L124 PetriNetUnfolderBase]: 6038/22406 cut-off events. [2025-03-04 06:23:14,412 INFO L125 PetriNetUnfolderBase]: For 4253/4484 co-relation queries the response was YES. [2025-03-04 06:23:14,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40984 conditions, 22406 events. 6038/22406 cut-off events. For 4253/4484 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 222007 event pairs, 3626 based on Foata normal form. 30/20391 useless extension candidates. Maximal degree in co-relation 39596. Up to 11092 conditions per place. [2025-03-04 06:23:14,518 INFO L140 encePairwiseOnDemand]: 543/592 looper letters, 228 selfloop transitions, 156 changer transitions 0/788 dead transitions. [2025-03-04 06:23:14,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 572 places, 788 transitions, 2853 flow [2025-03-04 06:23:14,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:23:14,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:23:14,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2833 transitions. [2025-03-04 06:23:14,523 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7975788288288288 [2025-03-04 06:23:14,523 INFO L175 Difference]: Start difference. First operand has 568 places, 628 transitions, 1661 flow. Second operand 6 states and 2833 transitions. [2025-03-04 06:23:14,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 572 places, 788 transitions, 2853 flow [2025-03-04 06:23:14,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 571 places, 788 transitions, 2850 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:23:14,540 INFO L231 Difference]: Finished difference. Result has 576 places, 776 transitions, 2758 flow [2025-03-04 06:23:14,541 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=592, PETRI_DIFFERENCE_MINUEND_FLOW=1656, PETRI_DIFFERENCE_MINUEND_PLACES=566, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=627, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=579, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2758, PETRI_PLACES=576, PETRI_TRANSITIONS=776} [2025-03-04 06:23:14,542 INFO L279 CegarLoopForPetriNet]: 570 programPoint places, 6 predicate places. [2025-03-04 06:23:14,542 INFO L471 AbstractCegarLoop]: Abstraction has has 576 places, 776 transitions, 2758 flow [2025-03-04 06:23:14,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 423.8333333333333) internal successors, (2543), 6 states have internal predecessors, (2543), 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-04 06:23:14,543 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:23:14,543 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 06:23:14,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 06:23:14,543 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err20ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-04 06:23:14,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:23:14,543 INFO L85 PathProgramCache]: Analyzing trace with hash -645065793, now seen corresponding path program 1 times [2025-03-04 06:23:14,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:23:14,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087268663] [2025-03-04 06:23:14,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:23:14,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:23:14,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-04 06:23:14,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-04 06:23:14,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:23:14,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:23:14,939 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 06:23:14,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:23:14,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087268663] [2025-03-04 06:23:14,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087268663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:23:14,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:23:14,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:23:14,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453402141] [2025-03-04 06:23:14,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:23:14,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:23:14,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:23:14,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:23:14,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:23:15,777 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 504 out of 592 [2025-03-04 06:23:15,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 576 places, 776 transitions, 2758 flow. Second operand has 6 states, 6 states have (on average 508.1666666666667) internal successors, (3049), 6 states have internal predecessors, (3049), 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-04 06:23:15,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:23:15,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 504 of 592 [2025-03-04 06:23:15,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:23:18,473 INFO L124 PetriNetUnfolderBase]: 2816/14526 cut-off events. [2025-03-04 06:23:18,473 INFO L125 PetriNetUnfolderBase]: For 4557/5238 co-relation queries the response was YES. [2025-03-04 06:23:18,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27626 conditions, 14526 events. 2816/14526 cut-off events. For 4557/5238 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 139658 event pairs, 749 based on Foata normal form. 51/13285 useless extension candidates. Maximal degree in co-relation 26599. Up to 3595 conditions per place. [2025-03-04 06:23:18,590 INFO L140 encePairwiseOnDemand]: 567/592 looper letters, 182 selfloop transitions, 59 changer transitions 0/840 dead transitions. [2025-03-04 06:23:18,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 580 places, 840 transitions, 3568 flow [2025-03-04 06:23:18,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:23:18,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:23:18,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3167 transitions. [2025-03-04 06:23:18,594 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8916103603603603 [2025-03-04 06:23:18,594 INFO L175 Difference]: Start difference. First operand has 576 places, 776 transitions, 2758 flow. Second operand 6 states and 3167 transitions. [2025-03-04 06:23:18,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 580 places, 840 transitions, 3568 flow [2025-03-04 06:23:18,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 580 places, 840 transitions, 3472 flow, removed 48 selfloop flow, removed 0 redundant places. [2025-03-04 06:23:18,627 INFO L231 Difference]: Finished difference. Result has 585 places, 828 transitions, 3230 flow [2025-03-04 06:23:18,628 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=592, PETRI_DIFFERENCE_MINUEND_FLOW=2660, PETRI_DIFFERENCE_MINUEND_PLACES=575, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=775, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=752, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3230, PETRI_PLACES=585, PETRI_TRANSITIONS=828} [2025-03-04 06:23:18,628 INFO L279 CegarLoopForPetriNet]: 570 programPoint places, 15 predicate places. [2025-03-04 06:23:18,628 INFO L471 AbstractCegarLoop]: Abstraction has has 585 places, 828 transitions, 3230 flow [2025-03-04 06:23:18,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 508.1666666666667) internal successors, (3049), 6 states have internal predecessors, (3049), 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-04 06:23:18,629 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:23:18,630 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:23:18,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:23:18,630 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err19ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-04 06:23:18,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:23:18,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1367281731, now seen corresponding path program 1 times [2025-03-04 06:23:18,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:23:18,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963100269] [2025-03-04 06:23:18,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:23:18,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:23:18,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-04 06:23:18,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-04 06:23:18,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:23:18,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:23:19,081 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 06:23:19,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:23:19,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963100269] [2025-03-04 06:23:19,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963100269] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:23:19,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:23:19,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:23:19,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837087029] [2025-03-04 06:23:19,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:23:19,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:23:19,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:23:19,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:23:19,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:23:19,637 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 460 out of 592 [2025-03-04 06:23:19,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 585 places, 828 transitions, 3230 flow. Second operand has 6 states, 6 states have (on average 466.5) internal successors, (2799), 6 states have internal predecessors, (2799), 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-04 06:23:19,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:23:19,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 592 [2025-03-04 06:23:19,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:23:23,448 INFO L124 PetriNetUnfolderBase]: 4710/19221 cut-off events. [2025-03-04 06:23:23,448 INFO L125 PetriNetUnfolderBase]: For 8446/8780 co-relation queries the response was YES. [2025-03-04 06:23:23,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41220 conditions, 19221 events. 4710/19221 cut-off events. For 8446/8780 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 188981 event pairs, 1581 based on Foata normal form. 59/17632 useless extension candidates. Maximal degree in co-relation 40081. Up to 7811 conditions per place. [2025-03-04 06:23:23,553 INFO L140 encePairwiseOnDemand]: 543/592 looper letters, 374 selfloop transitions, 156 changer transitions 0/988 dead transitions. [2025-03-04 06:23:23,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 589 places, 988 transitions, 5098 flow [2025-03-04 06:23:23,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:23:23,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:23:23,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3043 transitions. [2025-03-04 06:23:23,558 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8567004504504504 [2025-03-04 06:23:23,558 INFO L175 Difference]: Start difference. First operand has 585 places, 828 transitions, 3230 flow. Second operand 6 states and 3043 transitions. [2025-03-04 06:23:23,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 589 places, 988 transitions, 5098 flow [2025-03-04 06:23:23,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 589 places, 988 transitions, 5002 flow, removed 48 selfloop flow, removed 0 redundant places. [2025-03-04 06:23:23,595 INFO L231 Difference]: Finished difference. Result has 594 places, 976 transitions, 4618 flow [2025-03-04 06:23:23,596 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=592, PETRI_DIFFERENCE_MINUEND_FLOW=3132, PETRI_DIFFERENCE_MINUEND_PLACES=584, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=827, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=779, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4618, PETRI_PLACES=594, PETRI_TRANSITIONS=976} [2025-03-04 06:23:23,597 INFO L279 CegarLoopForPetriNet]: 570 programPoint places, 24 predicate places. [2025-03-04 06:23:23,597 INFO L471 AbstractCegarLoop]: Abstraction has has 594 places, 976 transitions, 4618 flow [2025-03-04 06:23:23,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 466.5) internal successors, (2799), 6 states have internal predecessors, (2799), 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-04 06:23:23,598 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:23:23,598 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:23:23,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 06:23:23,598 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-04 06:23:23,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:23:23,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1586444398, now seen corresponding path program 1 times [2025-03-04 06:23:23,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:23:23,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719017165] [2025-03-04 06:23:23,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:23:23,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:23:23,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-04 06:23:23,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-04 06:23:23,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:23:23,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:23:23,925 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 06:23:23,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:23:23,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719017165] [2025-03-04 06:23:23,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719017165] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:23:23,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:23:23,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:23:23,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920304351] [2025-03-04 06:23:23,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:23:23,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:23:23,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:23:23,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:23:23,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:23:24,409 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 430 out of 592 [2025-03-04 06:23:24,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 594 places, 976 transitions, 4618 flow. Second operand has 6 states, 6 states have (on average 437.3333333333333) internal successors, (2624), 6 states have internal predecessors, (2624), 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-04 06:23:24,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:23:24,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 430 of 592 [2025-03-04 06:23:24,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:23:29,939 INFO L124 PetriNetUnfolderBase]: 7085/25823 cut-off events. [2025-03-04 06:23:29,940 INFO L125 PetriNetUnfolderBase]: For 18989/19407 co-relation queries the response was YES. [2025-03-04 06:23:30,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63028 conditions, 25823 events. 7085/25823 cut-off events. For 18989/19407 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 262278 event pairs, 2895 based on Foata normal form. 58/23776 useless extension candidates. Maximal degree in co-relation 61630. Up to 11984 conditions per place. [2025-03-04 06:23:30,167 INFO L140 encePairwiseOnDemand]: 543/592 looper letters, 558 selfloop transitions, 156 changer transitions 0/1136 dead transitions. [2025-03-04 06:23:30,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 598 places, 1136 transitions, 7142 flow [2025-03-04 06:23:30,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:23:30,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:23:30,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2893 transitions. [2025-03-04 06:23:30,172 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8144707207207207 [2025-03-04 06:23:30,172 INFO L175 Difference]: Start difference. First operand has 594 places, 976 transitions, 4618 flow. Second operand 6 states and 2893 transitions. [2025-03-04 06:23:30,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 598 places, 1136 transitions, 7142 flow [2025-03-04 06:23:30,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 598 places, 1136 transitions, 6662 flow, removed 240 selfloop flow, removed 0 redundant places. [2025-03-04 06:23:30,238 INFO L231 Difference]: Finished difference. Result has 603 places, 1124 transitions, 5910 flow [2025-03-04 06:23:30,239 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=592, PETRI_DIFFERENCE_MINUEND_FLOW=4136, PETRI_DIFFERENCE_MINUEND_PLACES=593, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=975, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=927, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5910, PETRI_PLACES=603, PETRI_TRANSITIONS=1124} [2025-03-04 06:23:30,239 INFO L279 CegarLoopForPetriNet]: 570 programPoint places, 33 predicate places. [2025-03-04 06:23:30,240 INFO L471 AbstractCegarLoop]: Abstraction has has 603 places, 1124 transitions, 5910 flow [2025-03-04 06:23:30,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 437.3333333333333) internal successors, (2624), 6 states have internal predecessors, (2624), 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-04 06:23:30,240 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:23:30,240 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:23:30,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 06:23:30,240 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err16ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-04 06:23:30,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:23:30,241 INFO L85 PathProgramCache]: Analyzing trace with hash -601568638, now seen corresponding path program 1 times [2025-03-04 06:23:30,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:23:30,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453391738] [2025-03-04 06:23:30,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:23:30,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:23:30,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-04 06:23:30,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-04 06:23:30,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:23:30,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:23:30,714 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 06:23:30,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:23:30,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453391738] [2025-03-04 06:23:30,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453391738] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:23:30,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:23:30,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:23:30,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730669325] [2025-03-04 06:23:30,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:23:30,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:23:30,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:23:30,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:23:30,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:23:31,229 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 430 out of 592 [2025-03-04 06:23:31,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 603 places, 1124 transitions, 5910 flow. Second operand has 6 states, 6 states have (on average 438.1666666666667) internal successors, (2629), 6 states have internal predecessors, (2629), 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-04 06:23:31,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:23:31,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 430 of 592 [2025-03-04 06:23:31,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:23:37,131 INFO L124 PetriNetUnfolderBase]: 7511/26884 cut-off events. [2025-03-04 06:23:37,131 INFO L125 PetriNetUnfolderBase]: For 28720/29226 co-relation queries the response was YES. [2025-03-04 06:23:37,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72169 conditions, 26884 events. 7511/26884 cut-off events. For 28720/29226 co-relation queries the response was YES. Maximal size of possible extension queue 328. Compared 273401 event pairs, 2522 based on Foata normal form. 60/24829 useless extension candidates. Maximal degree in co-relation 70749. Up to 12642 conditions per place. [2025-03-04 06:23:37,379 INFO L140 encePairwiseOnDemand]: 543/592 looper letters, 706 selfloop transitions, 156 changer transitions 0/1284 dead transitions. [2025-03-04 06:23:37,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 607 places, 1284 transitions, 9018 flow [2025-03-04 06:23:37,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:23:37,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:23:37,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2893 transitions. [2025-03-04 06:23:37,384 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8144707207207207 [2025-03-04 06:23:37,384 INFO L175 Difference]: Start difference. First operand has 603 places, 1124 transitions, 5910 flow. Second operand 6 states and 2893 transitions. [2025-03-04 06:23:37,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 607 places, 1284 transitions, 9018 flow [2025-03-04 06:23:37,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 607 places, 1284 transitions, 8250 flow, removed 384 selfloop flow, removed 0 redundant places. [2025-03-04 06:23:37,471 INFO L231 Difference]: Finished difference. Result has 612 places, 1272 transitions, 7202 flow [2025-03-04 06:23:37,472 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=592, PETRI_DIFFERENCE_MINUEND_FLOW=5140, PETRI_DIFFERENCE_MINUEND_PLACES=602, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1075, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=7202, PETRI_PLACES=612, PETRI_TRANSITIONS=1272} [2025-03-04 06:23:37,473 INFO L279 CegarLoopForPetriNet]: 570 programPoint places, 42 predicate places. [2025-03-04 06:23:37,473 INFO L471 AbstractCegarLoop]: Abstraction has has 612 places, 1272 transitions, 7202 flow [2025-03-04 06:23:37,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 438.1666666666667) internal successors, (2629), 6 states have internal predecessors, (2629), 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-04 06:23:37,473 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:23:37,474 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:23:37,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 06:23:37,474 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-04 06:23:37,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:23:37,475 INFO L85 PathProgramCache]: Analyzing trace with hash -823485203, now seen corresponding path program 1 times [2025-03-04 06:23:37,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:23:37,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207055684] [2025-03-04 06:23:37,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:23:37,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:23:37,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-04 06:23:37,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-04 06:23:37,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:23:37,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:23:38,015 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 06:23:38,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:23:38,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207055684] [2025-03-04 06:23:38,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207055684] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:23:38,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:23:38,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:23:38,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202544341] [2025-03-04 06:23:38,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:23:38,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:23:38,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:23:38,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:23:38,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:23:38,463 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 431 out of 592 [2025-03-04 06:23:38,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 612 places, 1272 transitions, 7202 flow. Second operand has 6 states, 6 states have (on average 439.8333333333333) internal successors, (2639), 6 states have internal predecessors, (2639), 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-04 06:23:38,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:23:38,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 431 of 592 [2025-03-04 06:23:38,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:23:43,776 INFO L124 PetriNetUnfolderBase]: 7133/25766 cut-off events. [2025-03-04 06:23:43,776 INFO L125 PetriNetUnfolderBase]: For 36887/37552 co-relation queries the response was YES. [2025-03-04 06:23:43,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74741 conditions, 25766 events. 7133/25766 cut-off events. For 36887/37552 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 261388 event pairs, 2299 based on Foata normal form. 10/23840 useless extension candidates. Maximal degree in co-relation 73287. Up to 12670 conditions per place. [2025-03-04 06:23:43,951 INFO L140 encePairwiseOnDemand]: 586/592 looper letters, 857 selfloop transitions, 5 changer transitions 0/1283 dead transitions. [2025-03-04 06:23:43,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 616 places, 1283 transitions, 8956 flow [2025-03-04 06:23:43,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:23:43,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:23:43,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2748 transitions. [2025-03-04 06:23:43,955 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7736486486486487 [2025-03-04 06:23:43,955 INFO L175 Difference]: Start difference. First operand has 612 places, 1272 transitions, 7202 flow. Second operand 6 states and 2748 transitions. [2025-03-04 06:23:43,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 616 places, 1283 transitions, 8956 flow [2025-03-04 06:23:44,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 616 places, 1283 transitions, 7900 flow, removed 528 selfloop flow, removed 0 redundant places. [2025-03-04 06:23:44,047 INFO L231 Difference]: Finished difference. Result has 616 places, 1271 transitions, 6154 flow [2025-03-04 06:23:44,048 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=592, PETRI_DIFFERENCE_MINUEND_FLOW=6144, PETRI_DIFFERENCE_MINUEND_PLACES=611, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=6154, PETRI_PLACES=616, PETRI_TRANSITIONS=1271} [2025-03-04 06:23:44,048 INFO L279 CegarLoopForPetriNet]: 570 programPoint places, 46 predicate places. [2025-03-04 06:23:44,048 INFO L471 AbstractCegarLoop]: Abstraction has has 616 places, 1271 transitions, 6154 flow [2025-03-04 06:23:44,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 439.8333333333333) internal successors, (2639), 6 states have internal predecessors, (2639), 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-04 06:23:44,049 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:23:44,049 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 06:23:44,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 06:23:44,049 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-04 06:23:44,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:23:44,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1455601514, now seen corresponding path program 1 times [2025-03-04 06:23:44,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:23:44,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293457094] [2025-03-04 06:23:44,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:23:44,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:23:44,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-03-04 06:23:44,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-03-04 06:23:44,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:23:44,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:23:44,539 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 06:23:44,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:23:44,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293457094] [2025-03-04 06:23:44,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293457094] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:23:44,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:23:44,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:23:44,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710307917] [2025-03-04 06:23:44,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:23:44,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:23:44,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:23:44,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:23:44,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:23:45,331 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 499 out of 592 [2025-03-04 06:23:45,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 616 places, 1271 transitions, 6154 flow. Second operand has 6 states, 6 states have (on average 505.1666666666667) internal successors, (3031), 6 states have internal predecessors, (3031), 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-04 06:23:45,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:23:45,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 499 of 592 [2025-03-04 06:23:45,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand