./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 735b3cc8 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread/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-?-735b3cc-m [2025-03-14 01:15:37,598 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:15:37,664 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-14 01:15:37,668 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:15:37,669 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:15:37,691 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:15:37,692 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:15:37,693 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:15:37,693 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:15:37,693 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:15:37,694 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:15:37,694 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:15:37,694 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:15:37,694 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:15:37,694 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:15:37,694 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:15:37,695 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:15:37,695 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:15:37,695 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:15:37,695 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:15:37,695 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:15:37,695 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:15:37,696 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-14 01:15:37,696 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-14 01:15:37,696 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:15:37,696 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:15:37,696 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:15:37,696 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:15:37,696 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:15:37,696 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:15:37,696 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:15:37,696 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:15:37,696 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:15:37,696 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:15:37,696 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:15:37,696 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:15:37,696 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:15:37,696 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:15:37,696 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:15:37,697 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:15:37,697 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:15:37,697 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:15:37,697 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-14 01:15:37,945 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:15:37,954 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:15:37,957 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:15:37,958 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:15:37,958 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:15:37,959 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/queue.i [2025-03-14 01:15:39,154 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83e776da8/5c4c52f5419d4943a1187509af9d0ac7/FLAGfbce6f6b0 [2025-03-14 01:15:39,487 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:15:39,490 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue.i [2025-03-14 01:15:39,507 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83e776da8/5c4c52f5419d4943a1187509af9d0ac7/FLAGfbce6f6b0 [2025-03-14 01:15:39,725 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83e776da8/5c4c52f5419d4943a1187509af9d0ac7 [2025-03-14 01:15:39,727 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:15:39,728 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:15:39,729 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:15:39,729 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:15:39,732 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:15:39,733 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:15:39" (1/1) ... [2025-03-14 01:15:39,733 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72645251 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:15:39, skipping insertion in model container [2025-03-14 01:15:39,733 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:15:39" (1/1) ... [2025-03-14 01:15:39,762 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:15:40,034 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:15:40,047 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:15:40,105 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:15:40,143 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:15:40,143 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:15:40 WrapperNode [2025-03-14 01:15:40,144 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:15:40,144 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:15:40,145 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:15:40,145 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:15:40,149 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:15:40" (1/1) ... [2025-03-14 01:15:40,165 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:15:40" (1/1) ... [2025-03-14 01:15:40,207 INFO L138 Inliner]: procedures = 274, calls = 107, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 518 [2025-03-14 01:15:40,208 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:15:40,208 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:15:40,209 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:15:40,209 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:15:40,218 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:15:40" (1/1) ... [2025-03-14 01:15:40,219 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:15:40" (1/1) ... [2025-03-14 01:15:40,226 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:15:40" (1/1) ... [2025-03-14 01:15:40,226 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:15:40" (1/1) ... [2025-03-14 01:15:40,258 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:15:40" (1/1) ... [2025-03-14 01:15:40,260 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:15:40" (1/1) ... [2025-03-14 01:15:40,262 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:15:40" (1/1) ... [2025-03-14 01:15:40,264 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:15:40" (1/1) ... [2025-03-14 01:15:40,271 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:15:40,272 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:15:40,272 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:15:40,272 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:15:40,277 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:15:40" (1/1) ... [2025-03-14 01:15:40,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:15:40,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:15:40,310 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-14 01:15:40,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-14 01:15:40,334 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-14 01:15:40,334 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-14 01:15:40,334 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-14 01:15:40,334 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-14 01:15:40,334 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-14 01:15:40,335 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-14 01:15:40,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-14 01:15:40,335 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-14 01:15:40,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:15:40,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 01:15:40,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:15:40,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:15:40,336 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:15:40,466 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:15:40,467 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:15:41,144 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:15:41,145 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:15:41,145 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:15:41,188 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:15:41,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:15:41 BoogieIcfgContainer [2025-03-14 01:15:41,189 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:15:41,194 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:15:41,194 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:15:41,198 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:15:41,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:15:39" (1/3) ... [2025-03-14 01:15:41,199 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@404a7040 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:15:41, skipping insertion in model container [2025-03-14 01:15:41,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:15:40" (2/3) ... [2025-03-14 01:15:41,199 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@404a7040 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:15:41, skipping insertion in model container [2025-03-14 01:15:41,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:15:41" (3/3) ... [2025-03-14 01:15:41,200 INFO L128 eAbstractionObserver]: Analyzing ICFG queue.i [2025-03-14 01:15:41,212 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:15:41,215 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-14 01:15:41,215 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:15:41,375 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-14 01:15:41,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 583 places, 592 transitions, 1198 flow [2025-03-14 01:15:41,614 INFO L124 PetriNetUnfolderBase]: 16/590 cut-off events. [2025-03-14 01:15:41,617 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:15:41,633 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-14 01:15:41,634 INFO L82 GeneralOperation]: Start removeDead. Operand has 583 places, 592 transitions, 1198 flow [2025-03-14 01:15:41,680 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 570 places, 577 transitions, 1163 flow [2025-03-14 01:15:41,687 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:15:41,699 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;@54636bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:15:41,701 INFO L334 AbstractCegarLoop]: Starting to check reachability of 79 error locations. [2025-03-14 01:15:41,710 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:15:41,710 INFO L124 PetriNetUnfolderBase]: 0/78 cut-off events. [2025-03-14 01:15:41,710 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:15:41,710 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:15:41,711 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-14 01:15:41,711 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-14 01:15:41,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:15:41,716 INFO L85 PathProgramCache]: Analyzing trace with hash 660549691, now seen corresponding path program 1 times [2025-03-14 01:15:41,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:15:41,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293046067] [2025-03-14 01:15:41,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:15:41,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:15:41,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-14 01:15:41,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-14 01:15:41,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:15:41,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:15:41,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:15:41,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:15:41,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293046067] [2025-03-14 01:15:41,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293046067] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:15:41,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:15:41,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:15:41,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30421361] [2025-03-14 01:15:41,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:15:41,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:15:41,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:15:41,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:15:41,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:15:42,022 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 562 out of 592 [2025-03-14 01:15:42,029 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-14 01:15:42,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:15:42,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 562 of 592 [2025-03-14 01:15:42,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:15:42,405 INFO L124 PetriNetUnfolderBase]: 61/1686 cut-off events. [2025-03-14 01:15:42,405 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-03-14 01:15:42,414 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-14 01:15:42,421 INFO L140 encePairwiseOnDemand]: 585/592 looper letters, 15 selfloop transitions, 2 changer transitions 0/568 dead transitions. [2025-03-14 01:15:42,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 567 places, 568 transitions, 1179 flow [2025-03-14 01:15:42,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:15:42,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:15:42,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1708 transitions. [2025-03-14 01:15:42,441 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9617117117117117 [2025-03-14 01:15:42,442 INFO L175 Difference]: Start difference. First operand has 570 places, 577 transitions, 1163 flow. Second operand 3 states and 1708 transitions. [2025-03-14 01:15:42,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 567 places, 568 transitions, 1179 flow [2025-03-14 01:15:42,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 564 places, 568 transitions, 1174 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-14 01:15:42,464 INFO L231 Difference]: Finished difference. Result has 564 places, 568 transitions, 1144 flow [2025-03-14 01:15:42,468 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-14 01:15:42,471 INFO L279 CegarLoopForPetriNet]: 570 programPoint places, -6 predicate places. [2025-03-14 01:15:42,472 INFO L471 AbstractCegarLoop]: Abstraction has has 564 places, 568 transitions, 1144 flow [2025-03-14 01:15:42,473 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-14 01:15:42,474 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:15:42,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] [2025-03-14 01:15:42,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:15:42,474 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-14 01:15:42,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:15:42,475 INFO L85 PathProgramCache]: Analyzing trace with hash 549712237, now seen corresponding path program 1 times [2025-03-14 01:15:42,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:15:42,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957900604] [2025-03-14 01:15:42,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:15:42,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:15:42,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-14 01:15:42,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-14 01:15:42,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:15:42,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:15:42,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:15:42,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:15:42,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957900604] [2025-03-14 01:15:42,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957900604] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:15:42,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:15:42,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:15:42,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006653403] [2025-03-14 01:15:42,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:15:42,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:15:42,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:15:42,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:15:42,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:15:42,619 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 562 out of 592 [2025-03-14 01:15:42,622 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-14 01:15:42,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:15:42,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 562 of 592 [2025-03-14 01:15:42,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:15:42,990 INFO L124 PetriNetUnfolderBase]: 69/1960 cut-off events. [2025-03-14 01:15:42,991 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-14 01:15:43,003 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-14 01:15:43,011 INFO L140 encePairwiseOnDemand]: 589/592 looper letters, 15 selfloop transitions, 2 changer transitions 0/567 dead transitions. [2025-03-14 01:15:43,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 565 places, 567 transitions, 1176 flow [2025-03-14 01:15:43,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:15:43,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:15:43,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1704 transitions. [2025-03-14 01:15:43,023 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9594594594594594 [2025-03-14 01:15:43,023 INFO L175 Difference]: Start difference. First operand has 564 places, 568 transitions, 1144 flow. Second operand 3 states and 1704 transitions. [2025-03-14 01:15:43,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 565 places, 567 transitions, 1176 flow [2025-03-14 01:15:43,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 567 transitions, 1172 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:15:43,036 INFO L231 Difference]: Finished difference. Result has 563 places, 567 transitions, 1142 flow [2025-03-14 01:15:43,037 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-14 01:15:43,038 INFO L279 CegarLoopForPetriNet]: 570 programPoint places, -7 predicate places. [2025-03-14 01:15:43,038 INFO L471 AbstractCegarLoop]: Abstraction has has 563 places, 567 transitions, 1142 flow [2025-03-14 01:15:43,039 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-14 01:15:43,039 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:15:43,040 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-14 01:15:43,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:15:43,040 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-14 01:15:43,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:15:43,042 INFO L85 PathProgramCache]: Analyzing trace with hash 58637508, now seen corresponding path program 1 times [2025-03-14 01:15:43,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:15:43,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797136195] [2025-03-14 01:15:43,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:15:43,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:15:43,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-14 01:15:43,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-14 01:15:43,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:15:43,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:15:43,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:15:43,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:15:43,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797136195] [2025-03-14 01:15:43,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797136195] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:15:43,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:15:43,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:15:43,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584897666] [2025-03-14 01:15:43,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:15:43,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:15:43,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:15:43,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:15:43,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:15:44,585 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 437 out of 592 [2025-03-14 01:15:44,588 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-14 01:15:44,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:15:44,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 437 of 592 [2025-03-14 01:15:44,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:15:46,653 INFO L124 PetriNetUnfolderBase]: 3671/15096 cut-off events. [2025-03-14 01:15:46,653 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-03-14 01:15:46,694 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-14 01:15:46,754 INFO L140 encePairwiseOnDemand]: 586/592 looper letters, 138 selfloop transitions, 5 changer transitions 0/566 dead transitions. [2025-03-14 01:15:46,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 567 places, 566 transitions, 1426 flow [2025-03-14 01:15:46,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:15:46,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:15:46,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2766 transitions. [2025-03-14 01:15:46,760 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7787162162162162 [2025-03-14 01:15:46,760 INFO L175 Difference]: Start difference. First operand has 563 places, 567 transitions, 1142 flow. Second operand 6 states and 2766 transitions. [2025-03-14 01:15:46,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 567 places, 566 transitions, 1426 flow [2025-03-14 01:15:46,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 565 places, 566 transitions, 1422 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:15:46,768 INFO L231 Difference]: Finished difference. Result has 565 places, 566 transitions, 1146 flow [2025-03-14 01:15:46,769 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-14 01:15:46,770 INFO L279 CegarLoopForPetriNet]: 570 programPoint places, -5 predicate places. [2025-03-14 01:15:46,770 INFO L471 AbstractCegarLoop]: Abstraction has has 565 places, 566 transitions, 1146 flow [2025-03-14 01:15:46,771 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-14 01:15:46,771 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:15:46,771 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-14 01:15:46,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:15:46,772 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-14 01:15:46,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:15:46,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1420314719, now seen corresponding path program 1 times [2025-03-14 01:15:46,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:15:46,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141385535] [2025-03-14 01:15:46,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:15:46,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:15:46,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-14 01:15:46,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-14 01:15:46,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:15:46,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:15:47,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:15:47,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:15:47,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141385535] [2025-03-14 01:15:47,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141385535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:15:47,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:15:47,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:15:47,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153622005] [2025-03-14 01:15:47,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:15:47,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:15:47,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:15:47,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:15:47,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:15:47,903 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 437 out of 592 [2025-03-14 01:15:47,906 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-14 01:15:47,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:15:47,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 437 of 592 [2025-03-14 01:15:47,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:15:49,979 INFO L124 PetriNetUnfolderBase]: 3671/15095 cut-off events. [2025-03-14 01:15:49,980 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-03-14 01:15:50,000 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-14 01:15:50,038 INFO L140 encePairwiseOnDemand]: 586/592 looper letters, 138 selfloop transitions, 5 changer transitions 0/565 dead transitions. [2025-03-14 01:15:50,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 569 places, 565 transitions, 1430 flow [2025-03-14 01:15:50,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:15:50,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:15:50,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2766 transitions. [2025-03-14 01:15:50,043 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7787162162162162 [2025-03-14 01:15:50,043 INFO L175 Difference]: Start difference. First operand has 565 places, 566 transitions, 1146 flow. Second operand 6 states and 2766 transitions. [2025-03-14 01:15:50,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 569 places, 565 transitions, 1430 flow [2025-03-14 01:15:50,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 564 places, 565 transitions, 1420 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:15:50,049 INFO L231 Difference]: Finished difference. Result has 564 places, 565 transitions, 1144 flow [2025-03-14 01:15:50,050 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-14 01:15:50,051 INFO L279 CegarLoopForPetriNet]: 570 programPoint places, -6 predicate places. [2025-03-14 01:15:50,051 INFO L471 AbstractCegarLoop]: Abstraction has has 564 places, 565 transitions, 1144 flow [2025-03-14 01:15:50,052 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-14 01:15:50,053 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:15:50,053 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-14 01:15:50,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:15:50,053 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-14 01:15:50,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:15:50,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1125698543, now seen corresponding path program 1 times [2025-03-14 01:15:50,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:15:50,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461456348] [2025-03-14 01:15:50,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:15:50,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:15:50,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-14 01:15:50,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-14 01:15:50,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:15:50,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:15:50,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:15:50,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:15:50,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461456348] [2025-03-14 01:15:50,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461456348] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:15:50,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:15:50,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:15:50,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656725432] [2025-03-14 01:15:50,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:15:50,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:15:50,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:15:50,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:15:50,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:15:51,051 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 437 out of 592 [2025-03-14 01:15:51,054 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-14 01:15:51,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:15:51,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 437 of 592 [2025-03-14 01:15:51,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:15:53,430 INFO L124 PetriNetUnfolderBase]: 3671/15094 cut-off events. [2025-03-14 01:15:53,431 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-03-14 01:15:53,456 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-14 01:15:53,499 INFO L140 encePairwiseOnDemand]: 586/592 looper letters, 138 selfloop transitions, 5 changer transitions 0/564 dead transitions. [2025-03-14 01:15:53,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 568 places, 564 transitions, 1428 flow [2025-03-14 01:15:53,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:15:53,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:15:53,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2766 transitions. [2025-03-14 01:15:53,507 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7787162162162162 [2025-03-14 01:15:53,507 INFO L175 Difference]: Start difference. First operand has 564 places, 565 transitions, 1144 flow. Second operand 6 states and 2766 transitions. [2025-03-14 01:15:53,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 568 places, 564 transitions, 1428 flow [2025-03-14 01:15:53,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 564 transitions, 1418 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:15:53,515 INFO L231 Difference]: Finished difference. Result has 563 places, 564 transitions, 1142 flow [2025-03-14 01:15:53,519 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-14 01:15:53,520 INFO L279 CegarLoopForPetriNet]: 570 programPoint places, -7 predicate places. [2025-03-14 01:15:53,520 INFO L471 AbstractCegarLoop]: Abstraction has has 563 places, 564 transitions, 1142 flow [2025-03-14 01:15:53,521 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-14 01:15:53,521 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:15:53,521 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-14 01:15:53,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:15:53,521 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-14 01:15:53,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:15:53,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1179369503, now seen corresponding path program 1 times [2025-03-14 01:15:53,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:15:53,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604933061] [2025-03-14 01:15:53,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:15:53,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:15:53,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-14 01:15:53,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-14 01:15:53,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:15:53,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:15:53,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:15:53,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:15:53,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604933061] [2025-03-14 01:15:53,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604933061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:15:53,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:15:53,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:15:53,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399781874] [2025-03-14 01:15:54,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:15:54,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:15:54,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:15:54,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:15:54,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:15:54,922 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 499 out of 592 [2025-03-14 01:15:54,925 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-14 01:15:54,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:15:54,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 499 of 592 [2025-03-14 01:15:54,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:15:55,519 INFO L124 PetriNetUnfolderBase]: 831/5612 cut-off events. [2025-03-14 01:15:55,519 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-14 01:15:55,533 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-14 01:15:55,550 INFO L140 encePairwiseOnDemand]: 586/592 looper letters, 76 selfloop transitions, 5 changer transitions 0/563 dead transitions. [2025-03-14 01:15:55,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 567 places, 563 transitions, 1302 flow [2025-03-14 01:15:55,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:15:55,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:15:55,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3076 transitions. [2025-03-14 01:15:55,557 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.865990990990991 [2025-03-14 01:15:55,557 INFO L175 Difference]: Start difference. First operand has 563 places, 564 transitions, 1142 flow. Second operand 6 states and 3076 transitions. [2025-03-14 01:15:55,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 567 places, 563 transitions, 1302 flow [2025-03-14 01:15:55,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 562 places, 563 transitions, 1292 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:15:55,564 INFO L231 Difference]: Finished difference. Result has 562 places, 563 transitions, 1140 flow [2025-03-14 01:15:55,565 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-14 01:15:55,568 INFO L279 CegarLoopForPetriNet]: 570 programPoint places, -8 predicate places. [2025-03-14 01:15:55,568 INFO L471 AbstractCegarLoop]: Abstraction has has 562 places, 563 transitions, 1140 flow [2025-03-14 01:15:55,569 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-14 01:15:55,569 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:15:55,570 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-14 01:15:55,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:15:55,570 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-14 01:15:55,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:15:55,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1298725753, now seen corresponding path program 1 times [2025-03-14 01:15:55,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:15:55,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818646307] [2025-03-14 01:15:55,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:15:55,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:15:55,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-14 01:15:55,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-14 01:15:55,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:15:55,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:15:55,976 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:15:55,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:15:55,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818646307] [2025-03-14 01:15:55,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818646307] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:15:55,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:15:55,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:15:55,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236036732] [2025-03-14 01:15:55,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:15:55,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:15:55,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:15:55,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:15:55,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:15:56,753 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 499 out of 592 [2025-03-14 01:15:56,756 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-14 01:15:56,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:15:56,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 499 of 592 [2025-03-14 01:15:56,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:15:57,352 INFO L124 PetriNetUnfolderBase]: 831/5611 cut-off events. [2025-03-14 01:15:57,352 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-14 01:15:57,366 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-14 01:15:57,378 INFO L140 encePairwiseOnDemand]: 586/592 looper letters, 76 selfloop transitions, 5 changer transitions 0/562 dead transitions. [2025-03-14 01:15:57,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 566 places, 562 transitions, 1300 flow [2025-03-14 01:15:57,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:15:57,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:15:57,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3076 transitions. [2025-03-14 01:15:57,382 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.865990990990991 [2025-03-14 01:15:57,382 INFO L175 Difference]: Start difference. First operand has 562 places, 563 transitions, 1140 flow. Second operand 6 states and 3076 transitions. [2025-03-14 01:15:57,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 566 places, 562 transitions, 1300 flow [2025-03-14 01:15:57,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 561 places, 562 transitions, 1290 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:15:57,388 INFO L231 Difference]: Finished difference. Result has 561 places, 562 transitions, 1138 flow [2025-03-14 01:15:57,389 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-14 01:15:57,391 INFO L279 CegarLoopForPetriNet]: 570 programPoint places, -9 predicate places. [2025-03-14 01:15:57,391 INFO L471 AbstractCegarLoop]: Abstraction has has 561 places, 562 transitions, 1138 flow [2025-03-14 01:15:57,392 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-14 01:15:57,392 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:15:57,392 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-14 01:15:57,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:15:57,393 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-14 01:15:57,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:15:57,394 INFO L85 PathProgramCache]: Analyzing trace with hash -208833624, now seen corresponding path program 1 times [2025-03-14 01:15:57,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:15:57,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672872387] [2025-03-14 01:15:57,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:15:57,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:15:57,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-14 01:15:57,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-14 01:15:57,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:15:57,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:15:57,482 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-14 01:15:57,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:15:57,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672872387] [2025-03-14 01:15:57,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672872387] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:15:57,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:15:57,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:15:57,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368930227] [2025-03-14 01:15:57,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:15:57,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:15:57,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:15:57,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:15:57,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:15:57,495 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 592 [2025-03-14 01:15:57,498 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-14 01:15:57,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:15:57,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 592 [2025-03-14 01:15:57,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:15:57,803 INFO L124 PetriNetUnfolderBase]: 114/2678 cut-off events. [2025-03-14 01:15:57,803 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-03-14 01:15:57,813 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-14 01:15:57,818 INFO L140 encePairwiseOnDemand]: 587/592 looper letters, 22 selfloop transitions, 4 changer transitions 0/573 dead transitions. [2025-03-14 01:15:57,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 563 places, 573 transitions, 1213 flow [2025-03-14 01:15:57,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:15:57,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:15:57,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1725 transitions. [2025-03-14 01:15:57,822 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9712837837837838 [2025-03-14 01:15:57,822 INFO L175 Difference]: Start difference. First operand has 561 places, 562 transitions, 1138 flow. Second operand 3 states and 1725 transitions. [2025-03-14 01:15:57,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 563 places, 573 transitions, 1213 flow [2025-03-14 01:15:57,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 558 places, 573 transitions, 1203 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:15:57,833 INFO L231 Difference]: Finished difference. Result has 560 places, 566 transitions, 1162 flow [2025-03-14 01:15:57,835 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-14 01:15:57,835 INFO L279 CegarLoopForPetriNet]: 570 programPoint places, -10 predicate places. [2025-03-14 01:15:57,835 INFO L471 AbstractCegarLoop]: Abstraction has has 560 places, 566 transitions, 1162 flow [2025-03-14 01:15:57,836 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-14 01:15:57,836 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:15:57,837 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-14 01:15:57,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:15:57,837 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-14 01:15:57,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:15:57,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1308442786, now seen corresponding path program 1 times [2025-03-14 01:15:57,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:15:57,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647076828] [2025-03-14 01:15:57,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:15:57,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:15:57,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-14 01:15:57,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-14 01:15:57,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:15:57,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:15:58,295 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-14 01:15:58,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:15:58,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647076828] [2025-03-14 01:15:58,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647076828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:15:58,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:15:58,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:15:58,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262801029] [2025-03-14 01:15:58,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:15:58,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:15:58,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:15:58,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:15:58,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:15:59,259 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 470 out of 592 [2025-03-14 01:15:59,262 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-14 01:15:59,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:15:59,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 470 of 592 [2025-03-14 01:15:59,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:16:01,753 INFO L124 PetriNetUnfolderBase]: 3091/15503 cut-off events. [2025-03-14 01:16:01,753 INFO L125 PetriNetUnfolderBase]: For 128/128 co-relation queries the response was YES. [2025-03-14 01:16:01,775 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-14 01:16:01,812 INFO L140 encePairwiseOnDemand]: 538/592 looper letters, 125 selfloop transitions, 84 changer transitions 0/664 dead transitions. [2025-03-14 01:16:01,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 565 places, 664 transitions, 1784 flow [2025-03-14 01:16:01,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:16:01,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:16:01,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3035 transitions. [2025-03-14 01:16:01,816 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8544481981981982 [2025-03-14 01:16:01,816 INFO L175 Difference]: Start difference. First operand has 560 places, 566 transitions, 1162 flow. Second operand 6 states and 3035 transitions. [2025-03-14 01:16:01,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 565 places, 664 transitions, 1784 flow [2025-03-14 01:16:01,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 664 transitions, 1776 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:16:01,824 INFO L231 Difference]: Finished difference. Result has 568 places, 646 transitions, 1750 flow [2025-03-14 01:16:01,825 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-14 01:16:01,826 INFO L279 CegarLoopForPetriNet]: 570 programPoint places, -2 predicate places. [2025-03-14 01:16:01,827 INFO L471 AbstractCegarLoop]: Abstraction has has 568 places, 646 transitions, 1750 flow [2025-03-14 01:16:01,828 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-14 01:16:01,828 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:16:01,828 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-14 01:16:01,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 01:16:01,828 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-14 01:16:01,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:16:01,829 INFO L85 PathProgramCache]: Analyzing trace with hash -2131945807, now seen corresponding path program 1 times [2025-03-14 01:16:01,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:16:01,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27364198] [2025-03-14 01:16:01,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:16:01,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:16:01,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-14 01:16:01,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-14 01:16:01,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:16:01,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:16:01,965 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-14 01:16:01,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:16:01,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27364198] [2025-03-14 01:16:01,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27364198] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:16:01,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:16:01,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:16:01,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865237336] [2025-03-14 01:16:01,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:16:01,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:16:01,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:16:01,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:16:01,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:16:01,972 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 567 out of 592 [2025-03-14 01:16:01,973 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-14 01:16:01,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:16:01,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 567 of 592 [2025-03-14 01:16:01,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:16:03,131 INFO L124 PetriNetUnfolderBase]: 991/8750 cut-off events. [2025-03-14 01:16:03,132 INFO L125 PetriNetUnfolderBase]: For 621/633 co-relation queries the response was YES. [2025-03-14 01:16:03,152 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-14 01:16:03,166 INFO L140 encePairwiseOnDemand]: 588/592 looper letters, 18 selfloop transitions, 3 changer transitions 0/634 dead transitions. [2025-03-14 01:16:03,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 567 places, 634 transitions, 1719 flow [2025-03-14 01:16:03,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:16:03,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:16:03,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1723 transitions. [2025-03-14 01:16:03,168 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9701576576576577 [2025-03-14 01:16:03,168 INFO L175 Difference]: Start difference. First operand has 568 places, 646 transitions, 1750 flow. Second operand 3 states and 1723 transitions. [2025-03-14 01:16:03,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 567 places, 634 transitions, 1719 flow [2025-03-14 01:16:03,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 567 places, 634 transitions, 1705 flow, removed 7 selfloop flow, removed 0 redundant places. [2025-03-14 01:16:03,183 INFO L231 Difference]: Finished difference. Result has 568 places, 628 transitions, 1661 flow [2025-03-14 01:16:03,183 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-14 01:16:03,184 INFO L279 CegarLoopForPetriNet]: 570 programPoint places, -2 predicate places. [2025-03-14 01:16:03,184 INFO L471 AbstractCegarLoop]: Abstraction has has 568 places, 628 transitions, 1661 flow [2025-03-14 01:16:03,185 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-14 01:16:03,185 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:16:03,185 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-14 01:16:03,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 01:16:03,185 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-14 01:16:03,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:16:03,186 INFO L85 PathProgramCache]: Analyzing trace with hash 300033979, now seen corresponding path program 1 times [2025-03-14 01:16:03,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:16:03,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087609594] [2025-03-14 01:16:03,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:16:03,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:16:03,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-14 01:16:03,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-14 01:16:03,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:16:03,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:16:03,513 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-14 01:16:03,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:16:03,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087609594] [2025-03-14 01:16:03,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087609594] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:16:03,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:16:03,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:16:03,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991822445] [2025-03-14 01:16:03,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:16:03,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:16:03,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:16:03,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:16:03,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:16:04,091 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 592 [2025-03-14 01:16:04,093 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-14 01:16:04,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:16:04,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 592 [2025-03-14 01:16:04,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:16:07,737 INFO L124 PetriNetUnfolderBase]: 6038/22406 cut-off events. [2025-03-14 01:16:07,737 INFO L125 PetriNetUnfolderBase]: For 4253/4484 co-relation queries the response was YES. [2025-03-14 01:16:07,808 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-14 01:16:07,876 INFO L140 encePairwiseOnDemand]: 543/592 looper letters, 228 selfloop transitions, 156 changer transitions 0/788 dead transitions. [2025-03-14 01:16:07,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 572 places, 788 transitions, 2853 flow [2025-03-14 01:16:07,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:16:07,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:16:07,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2833 transitions. [2025-03-14 01:16:07,880 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7975788288288288 [2025-03-14 01:16:07,881 INFO L175 Difference]: Start difference. First operand has 568 places, 628 transitions, 1661 flow. Second operand 6 states and 2833 transitions. [2025-03-14 01:16:07,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 572 places, 788 transitions, 2853 flow [2025-03-14 01:16:07,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 571 places, 788 transitions, 2850 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:16:07,900 INFO L231 Difference]: Finished difference. Result has 576 places, 776 transitions, 2758 flow [2025-03-14 01:16:07,901 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-14 01:16:07,901 INFO L279 CegarLoopForPetriNet]: 570 programPoint places, 6 predicate places. [2025-03-14 01:16:07,901 INFO L471 AbstractCegarLoop]: Abstraction has has 576 places, 776 transitions, 2758 flow [2025-03-14 01:16:07,902 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-14 01:16:07,902 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:16:07,903 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-14 01:16:07,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 01:16:07,903 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-14 01:16:07,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:16:07,904 INFO L85 PathProgramCache]: Analyzing trace with hash -645065793, now seen corresponding path program 1 times [2025-03-14 01:16:07,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:16:07,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097447807] [2025-03-14 01:16:07,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:16:07,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:16:07,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-14 01:16:07,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-14 01:16:07,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:16:07,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:16:08,206 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-14 01:16:08,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:16:08,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097447807] [2025-03-14 01:16:08,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097447807] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:16:08,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:16:08,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:16:08,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169397508] [2025-03-14 01:16:08,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:16:08,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:16:08,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:16:08,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:16:08,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:16:09,029 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 504 out of 592 [2025-03-14 01:16:09,032 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-14 01:16:09,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:16:09,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 504 of 592 [2025-03-14 01:16:09,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:16:11,376 INFO L124 PetriNetUnfolderBase]: 2816/14526 cut-off events. [2025-03-14 01:16:11,376 INFO L125 PetriNetUnfolderBase]: For 4557/5238 co-relation queries the response was YES. [2025-03-14 01:16:11,445 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-14 01:16:11,492 INFO L140 encePairwiseOnDemand]: 567/592 looper letters, 182 selfloop transitions, 59 changer transitions 0/840 dead transitions. [2025-03-14 01:16:11,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 580 places, 840 transitions, 3568 flow [2025-03-14 01:16:11,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:16:11,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:16:11,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3167 transitions. [2025-03-14 01:16:11,496 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8916103603603603 [2025-03-14 01:16:11,496 INFO L175 Difference]: Start difference. First operand has 576 places, 776 transitions, 2758 flow. Second operand 6 states and 3167 transitions. [2025-03-14 01:16:11,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 580 places, 840 transitions, 3568 flow [2025-03-14 01:16:11,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 580 places, 840 transitions, 3472 flow, removed 48 selfloop flow, removed 0 redundant places. [2025-03-14 01:16:11,528 INFO L231 Difference]: Finished difference. Result has 585 places, 828 transitions, 3230 flow [2025-03-14 01:16:11,528 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-14 01:16:11,529 INFO L279 CegarLoopForPetriNet]: 570 programPoint places, 15 predicate places. [2025-03-14 01:16:11,529 INFO L471 AbstractCegarLoop]: Abstraction has has 585 places, 828 transitions, 3230 flow [2025-03-14 01:16:11,530 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-14 01:16:11,530 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:16:11,530 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-14 01:16:11,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-14 01:16:11,530 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-14 01:16:11,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:16:11,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1367281731, now seen corresponding path program 1 times [2025-03-14 01:16:11,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:16:11,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501864412] [2025-03-14 01:16:11,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:16:11,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:16:11,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-14 01:16:11,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-14 01:16:11,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:16:11,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:16:11,884 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-14 01:16:11,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:16:11,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501864412] [2025-03-14 01:16:11,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501864412] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:16:11,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:16:11,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:16:11,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786143558] [2025-03-14 01:16:11,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:16:11,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:16:11,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:16:11,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:16:11,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:16:12,463 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 460 out of 592 [2025-03-14 01:16:12,465 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-14 01:16:12,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:16:12,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 592 [2025-03-14 01:16:12,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:16:15,501 INFO L124 PetriNetUnfolderBase]: 4710/19221 cut-off events. [2025-03-14 01:16:15,501 INFO L125 PetriNetUnfolderBase]: For 8446/8780 co-relation queries the response was YES. [2025-03-14 01:16:15,591 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-14 01:16:15,650 INFO L140 encePairwiseOnDemand]: 543/592 looper letters, 374 selfloop transitions, 156 changer transitions 0/988 dead transitions. [2025-03-14 01:16:15,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 589 places, 988 transitions, 5098 flow [2025-03-14 01:16:15,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:16:15,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:16:15,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3043 transitions. [2025-03-14 01:16:15,655 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8567004504504504 [2025-03-14 01:16:15,655 INFO L175 Difference]: Start difference. First operand has 585 places, 828 transitions, 3230 flow. Second operand 6 states and 3043 transitions. [2025-03-14 01:16:15,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 589 places, 988 transitions, 5098 flow [2025-03-14 01:16:15,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 589 places, 988 transitions, 5002 flow, removed 48 selfloop flow, removed 0 redundant places. [2025-03-14 01:16:15,706 INFO L231 Difference]: Finished difference. Result has 594 places, 976 transitions, 4618 flow [2025-03-14 01:16:15,707 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-14 01:16:15,707 INFO L279 CegarLoopForPetriNet]: 570 programPoint places, 24 predicate places. [2025-03-14 01:16:15,707 INFO L471 AbstractCegarLoop]: Abstraction has has 594 places, 976 transitions, 4618 flow [2025-03-14 01:16:15,709 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-14 01:16:15,709 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:16:15,709 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-14 01:16:15,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-14 01:16:15,709 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-14 01:16:15,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:16:15,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1586444398, now seen corresponding path program 1 times [2025-03-14 01:16:15,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:16:15,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027758959] [2025-03-14 01:16:15,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:16:15,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:16:15,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-14 01:16:15,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-14 01:16:15,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:16:15,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:16:16,084 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-14 01:16:16,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:16:16,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027758959] [2025-03-14 01:16:16,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027758959] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:16:16,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:16:16,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:16:16,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880397982] [2025-03-14 01:16:16,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:16:16,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:16:16,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:16:16,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:16:16,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:16:16,552 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 430 out of 592 [2025-03-14 01:16:16,554 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-14 01:16:16,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:16:16,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 430 of 592 [2025-03-14 01:16:16,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:16:21,934 INFO L124 PetriNetUnfolderBase]: 7085/25823 cut-off events. [2025-03-14 01:16:21,934 INFO L125 PetriNetUnfolderBase]: For 18989/19407 co-relation queries the response was YES. [2025-03-14 01:16:22,031 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-14 01:16:22,108 INFO L140 encePairwiseOnDemand]: 543/592 looper letters, 558 selfloop transitions, 156 changer transitions 0/1136 dead transitions. [2025-03-14 01:16:22,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 598 places, 1136 transitions, 7142 flow [2025-03-14 01:16:22,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:16:22,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:16:22,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2893 transitions. [2025-03-14 01:16:22,113 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8144707207207207 [2025-03-14 01:16:22,113 INFO L175 Difference]: Start difference. First operand has 594 places, 976 transitions, 4618 flow. Second operand 6 states and 2893 transitions. [2025-03-14 01:16:22,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 598 places, 1136 transitions, 7142 flow [2025-03-14 01:16:22,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 598 places, 1136 transitions, 6662 flow, removed 240 selfloop flow, removed 0 redundant places. [2025-03-14 01:16:22,175 INFO L231 Difference]: Finished difference. Result has 603 places, 1124 transitions, 5910 flow [2025-03-14 01:16:22,175 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-14 01:16:22,176 INFO L279 CegarLoopForPetriNet]: 570 programPoint places, 33 predicate places. [2025-03-14 01:16:22,176 INFO L471 AbstractCegarLoop]: Abstraction has has 603 places, 1124 transitions, 5910 flow [2025-03-14 01:16:22,177 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-14 01:16:22,177 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:16:22,177 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-14 01:16:22,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-14 01:16:22,177 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-14 01:16:22,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:16:22,178 INFO L85 PathProgramCache]: Analyzing trace with hash -601568638, now seen corresponding path program 1 times [2025-03-14 01:16:22,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:16:22,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518121536] [2025-03-14 01:16:22,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:16:22,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:16:22,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-14 01:16:22,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-14 01:16:22,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:16:22,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:16:22,936 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-14 01:16:22,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:16:22,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518121536] [2025-03-14 01:16:22,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518121536] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:16:22,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:16:22,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:16:22,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193831846] [2025-03-14 01:16:22,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:16:22,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:16:22,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:16:22,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:16:22,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:16:23,502 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 430 out of 592 [2025-03-14 01:16:23,504 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-14 01:16:23,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:16:23,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 430 of 592 [2025-03-14 01:16:23,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:16:29,576 INFO L124 PetriNetUnfolderBase]: 7511/26884 cut-off events. [2025-03-14 01:16:29,577 INFO L125 PetriNetUnfolderBase]: For 28720/29226 co-relation queries the response was YES. [2025-03-14 01:16:29,692 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-14 01:16:29,762 INFO L140 encePairwiseOnDemand]: 543/592 looper letters, 706 selfloop transitions, 156 changer transitions 0/1284 dead transitions. [2025-03-14 01:16:29,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 607 places, 1284 transitions, 9018 flow [2025-03-14 01:16:29,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:16:29,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:16:29,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2893 transitions. [2025-03-14 01:16:29,766 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8144707207207207 [2025-03-14 01:16:29,766 INFO L175 Difference]: Start difference. First operand has 603 places, 1124 transitions, 5910 flow. Second operand 6 states and 2893 transitions. [2025-03-14 01:16:29,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 607 places, 1284 transitions, 9018 flow [2025-03-14 01:16:29,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 607 places, 1284 transitions, 8250 flow, removed 384 selfloop flow, removed 0 redundant places. [2025-03-14 01:16:29,840 INFO L231 Difference]: Finished difference. Result has 612 places, 1272 transitions, 7202 flow [2025-03-14 01:16:29,840 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-14 01:16:29,841 INFO L279 CegarLoopForPetriNet]: 570 programPoint places, 42 predicate places. [2025-03-14 01:16:29,841 INFO L471 AbstractCegarLoop]: Abstraction has has 612 places, 1272 transitions, 7202 flow [2025-03-14 01:16:29,842 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-14 01:16:29,842 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:16:29,842 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-14 01:16:29,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-14 01:16:29,842 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-14 01:16:29,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:16:29,843 INFO L85 PathProgramCache]: Analyzing trace with hash -823485203, now seen corresponding path program 1 times [2025-03-14 01:16:29,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:16:29,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939141671] [2025-03-14 01:16:29,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:16:29,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:16:29,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-14 01:16:29,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-14 01:16:29,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:16:29,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:16:30,325 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-14 01:16:30,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:16:30,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939141671] [2025-03-14 01:16:30,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939141671] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:16:30,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:16:30,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:16:30,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838569689] [2025-03-14 01:16:30,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:16:30,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:16:30,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:16:30,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:16:30,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:16:30,766 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 431 out of 592 [2025-03-14 01:16:30,767 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-14 01:16:30,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:16:30,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 431 of 592 [2025-03-14 01:16:30,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:16:36,858 INFO L124 PetriNetUnfolderBase]: 7133/25766 cut-off events. [2025-03-14 01:16:36,859 INFO L125 PetriNetUnfolderBase]: For 36887/37552 co-relation queries the response was YES. [2025-03-14 01:16:36,967 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-14 01:16:37,038 INFO L140 encePairwiseOnDemand]: 586/592 looper letters, 857 selfloop transitions, 5 changer transitions 0/1283 dead transitions. [2025-03-14 01:16:37,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 616 places, 1283 transitions, 8956 flow [2025-03-14 01:16:37,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:16:37,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:16:37,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2748 transitions. [2025-03-14 01:16:37,042 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7736486486486487 [2025-03-14 01:16:37,042 INFO L175 Difference]: Start difference. First operand has 612 places, 1272 transitions, 7202 flow. Second operand 6 states and 2748 transitions. [2025-03-14 01:16:37,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 616 places, 1283 transitions, 8956 flow [2025-03-14 01:16:37,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 616 places, 1283 transitions, 7900 flow, removed 528 selfloop flow, removed 0 redundant places. [2025-03-14 01:16:37,128 INFO L231 Difference]: Finished difference. Result has 616 places, 1271 transitions, 6154 flow [2025-03-14 01:16:37,129 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-14 01:16:37,129 INFO L279 CegarLoopForPetriNet]: 570 programPoint places, 46 predicate places. [2025-03-14 01:16:37,129 INFO L471 AbstractCegarLoop]: Abstraction has has 616 places, 1271 transitions, 6154 flow [2025-03-14 01:16:37,130 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-14 01:16:37,130 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:16:37,130 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-14 01:16:37,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-14 01:16:37,130 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-14 01:16:37,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:16:37,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1455601514, now seen corresponding path program 1 times [2025-03-14 01:16:37,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:16:37,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164831500] [2025-03-14 01:16:37,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:16:37,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:16:37,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-03-14 01:16:37,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-03-14 01:16:37,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:16:37,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:16:37,631 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-14 01:16:37,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:16:37,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164831500] [2025-03-14 01:16:37,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164831500] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:16:37,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:16:37,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:16:37,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599602463] [2025-03-14 01:16:37,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:16:37,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:16:37,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:16:37,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:16:37,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:16:38,382 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 499 out of 592 [2025-03-14 01:16:38,383 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-14 01:16:38,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:16:38,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 499 of 592 [2025-03-14 01:16:38,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:16:42,815 INFO L124 PetriNetUnfolderBase]: 5091/20469 cut-off events. [2025-03-14 01:16:42,815 INFO L125 PetriNetUnfolderBase]: For 25539/26035 co-relation queries the response was YES. [2025-03-14 01:16:42,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54392 conditions, 20469 events. 5091/20469 cut-off events. For 25539/26035 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 203955 event pairs, 719 based on Foata normal form. 90/19053 useless extension candidates. Maximal degree in co-relation 53197. Up to 5720 conditions per place. [2025-03-14 01:16:43,029 INFO L140 encePairwiseOnDemand]: 586/592 looper letters, 392 selfloop transitions, 5 changer transitions 0/1282 dead transitions. [2025-03-14 01:16:43,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 620 places, 1282 transitions, 6978 flow [2025-03-14 01:16:43,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:16:43,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:16:43,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3088 transitions. [2025-03-14 01:16:43,033 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8693693693693694 [2025-03-14 01:16:43,033 INFO L175 Difference]: Start difference. First operand has 616 places, 1271 transitions, 6154 flow. Second operand 6 states and 3088 transitions. [2025-03-14 01:16:43,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 620 places, 1282 transitions, 6978 flow [2025-03-14 01:16:43,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 615 places, 1282 transitions, 6968 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:16:43,123 INFO L231 Difference]: Finished difference. Result has 615 places, 1270 transitions, 6152 flow [2025-03-14 01:16:43,124 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=592, PETRI_DIFFERENCE_MINUEND_FLOW=6142, PETRI_DIFFERENCE_MINUEND_PLACES=610, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=6152, PETRI_PLACES=615, PETRI_TRANSITIONS=1270} [2025-03-14 01:16:43,127 INFO L279 CegarLoopForPetriNet]: 570 programPoint places, 45 predicate places. [2025-03-14 01:16:43,127 INFO L471 AbstractCegarLoop]: Abstraction has has 615 places, 1270 transitions, 6152 flow [2025-03-14 01:16:43,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has 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-14 01:16:43,128 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:16:43,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:16:43,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-14 01:16:43,128 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-14 01:16:43,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:16:43,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1055991597, now seen corresponding path program 1 times [2025-03-14 01:16:43,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:16:43,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083617773] [2025-03-14 01:16:43,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:16:43,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:16:43,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-03-14 01:16:43,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-03-14 01:16:43,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:16:43,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:16:43,788 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-14 01:16:43,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:16:43,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083617773] [2025-03-14 01:16:43,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083617773] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:16:43,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:16:43,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:16:43,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519721721] [2025-03-14 01:16:43,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:16:43,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:16:43,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:16:43,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:16:43,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:16:44,526 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 499 out of 592 [2025-03-14 01:16:44,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 615 places, 1270 transitions, 6152 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-14 01:16:44,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:16:44,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 499 of 592 [2025-03-14 01:16:44,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:16:48,562 INFO L124 PetriNetUnfolderBase]: 5091/20464 cut-off events. [2025-03-14 01:16:48,563 INFO L125 PetriNetUnfolderBase]: For 25539/26035 co-relation queries the response was YES. [2025-03-14 01:16:48,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54387 conditions, 20464 events. 5091/20464 cut-off events. For 25539/26035 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 203743 event pairs, 719 based on Foata normal form. 90/19053 useless extension candidates. Maximal degree in co-relation 53193. Up to 5720 conditions per place. [2025-03-14 01:16:48,767 INFO L140 encePairwiseOnDemand]: 586/592 looper letters, 392 selfloop transitions, 5 changer transitions 0/1281 dead transitions. [2025-03-14 01:16:48,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 619 places, 1281 transitions, 6976 flow [2025-03-14 01:16:48,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:16:48,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:16:48,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3088 transitions. [2025-03-14 01:16:48,944 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8693693693693694 [2025-03-14 01:16:48,944 INFO L175 Difference]: Start difference. First operand has 615 places, 1270 transitions, 6152 flow. Second operand 6 states and 3088 transitions. [2025-03-14 01:16:48,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 619 places, 1281 transitions, 6976 flow [2025-03-14 01:16:49,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 614 places, 1281 transitions, 6966 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:16:49,013 INFO L231 Difference]: Finished difference. Result has 614 places, 1269 transitions, 6150 flow [2025-03-14 01:16:49,014 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=592, PETRI_DIFFERENCE_MINUEND_FLOW=6140, PETRI_DIFFERENCE_MINUEND_PLACES=609, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=6150, PETRI_PLACES=614, PETRI_TRANSITIONS=1269} [2025-03-14 01:16:49,014 INFO L279 CegarLoopForPetriNet]: 570 programPoint places, 44 predicate places. [2025-03-14 01:16:49,014 INFO L471 AbstractCegarLoop]: Abstraction has has 614 places, 1269 transitions, 6150 flow [2025-03-14 01:16:49,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has 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-14 01:16:49,015 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:16:49,015 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:16:49,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-14 01:16:49,015 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-14 01:16:49,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:16:49,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1031411653, now seen corresponding path program 1 times [2025-03-14 01:16:49,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:16:49,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605436210] [2025-03-14 01:16:49,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:16:49,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:16:49,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-03-14 01:16:49,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-03-14 01:16:49,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:16:49,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:16:49,079 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-14 01:16:49,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:16:49,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605436210] [2025-03-14 01:16:49,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605436210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:16:49,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:16:49,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:16:49,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010639026] [2025-03-14 01:16:49,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:16:49,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:16:49,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:16:49,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:16:49,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:16:49,092 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 592 [2025-03-14 01:16:49,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 614 places, 1269 transitions, 6150 flow. Second operand has 3 states, 3 states have (on average 568.3333333333334) internal successors, (1705), 3 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:16:49,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:16:49,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 592 [2025-03-14 01:16:49,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand