./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-chromosome-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8fc3dc66 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/weaver/chl-chromosome-symm.wvr.c -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 23ca06a4d1d66eab783b29fc3ce31114eee62eb7d17a2452b84e2d73b8d92cfa --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:11:19,972 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:11:20,032 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 11:11:20,036 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:11:20,036 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:11:20,055 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:11:20,055 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:11:20,055 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:11:20,056 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:11:20,056 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:11:20,056 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:11:20,057 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:11:20,057 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:11:20,057 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:11:20,057 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 11:11:20,057 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:11:20,057 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:11:20,058 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:11:20,058 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:11:20,058 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 11:11:20,058 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:11:20,058 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 11:11:20,058 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 11:11:20,058 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:11:20,058 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:11:20,059 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 11:11:20,059 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:11:20,059 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:11:20,059 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:11:20,059 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:11:20,059 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:11:20,059 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:11:20,059 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:11:20,059 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:11:20,060 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 11:11:20,060 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 11:11:20,060 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:11:20,060 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:11:20,060 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:11:20,060 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:11:20,060 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:11:20,060 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:11:20,060 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 -> 23ca06a4d1d66eab783b29fc3ce31114eee62eb7d17a2452b84e2d73b8d92cfa [2025-03-17 11:11:20,306 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:11:20,312 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:11:20,314 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:11:20,315 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:11:20,315 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:11:20,316 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-chromosome-symm.wvr.c [2025-03-17 11:11:21,461 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3730e14da/f06ec8b9c8084a58b9a60c7bc4900cdc/FLAG1d91346b6 [2025-03-17 11:11:21,672 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:11:21,674 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-chromosome-symm.wvr.c [2025-03-17 11:11:21,683 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3730e14da/f06ec8b9c8084a58b9a60c7bc4900cdc/FLAG1d91346b6 [2025-03-17 11:11:22,028 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3730e14da/f06ec8b9c8084a58b9a60c7bc4900cdc [2025-03-17 11:11:22,030 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:11:22,031 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:11:22,032 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:11:22,032 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:11:22,035 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:11:22,035 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:11:22" (1/1) ... [2025-03-17 11:11:22,035 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ebc7f21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:22, skipping insertion in model container [2025-03-17 11:11:22,036 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:11:22" (1/1) ... [2025-03-17 11:11:22,050 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:11:22,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:11:22,212 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:11:22,242 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:11:22,259 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:11:22,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:22 WrapperNode [2025-03-17 11:11:22,260 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:11:22,260 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:11:22,261 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:11:22,261 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:11:22,266 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:22" (1/1) ... [2025-03-17 11:11:22,276 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:22" (1/1) ... [2025-03-17 11:11:22,310 INFO L138 Inliner]: procedures = 24, calls = 28, calls flagged for inlining = 16, calls inlined = 20, statements flattened = 311 [2025-03-17 11:11:22,310 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:11:22,310 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:11:22,311 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:11:22,311 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:11:22,318 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:22" (1/1) ... [2025-03-17 11:11:22,318 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:22" (1/1) ... [2025-03-17 11:11:22,321 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:22" (1/1) ... [2025-03-17 11:11:22,323 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:22" (1/1) ... [2025-03-17 11:11:22,341 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:22" (1/1) ... [2025-03-17 11:11:22,343 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:22" (1/1) ... [2025-03-17 11:11:22,346 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:22" (1/1) ... [2025-03-17 11:11:22,350 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:22" (1/1) ... [2025-03-17 11:11:22,353 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:11:22,358 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:11:22,358 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:11:22,358 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:11:22,359 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:22" (1/1) ... [2025-03-17 11:11:22,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:11:22,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:11:22,382 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-17 11:11:22,384 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-17 11:11:22,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:11:22,399 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-17 11:11:22,399 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-17 11:11:22,399 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-17 11:11:22,399 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-17 11:11:22,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 11:11:22,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 11:11:22,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 11:11:22,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:11:22,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:11:22,400 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 11:11:22,401 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 11:11:22,489 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:11:22,491 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:11:22,888 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 11:11:22,888 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:11:22,903 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:11:22,903 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:11:22,905 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:11:22 BoogieIcfgContainer [2025-03-17 11:11:22,905 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:11:22,907 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:11:22,908 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:11:22,911 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:11:22,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:11:22" (1/3) ... [2025-03-17 11:11:22,912 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bdb59f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:11:22, skipping insertion in model container [2025-03-17 11:11:22,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:22" (2/3) ... [2025-03-17 11:11:22,912 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bdb59f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:11:22, skipping insertion in model container [2025-03-17 11:11:22,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:11:22" (3/3) ... [2025-03-17 11:11:22,913 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-chromosome-symm.wvr.c [2025-03-17 11:11:22,923 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:11:22,924 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-chromosome-symm.wvr.c that has 3 procedures, 406 locations, 1 initial locations, 4 loop locations, and 34 error locations. [2025-03-17 11:11:22,924 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 11:11:23,022 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-17 11:11:23,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 412 places, 427 transitions, 868 flow [2025-03-17 11:11:23,209 INFO L124 PetriNetUnfolderBase]: 22/425 cut-off events. [2025-03-17 11:11:23,211 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 11:11:23,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 434 conditions, 425 events. 22/425 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 709 event pairs, 0 based on Foata normal form. 0/369 useless extension candidates. Maximal degree in co-relation 254. Up to 2 conditions per place. [2025-03-17 11:11:23,219 INFO L82 GeneralOperation]: Start removeDead. Operand has 412 places, 427 transitions, 868 flow [2025-03-17 11:11:23,227 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 392 places, 405 transitions, 822 flow [2025-03-17 11:11:23,236 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:11:23,248 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;@2d0e9199, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:11:23,248 INFO L334 AbstractCegarLoop]: Starting to check reachability of 58 error locations. [2025-03-17 11:11:23,259 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:11:23,259 INFO L124 PetriNetUnfolderBase]: 2/59 cut-off events. [2025-03-17 11:11:23,259 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:11:23,259 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:23,260 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] [2025-03-17 11:11:23,260 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-17 11:11:23,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:23,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1254563108, now seen corresponding path program 1 times [2025-03-17 11:11:23,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:23,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370879549] [2025-03-17 11:11:23,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:23,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:23,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-17 11:11:23,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 11:11:23,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:23,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:23,919 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-17 11:11:23,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:23,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370879549] [2025-03-17 11:11:23,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370879549] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:23,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:23,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:11:23,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635693501] [2025-03-17 11:11:23,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:23,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:11:23,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:23,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:11:23,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:11:24,163 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 365 out of 427 [2025-03-17 11:11:24,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 405 transitions, 822 flow. Second operand has 6 states, 6 states have (on average 366.5) internal successors, (2199), 6 states have internal predecessors, (2199), 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-17 11:11:24,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:24,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 365 of 427 [2025-03-17 11:11:24,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:24,426 INFO L124 PetriNetUnfolderBase]: 131/1616 cut-off events. [2025-03-17 11:11:24,427 INFO L125 PetriNetUnfolderBase]: For 68/69 co-relation queries the response was YES. [2025-03-17 11:11:24,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1893 conditions, 1616 events. 131/1616 cut-off events. For 68/69 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 10206 event pairs, 80 based on Foata normal form. 56/1430 useless extension candidates. Maximal degree in co-relation 1531. Up to 224 conditions per place. [2025-03-17 11:11:24,444 INFO L140 encePairwiseOnDemand]: 403/427 looper letters, 36 selfloop transitions, 10 changer transitions 6/391 dead transitions. [2025-03-17 11:11:24,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 391 transitions, 886 flow [2025-03-17 11:11:24,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:11:24,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:11:24,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2250 transitions. [2025-03-17 11:11:24,465 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8782201405152225 [2025-03-17 11:11:24,468 INFO L175 Difference]: Start difference. First operand has 392 places, 405 transitions, 822 flow. Second operand 6 states and 2250 transitions. [2025-03-17 11:11:24,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 395 places, 391 transitions, 886 flow [2025-03-17 11:11:24,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 391 places, 391 transitions, 878 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 11:11:24,483 INFO L231 Difference]: Finished difference. Result has 391 places, 385 transitions, 794 flow [2025-03-17 11:11:24,487 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=786, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=794, PETRI_PLACES=391, PETRI_TRANSITIONS=385} [2025-03-17 11:11:24,489 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -1 predicate places. [2025-03-17 11:11:24,491 INFO L471 AbstractCegarLoop]: Abstraction has has 391 places, 385 transitions, 794 flow [2025-03-17 11:11:24,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 366.5) internal successors, (2199), 6 states have internal predecessors, (2199), 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-17 11:11:24,492 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:24,492 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] [2025-03-17 11:11:24,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:11:24,492 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-17 11:11:24,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:24,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1517302799, now seen corresponding path program 1 times [2025-03-17 11:11:24,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:24,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824296344] [2025-03-17 11:11:24,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:24,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:24,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-17 11:11:24,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 11:11:24,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:24,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:24,533 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-17 11:11:24,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:24,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824296344] [2025-03-17 11:11:24,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824296344] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:24,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:24,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:24,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472619768] [2025-03-17 11:11:24,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:24,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:24,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:24,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:24,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:24,556 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 427 [2025-03-17 11:11:24,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 385 transitions, 794 flow. Second operand has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 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-17 11:11:24,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:24,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 427 [2025-03-17 11:11:24,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:24,639 INFO L124 PetriNetUnfolderBase]: 13/491 cut-off events. [2025-03-17 11:11:24,639 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2025-03-17 11:11:24,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 524 conditions, 491 events. 13/491 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1297 event pairs, 3 based on Foata normal form. 0/430 useless extension candidates. Maximal degree in co-relation 491. Up to 16 conditions per place. [2025-03-17 11:11:24,643 INFO L140 encePairwiseOnDemand]: 424/427 looper letters, 9 selfloop transitions, 2 changer transitions 0/384 dead transitions. [2025-03-17 11:11:24,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 384 transitions, 814 flow [2025-03-17 11:11:24,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:24,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:24,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1212 transitions. [2025-03-17 11:11:24,646 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9461358313817331 [2025-03-17 11:11:24,646 INFO L175 Difference]: Start difference. First operand has 391 places, 385 transitions, 794 flow. Second operand 3 states and 1212 transitions. [2025-03-17 11:11:24,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 384 transitions, 814 flow [2025-03-17 11:11:24,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 384 transitions, 794 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:11:24,652 INFO L231 Difference]: Finished difference. Result has 381 places, 384 transitions, 776 flow [2025-03-17 11:11:24,653 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=772, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=382, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=776, PETRI_PLACES=381, PETRI_TRANSITIONS=384} [2025-03-17 11:11:24,653 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -11 predicate places. [2025-03-17 11:11:24,653 INFO L471 AbstractCegarLoop]: Abstraction has has 381 places, 384 transitions, 776 flow [2025-03-17 11:11:24,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 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-17 11:11:24,654 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:24,654 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-17 11:11:24,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:11:24,654 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-17 11:11:24,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:24,655 INFO L85 PathProgramCache]: Analyzing trace with hash 339926766, now seen corresponding path program 1 times [2025-03-17 11:11:24,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:24,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72166043] [2025-03-17 11:11:24,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:24,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:24,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-17 11:11:24,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-17 11:11:24,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:24,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:24,698 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-17 11:11:24,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:24,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72166043] [2025-03-17 11:11:24,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72166043] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:24,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:24,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:24,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396058805] [2025-03-17 11:11:24,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:24,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:24,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:24,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:24,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:24,718 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 427 [2025-03-17 11:11:24,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 384 transitions, 776 flow. Second operand has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 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-17 11:11:24,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:24,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 427 [2025-03-17 11:11:24,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:24,787 INFO L124 PetriNetUnfolderBase]: 16/569 cut-off events. [2025-03-17 11:11:24,788 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-17 11:11:24,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 596 conditions, 569 events. 16/569 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1500 event pairs, 3 based on Foata normal form. 0/495 useless extension candidates. Maximal degree in co-relation 527. Up to 18 conditions per place. [2025-03-17 11:11:24,791 INFO L140 encePairwiseOnDemand]: 424/427 looper letters, 9 selfloop transitions, 2 changer transitions 0/383 dead transitions. [2025-03-17 11:11:24,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 383 transitions, 796 flow [2025-03-17 11:11:24,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:24,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:24,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1212 transitions. [2025-03-17 11:11:24,794 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9461358313817331 [2025-03-17 11:11:24,794 INFO L175 Difference]: Start difference. First operand has 381 places, 384 transitions, 776 flow. Second operand 3 states and 1212 transitions. [2025-03-17 11:11:24,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 383 transitions, 796 flow [2025-03-17 11:11:24,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 383 transitions, 792 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:24,800 INFO L231 Difference]: Finished difference. Result has 380 places, 383 transitions, 774 flow [2025-03-17 11:11:24,801 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=770, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=774, PETRI_PLACES=380, PETRI_TRANSITIONS=383} [2025-03-17 11:11:24,802 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -12 predicate places. [2025-03-17 11:11:24,802 INFO L471 AbstractCegarLoop]: Abstraction has has 380 places, 383 transitions, 774 flow [2025-03-17 11:11:24,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 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-17 11:11:24,802 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:24,803 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] [2025-03-17 11:11:24,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:11:24,803 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-17 11:11:24,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:24,803 INFO L85 PathProgramCache]: Analyzing trace with hash 952608988, now seen corresponding path program 1 times [2025-03-17 11:11:24,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:24,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524935484] [2025-03-17 11:11:24,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:24,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:24,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 11:11:24,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 11:11:24,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:24,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:24,863 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-17 11:11:24,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:24,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524935484] [2025-03-17 11:11:24,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524935484] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:24,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:24,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:24,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747849041] [2025-03-17 11:11:24,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:24,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:24,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:24,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:24,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:24,883 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 427 [2025-03-17 11:11:24,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 383 transitions, 774 flow. Second operand has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 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-17 11:11:24,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:24,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 427 [2025-03-17 11:11:24,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:24,950 INFO L124 PetriNetUnfolderBase]: 15/584 cut-off events. [2025-03-17 11:11:24,950 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 11:11:24,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 609 conditions, 584 events. 15/584 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1822 event pairs, 3 based on Foata normal form. 0/508 useless extension candidates. Maximal degree in co-relation 493. Up to 16 conditions per place. [2025-03-17 11:11:24,954 INFO L140 encePairwiseOnDemand]: 424/427 looper letters, 9 selfloop transitions, 2 changer transitions 0/382 dead transitions. [2025-03-17 11:11:24,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 382 transitions, 794 flow [2025-03-17 11:11:24,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:24,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:24,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1212 transitions. [2025-03-17 11:11:24,956 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9461358313817331 [2025-03-17 11:11:24,956 INFO L175 Difference]: Start difference. First operand has 380 places, 383 transitions, 774 flow. Second operand 3 states and 1212 transitions. [2025-03-17 11:11:24,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 382 transitions, 794 flow [2025-03-17 11:11:24,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 382 transitions, 790 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:24,961 INFO L231 Difference]: Finished difference. Result has 379 places, 382 transitions, 772 flow [2025-03-17 11:11:24,961 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=768, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=772, PETRI_PLACES=379, PETRI_TRANSITIONS=382} [2025-03-17 11:11:24,962 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -13 predicate places. [2025-03-17 11:11:24,962 INFO L471 AbstractCegarLoop]: Abstraction has has 379 places, 382 transitions, 772 flow [2025-03-17 11:11:24,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 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-17 11:11:24,963 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:24,963 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-17 11:11:24,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:11:24,963 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-17 11:11:24,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:24,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1001520700, now seen corresponding path program 1 times [2025-03-17 11:11:24,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:24,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562919621] [2025-03-17 11:11:24,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:24,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:24,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 11:11:24,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 11:11:24,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:24,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:25,005 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-17 11:11:25,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:25,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562919621] [2025-03-17 11:11:25,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562919621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:25,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:25,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:25,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769653590] [2025-03-17 11:11:25,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:25,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:25,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:25,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:25,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:25,021 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 427 [2025-03-17 11:11:25,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 382 transitions, 772 flow. Second operand has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 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-17 11:11:25,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:25,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 427 [2025-03-17 11:11:25,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:25,089 INFO L124 PetriNetUnfolderBase]: 15/586 cut-off events. [2025-03-17 11:11:25,089 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-17 11:11:25,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 611 conditions, 586 events. 15/586 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1684 event pairs, 3 based on Foata normal form. 0/510 useless extension candidates. Maximal degree in co-relation 487. Up to 16 conditions per place. [2025-03-17 11:11:25,092 INFO L140 encePairwiseOnDemand]: 424/427 looper letters, 9 selfloop transitions, 2 changer transitions 0/381 dead transitions. [2025-03-17 11:11:25,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 381 transitions, 792 flow [2025-03-17 11:11:25,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:25,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:25,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1212 transitions. [2025-03-17 11:11:25,094 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9461358313817331 [2025-03-17 11:11:25,094 INFO L175 Difference]: Start difference. First operand has 379 places, 382 transitions, 772 flow. Second operand 3 states and 1212 transitions. [2025-03-17 11:11:25,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 381 transitions, 792 flow [2025-03-17 11:11:25,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 381 transitions, 788 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:25,098 INFO L231 Difference]: Finished difference. Result has 378 places, 381 transitions, 770 flow [2025-03-17 11:11:25,099 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=766, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=770, PETRI_PLACES=378, PETRI_TRANSITIONS=381} [2025-03-17 11:11:25,099 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -14 predicate places. [2025-03-17 11:11:25,099 INFO L471 AbstractCegarLoop]: Abstraction has has 378 places, 381 transitions, 770 flow [2025-03-17 11:11:25,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 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-17 11:11:25,100 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:25,100 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] [2025-03-17 11:11:25,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:11:25,100 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-17 11:11:25,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:25,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1579494890, now seen corresponding path program 1 times [2025-03-17 11:11:25,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:25,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145128017] [2025-03-17 11:11:25,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:25,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:25,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-17 11:11:25,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-17 11:11:25,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:25,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:25,139 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-17 11:11:25,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:25,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145128017] [2025-03-17 11:11:25,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145128017] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:25,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:25,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:25,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278529420] [2025-03-17 11:11:25,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:25,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:25,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:25,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:25,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:25,152 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 402 out of 427 [2025-03-17 11:11:25,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 381 transitions, 770 flow. Second operand has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 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-17 11:11:25,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:25,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 402 of 427 [2025-03-17 11:11:25,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:25,212 INFO L124 PetriNetUnfolderBase]: 26/858 cut-off events. [2025-03-17 11:11:25,212 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-17 11:11:25,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 892 conditions, 858 events. 26/858 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 3693 event pairs, 5 based on Foata normal form. 0/745 useless extension candidates. Maximal degree in co-relation 760. Up to 22 conditions per place. [2025-03-17 11:11:25,217 INFO L140 encePairwiseOnDemand]: 423/427 looper letters, 10 selfloop transitions, 2 changer transitions 0/382 dead transitions. [2025-03-17 11:11:25,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 382 transitions, 797 flow [2025-03-17 11:11:25,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:25,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:25,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1220 transitions. [2025-03-17 11:11:25,219 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9523809523809523 [2025-03-17 11:11:25,219 INFO L175 Difference]: Start difference. First operand has 378 places, 381 transitions, 770 flow. Second operand 3 states and 1220 transitions. [2025-03-17 11:11:25,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 382 transitions, 797 flow [2025-03-17 11:11:25,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 382 transitions, 793 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:25,226 INFO L231 Difference]: Finished difference. Result has 377 places, 381 transitions, 776 flow [2025-03-17 11:11:25,227 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=762, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=776, PETRI_PLACES=377, PETRI_TRANSITIONS=381} [2025-03-17 11:11:25,227 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -15 predicate places. [2025-03-17 11:11:25,227 INFO L471 AbstractCegarLoop]: Abstraction has has 377 places, 381 transitions, 776 flow [2025-03-17 11:11:25,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 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-17 11:11:25,228 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:25,228 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] [2025-03-17 11:11:25,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:11:25,228 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-17 11:11:25,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:25,229 INFO L85 PathProgramCache]: Analyzing trace with hash 2059917876, now seen corresponding path program 1 times [2025-03-17 11:11:25,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:25,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229859467] [2025-03-17 11:11:25,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:25,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:25,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-17 11:11:25,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-17 11:11:25,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:25,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:25,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:11:25,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:25,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229859467] [2025-03-17 11:11:25,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229859467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:25,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:25,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:25,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725595832] [2025-03-17 11:11:25,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:25,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:25,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:25,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:25,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:25,278 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 402 out of 427 [2025-03-17 11:11:25,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 381 transitions, 776 flow. Second operand has 3 states, 3 states have (on average 403.6666666666667) internal successors, (1211), 3 states have internal predecessors, (1211), 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-17 11:11:25,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:25,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 402 of 427 [2025-03-17 11:11:25,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:25,336 INFO L124 PetriNetUnfolderBase]: 27/835 cut-off events. [2025-03-17 11:11:25,336 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-03-17 11:11:25,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 874 conditions, 835 events. 27/835 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3879 event pairs, 3 based on Foata normal form. 0/731 useless extension candidates. Maximal degree in co-relation 642. Up to 22 conditions per place. [2025-03-17 11:11:25,340 INFO L140 encePairwiseOnDemand]: 423/427 looper letters, 10 selfloop transitions, 2 changer transitions 0/382 dead transitions. [2025-03-17 11:11:25,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 382 transitions, 803 flow [2025-03-17 11:11:25,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:25,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:25,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1220 transitions. [2025-03-17 11:11:25,343 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9523809523809523 [2025-03-17 11:11:25,343 INFO L175 Difference]: Start difference. First operand has 377 places, 381 transitions, 776 flow. Second operand 3 states and 1220 transitions. [2025-03-17 11:11:25,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 382 transitions, 803 flow [2025-03-17 11:11:25,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 382 transitions, 803 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:11:25,347 INFO L231 Difference]: Finished difference. Result has 378 places, 381 transitions, 786 flow [2025-03-17 11:11:25,347 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=772, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=786, PETRI_PLACES=378, PETRI_TRANSITIONS=381} [2025-03-17 11:11:25,347 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -14 predicate places. [2025-03-17 11:11:25,348 INFO L471 AbstractCegarLoop]: Abstraction has has 378 places, 381 transitions, 786 flow [2025-03-17 11:11:25,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 403.6666666666667) internal successors, (1211), 3 states have internal predecessors, (1211), 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-17 11:11:25,348 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:25,348 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] [2025-03-17 11:11:25,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:11:25,348 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-17 11:11:25,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:25,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1831265226, now seen corresponding path program 1 times [2025-03-17 11:11:25,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:25,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966087411] [2025-03-17 11:11:25,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:25,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:25,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 11:11:25,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 11:11:25,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:25,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:25,391 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-17 11:11:25,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:25,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966087411] [2025-03-17 11:11:25,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966087411] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:25,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:25,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:25,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100793128] [2025-03-17 11:11:25,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:25,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:25,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:25,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:25,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:25,417 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 397 out of 427 [2025-03-17 11:11:25,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 381 transitions, 786 flow. Second operand has 3 states, 3 states have (on average 398.3333333333333) internal successors, (1195), 3 states have internal predecessors, (1195), 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-17 11:11:25,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:25,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 397 of 427 [2025-03-17 11:11:25,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:25,472 INFO L124 PetriNetUnfolderBase]: 25/649 cut-off events. [2025-03-17 11:11:25,473 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 11:11:25,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 716 conditions, 649 events. 25/649 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2512 event pairs, 6 based on Foata normal form. 0/575 useless extension candidates. Maximal degree in co-relation 484. Up to 33 conditions per place. [2025-03-17 11:11:25,477 INFO L140 encePairwiseOnDemand]: 424/427 looper letters, 14 selfloop transitions, 2 changer transitions 0/381 dead transitions. [2025-03-17 11:11:25,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 381 transitions, 819 flow [2025-03-17 11:11:25,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:25,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:25,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1208 transitions. [2025-03-17 11:11:25,479 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9430132708821234 [2025-03-17 11:11:25,479 INFO L175 Difference]: Start difference. First operand has 378 places, 381 transitions, 786 flow. Second operand 3 states and 1208 transitions. [2025-03-17 11:11:25,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 381 transitions, 819 flow [2025-03-17 11:11:25,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 381 transitions, 819 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:11:25,487 INFO L231 Difference]: Finished difference. Result has 379 places, 380 transitions, 788 flow [2025-03-17 11:11:25,487 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=784, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=788, PETRI_PLACES=379, PETRI_TRANSITIONS=380} [2025-03-17 11:11:25,488 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -13 predicate places. [2025-03-17 11:11:25,489 INFO L471 AbstractCegarLoop]: Abstraction has has 379 places, 380 transitions, 788 flow [2025-03-17 11:11:25,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 398.3333333333333) internal successors, (1195), 3 states have internal predecessors, (1195), 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-17 11:11:25,490 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:25,490 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:11:25,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:11:25,490 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-17 11:11:25,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:25,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1602956553, now seen corresponding path program 1 times [2025-03-17 11:11:25,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:25,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294388950] [2025-03-17 11:11:25,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:25,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:25,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-17 11:11:25,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-17 11:11:25,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:25,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:25,525 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-17 11:11:25,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:25,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294388950] [2025-03-17 11:11:25,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294388950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:25,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:25,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:25,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454680714] [2025-03-17 11:11:25,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:25,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:25,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:25,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:25,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:25,534 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 402 out of 427 [2025-03-17 11:11:25,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 380 transitions, 788 flow. Second operand has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 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-17 11:11:25,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:25,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 402 of 427 [2025-03-17 11:11:25,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:25,615 INFO L124 PetriNetUnfolderBase]: 43/1091 cut-off events. [2025-03-17 11:11:25,615 INFO L125 PetriNetUnfolderBase]: For 9/10 co-relation queries the response was YES. [2025-03-17 11:11:25,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1163 conditions, 1091 events. 43/1091 cut-off events. For 9/10 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 5175 event pairs, 2 based on Foata normal form. 0/948 useless extension candidates. Maximal degree in co-relation 898. Up to 41 conditions per place. [2025-03-17 11:11:25,635 INFO L140 encePairwiseOnDemand]: 423/427 looper letters, 12 selfloop transitions, 2 changer transitions 0/383 dead transitions. [2025-03-17 11:11:25,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 383 transitions, 825 flow [2025-03-17 11:11:25,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:25,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:25,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1222 transitions. [2025-03-17 11:11:25,637 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9539422326307572 [2025-03-17 11:11:25,637 INFO L175 Difference]: Start difference. First operand has 379 places, 380 transitions, 788 flow. Second operand 3 states and 1222 transitions. [2025-03-17 11:11:25,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 383 transitions, 825 flow [2025-03-17 11:11:25,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 383 transitions, 821 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:25,641 INFO L231 Difference]: Finished difference. Result has 378 places, 380 transitions, 794 flow [2025-03-17 11:11:25,641 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=780, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=794, PETRI_PLACES=378, PETRI_TRANSITIONS=380} [2025-03-17 11:11:25,642 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -14 predicate places. [2025-03-17 11:11:25,642 INFO L471 AbstractCegarLoop]: Abstraction has has 378 places, 380 transitions, 794 flow [2025-03-17 11:11:25,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 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-17 11:11:25,642 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:25,642 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] [2025-03-17 11:11:25,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 11:11:25,642 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-17 11:11:25,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:25,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1847986076, now seen corresponding path program 1 times [2025-03-17 11:11:25,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:25,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440545319] [2025-03-17 11:11:25,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:25,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:25,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-17 11:11:25,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-17 11:11:25,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:25,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:25,687 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-17 11:11:25,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:25,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440545319] [2025-03-17 11:11:25,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440545319] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:25,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:25,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:25,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382268082] [2025-03-17 11:11:25,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:25,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:25,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:25,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:25,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:25,712 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 391 out of 427 [2025-03-17 11:11:25,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 380 transitions, 794 flow. Second operand has 3 states, 3 states have (on average 392.3333333333333) internal successors, (1177), 3 states have internal predecessors, (1177), 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-17 11:11:25,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:25,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 427 [2025-03-17 11:11:25,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:25,796 INFO L124 PetriNetUnfolderBase]: 45/1032 cut-off events. [2025-03-17 11:11:25,796 INFO L125 PetriNetUnfolderBase]: For 6/18 co-relation queries the response was YES. [2025-03-17 11:11:25,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1152 conditions, 1032 events. 45/1032 cut-off events. For 6/18 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4376 event pairs, 5 based on Foata normal form. 2/919 useless extension candidates. Maximal degree in co-relation 888. Up to 36 conditions per place. [2025-03-17 11:11:25,803 INFO L140 encePairwiseOnDemand]: 417/427 looper letters, 16 selfloop transitions, 5 changer transitions 0/379 dead transitions. [2025-03-17 11:11:25,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 379 transitions, 835 flow [2025-03-17 11:11:25,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:25,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:25,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1199 transitions. [2025-03-17 11:11:25,807 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9359875097580016 [2025-03-17 11:11:25,807 INFO L175 Difference]: Start difference. First operand has 378 places, 380 transitions, 794 flow. Second operand 3 states and 1199 transitions. [2025-03-17 11:11:25,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 379 transitions, 835 flow [2025-03-17 11:11:25,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 379 transitions, 835 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:11:25,811 INFO L231 Difference]: Finished difference. Result has 377 places, 378 transitions, 816 flow [2025-03-17 11:11:25,812 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=784, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=816, PETRI_PLACES=377, PETRI_TRANSITIONS=378} [2025-03-17 11:11:25,812 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -15 predicate places. [2025-03-17 11:11:25,812 INFO L471 AbstractCegarLoop]: Abstraction has has 377 places, 378 transitions, 816 flow [2025-03-17 11:11:25,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 392.3333333333333) internal successors, (1177), 3 states have internal predecessors, (1177), 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-17 11:11:25,813 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:25,813 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] [2025-03-17 11:11:25,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 11:11:25,813 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-17 11:11:25,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:25,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1926341805, now seen corresponding path program 1 times [2025-03-17 11:11:25,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:25,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766787135] [2025-03-17 11:11:25,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:25,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:25,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-17 11:11:25,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-17 11:11:25,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:25,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:25,853 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-17 11:11:25,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:25,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766787135] [2025-03-17 11:11:25,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766787135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:25,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:25,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:25,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617039466] [2025-03-17 11:11:25,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:25,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:25,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:25,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:25,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:25,883 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 397 out of 427 [2025-03-17 11:11:25,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 378 transitions, 816 flow. Second operand has 3 states, 3 states have (on average 398.6666666666667) internal successors, (1196), 3 states have internal predecessors, (1196), 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-17 11:11:25,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:25,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 397 of 427 [2025-03-17 11:11:25,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:25,977 INFO L124 PetriNetUnfolderBase]: 50/1066 cut-off events. [2025-03-17 11:11:25,978 INFO L125 PetriNetUnfolderBase]: For 38/40 co-relation queries the response was YES. [2025-03-17 11:11:25,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1214 conditions, 1066 events. 50/1066 cut-off events. For 38/40 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 4805 event pairs, 11 based on Foata normal form. 0/935 useless extension candidates. Maximal degree in co-relation 939. Up to 65 conditions per place. [2025-03-17 11:11:25,985 INFO L140 encePairwiseOnDemand]: 424/427 looper letters, 14 selfloop transitions, 2 changer transitions 0/378 dead transitions. [2025-03-17 11:11:25,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 378 transitions, 849 flow [2025-03-17 11:11:25,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:25,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:25,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1208 transitions. [2025-03-17 11:11:25,988 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9430132708821234 [2025-03-17 11:11:25,988 INFO L175 Difference]: Start difference. First operand has 377 places, 378 transitions, 816 flow. Second operand 3 states and 1208 transitions. [2025-03-17 11:11:25,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 378 transitions, 849 flow [2025-03-17 11:11:25,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 378 transitions, 839 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:25,994 INFO L231 Difference]: Finished difference. Result has 376 places, 377 transitions, 808 flow [2025-03-17 11:11:25,995 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=804, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=808, PETRI_PLACES=376, PETRI_TRANSITIONS=377} [2025-03-17 11:11:25,995 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -16 predicate places. [2025-03-17 11:11:25,995 INFO L471 AbstractCegarLoop]: Abstraction has has 376 places, 377 transitions, 808 flow [2025-03-17 11:11:25,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 398.6666666666667) internal successors, (1196), 3 states have internal predecessors, (1196), 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-17 11:11:25,996 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:25,996 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] [2025-03-17 11:11:25,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 11:11:25,996 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-17 11:11:25,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:25,997 INFO L85 PathProgramCache]: Analyzing trace with hash 492854302, now seen corresponding path program 1 times [2025-03-17 11:11:25,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:25,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644885383] [2025-03-17 11:11:25,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:25,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:26,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 11:11:26,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 11:11:26,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:26,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:26,088 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-17 11:11:26,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:26,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644885383] [2025-03-17 11:11:26,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644885383] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:26,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:26,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:11:26,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244388884] [2025-03-17 11:11:26,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:26,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:11:26,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:26,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:11:26,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:11:26,148 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 401 out of 427 [2025-03-17 11:11:26,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 377 transitions, 808 flow. Second operand has 4 states, 4 states have (on average 402.25) internal successors, (1609), 4 states have internal predecessors, (1609), 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-17 11:11:26,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:26,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 401 of 427 [2025-03-17 11:11:26,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:26,289 INFO L124 PetriNetUnfolderBase]: 46/1176 cut-off events. [2025-03-17 11:11:26,289 INFO L125 PetriNetUnfolderBase]: For 9/31 co-relation queries the response was YES. [2025-03-17 11:11:26,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1332 conditions, 1176 events. 46/1176 cut-off events. For 9/31 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 5459 event pairs, 7 based on Foata normal form. 3/1052 useless extension candidates. Maximal degree in co-relation 1065. Up to 34 conditions per place. [2025-03-17 11:11:26,296 INFO L140 encePairwiseOnDemand]: 422/427 looper letters, 20 selfloop transitions, 4 changer transitions 0/388 dead transitions. [2025-03-17 11:11:26,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 388 transitions, 883 flow [2025-03-17 11:11:26,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:11:26,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 11:11:26,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2030 transitions. [2025-03-17 11:11:26,299 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9508196721311475 [2025-03-17 11:11:26,300 INFO L175 Difference]: Start difference. First operand has 376 places, 377 transitions, 808 flow. Second operand 5 states and 2030 transitions. [2025-03-17 11:11:26,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 388 transitions, 883 flow [2025-03-17 11:11:26,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 388 transitions, 879 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:26,304 INFO L231 Difference]: Finished difference. Result has 381 places, 379 transitions, 829 flow [2025-03-17 11:11:26,304 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=800, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=829, PETRI_PLACES=381, PETRI_TRANSITIONS=379} [2025-03-17 11:11:26,305 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -11 predicate places. [2025-03-17 11:11:26,305 INFO L471 AbstractCegarLoop]: Abstraction has has 381 places, 379 transitions, 829 flow [2025-03-17 11:11:26,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 402.25) internal successors, (1609), 4 states have internal predecessors, (1609), 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-17 11:11:26,306 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:26,306 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] [2025-03-17 11:11:26,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 11:11:26,306 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-17 11:11:26,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:26,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1502039454, now seen corresponding path program 1 times [2025-03-17 11:11:26,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:26,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940330401] [2025-03-17 11:11:26,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:26,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:26,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 11:11:26,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 11:11:26,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:26,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:26,342 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-17 11:11:26,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:26,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940330401] [2025-03-17 11:11:26,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940330401] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:26,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:26,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:26,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204432463] [2025-03-17 11:11:26,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:26,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:26,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:26,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:26,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:26,373 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 397 out of 427 [2025-03-17 11:11:26,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 379 transitions, 829 flow. Second operand has 3 states, 3 states have (on average 399.0) internal successors, (1197), 3 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:26,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:26,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 397 of 427 [2025-03-17 11:11:26,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:26,473 INFO L124 PetriNetUnfolderBase]: 57/1123 cut-off events. [2025-03-17 11:11:26,473 INFO L125 PetriNetUnfolderBase]: For 34/67 co-relation queries the response was YES. [2025-03-17 11:11:26,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1350 conditions, 1123 events. 57/1123 cut-off events. For 34/67 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5065 event pairs, 14 based on Foata normal form. 2/1018 useless extension candidates. Maximal degree in co-relation 1083. Up to 79 conditions per place. [2025-03-17 11:11:26,486 INFO L140 encePairwiseOnDemand]: 424/427 looper letters, 16 selfloop transitions, 2 changer transitions 0/379 dead transitions. [2025-03-17 11:11:26,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 379 transitions, 866 flow [2025-03-17 11:11:26,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:26,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:26,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1208 transitions. [2025-03-17 11:11:26,489 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9430132708821234 [2025-03-17 11:11:26,489 INFO L175 Difference]: Start difference. First operand has 381 places, 379 transitions, 829 flow. Second operand 3 states and 1208 transitions. [2025-03-17 11:11:26,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 379 transitions, 866 flow [2025-03-17 11:11:26,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 379 transitions, 866 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:11:26,495 INFO L231 Difference]: Finished difference. Result has 382 places, 378 transitions, 831 flow [2025-03-17 11:11:26,496 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=827, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=831, PETRI_PLACES=382, PETRI_TRANSITIONS=378} [2025-03-17 11:11:26,497 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -10 predicate places. [2025-03-17 11:11:26,497 INFO L471 AbstractCegarLoop]: Abstraction has has 382 places, 378 transitions, 831 flow [2025-03-17 11:11:26,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 399.0) internal successors, (1197), 3 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:26,498 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:26,498 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] [2025-03-17 11:11:26,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 11:11:26,499 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-17 11:11:26,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:26,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1053134111, now seen corresponding path program 1 times [2025-03-17 11:11:26,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:26,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638563673] [2025-03-17 11:11:26,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:26,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:26,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 11:11:26,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 11:11:26,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:26,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:26,599 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-17 11:11:26,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:26,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638563673] [2025-03-17 11:11:26,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638563673] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:26,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:26,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:11:26,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256006902] [2025-03-17 11:11:26,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:26,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:11:26,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:26,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:11:26,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:11:26,679 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 391 out of 427 [2025-03-17 11:11:26,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 378 transitions, 831 flow. Second operand has 5 states, 5 states have (on average 394.4) internal successors, (1972), 5 states have internal predecessors, (1972), 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-17 11:11:26,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:26,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 427 [2025-03-17 11:11:26,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:26,819 INFO L124 PetriNetUnfolderBase]: 28/1064 cut-off events. [2025-03-17 11:11:26,820 INFO L125 PetriNetUnfolderBase]: For 19/27 co-relation queries the response was YES. [2025-03-17 11:11:26,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1198 conditions, 1064 events. 28/1064 cut-off events. For 19/27 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 4302 event pairs, 1 based on Foata normal form. 2/966 useless extension candidates. Maximal degree in co-relation 987. Up to 17 conditions per place. [2025-03-17 11:11:26,829 INFO L140 encePairwiseOnDemand]: 413/427 looper letters, 12 selfloop transitions, 12 changer transitions 0/380 dead transitions. [2025-03-17 11:11:26,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 380 transitions, 883 flow [2025-03-17 11:11:26,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:11:26,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 11:11:26,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1981 transitions. [2025-03-17 11:11:26,834 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9278688524590164 [2025-03-17 11:11:26,834 INFO L175 Difference]: Start difference. First operand has 382 places, 378 transitions, 831 flow. Second operand 5 states and 1981 transitions. [2025-03-17 11:11:26,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 380 transitions, 883 flow [2025-03-17 11:11:26,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 384 places, 380 transitions, 879 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:26,840 INFO L231 Difference]: Finished difference. Result has 385 places, 380 transitions, 867 flow [2025-03-17 11:11:26,841 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=827, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=867, PETRI_PLACES=385, PETRI_TRANSITIONS=380} [2025-03-17 11:11:26,841 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -7 predicate places. [2025-03-17 11:11:26,841 INFO L471 AbstractCegarLoop]: Abstraction has has 385 places, 380 transitions, 867 flow [2025-03-17 11:11:26,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 394.4) internal successors, (1972), 5 states have internal predecessors, (1972), 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-17 11:11:26,842 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:26,843 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] [2025-03-17 11:11:26,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 11:11:26,843 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-17 11:11:26,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:26,844 INFO L85 PathProgramCache]: Analyzing trace with hash -907256926, now seen corresponding path program 1 times [2025-03-17 11:11:26,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:26,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359073220] [2025-03-17 11:11:26,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:26,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:26,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-17 11:11:26,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-17 11:11:26,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:26,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:27,014 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:11:27,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:27,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359073220] [2025-03-17 11:11:27,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359073220] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:11:27,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183969540] [2025-03-17 11:11:27,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:27,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:11:27,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:11:27,017 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:11:27,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 11:11:27,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-17 11:11:27,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-17 11:11:27,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:27,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:27,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 11:11:27,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:11:27,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:11:27,247 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:11:27,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:11:27,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183969540] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:11:27,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:11:27,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-03-17 11:11:27,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187301910] [2025-03-17 11:11:27,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:11:27,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 11:11:27,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:27,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 11:11:27,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-03-17 11:11:27,752 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 385 out of 427 [2025-03-17 11:11:27,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 380 transitions, 867 flow. Second operand has 15 states, 15 states have (on average 387.6666666666667) internal successors, (5815), 15 states have internal predecessors, (5815), 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-17 11:11:27,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:27,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 385 of 427 [2025-03-17 11:11:27,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:28,001 INFO L124 PetriNetUnfolderBase]: 28/1098 cut-off events. [2025-03-17 11:11:28,001 INFO L125 PetriNetUnfolderBase]: For 23/31 co-relation queries the response was YES. [2025-03-17 11:11:28,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1263 conditions, 1098 events. 28/1098 cut-off events. For 23/31 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 4247 event pairs, 1 based on Foata normal form. 4/1002 useless extension candidates. Maximal degree in co-relation 1059. Up to 17 conditions per place. [2025-03-17 11:11:28,009 INFO L140 encePairwiseOnDemand]: 407/427 looper letters, 20 selfloop transitions, 26 changer transitions 0/396 dead transitions. [2025-03-17 11:11:28,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 396 transitions, 995 flow [2025-03-17 11:11:28,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 11:11:28,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-17 11:11:28,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 4285 transitions. [2025-03-17 11:11:28,016 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9122844368746008 [2025-03-17 11:11:28,016 INFO L175 Difference]: Start difference. First operand has 385 places, 380 transitions, 867 flow. Second operand 11 states and 4285 transitions. [2025-03-17 11:11:28,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 395 places, 396 transitions, 995 flow [2025-03-17 11:11:28,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 392 places, 396 transitions, 975 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 11:11:28,022 INFO L231 Difference]: Finished difference. Result has 395 places, 392 transitions, 967 flow [2025-03-17 11:11:28,023 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=847, PETRI_DIFFERENCE_MINUEND_PLACES=382, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=967, PETRI_PLACES=395, PETRI_TRANSITIONS=392} [2025-03-17 11:11:28,024 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, 3 predicate places. [2025-03-17 11:11:28,024 INFO L471 AbstractCegarLoop]: Abstraction has has 395 places, 392 transitions, 967 flow [2025-03-17 11:11:28,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 387.6666666666667) internal successors, (5815), 15 states have internal predecessors, (5815), 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-17 11:11:28,026 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:28,027 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:11:28,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 11:11:28,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-17 11:11:28,233 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-17 11:11:28,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:28,234 INFO L85 PathProgramCache]: Analyzing trace with hash -965797502, now seen corresponding path program 2 times [2025-03-17 11:11:28,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:28,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405082364] [2025-03-17 11:11:28,234 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:11:28,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:28,253 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 217 statements into 2 equivalence classes. [2025-03-17 11:11:28,265 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 127 of 217 statements. [2025-03-17 11:11:28,265 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 11:11:28,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:28,619 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-17 11:11:28,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:28,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405082364] [2025-03-17 11:11:28,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405082364] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:28,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:28,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:11:28,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567669866] [2025-03-17 11:11:28,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:28,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:11:28,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:28,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:11:28,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:11:28,821 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 391 out of 427 [2025-03-17 11:11:28,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 392 transitions, 967 flow. Second operand has 6 states, 6 states have (on average 393.8333333333333) internal successors, (2363), 6 states have internal predecessors, (2363), 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-17 11:11:28,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:28,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 427 [2025-03-17 11:11:28,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:28,982 INFO L124 PetriNetUnfolderBase]: 43/1221 cut-off events. [2025-03-17 11:11:28,982 INFO L125 PetriNetUnfolderBase]: For 42/63 co-relation queries the response was YES. [2025-03-17 11:11:28,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1487 conditions, 1221 events. 43/1221 cut-off events. For 42/63 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 5272 event pairs, 3 based on Foata normal form. 4/1118 useless extension candidates. Maximal degree in co-relation 1280. Up to 52 conditions per place. [2025-03-17 11:11:28,990 INFO L140 encePairwiseOnDemand]: 421/427 looper letters, 20 selfloop transitions, 6 changer transitions 0/395 dead transitions. [2025-03-17 11:11:28,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 395 transitions, 1029 flow [2025-03-17 11:11:28,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:11:28,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:11:28,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2372 transitions. [2025-03-17 11:11:28,994 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9258391881342701 [2025-03-17 11:11:28,994 INFO L175 Difference]: Start difference. First operand has 395 places, 392 transitions, 967 flow. Second operand 6 states and 2372 transitions. [2025-03-17 11:11:28,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 395 transitions, 1029 flow [2025-03-17 11:11:28,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 396 places, 395 transitions, 1005 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-03-17 11:11:29,000 INFO L231 Difference]: Finished difference. Result has 396 places, 391 transitions, 953 flow [2025-03-17 11:11:29,000 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=941, PETRI_DIFFERENCE_MINUEND_PLACES=391, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=385, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=953, PETRI_PLACES=396, PETRI_TRANSITIONS=391} [2025-03-17 11:11:29,000 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, 4 predicate places. [2025-03-17 11:11:29,001 INFO L471 AbstractCegarLoop]: Abstraction has has 396 places, 391 transitions, 953 flow [2025-03-17 11:11:29,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 393.8333333333333) internal successors, (2363), 6 states have internal predecessors, (2363), 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-17 11:11:29,001 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:29,002 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:11:29,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 11:11:29,002 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-17 11:11:29,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:29,003 INFO L85 PathProgramCache]: Analyzing trace with hash 328261892, now seen corresponding path program 1 times [2025-03-17 11:11:29,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:29,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506055331] [2025-03-17 11:11:29,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:29,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:29,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-17 11:11:29,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-17 11:11:29,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:29,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:29,064 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-17 11:11:29,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:29,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506055331] [2025-03-17 11:11:29,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506055331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:29,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:29,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:29,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502599685] [2025-03-17 11:11:29,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:29,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:29,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:29,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:29,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:29,074 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 402 out of 427 [2025-03-17 11:11:29,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 391 transitions, 953 flow. Second operand has 3 states, 3 states have (on average 403.6666666666667) internal successors, (1211), 3 states have internal predecessors, (1211), 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-17 11:11:29,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:29,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 402 of 427 [2025-03-17 11:11:29,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:29,260 INFO L124 PetriNetUnfolderBase]: 62/1648 cut-off events. [2025-03-17 11:11:29,260 INFO L125 PetriNetUnfolderBase]: For 47/54 co-relation queries the response was YES. [2025-03-17 11:11:29,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1960 conditions, 1648 events. 62/1648 cut-off events. For 47/54 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 8993 event pairs, 7 based on Foata normal form. 0/1512 useless extension candidates. Maximal degree in co-relation 1738. Up to 76 conditions per place. [2025-03-17 11:11:29,270 INFO L140 encePairwiseOnDemand]: 423/427 looper letters, 12 selfloop transitions, 2 changer transitions 0/394 dead transitions. [2025-03-17 11:11:29,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 394 transitions, 990 flow [2025-03-17 11:11:29,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:29,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:29,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1222 transitions. [2025-03-17 11:11:29,276 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9539422326307572 [2025-03-17 11:11:29,276 INFO L175 Difference]: Start difference. First operand has 396 places, 391 transitions, 953 flow. Second operand 3 states and 1222 transitions. [2025-03-17 11:11:29,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 394 transitions, 990 flow [2025-03-17 11:11:29,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 391 places, 394 transitions, 978 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:11:29,280 INFO L231 Difference]: Finished difference. Result has 392 places, 391 transitions, 951 flow [2025-03-17 11:11:29,281 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=937, PETRI_DIFFERENCE_MINUEND_PLACES=389, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=389, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=387, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=951, PETRI_PLACES=392, PETRI_TRANSITIONS=391} [2025-03-17 11:11:29,281 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, 0 predicate places. [2025-03-17 11:11:29,281 INFO L471 AbstractCegarLoop]: Abstraction has has 392 places, 391 transitions, 951 flow [2025-03-17 11:11:29,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 403.6666666666667) internal successors, (1211), 3 states have internal predecessors, (1211), 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-17 11:11:29,282 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:29,282 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:11:29,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 11:11:29,282 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-17 11:11:29,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:29,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1586215830, now seen corresponding path program 1 times [2025-03-17 11:11:29,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:29,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953347079] [2025-03-17 11:11:29,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:29,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:29,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-17 11:11:29,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-17 11:11:29,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:29,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:29,351 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-17 11:11:29,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:29,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953347079] [2025-03-17 11:11:29,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953347079] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:29,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:29,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:29,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899309667] [2025-03-17 11:11:29,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:29,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:29,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:29,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:29,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:29,373 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 391 out of 427 [2025-03-17 11:11:29,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 391 transitions, 951 flow. Second operand has 3 states, 3 states have (on average 392.6666666666667) internal successors, (1178), 3 states have internal predecessors, (1178), 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-17 11:11:29,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:29,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 427 [2025-03-17 11:11:29,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:29,578 INFO L124 PetriNetUnfolderBase]: 84/1913 cut-off events. [2025-03-17 11:11:29,578 INFO L125 PetriNetUnfolderBase]: For 58/61 co-relation queries the response was YES. [2025-03-17 11:11:29,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2263 conditions, 1913 events. 84/1913 cut-off events. For 58/61 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 10768 event pairs, 15 based on Foata normal form. 4/1762 useless extension candidates. Maximal degree in co-relation 2041. Up to 84 conditions per place. [2025-03-17 11:11:29,592 INFO L140 encePairwiseOnDemand]: 415/427 looper letters, 10 selfloop transitions, 4 changer transitions 38/392 dead transitions. [2025-03-17 11:11:29,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 392 transitions, 998 flow [2025-03-17 11:11:29,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:29,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:29,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1200 transitions. [2025-03-17 11:11:29,594 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.936768149882904 [2025-03-17 11:11:29,594 INFO L175 Difference]: Start difference. First operand has 392 places, 391 transitions, 951 flow. Second operand 3 states and 1200 transitions. [2025-03-17 11:11:29,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 392 transitions, 998 flow [2025-03-17 11:11:29,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 392 transitions, 998 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:11:29,599 INFO L231 Difference]: Finished difference. Result has 391 places, 353 transitions, 894 flow [2025-03-17 11:11:29,600 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=941, PETRI_DIFFERENCE_MINUEND_PLACES=387, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=386, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=382, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=894, PETRI_PLACES=391, PETRI_TRANSITIONS=353} [2025-03-17 11:11:29,600 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -1 predicate places. [2025-03-17 11:11:29,600 INFO L471 AbstractCegarLoop]: Abstraction has has 391 places, 353 transitions, 894 flow [2025-03-17 11:11:29,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 392.6666666666667) internal successors, (1178), 3 states have internal predecessors, (1178), 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-17 11:11:29,601 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:29,601 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:11:29,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 11:11:29,601 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-17 11:11:29,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:29,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1756167531, now seen corresponding path program 1 times [2025-03-17 11:11:29,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:29,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191063347] [2025-03-17 11:11:29,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:29,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:29,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-03-17 11:11:29,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-03-17 11:11:29,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:29,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:29,693 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-17 11:11:29,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:29,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191063347] [2025-03-17 11:11:29,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191063347] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:29,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:29,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:11:29,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220841672] [2025-03-17 11:11:29,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:29,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:11:29,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:29,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:11:29,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:11:29,735 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 401 out of 427 [2025-03-17 11:11:29,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 353 transitions, 894 flow. Second operand has 4 states, 4 states have (on average 402.5) internal successors, (1610), 4 states have internal predecessors, (1610), 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-17 11:11:29,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:29,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 401 of 427 [2025-03-17 11:11:29,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:29,936 INFO L124 PetriNetUnfolderBase]: 64/1697 cut-off events. [2025-03-17 11:11:29,936 INFO L125 PetriNetUnfolderBase]: For 99/102 co-relation queries the response was YES. [2025-03-17 11:11:29,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2118 conditions, 1697 events. 64/1697 cut-off events. For 99/102 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 9981 event pairs, 25 based on Foata normal form. 0/1555 useless extension candidates. Maximal degree in co-relation 1894. Up to 76 conditions per place. [2025-03-17 11:11:29,948 INFO L140 encePairwiseOnDemand]: 422/427 looper letters, 15 selfloop transitions, 4 changer transitions 0/360 dead transitions. [2025-03-17 11:11:29,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 360 transitions, 947 flow [2025-03-17 11:11:29,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:11:29,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 11:11:29,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2025 transitions. [2025-03-17 11:11:29,951 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9484777517564403 [2025-03-17 11:11:29,951 INFO L175 Difference]: Start difference. First operand has 391 places, 353 transitions, 894 flow. Second operand 5 states and 2025 transitions. [2025-03-17 11:11:29,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 360 transitions, 947 flow [2025-03-17 11:11:29,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 360 transitions, 939 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:29,955 INFO L231 Difference]: Finished difference. Result has 362 places, 355 transitions, 911 flow [2025-03-17 11:11:29,956 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=911, PETRI_PLACES=362, PETRI_TRANSITIONS=355} [2025-03-17 11:11:29,956 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -30 predicate places. [2025-03-17 11:11:29,956 INFO L471 AbstractCegarLoop]: Abstraction has has 362 places, 355 transitions, 911 flow [2025-03-17 11:11:29,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 402.5) internal successors, (1610), 4 states have internal predecessors, (1610), 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-17 11:11:29,957 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:29,957 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:11:29,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 11:11:29,958 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-17 11:11:29,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:29,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1361199439, now seen corresponding path program 1 times [2025-03-17 11:11:29,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:29,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267791218] [2025-03-17 11:11:29,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:29,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:29,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-03-17 11:11:29,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-03-17 11:11:29,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:29,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:30,039 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-17 11:11:30,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:30,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267791218] [2025-03-17 11:11:30,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267791218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:30,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:30,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:30,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753245039] [2025-03-17 11:11:30,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:30,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:30,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:30,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:30,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:30,069 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 397 out of 427 [2025-03-17 11:11:30,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 355 transitions, 911 flow. Second operand has 3 states, 3 states have (on average 399.3333333333333) internal successors, (1198), 3 states have internal predecessors, (1198), 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-17 11:11:30,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:30,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 397 of 427 [2025-03-17 11:11:30,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:30,256 INFO L124 PetriNetUnfolderBase]: 85/1728 cut-off events. [2025-03-17 11:11:30,257 INFO L125 PetriNetUnfolderBase]: For 133/136 co-relation queries the response was YES. [2025-03-17 11:11:30,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2255 conditions, 1728 events. 85/1728 cut-off events. For 133/136 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 11077 event pairs, 46 based on Foata normal form. 0/1601 useless extension candidates. Maximal degree in co-relation 2029. Up to 135 conditions per place. [2025-03-17 11:11:30,268 INFO L140 encePairwiseOnDemand]: 424/427 looper letters, 11 selfloop transitions, 2 changer transitions 1/355 dead transitions. [2025-03-17 11:11:30,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 355 transitions, 940 flow [2025-03-17 11:11:30,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:30,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:30,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1204 transitions. [2025-03-17 11:11:30,270 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9398907103825137 [2025-03-17 11:11:30,271 INFO L175 Difference]: Start difference. First operand has 362 places, 355 transitions, 911 flow. Second operand 3 states and 1204 transitions. [2025-03-17 11:11:30,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 355 transitions, 940 flow [2025-03-17 11:11:30,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 355 transitions, 940 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:11:30,275 INFO L231 Difference]: Finished difference. Result has 363 places, 354 transitions, 913 flow [2025-03-17 11:11:30,276 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=909, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=913, PETRI_PLACES=363, PETRI_TRANSITIONS=354} [2025-03-17 11:11:30,276 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -29 predicate places. [2025-03-17 11:11:30,276 INFO L471 AbstractCegarLoop]: Abstraction has has 363 places, 354 transitions, 913 flow [2025-03-17 11:11:30,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 399.3333333333333) internal successors, (1198), 3 states have internal predecessors, (1198), 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-17 11:11:30,276 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:30,277 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:11:30,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 11:11:30,277 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-17 11:11:30,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:30,278 INFO L85 PathProgramCache]: Analyzing trace with hash -378594292, now seen corresponding path program 1 times [2025-03-17 11:11:30,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:30,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747389710] [2025-03-17 11:11:30,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:30,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:30,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-03-17 11:11:30,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-03-17 11:11:30,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:30,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:30,503 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-17 11:11:30,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:30,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747389710] [2025-03-17 11:11:30,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747389710] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:11:30,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768708873] [2025-03-17 11:11:30,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:30,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:11:30,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:11:30,505 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:11:30,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 11:11:30,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-03-17 11:11:30,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-03-17 11:11:30,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:30,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:30,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 11:11:30,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:11:30,865 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-17 11:11:30,865 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:11:31,005 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-17 11:11:31,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1768708873] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:11:31,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:11:31,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2025-03-17 11:11:31,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253595625] [2025-03-17 11:11:31,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:11:31,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-17 11:11:31,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:31,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-17 11:11:31,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2025-03-17 11:11:31,468 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 385 out of 427 [2025-03-17 11:11:31,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 354 transitions, 913 flow. Second operand has 22 states, 22 states have (on average 387.59090909090907) internal successors, (8527), 22 states have internal predecessors, (8527), 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-17 11:11:31,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:31,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 385 of 427 [2025-03-17 11:11:31,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:31,875 INFO L124 PetriNetUnfolderBase]: 21/1438 cut-off events. [2025-03-17 11:11:31,875 INFO L125 PetriNetUnfolderBase]: For 68/71 co-relation queries the response was YES. [2025-03-17 11:11:31,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1817 conditions, 1438 events. 21/1438 cut-off events. For 68/71 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 5726 event pairs, 5 based on Foata normal form. 4/1367 useless extension candidates. Maximal degree in co-relation 1708. Up to 19 conditions per place. [2025-03-17 11:11:31,884 INFO L140 encePairwiseOnDemand]: 407/427 looper letters, 23 selfloop transitions, 38 changer transitions 0/374 dead transitions. [2025-03-17 11:11:31,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 374 transitions, 1131 flow [2025-03-17 11:11:31,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 11:11:31,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-17 11:11:31,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 6610 transitions. [2025-03-17 11:11:31,892 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9105937456949993 [2025-03-17 11:11:31,893 INFO L175 Difference]: Start difference. First operand has 363 places, 354 transitions, 913 flow. Second operand 17 states and 6610 transitions. [2025-03-17 11:11:31,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 374 transitions, 1131 flow [2025-03-17 11:11:31,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 374 transitions, 1127 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:31,899 INFO L231 Difference]: Finished difference. Result has 380 places, 368 transitions, 1093 flow [2025-03-17 11:11:31,900 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=909, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1093, PETRI_PLACES=380, PETRI_TRANSITIONS=368} [2025-03-17 11:11:31,900 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -12 predicate places. [2025-03-17 11:11:31,900 INFO L471 AbstractCegarLoop]: Abstraction has has 380 places, 368 transitions, 1093 flow [2025-03-17 11:11:31,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 387.59090909090907) internal successors, (8527), 22 states have internal predecessors, (8527), 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-17 11:11:31,902 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:31,902 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:11:31,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 11:11:32,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-17 11:11:32,103 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-17 11:11:32,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:32,104 INFO L85 PathProgramCache]: Analyzing trace with hash 921258476, now seen corresponding path program 2 times [2025-03-17 11:11:32,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:32,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901253584] [2025-03-17 11:11:32,104 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:11:32,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:32,124 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 283 statements into 2 equivalence classes. [2025-03-17 11:11:32,127 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 133 of 283 statements. [2025-03-17 11:11:32,127 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 11:11:32,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:32,335 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2025-03-17 11:11:32,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:32,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901253584] [2025-03-17 11:11:32,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901253584] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:32,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:32,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:11:32,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593430980] [2025-03-17 11:11:32,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:32,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:11:32,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:32,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:11:32,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:11:32,541 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 391 out of 427 [2025-03-17 11:11:32,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 368 transitions, 1093 flow. Second operand has 6 states, 6 states have (on average 394.0) internal successors, (2364), 6 states have internal predecessors, (2364), 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-17 11:11:32,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:32,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 427 [2025-03-17 11:11:32,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:32,791 INFO L124 PetriNetUnfolderBase]: 64/1911 cut-off events. [2025-03-17 11:11:32,791 INFO L125 PetriNetUnfolderBase]: For 147/150 co-relation queries the response was YES. [2025-03-17 11:11:32,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2504 conditions, 1911 events. 64/1911 cut-off events. For 147/150 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 10021 event pairs, 13 based on Foata normal form. 0/1807 useless extension candidates. Maximal degree in co-relation 2308. Up to 80 conditions per place. [2025-03-17 11:11:32,802 INFO L140 encePairwiseOnDemand]: 421/427 looper letters, 19 selfloop transitions, 6 changer transitions 0/371 dead transitions. [2025-03-17 11:11:32,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 371 transitions, 1153 flow [2025-03-17 11:11:32,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:11:32,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:11:32,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2371 transitions. [2025-03-17 11:11:32,806 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9254488680718189 [2025-03-17 11:11:32,806 INFO L175 Difference]: Start difference. First operand has 380 places, 368 transitions, 1093 flow. Second operand 6 states and 2371 transitions. [2025-03-17 11:11:32,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 371 transitions, 1153 flow [2025-03-17 11:11:32,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 371 transitions, 1101 flow, removed 8 selfloop flow, removed 8 redundant places. [2025-03-17 11:11:32,811 INFO L231 Difference]: Finished difference. Result has 376 places, 367 transitions, 1051 flow [2025-03-17 11:11:32,811 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=1039, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=361, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1051, PETRI_PLACES=376, PETRI_TRANSITIONS=367} [2025-03-17 11:11:32,812 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -16 predicate places. [2025-03-17 11:11:32,812 INFO L471 AbstractCegarLoop]: Abstraction has has 376 places, 367 transitions, 1051 flow [2025-03-17 11:11:32,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 394.0) internal successors, (2364), 6 states have internal predecessors, (2364), 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-17 11:11:32,812 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:32,813 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:11:32,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 11:11:32,813 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-17 11:11:32,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:32,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1485765703, now seen corresponding path program 1 times [2025-03-17 11:11:32,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:32,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723641048] [2025-03-17 11:11:32,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:32,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:32,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 285 statements into 1 equivalence classes. [2025-03-17 11:11:32,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 285 of 285 statements. [2025-03-17 11:11:32,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:32,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:33,446 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2025-03-17 11:11:33,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:33,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723641048] [2025-03-17 11:11:33,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723641048] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:33,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:33,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:11:33,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666648618] [2025-03-17 11:11:33,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:33,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:11:33,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:33,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:11:33,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:11:33,633 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 391 out of 427 [2025-03-17 11:11:33,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 367 transitions, 1051 flow. Second operand has 6 states, 6 states have (on average 393.8333333333333) internal successors, (2363), 6 states have internal predecessors, (2363), 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-17 11:11:33,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:33,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 427 [2025-03-17 11:11:33,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:33,849 INFO L124 PetriNetUnfolderBase]: 36/1532 cut-off events. [2025-03-17 11:11:33,849 INFO L125 PetriNetUnfolderBase]: For 113/116 co-relation queries the response was YES. [2025-03-17 11:11:33,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2038 conditions, 1532 events. 36/1532 cut-off events. For 113/116 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 6528 event pairs, 7 based on Foata normal form. 0/1461 useless extension candidates. Maximal degree in co-relation 1932. Up to 70 conditions per place. [2025-03-17 11:11:33,856 INFO L140 encePairwiseOnDemand]: 421/427 looper letters, 19 selfloop transitions, 6 changer transitions 0/370 dead transitions. [2025-03-17 11:11:33,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 370 transitions, 1111 flow [2025-03-17 11:11:33,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:11:33,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:11:33,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2371 transitions. [2025-03-17 11:11:33,858 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9254488680718189 [2025-03-17 11:11:33,858 INFO L175 Difference]: Start difference. First operand has 376 places, 367 transitions, 1051 flow. Second operand 6 states and 2371 transitions. [2025-03-17 11:11:33,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 370 transitions, 1111 flow [2025-03-17 11:11:33,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 370 transitions, 1099 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:11:33,864 INFO L231 Difference]: Finished difference. Result has 375 places, 366 transitions, 1049 flow [2025-03-17 11:11:33,865 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=1037, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1049, PETRI_PLACES=375, PETRI_TRANSITIONS=366} [2025-03-17 11:11:33,865 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -17 predicate places. [2025-03-17 11:11:33,865 INFO L471 AbstractCegarLoop]: Abstraction has has 375 places, 366 transitions, 1049 flow [2025-03-17 11:11:33,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 393.8333333333333) internal successors, (2363), 6 states have internal predecessors, (2363), 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-17 11:11:33,866 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:33,866 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:11:33,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 11:11:33,867 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-17 11:11:33,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:33,867 INFO L85 PathProgramCache]: Analyzing trace with hash -631058351, now seen corresponding path program 1 times [2025-03-17 11:11:33,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:33,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271353568] [2025-03-17 11:11:33,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:33,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:33,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 291 statements into 1 equivalence classes. [2025-03-17 11:11:33,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 291 of 291 statements. [2025-03-17 11:11:33,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:33,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:34,441 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2025-03-17 11:11:34,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:34,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271353568] [2025-03-17 11:11:34,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271353568] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:34,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:34,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:11:34,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182118997] [2025-03-17 11:11:34,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:34,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:11:34,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:34,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:11:34,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:11:34,604 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 391 out of 427 [2025-03-17 11:11:34,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 366 transitions, 1049 flow. Second operand has 6 states, 6 states have (on average 394.0) internal successors, (2364), 6 states have internal predecessors, (2364), 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-17 11:11:34,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:34,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 427 [2025-03-17 11:11:34,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:34,835 INFO L124 PetriNetUnfolderBase]: 64/1857 cut-off events. [2025-03-17 11:11:34,835 INFO L125 PetriNetUnfolderBase]: For 163/166 co-relation queries the response was YES. [2025-03-17 11:11:34,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2475 conditions, 1857 events. 64/1857 cut-off events. For 163/166 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 9831 event pairs, 13 based on Foata normal form. 0/1776 useless extension candidates. Maximal degree in co-relation 2279. Up to 80 conditions per place. [2025-03-17 11:11:34,847 INFO L140 encePairwiseOnDemand]: 421/427 looper letters, 19 selfloop transitions, 6 changer transitions 0/369 dead transitions. [2025-03-17 11:11:34,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 369 transitions, 1109 flow [2025-03-17 11:11:34,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:11:34,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:11:34,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2371 transitions. [2025-03-17 11:11:34,849 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9254488680718189 [2025-03-17 11:11:34,849 INFO L175 Difference]: Start difference. First operand has 375 places, 366 transitions, 1049 flow. Second operand 6 states and 2371 transitions. [2025-03-17 11:11:34,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 369 transitions, 1109 flow [2025-03-17 11:11:34,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 369 transitions, 1097 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:11:34,854 INFO L231 Difference]: Finished difference. Result has 374 places, 365 transitions, 1047 flow [2025-03-17 11:11:34,855 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=1035, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1047, PETRI_PLACES=374, PETRI_TRANSITIONS=365} [2025-03-17 11:11:34,855 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -18 predicate places. [2025-03-17 11:11:34,855 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 365 transitions, 1047 flow [2025-03-17 11:11:34,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 394.0) internal successors, (2364), 6 states have internal predecessors, (2364), 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-17 11:11:34,856 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:34,856 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:11:34,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 11:11:34,856 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-17 11:11:34,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:34,857 INFO L85 PathProgramCache]: Analyzing trace with hash -898871946, now seen corresponding path program 1 times [2025-03-17 11:11:34,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:34,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589968279] [2025-03-17 11:11:34,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:34,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:34,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-03-17 11:11:34,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-03-17 11:11:34,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:34,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:34,928 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2025-03-17 11:11:34,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:34,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589968279] [2025-03-17 11:11:34,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589968279] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:34,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:34,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:34,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026923642] [2025-03-17 11:11:34,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:34,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:34,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:34,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:34,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:34,952 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 397 out of 427 [2025-03-17 11:11:34,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 365 transitions, 1047 flow. Second operand has 3 states, 3 states have (on average 398.6666666666667) internal successors, (1196), 3 states have internal predecessors, (1196), 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-17 11:11:34,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:34,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 397 of 427 [2025-03-17 11:11:34,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:35,117 INFO L124 PetriNetUnfolderBase]: 42/1534 cut-off events. [2025-03-17 11:11:35,117 INFO L125 PetriNetUnfolderBase]: For 113/113 co-relation queries the response was YES. [2025-03-17 11:11:35,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2040 conditions, 1534 events. 42/1534 cut-off events. For 113/113 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 6615 event pairs, 17 based on Foata normal form. 0/1484 useless extension candidates. Maximal degree in co-relation 1934. Up to 79 conditions per place. [2025-03-17 11:11:35,127 INFO L140 encePairwiseOnDemand]: 424/427 looper letters, 11 selfloop transitions, 3 changer transitions 0/365 dead transitions. [2025-03-17 11:11:35,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 365 transitions, 1076 flow [2025-03-17 11:11:35,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:35,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:35,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1204 transitions. [2025-03-17 11:11:35,129 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9398907103825137 [2025-03-17 11:11:35,129 INFO L175 Difference]: Start difference. First operand has 374 places, 365 transitions, 1047 flow. Second operand 3 states and 1204 transitions. [2025-03-17 11:11:35,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 365 transitions, 1076 flow [2025-03-17 11:11:35,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 365 transitions, 1064 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:11:35,133 INFO L231 Difference]: Finished difference. Result has 370 places, 364 transitions, 1039 flow [2025-03-17 11:11:35,134 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=1033, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=361, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1039, PETRI_PLACES=370, PETRI_TRANSITIONS=364} [2025-03-17 11:11:35,134 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -22 predicate places. [2025-03-17 11:11:35,134 INFO L471 AbstractCegarLoop]: Abstraction has has 370 places, 364 transitions, 1039 flow [2025-03-17 11:11:35,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 398.6666666666667) internal successors, (1196), 3 states have internal predecessors, (1196), 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-17 11:11:35,135 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:35,135 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:11:35,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 11:11:35,135 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-17 11:11:35,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:35,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1889247136, now seen corresponding path program 1 times [2025-03-17 11:11:35,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:35,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665934560] [2025-03-17 11:11:35,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:35,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:35,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 317 statements into 1 equivalence classes. [2025-03-17 11:11:35,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 317 of 317 statements. [2025-03-17 11:11:35,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:35,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:35,207 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2025-03-17 11:11:35,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:35,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665934560] [2025-03-17 11:11:35,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665934560] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:35,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:35,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:35,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041642947] [2025-03-17 11:11:35,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:35,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:35,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:35,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:35,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:35,237 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 397 out of 427 [2025-03-17 11:11:35,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 364 transitions, 1039 flow. Second operand has 3 states, 3 states have (on average 399.0) internal successors, (1197), 3 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:35,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:35,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 397 of 427 [2025-03-17 11:11:35,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:35,427 INFO L124 PetriNetUnfolderBase]: 76/1736 cut-off events. [2025-03-17 11:11:35,427 INFO L125 PetriNetUnfolderBase]: For 171/174 co-relation queries the response was YES. [2025-03-17 11:11:35,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2317 conditions, 1736 events. 76/1736 cut-off events. For 171/174 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 10058 event pairs, 43 based on Foata normal form. 0/1663 useless extension candidates. Maximal degree in co-relation 2086. Up to 127 conditions per place. [2025-03-17 11:11:35,439 INFO L140 encePairwiseOnDemand]: 424/427 looper letters, 0 selfloop transitions, 0 changer transitions 364/364 dead transitions. [2025-03-17 11:11:35,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 364 transitions, 1068 flow [2025-03-17 11:11:35,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:35,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:35,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1204 transitions. [2025-03-17 11:11:35,440 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9398907103825137 [2025-03-17 11:11:35,440 INFO L175 Difference]: Start difference. First operand has 370 places, 364 transitions, 1039 flow. Second operand 3 states and 1204 transitions. [2025-03-17 11:11:35,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 364 transitions, 1068 flow [2025-03-17 11:11:35,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 364 transitions, 1062 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:35,445 INFO L231 Difference]: Finished difference. Result has 369 places, 0 transitions, 0 flow [2025-03-17 11:11:35,445 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=1031, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=369, PETRI_TRANSITIONS=0} [2025-03-17 11:11:35,445 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -23 predicate places. [2025-03-17 11:11:35,445 INFO L471 AbstractCegarLoop]: Abstraction has has 369 places, 0 transitions, 0 flow [2025-03-17 11:11:35,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 399.0) internal successors, (1197), 3 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:35,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (57 of 58 remaining) [2025-03-17 11:11:35,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (56 of 58 remaining) [2025-03-17 11:11:35,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (55 of 58 remaining) [2025-03-17 11:11:35,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (54 of 58 remaining) [2025-03-17 11:11:35,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (53 of 58 remaining) [2025-03-17 11:11:35,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (52 of 58 remaining) [2025-03-17 11:11:35,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (51 of 58 remaining) [2025-03-17 11:11:35,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (50 of 58 remaining) [2025-03-17 11:11:35,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (49 of 58 remaining) [2025-03-17 11:11:35,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (48 of 58 remaining) [2025-03-17 11:11:35,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (47 of 58 remaining) [2025-03-17 11:11:35,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (46 of 58 remaining) [2025-03-17 11:11:35,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (45 of 58 remaining) [2025-03-17 11:11:35,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (44 of 58 remaining) [2025-03-17 11:11:35,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (43 of 58 remaining) [2025-03-17 11:11:35,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (42 of 58 remaining) [2025-03-17 11:11:35,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (41 of 58 remaining) [2025-03-17 11:11:35,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (40 of 58 remaining) [2025-03-17 11:11:35,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (39 of 58 remaining) [2025-03-17 11:11:35,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (38 of 58 remaining) [2025-03-17 11:11:35,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (37 of 58 remaining) [2025-03-17 11:11:35,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (36 of 58 remaining) [2025-03-17 11:11:35,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (35 of 58 remaining) [2025-03-17 11:11:35,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (34 of 58 remaining) [2025-03-17 11:11:35,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (33 of 58 remaining) [2025-03-17 11:11:35,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (32 of 58 remaining) [2025-03-17 11:11:35,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (31 of 58 remaining) [2025-03-17 11:11:35,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (30 of 58 remaining) [2025-03-17 11:11:35,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (29 of 58 remaining) [2025-03-17 11:11:35,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (28 of 58 remaining) [2025-03-17 11:11:35,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (27 of 58 remaining) [2025-03-17 11:11:35,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (26 of 58 remaining) [2025-03-17 11:11:35,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (25 of 58 remaining) [2025-03-17 11:11:35,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (24 of 58 remaining) [2025-03-17 11:11:35,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 58 remaining) [2025-03-17 11:11:35,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 58 remaining) [2025-03-17 11:11:35,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (21 of 58 remaining) [2025-03-17 11:11:35,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (20 of 58 remaining) [2025-03-17 11:11:35,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (19 of 58 remaining) [2025-03-17 11:11:35,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (18 of 58 remaining) [2025-03-17 11:11:35,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (17 of 58 remaining) [2025-03-17 11:11:35,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (16 of 58 remaining) [2025-03-17 11:11:35,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (15 of 58 remaining) [2025-03-17 11:11:35,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (14 of 58 remaining) [2025-03-17 11:11:35,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (13 of 58 remaining) [2025-03-17 11:11:35,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (12 of 58 remaining) [2025-03-17 11:11:35,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (11 of 58 remaining) [2025-03-17 11:11:35,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (10 of 58 remaining) [2025-03-17 11:11:35,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (9 of 58 remaining) [2025-03-17 11:11:35,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (8 of 58 remaining) [2025-03-17 11:11:35,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (7 of 58 remaining) [2025-03-17 11:11:35,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (6 of 58 remaining) [2025-03-17 11:11:35,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (5 of 58 remaining) [2025-03-17 11:11:35,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (4 of 58 remaining) [2025-03-17 11:11:35,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (3 of 58 remaining) [2025-03-17 11:11:35,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (2 of 58 remaining) [2025-03-17 11:11:35,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (1 of 58 remaining) [2025-03-17 11:11:35,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (0 of 58 remaining) [2025-03-17 11:11:35,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-17 11:11:35,453 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:11:35,457 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-17 11:11:35,458 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 11:11:35,463 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 11:11:35 BasicIcfg [2025-03-17 11:11:35,464 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 11:11:35,465 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 11:11:35,465 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 11:11:35,465 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 11:11:35,466 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:11:22" (3/4) ... [2025-03-17 11:11:35,467 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 11:11:35,470 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-17 11:11:35,470 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-17 11:11:35,474 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2025-03-17 11:11:35,475 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-17 11:11:35,475 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 11:11:35,475 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 11:11:35,545 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 11:11:35,545 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 11:11:35,546 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 11:11:35,547 INFO L158 Benchmark]: Toolchain (without parser) took 13515.62ms. Allocated memory was 142.6MB in the beginning and 629.1MB in the end (delta: 486.5MB). Free memory was 113.7MB in the beginning and 295.8MB in the end (delta: -182.2MB). Peak memory consumption was 299.1MB. Max. memory is 16.1GB. [2025-03-17 11:11:35,547 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:11:35,548 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.17ms. Allocated memory is still 142.6MB. Free memory was 113.7MB in the beginning and 100.7MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 11:11:35,548 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.57ms. Allocated memory is still 142.6MB. Free memory was 100.7MB in the beginning and 98.2MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 11:11:35,548 INFO L158 Benchmark]: Boogie Preprocessor took 43.68ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 96.0MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:11:35,548 INFO L158 Benchmark]: IcfgBuilder took 547.46ms. Allocated memory is still 142.6MB. Free memory was 96.0MB in the beginning and 65.1MB in the end (delta: 30.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 11:11:35,549 INFO L158 Benchmark]: TraceAbstraction took 12557.45ms. Allocated memory was 142.6MB in the beginning and 629.1MB in the end (delta: 486.5MB). Free memory was 64.7MB in the beginning and 300.0MB in the end (delta: -235.3MB). Peak memory consumption was 248.8MB. Max. memory is 16.1GB. [2025-03-17 11:11:35,549 INFO L158 Benchmark]: Witness Printer took 81.19ms. Allocated memory is still 629.1MB. Free memory was 300.0MB in the beginning and 295.8MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:11:35,550 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 228.17ms. Allocated memory is still 142.6MB. Free memory was 113.7MB in the beginning and 100.7MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.57ms. Allocated memory is still 142.6MB. Free memory was 100.7MB in the beginning and 98.2MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.68ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 96.0MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 547.46ms. Allocated memory is still 142.6MB. Free memory was 96.0MB in the beginning and 65.1MB in the end (delta: 30.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 12557.45ms. Allocated memory was 142.6MB in the beginning and 629.1MB in the end (delta: 486.5MB). Free memory was 64.7MB in the beginning and 300.0MB in the end (delta: -235.3MB). Peak memory consumption was 248.8MB. Max. memory is 16.1GB. * Witness Printer took 81.19ms. Allocated memory is still 629.1MB. Free memory was 300.0MB in the beginning and 295.8MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 606 locations, 637 edges, 58 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 12.4s, OverallIterations: 26, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2586 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1721 mSDsluCounter, 1226 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 920 mSDsCounter, 371 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4185 IncrementalHoareTripleChecker+Invalid, 4556 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 371 mSolverCounterUnsat, 306 mSDtfsCounter, 4185 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 875 GetRequests, 768 SyntacticMatches, 5 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1093occurred in iteration=21, InterpolantAutomatonStates: 121, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 4765 NumberOfCodeBlocks, 4525 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 5115 ConstructedInterpolants, 0 QuantifiedInterpolants, 6924 SizeOfPredicates, 14 NumberOfNonLiveVariables, 856 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 30 InterpolantComputations, 24 PerfectInterpolantSequences, 2178/2325 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 34 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-17 11:11:35,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE