./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/parallel-ticket-5.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/parallel-ticket-5.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 9c69d99d457f457373aeec8cf091a3652593de03a43f690cddfeb4bfa1e12a5f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:54:45,429 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:54:45,489 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:54:45,492 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:54:45,496 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:54:45,511 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:54:45,512 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:54:45,513 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:54:45,513 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:54:45,513 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:54:45,513 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:54:45,514 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:54:45,514 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:54:45,514 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:54:45,514 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:54:45,514 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:54:45,514 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:54:45,514 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:54:45,514 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:54:45,514 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:54:45,514 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:54:45,514 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:54:45,514 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:54:45,514 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:54:45,514 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:54:45,514 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:54:45,514 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:54:45,515 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:54:45,515 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:54:45,515 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:54:45,515 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:54:45,515 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:54:45,516 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:54:45,516 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:54:45,516 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:54:45,516 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:54:45,516 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:54:45,516 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:54:45,516 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:54:45,516 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:54:45,516 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:54:45,516 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:54:45,516 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 -> 9c69d99d457f457373aeec8cf091a3652593de03a43f690cddfeb4bfa1e12a5f [2025-03-04 06:54:45,720 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:54:45,725 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:54:45,727 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:54:45,728 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:54:45,728 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:54:45,729 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-ticket-5.wvr.c [2025-03-04 06:54:46,833 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7b74c825/62df6f69050f4df6ae2eaab6a2ab5341/FLAG84ad21dcc [2025-03-04 06:54:47,056 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:54:47,057 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-ticket-5.wvr.c [2025-03-04 06:54:47,076 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7b74c825/62df6f69050f4df6ae2eaab6a2ab5341/FLAG84ad21dcc [2025-03-04 06:54:47,096 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7b74c825/62df6f69050f4df6ae2eaab6a2ab5341 [2025-03-04 06:54:47,098 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:54:47,099 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:54:47,100 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:54:47,100 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:54:47,103 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:54:47,103 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:54:47" (1/1) ... [2025-03-04 06:54:47,104 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46d9cf6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:54:47, skipping insertion in model container [2025-03-04 06:54:47,104 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:54:47" (1/1) ... [2025-03-04 06:54:47,119 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:54:47,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:54:47,254 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:54:47,277 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:54:47,293 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:54:47,295 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:54:47 WrapperNode [2025-03-04 06:54:47,295 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:54:47,296 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:54:47,296 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:54:47,296 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:54:47,303 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:54:47" (1/1) ... [2025-03-04 06:54:47,308 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:54:47" (1/1) ... [2025-03-04 06:54:47,330 INFO L138 Inliner]: procedures = 21, calls = 19, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 256 [2025-03-04 06:54:47,333 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:54:47,333 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:54:47,334 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:54:47,334 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:54:47,339 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:54:47" (1/1) ... [2025-03-04 06:54:47,339 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:54:47" (1/1) ... [2025-03-04 06:54:47,341 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:54:47" (1/1) ... [2025-03-04 06:54:47,344 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:54:47" (1/1) ... [2025-03-04 06:54:47,349 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:54:47" (1/1) ... [2025-03-04 06:54:47,352 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:54:47" (1/1) ... [2025-03-04 06:54:47,353 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:54:47" (1/1) ... [2025-03-04 06:54:47,357 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:54:47" (1/1) ... [2025-03-04 06:54:47,359 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:54:47,359 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:54:47,359 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:54:47,359 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:54:47,360 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:54:47" (1/1) ... [2025-03-04 06:54:47,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:54:47,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:54:47,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-04 06:54:47,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-04 06:54:47,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:54:47,399 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 06:54:47,399 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 06:54:47,399 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 06:54:47,399 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 06:54:47,399 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 06:54:47,399 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 06:54:47,400 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-04 06:54:47,400 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-04 06:54:47,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:54:47,400 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-03-04 06:54:47,400 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-03-04 06:54:47,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:54:47,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:54:47,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-04 06:54:47,481 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:54:47,483 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:54:47,794 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:54:47,794 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:54:47,829 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:54:47,830 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:54:47,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:54:47 BoogieIcfgContainer [2025-03-04 06:54:47,830 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:54:47,832 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:54:47,832 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:54:47,835 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:54:47,835 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:54:47" (1/3) ... [2025-03-04 06:54:47,836 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@564f3c52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:54:47, skipping insertion in model container [2025-03-04 06:54:47,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:54:47" (2/3) ... [2025-03-04 06:54:47,837 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@564f3c52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:54:47, skipping insertion in model container [2025-03-04 06:54:47,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:54:47" (3/3) ... [2025-03-04 06:54:47,838 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-ticket-5.wvr.c [2025-03-04 06:54:47,851 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:54:47,852 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-ticket-5.wvr.c that has 6 procedures, 271 locations, 1 initial locations, 0 loop locations, and 15 error locations. [2025-03-04 06:54:47,854 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:54:47,940 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2025-03-04 06:54:47,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 286 places, 281 transitions, 597 flow [2025-03-04 06:54:48,053 INFO L124 PetriNetUnfolderBase]: 11/276 cut-off events. [2025-03-04 06:54:48,055 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-04 06:54:48,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 297 conditions, 276 events. 11/276 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 492 event pairs, 0 based on Foata normal form. 0/250 useless extension candidates. Maximal degree in co-relation 233. Up to 2 conditions per place. [2025-03-04 06:54:48,063 INFO L82 GeneralOperation]: Start removeDead. Operand has 286 places, 281 transitions, 597 flow [2025-03-04 06:54:48,072 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 265 places, 259 transitions, 545 flow [2025-03-04 06:54:48,079 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:54:48,090 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;@2ab59e01, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:54:48,090 INFO L334 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2025-03-04 06:54:48,116 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:54:48,117 INFO L124 PetriNetUnfolderBase]: 0/28 cut-off events. [2025-03-04 06:54:48,117 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:54:48,117 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:54:48,118 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] [2025-03-04 06:54:48,119 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-04 06:54:48,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:54:48,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1517675666, now seen corresponding path program 1 times [2025-03-04 06:54:48,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:54:48,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970760205] [2025-03-04 06:54:48,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:54:48,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:54:48,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 06:54:48,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 06:54:48,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:54:48,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:54:48,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:54:48,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:54:48,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970760205] [2025-03-04 06:54:48,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970760205] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:54:48,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:54:48,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:54:48,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479898147] [2025-03-04 06:54:48,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:54:48,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:54:48,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:54:48,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:54:48,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:54:48,293 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 281 [2025-03-04 06:54:48,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 259 transitions, 545 flow. Second operand has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:54:48,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:54:48,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 281 [2025-03-04 06:54:48,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:54:51,224 INFO L124 PetriNetUnfolderBase]: 8140/22951 cut-off events. [2025-03-04 06:54:51,225 INFO L125 PetriNetUnfolderBase]: For 1237/1237 co-relation queries the response was YES. [2025-03-04 06:54:51,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34557 conditions, 22951 events. 8140/22951 cut-off events. For 1237/1237 co-relation queries the response was YES. Maximal size of possible extension queue 849. Compared 261196 event pairs, 5691 based on Foata normal form. 1950/21769 useless extension candidates. Maximal degree in co-relation 33945. Up to 10336 conditions per place. [2025-03-04 06:54:51,417 INFO L140 encePairwiseOnDemand]: 272/281 looper letters, 34 selfloop transitions, 2 changer transitions 1/252 dead transitions. [2025-03-04 06:54:51,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 252 transitions, 603 flow [2025-03-04 06:54:51,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:54:51,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:54:51,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 745 transitions. [2025-03-04 06:54:51,431 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8837485172004745 [2025-03-04 06:54:51,434 INFO L175 Difference]: Start difference. First operand has 265 places, 259 transitions, 545 flow. Second operand 3 states and 745 transitions. [2025-03-04 06:54:51,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 252 transitions, 603 flow [2025-03-04 06:54:51,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 252 transitions, 586 flow, removed 0 selfloop flow, removed 9 redundant places. [2025-03-04 06:54:51,447 INFO L231 Difference]: Finished difference. Result has 257 places, 251 transitions, 516 flow [2025-03-04 06:54:51,450 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=516, PETRI_PLACES=257, PETRI_TRANSITIONS=251} [2025-03-04 06:54:51,454 INFO L279 CegarLoopForPetriNet]: 265 programPoint places, -8 predicate places. [2025-03-04 06:54:51,455 INFO L471 AbstractCegarLoop]: Abstraction has has 257 places, 251 transitions, 516 flow [2025-03-04 06:54:51,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:54:51,456 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:54:51,456 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:54:51,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:54:51,457 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-04 06:54:51,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:54:51,458 INFO L85 PathProgramCache]: Analyzing trace with hash -879484758, now seen corresponding path program 1 times [2025-03-04 06:54:51,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:54:51,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747235644] [2025-03-04 06:54:51,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:54:51,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:54:51,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 06:54:51,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 06:54:51,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:54:51,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:54:51,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:54:51,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:54:51,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747235644] [2025-03-04 06:54:51,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747235644] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:54:51,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:54:51,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:54:51,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238908338] [2025-03-04 06:54:51,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:54:51,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:54:51,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:54:51,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:54:51,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:54:51,546 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 281 [2025-03-04 06:54:51,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 251 transitions, 516 flow. Second operand has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:54:51,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:54:51,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 281 [2025-03-04 06:54:51,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:54:54,094 INFO L124 PetriNetUnfolderBase]: 9181/24265 cut-off events. [2025-03-04 06:54:54,095 INFO L125 PetriNetUnfolderBase]: For 358/358 co-relation queries the response was YES. [2025-03-04 06:54:54,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36917 conditions, 24265 events. 9181/24265 cut-off events. For 358/358 co-relation queries the response was YES. Maximal size of possible extension queue 888. Compared 270499 event pairs, 6649 based on Foata normal form. 0/21005 useless extension candidates. Maximal degree in co-relation 36881. Up to 11675 conditions per place. [2025-03-04 06:54:54,278 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 34 selfloop transitions, 2 changer transitions 0/250 dead transitions. [2025-03-04 06:54:54,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 250 transitions, 586 flow [2025-03-04 06:54:54,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:54:54,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:54:54,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 739 transitions. [2025-03-04 06:54:54,284 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8766310794780545 [2025-03-04 06:54:54,284 INFO L175 Difference]: Start difference. First operand has 257 places, 251 transitions, 516 flow. Second operand 3 states and 739 transitions. [2025-03-04 06:54:54,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 250 transitions, 586 flow [2025-03-04 06:54:54,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 250 transitions, 582 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:54:54,289 INFO L231 Difference]: Finished difference. Result has 255 places, 250 transitions, 514 flow [2025-03-04 06:54:54,289 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=514, PETRI_PLACES=255, PETRI_TRANSITIONS=250} [2025-03-04 06:54:54,290 INFO L279 CegarLoopForPetriNet]: 265 programPoint places, -10 predicate places. [2025-03-04 06:54:54,290 INFO L471 AbstractCegarLoop]: Abstraction has has 255 places, 250 transitions, 514 flow [2025-03-04 06:54:54,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:54:54,293 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:54:54,293 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] [2025-03-04 06:54:54,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:54:54,293 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-04 06:54:54,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:54:54,294 INFO L85 PathProgramCache]: Analyzing trace with hash -2059546307, now seen corresponding path program 1 times [2025-03-04 06:54:54,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:54:54,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387791092] [2025-03-04 06:54:54,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:54:54,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:54:54,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 06:54:54,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 06:54:54,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:54:54,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:54:54,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:54:54,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:54:54,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387791092] [2025-03-04 06:54:54,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387791092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:54:54,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:54:54,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:54:54,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055600322] [2025-03-04 06:54:54,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:54:54,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:54:54,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:54:54,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:54:54,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:54:54,381 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 281 [2025-03-04 06:54:54,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 250 transitions, 514 flow. Second operand has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:54:54,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:54:54,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 281 [2025-03-04 06:54:54,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:54:56,546 INFO L124 PetriNetUnfolderBase]: 9267/24292 cut-off events. [2025-03-04 06:54:56,546 INFO L125 PetriNetUnfolderBase]: For 375/375 co-relation queries the response was YES. [2025-03-04 06:54:56,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37061 conditions, 24292 events. 9267/24292 cut-off events. For 375/375 co-relation queries the response was YES. Maximal size of possible extension queue 914. Compared 270432 event pairs, 6740 based on Foata normal form. 0/20919 useless extension candidates. Maximal degree in co-relation 37017. Up to 11781 conditions per place. [2025-03-04 06:54:56,699 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 34 selfloop transitions, 2 changer transitions 0/249 dead transitions. [2025-03-04 06:54:56,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 249 transitions, 584 flow [2025-03-04 06:54:56,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:54:56,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:54:56,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 739 transitions. [2025-03-04 06:54:56,701 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8766310794780545 [2025-03-04 06:54:56,701 INFO L175 Difference]: Start difference. First operand has 255 places, 250 transitions, 514 flow. Second operand 3 states and 739 transitions. [2025-03-04 06:54:56,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 249 transitions, 584 flow [2025-03-04 06:54:56,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 249 transitions, 580 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:54:56,704 INFO L231 Difference]: Finished difference. Result has 254 places, 249 transitions, 512 flow [2025-03-04 06:54:56,705 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=512, PETRI_PLACES=254, PETRI_TRANSITIONS=249} [2025-03-04 06:54:56,705 INFO L279 CegarLoopForPetriNet]: 265 programPoint places, -11 predicate places. [2025-03-04 06:54:56,705 INFO L471 AbstractCegarLoop]: Abstraction has has 254 places, 249 transitions, 512 flow [2025-03-04 06:54:56,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:54:56,706 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:54:56,706 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] [2025-03-04 06:54:56,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:54:56,706 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-04 06:54:56,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:54:56,707 INFO L85 PathProgramCache]: Analyzing trace with hash -702689454, now seen corresponding path program 1 times [2025-03-04 06:54:56,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:54:56,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913441129] [2025-03-04 06:54:56,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:54:56,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:54:56,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 06:54:56,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 06:54:56,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:54:56,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:54:56,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:54:56,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:54:56,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913441129] [2025-03-04 06:54:56,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913441129] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:54:56,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:54:56,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:54:56,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185779270] [2025-03-04 06:54:56,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:54:56,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:54:56,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:54:56,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:54:56,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:54:56,775 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 281 [2025-03-04 06:54:56,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 249 transitions, 512 flow. Second operand has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:54:56,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:54:56,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 281 [2025-03-04 06:54:56,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:54:58,982 INFO L124 PetriNetUnfolderBase]: 9706/21096 cut-off events. [2025-03-04 06:54:58,983 INFO L125 PetriNetUnfolderBase]: For 417/417 co-relation queries the response was YES. [2025-03-04 06:54:59,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34356 conditions, 21096 events. 9706/21096 cut-off events. For 417/417 co-relation queries the response was YES. Maximal size of possible extension queue 886. Compared 205241 event pairs, 7189 based on Foata normal form. 0/18384 useless extension candidates. Maximal degree in co-relation 34304. Up to 12334 conditions per place. [2025-03-04 06:54:59,112 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 34 selfloop transitions, 2 changer transitions 0/248 dead transitions. [2025-03-04 06:54:59,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 248 transitions, 582 flow [2025-03-04 06:54:59,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:54:59,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:54:59,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 739 transitions. [2025-03-04 06:54:59,114 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8766310794780545 [2025-03-04 06:54:59,114 INFO L175 Difference]: Start difference. First operand has 254 places, 249 transitions, 512 flow. Second operand 3 states and 739 transitions. [2025-03-04 06:54:59,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 248 transitions, 582 flow [2025-03-04 06:54:59,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 248 transitions, 578 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:54:59,117 INFO L231 Difference]: Finished difference. Result has 253 places, 248 transitions, 510 flow [2025-03-04 06:54:59,118 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=510, PETRI_PLACES=253, PETRI_TRANSITIONS=248} [2025-03-04 06:54:59,118 INFO L279 CegarLoopForPetriNet]: 265 programPoint places, -12 predicate places. [2025-03-04 06:54:59,118 INFO L471 AbstractCegarLoop]: Abstraction has has 253 places, 248 transitions, 510 flow [2025-03-04 06:54:59,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:54:59,119 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:54:59,119 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] [2025-03-04 06:54:59,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:54:59,119 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-04 06:54:59,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:54:59,120 INFO L85 PathProgramCache]: Analyzing trace with hash -855494839, now seen corresponding path program 1 times [2025-03-04 06:54:59,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:54:59,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407466592] [2025-03-04 06:54:59,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:54:59,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:54:59,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 06:54:59,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 06:54:59,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:54:59,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:54:59,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:54:59,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:54:59,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407466592] [2025-03-04 06:54:59,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407466592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:54:59,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:54:59,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:54:59,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539696438] [2025-03-04 06:54:59,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:54:59,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:54:59,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:54:59,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:54:59,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:54:59,194 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 281 [2025-03-04 06:54:59,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 248 transitions, 510 flow. Second operand has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:54:59,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:54:59,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 281 [2025-03-04 06:54:59,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:01,054 INFO L124 PetriNetUnfolderBase]: 8685/22770 cut-off events. [2025-03-04 06:55:01,054 INFO L125 PetriNetUnfolderBase]: For 375/375 co-relation queries the response was YES. [2025-03-04 06:55:01,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34475 conditions, 22770 events. 8685/22770 cut-off events. For 375/375 co-relation queries the response was YES. Maximal size of possible extension queue 849. Compared 248555 event pairs, 6215 based on Foata normal form. 0/19671 useless extension candidates. Maximal degree in co-relation 34415. Up to 11049 conditions per place. [2025-03-04 06:55:01,419 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 34 selfloop transitions, 2 changer transitions 0/247 dead transitions. [2025-03-04 06:55:01,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 247 transitions, 580 flow [2025-03-04 06:55:01,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:01,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:01,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 739 transitions. [2025-03-04 06:55:01,422 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8766310794780545 [2025-03-04 06:55:01,422 INFO L175 Difference]: Start difference. First operand has 253 places, 248 transitions, 510 flow. Second operand 3 states and 739 transitions. [2025-03-04 06:55:01,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 247 transitions, 580 flow [2025-03-04 06:55:01,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 247 transitions, 576 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:01,426 INFO L231 Difference]: Finished difference. Result has 252 places, 247 transitions, 508 flow [2025-03-04 06:55:01,426 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=508, PETRI_PLACES=252, PETRI_TRANSITIONS=247} [2025-03-04 06:55:01,426 INFO L279 CegarLoopForPetriNet]: 265 programPoint places, -13 predicate places. [2025-03-04 06:55:01,427 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 247 transitions, 508 flow [2025-03-04 06:55:01,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:01,427 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:01,427 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:55:01,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:55:01,428 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-04 06:55:01,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:01,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1687438109, now seen corresponding path program 1 times [2025-03-04 06:55:01,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:01,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876029269] [2025-03-04 06:55:01,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:01,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:01,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 06:55:01,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 06:55:01,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:01,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:01,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:01,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:01,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876029269] [2025-03-04 06:55:01,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876029269] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:01,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:01,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:01,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665650149] [2025-03-04 06:55:01,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:01,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:01,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:01,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:01,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:01,546 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 281 [2025-03-04 06:55:01,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 247 transitions, 508 flow. Second operand has 3 states, 3 states have (on average 239.33333333333334) internal successors, (718), 3 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:01,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:01,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 281 [2025-03-04 06:55:01,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:03,981 INFO L124 PetriNetUnfolderBase]: 11755/30292 cut-off events. [2025-03-04 06:55:03,981 INFO L125 PetriNetUnfolderBase]: For 228/228 co-relation queries the response was YES. [2025-03-04 06:55:04,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46458 conditions, 30292 events. 11755/30292 cut-off events. For 228/228 co-relation queries the response was YES. Maximal size of possible extension queue 1223. Compared 345182 event pairs, 6460 based on Foata normal form. 0/26232 useless extension candidates. Maximal degree in co-relation 46390. Up to 11588 conditions per place. [2025-03-04 06:55:04,233 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 49 selfloop transitions, 2 changer transitions 0/262 dead transitions. [2025-03-04 06:55:04,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 262 transitions, 645 flow [2025-03-04 06:55:04,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:04,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:04,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 760 transitions. [2025-03-04 06:55:04,236 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9015421115065243 [2025-03-04 06:55:04,236 INFO L175 Difference]: Start difference. First operand has 252 places, 247 transitions, 508 flow. Second operand 3 states and 760 transitions. [2025-03-04 06:55:04,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 262 transitions, 645 flow [2025-03-04 06:55:04,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 262 transitions, 641 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:04,239 INFO L231 Difference]: Finished difference. Result has 251 places, 246 transitions, 506 flow [2025-03-04 06:55:04,239 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=506, PETRI_PLACES=251, PETRI_TRANSITIONS=246} [2025-03-04 06:55:04,240 INFO L279 CegarLoopForPetriNet]: 265 programPoint places, -14 predicate places. [2025-03-04 06:55:04,240 INFO L471 AbstractCegarLoop]: Abstraction has has 251 places, 246 transitions, 506 flow [2025-03-04 06:55:04,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 239.33333333333334) internal successors, (718), 3 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:04,240 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:04,241 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] [2025-03-04 06:55:04,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:55:04,241 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-04 06:55:04,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:04,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1385655265, now seen corresponding path program 1 times [2025-03-04 06:55:04,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:04,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782263633] [2025-03-04 06:55:04,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:04,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:04,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-04 06:55:04,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 06:55:04,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:04,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:04,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:04,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:04,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782263633] [2025-03-04 06:55:04,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782263633] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:04,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:04,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:04,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425233236] [2025-03-04 06:55:04,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:04,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:04,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:04,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:04,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:04,323 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 281 [2025-03-04 06:55:04,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 246 transitions, 506 flow. Second operand has 3 states, 3 states have (on average 241.33333333333334) internal successors, (724), 3 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:04,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:04,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 281 [2025-03-04 06:55:04,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:06,440 INFO L124 PetriNetUnfolderBase]: 10729/21932 cut-off events. [2025-03-04 06:55:06,441 INFO L125 PetriNetUnfolderBase]: For 591/591 co-relation queries the response was YES. [2025-03-04 06:55:06,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36888 conditions, 21932 events. 10729/21932 cut-off events. For 591/591 co-relation queries the response was YES. Maximal size of possible extension queue 1056. Compared 201195 event pairs, 5362 based on Foata normal form. 0/20327 useless extension candidates. Maximal degree in co-relation 27803. Up to 9906 conditions per place. [2025-03-04 06:55:06,573 INFO L140 encePairwiseOnDemand]: 279/281 looper letters, 48 selfloop transitions, 1 changer transitions 0/261 dead transitions. [2025-03-04 06:55:06,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 261 transitions, 639 flow [2025-03-04 06:55:06,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:06,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:06,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 764 transitions. [2025-03-04 06:55:06,575 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9062870699881376 [2025-03-04 06:55:06,575 INFO L175 Difference]: Start difference. First operand has 251 places, 246 transitions, 506 flow. Second operand 3 states and 764 transitions. [2025-03-04 06:55:06,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 261 transitions, 639 flow [2025-03-04 06:55:06,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 261 transitions, 635 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:06,578 INFO L231 Difference]: Finished difference. Result has 250 places, 245 transitions, 502 flow [2025-03-04 06:55:06,578 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=502, PETRI_PLACES=250, PETRI_TRANSITIONS=245} [2025-03-04 06:55:06,579 INFO L279 CegarLoopForPetriNet]: 265 programPoint places, -15 predicate places. [2025-03-04 06:55:06,579 INFO L471 AbstractCegarLoop]: Abstraction has has 250 places, 245 transitions, 502 flow [2025-03-04 06:55:06,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 241.33333333333334) internal successors, (724), 3 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:06,580 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:06,580 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] [2025-03-04 06:55:06,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:55:06,580 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-04 06:55:06,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:06,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1496506874, now seen corresponding path program 1 times [2025-03-04 06:55:06,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:06,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920259835] [2025-03-04 06:55:06,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:06,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:06,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 06:55:06,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 06:55:06,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:06,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:06,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:06,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:06,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920259835] [2025-03-04 06:55:06,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920259835] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:06,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:06,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:06,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020306440] [2025-03-04 06:55:06,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:06,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:06,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:06,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:06,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:06,646 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 281 [2025-03-04 06:55:06,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 245 transitions, 502 flow. Second operand has 3 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:06,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:06,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 281 [2025-03-04 06:55:06,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:09,443 INFO L124 PetriNetUnfolderBase]: 14428/32703 cut-off events. [2025-03-04 06:55:09,443 INFO L125 PetriNetUnfolderBase]: For 547/547 co-relation queries the response was YES. [2025-03-04 06:55:09,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52534 conditions, 32703 events. 14428/32703 cut-off events. For 547/547 co-relation queries the response was YES. Maximal size of possible extension queue 1298. Compared 354661 event pairs, 7947 based on Foata normal form. 0/28649 useless extension candidates. Maximal degree in co-relation 40943. Up to 13745 conditions per place. [2025-03-04 06:55:09,700 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 50 selfloop transitions, 2 changer transitions 0/261 dead transitions. [2025-03-04 06:55:09,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 261 transitions, 643 flow [2025-03-04 06:55:09,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:09,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:09,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 761 transitions. [2025-03-04 06:55:09,703 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9027283511269276 [2025-03-04 06:55:09,703 INFO L175 Difference]: Start difference. First operand has 250 places, 245 transitions, 502 flow. Second operand 3 states and 761 transitions. [2025-03-04 06:55:09,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 261 transitions, 643 flow [2025-03-04 06:55:09,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 261 transitions, 642 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:55:09,707 INFO L231 Difference]: Finished difference. Result has 250 places, 244 transitions, 503 flow [2025-03-04 06:55:09,708 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=499, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=503, PETRI_PLACES=250, PETRI_TRANSITIONS=244} [2025-03-04 06:55:09,710 INFO L279 CegarLoopForPetriNet]: 265 programPoint places, -15 predicate places. [2025-03-04 06:55:09,710 INFO L471 AbstractCegarLoop]: Abstraction has has 250 places, 244 transitions, 503 flow [2025-03-04 06:55:09,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:09,711 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:09,711 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:55:09,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:55:09,711 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-04 06:55:09,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:09,712 INFO L85 PathProgramCache]: Analyzing trace with hash 545523976, now seen corresponding path program 1 times [2025-03-04 06:55:09,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:09,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319640548] [2025-03-04 06:55:09,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:09,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:09,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-04 06:55:09,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 06:55:09,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:09,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:09,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:09,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:09,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319640548] [2025-03-04 06:55:09,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319640548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:09,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:09,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:09,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910826676] [2025-03-04 06:55:09,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:09,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:09,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:09,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:09,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:09,787 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 281 [2025-03-04 06:55:09,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 244 transitions, 503 flow. Second operand has 3 states, 3 states have (on average 241.66666666666666) internal successors, (725), 3 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:09,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:09,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 281 [2025-03-04 06:55:09,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:12,053 INFO L124 PetriNetUnfolderBase]: 11068/25050 cut-off events. [2025-03-04 06:55:12,053 INFO L125 PetriNetUnfolderBase]: For 864/864 co-relation queries the response was YES. [2025-03-04 06:55:12,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40703 conditions, 25050 events. 11068/25050 cut-off events. For 864/864 co-relation queries the response was YES. Maximal size of possible extension queue 1020. Compared 253471 event pairs, 4982 based on Foata normal form. 0/22704 useless extension candidates. Maximal degree in co-relation 31491. Up to 8803 conditions per place. [2025-03-04 06:55:12,178 INFO L140 encePairwiseOnDemand]: 279/281 looper letters, 49 selfloop transitions, 1 changer transitions 0/260 dead transitions. [2025-03-04 06:55:12,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 260 transitions, 640 flow [2025-03-04 06:55:12,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:12,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:12,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 765 transitions. [2025-03-04 06:55:12,180 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9074733096085409 [2025-03-04 06:55:12,180 INFO L175 Difference]: Start difference. First operand has 250 places, 244 transitions, 503 flow. Second operand 3 states and 765 transitions. [2025-03-04 06:55:12,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 260 transitions, 640 flow [2025-03-04 06:55:12,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 260 transitions, 636 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:12,185 INFO L231 Difference]: Finished difference. Result has 249 places, 243 transitions, 499 flow [2025-03-04 06:55:12,186 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=497, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=499, PETRI_PLACES=249, PETRI_TRANSITIONS=243} [2025-03-04 06:55:12,186 INFO L279 CegarLoopForPetriNet]: 265 programPoint places, -16 predicate places. [2025-03-04 06:55:12,186 INFO L471 AbstractCegarLoop]: Abstraction has has 249 places, 243 transitions, 499 flow [2025-03-04 06:55:12,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 241.66666666666666) internal successors, (725), 3 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:12,187 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:12,187 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] [2025-03-04 06:55:12,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:55:12,187 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread3Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-04 06:55:12,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:12,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1116588335, now seen corresponding path program 1 times [2025-03-04 06:55:12,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:12,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361960703] [2025-03-04 06:55:12,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:12,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:12,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 06:55:12,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 06:55:12,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:12,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:12,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:12,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:12,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361960703] [2025-03-04 06:55:12,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361960703] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:12,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:12,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:12,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956167629] [2025-03-04 06:55:12,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:12,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:12,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:12,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:12,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:12,240 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 281 [2025-03-04 06:55:12,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 243 transitions, 499 flow. Second operand has 3 states, 3 states have (on average 240.0) internal successors, (720), 3 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:12,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:12,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 281 [2025-03-04 06:55:12,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:15,216 INFO L124 PetriNetUnfolderBase]: 14487/31582 cut-off events. [2025-03-04 06:55:15,216 INFO L125 PetriNetUnfolderBase]: For 603/603 co-relation queries the response was YES. [2025-03-04 06:55:15,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51474 conditions, 31582 events. 14487/31582 cut-off events. For 603/603 co-relation queries the response was YES. Maximal size of possible extension queue 1302. Compared 335383 event pairs, 7988 based on Foata normal form. 0/27701 useless extension candidates. Maximal degree in co-relation 40321. Up to 13706 conditions per place. [2025-03-04 06:55:15,387 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 50 selfloop transitions, 2 changer transitions 0/259 dead transitions. [2025-03-04 06:55:15,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 259 transitions, 640 flow [2025-03-04 06:55:15,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:15,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:15,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 761 transitions. [2025-03-04 06:55:15,389 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9027283511269276 [2025-03-04 06:55:15,389 INFO L175 Difference]: Start difference. First operand has 249 places, 243 transitions, 499 flow. Second operand 3 states and 761 transitions. [2025-03-04 06:55:15,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 259 transitions, 640 flow [2025-03-04 06:55:15,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 259 transitions, 639 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:55:15,392 INFO L231 Difference]: Finished difference. Result has 249 places, 242 transitions, 500 flow [2025-03-04 06:55:15,392 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=500, PETRI_PLACES=249, PETRI_TRANSITIONS=242} [2025-03-04 06:55:15,393 INFO L279 CegarLoopForPetriNet]: 265 programPoint places, -16 predicate places. [2025-03-04 06:55:15,393 INFO L471 AbstractCegarLoop]: Abstraction has has 249 places, 242 transitions, 500 flow [2025-03-04 06:55:15,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 240.0) internal successors, (720), 3 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:15,393 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:15,393 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:55:15,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:55:15,394 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-04 06:55:15,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:15,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1212524145, now seen corresponding path program 1 times [2025-03-04 06:55:15,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:15,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658778960] [2025-03-04 06:55:15,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:15,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:15,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 06:55:15,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 06:55:15,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:15,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:15,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:15,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:15,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658778960] [2025-03-04 06:55:15,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658778960] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:15,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:15,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:15,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001268689] [2025-03-04 06:55:15,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:15,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:15,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:15,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:15,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:15,456 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 281 [2025-03-04 06:55:15,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 242 transitions, 500 flow. Second operand has 3 states, 3 states have (on average 242.0) internal successors, (726), 3 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:15,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:15,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 281 [2025-03-04 06:55:15,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:17,618 INFO L124 PetriNetUnfolderBase]: 10372/25666 cut-off events. [2025-03-04 06:55:17,618 INFO L125 PetriNetUnfolderBase]: For 861/861 co-relation queries the response was YES. [2025-03-04 06:55:17,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40457 conditions, 25666 events. 10372/25666 cut-off events. For 861/861 co-relation queries the response was YES. Maximal size of possible extension queue 990. Compared 278125 event pairs, 3395 based on Foata normal form. 0/22512 useless extension candidates. Maximal degree in co-relation 31513. Up to 7615 conditions per place. [2025-03-04 06:55:17,749 INFO L140 encePairwiseOnDemand]: 279/281 looper letters, 49 selfloop transitions, 1 changer transitions 0/258 dead transitions. [2025-03-04 06:55:17,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 258 transitions, 637 flow [2025-03-04 06:55:17,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:17,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:17,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 765 transitions. [2025-03-04 06:55:17,752 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9074733096085409 [2025-03-04 06:55:17,752 INFO L175 Difference]: Start difference. First operand has 249 places, 242 transitions, 500 flow. Second operand 3 states and 765 transitions. [2025-03-04 06:55:17,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 258 transitions, 637 flow [2025-03-04 06:55:17,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 258 transitions, 633 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:17,759 INFO L231 Difference]: Finished difference. Result has 248 places, 241 transitions, 496 flow [2025-03-04 06:55:17,759 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=496, PETRI_PLACES=248, PETRI_TRANSITIONS=241} [2025-03-04 06:55:17,760 INFO L279 CegarLoopForPetriNet]: 265 programPoint places, -17 predicate places. [2025-03-04 06:55:17,760 INFO L471 AbstractCegarLoop]: Abstraction has has 248 places, 241 transitions, 496 flow [2025-03-04 06:55:17,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 242.0) internal successors, (726), 3 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:17,760 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:17,760 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] [2025-03-04 06:55:17,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 06:55:17,760 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread4Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-04 06:55:17,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:17,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1599397923, now seen corresponding path program 1 times [2025-03-04 06:55:17,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:17,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848604688] [2025-03-04 06:55:17,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:17,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:17,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-04 06:55:17,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-04 06:55:17,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:17,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:17,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:17,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:17,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848604688] [2025-03-04 06:55:17,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848604688] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:17,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:17,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:17,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984539064] [2025-03-04 06:55:17,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:17,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:17,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:17,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:17,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:17,829 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 281 [2025-03-04 06:55:17,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 241 transitions, 496 flow. Second operand has 3 states, 3 states have (on average 240.33333333333334) internal successors, (721), 3 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:17,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:17,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 281 [2025-03-04 06:55:17,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:20,376 INFO L124 PetriNetUnfolderBase]: 14972/27283 cut-off events. [2025-03-04 06:55:20,376 INFO L125 PetriNetUnfolderBase]: For 662/662 co-relation queries the response was YES. [2025-03-04 06:55:20,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47682 conditions, 27283 events. 14972/27283 cut-off events. For 662/662 co-relation queries the response was YES. Maximal size of possible extension queue 1323. Compared 244530 event pairs, 8588 based on Foata normal form. 0/24254 useless extension candidates. Maximal degree in co-relation 37304. Up to 14363 conditions per place. [2025-03-04 06:55:20,706 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 50 selfloop transitions, 2 changer transitions 0/257 dead transitions. [2025-03-04 06:55:20,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 257 transitions, 637 flow [2025-03-04 06:55:20,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:20,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:20,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 761 transitions. [2025-03-04 06:55:20,708 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9027283511269276 [2025-03-04 06:55:20,708 INFO L175 Difference]: Start difference. First operand has 248 places, 241 transitions, 496 flow. Second operand 3 states and 761 transitions. [2025-03-04 06:55:20,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 257 transitions, 637 flow [2025-03-04 06:55:20,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 257 transitions, 636 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:55:20,711 INFO L231 Difference]: Finished difference. Result has 248 places, 240 transitions, 497 flow [2025-03-04 06:55:20,712 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=493, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=497, PETRI_PLACES=248, PETRI_TRANSITIONS=240} [2025-03-04 06:55:20,712 INFO L279 CegarLoopForPetriNet]: 265 programPoint places, -17 predicate places. [2025-03-04 06:55:20,712 INFO L471 AbstractCegarLoop]: Abstraction has has 248 places, 240 transitions, 497 flow [2025-03-04 06:55:20,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 240.33333333333334) internal successors, (721), 3 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:20,713 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:20,713 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-04 06:55:20,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:55:20,713 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread4Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-04 06:55:20,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:20,713 INFO L85 PathProgramCache]: Analyzing trace with hash -317926875, now seen corresponding path program 1 times [2025-03-04 06:55:20,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:20,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39114421] [2025-03-04 06:55:20,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:20,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:20,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 06:55:20,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 06:55:20,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:20,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:20,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:20,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:20,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39114421] [2025-03-04 06:55:20,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39114421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:20,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:20,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:20,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469096131] [2025-03-04 06:55:20,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:20,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:20,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:20,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:20,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:20,781 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 281 [2025-03-04 06:55:20,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 240 transitions, 497 flow. Second operand has 3 states, 3 states have (on average 242.33333333333334) internal successors, (727), 3 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:20,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:20,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 281 [2025-03-04 06:55:20,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:22,740 INFO L124 PetriNetUnfolderBase]: 10913/23336 cut-off events. [2025-03-04 06:55:22,741 INFO L125 PetriNetUnfolderBase]: For 956/956 co-relation queries the response was YES. [2025-03-04 06:55:22,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39009 conditions, 23336 events. 10913/23336 cut-off events. For 956/956 co-relation queries the response was YES. Maximal size of possible extension queue 1026. Compared 225346 event pairs, 3900 based on Foata normal form. 0/21011 useless extension candidates. Maximal degree in co-relation 30642. Up to 7428 conditions per place. [2025-03-04 06:55:22,864 INFO L140 encePairwiseOnDemand]: 279/281 looper letters, 46 selfloop transitions, 1 changer transitions 6/256 dead transitions. [2025-03-04 06:55:22,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 256 transitions, 634 flow [2025-03-04 06:55:22,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:22,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:22,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 765 transitions. [2025-03-04 06:55:22,866 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9074733096085409 [2025-03-04 06:55:22,866 INFO L175 Difference]: Start difference. First operand has 248 places, 240 transitions, 497 flow. Second operand 3 states and 765 transitions. [2025-03-04 06:55:22,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 256 transitions, 634 flow [2025-03-04 06:55:22,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 256 transitions, 630 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:22,893 INFO L231 Difference]: Finished difference. Result has 247 places, 235 transitions, 485 flow [2025-03-04 06:55:22,893 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=491, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=485, PETRI_PLACES=247, PETRI_TRANSITIONS=235} [2025-03-04 06:55:22,894 INFO L279 CegarLoopForPetriNet]: 265 programPoint places, -18 predicate places. [2025-03-04 06:55:22,894 INFO L471 AbstractCegarLoop]: Abstraction has has 247 places, 235 transitions, 485 flow [2025-03-04 06:55:22,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 242.33333333333334) internal successors, (727), 3 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:22,894 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:22,894 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] [2025-03-04 06:55:22,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 06:55:22,894 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread5Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-04 06:55:22,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:22,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1769871334, now seen corresponding path program 1 times [2025-03-04 06:55:22,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:22,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122656347] [2025-03-04 06:55:22,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:22,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:22,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-04 06:55:22,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-04 06:55:22,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:22,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:22,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:22,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:22,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122656347] [2025-03-04 06:55:22,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122656347] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:22,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:22,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:22,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360178454] [2025-03-04 06:55:22,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:22,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:22,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:22,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:22,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:22,949 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 281 [2025-03-04 06:55:22,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 235 transitions, 485 flow. Second operand has 3 states, 3 states have (on average 240.66666666666666) internal successors, (722), 3 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:22,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:22,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 281 [2025-03-04 06:55:22,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:25,280 INFO L124 PetriNetUnfolderBase]: 11040/25254 cut-off events. [2025-03-04 06:55:25,281 INFO L125 PetriNetUnfolderBase]: For 511/511 co-relation queries the response was YES. [2025-03-04 06:55:25,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40258 conditions, 25254 events. 11040/25254 cut-off events. For 511/511 co-relation queries the response was YES. Maximal size of possible extension queue 1031. Compared 260119 event pairs, 5848 based on Foata normal form. 0/21977 useless extension candidates. Maximal degree in co-relation 34729. Up to 10249 conditions per place. [2025-03-04 06:55:25,418 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 49 selfloop transitions, 2 changer transitions 0/251 dead transitions. [2025-03-04 06:55:25,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 251 transitions, 623 flow [2025-03-04 06:55:25,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:25,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:25,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 760 transitions. [2025-03-04 06:55:25,419 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9015421115065243 [2025-03-04 06:55:25,419 INFO L175 Difference]: Start difference. First operand has 247 places, 235 transitions, 485 flow. Second operand 3 states and 760 transitions. [2025-03-04 06:55:25,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 251 transitions, 623 flow [2025-03-04 06:55:25,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 251 transitions, 622 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:55:25,428 INFO L231 Difference]: Finished difference. Result has 243 places, 234 transitions, 486 flow [2025-03-04 06:55:25,429 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=482, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=486, PETRI_PLACES=243, PETRI_TRANSITIONS=234} [2025-03-04 06:55:25,429 INFO L279 CegarLoopForPetriNet]: 265 programPoint places, -22 predicate places. [2025-03-04 06:55:25,429 INFO L471 AbstractCegarLoop]: Abstraction has has 243 places, 234 transitions, 486 flow [2025-03-04 06:55:25,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 240.66666666666666) internal successors, (722), 3 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:25,430 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:25,430 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-04 06:55:25,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 06:55:25,430 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread5Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-04 06:55:25,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:25,430 INFO L85 PathProgramCache]: Analyzing trace with hash 906212700, now seen corresponding path program 1 times [2025-03-04 06:55:25,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:25,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774330142] [2025-03-04 06:55:25,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:25,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:25,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 06:55:25,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 06:55:25,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:25,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:25,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:25,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:25,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774330142] [2025-03-04 06:55:25,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774330142] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:25,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:25,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:25,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659785618] [2025-03-04 06:55:25,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:25,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:25,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:25,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:25,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:25,468 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 281 [2025-03-04 06:55:25,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 234 transitions, 486 flow. Second operand has 3 states, 3 states have (on average 242.66666666666666) internal successors, (728), 3 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:25,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:25,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 281 [2025-03-04 06:55:25,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:27,433 INFO L124 PetriNetUnfolderBase]: 7926/20449 cut-off events. [2025-03-04 06:55:27,434 INFO L125 PetriNetUnfolderBase]: For 668/668 co-relation queries the response was YES. [2025-03-04 06:55:27,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31818 conditions, 20449 events. 7926/20449 cut-off events. For 668/668 co-relation queries the response was YES. Maximal size of possible extension queue 807. Compared 215888 event pairs, 3422 based on Foata normal form. 0/18086 useless extension candidates. Maximal degree in co-relation 26289. Up to 5887 conditions per place. [2025-03-04 06:55:27,527 INFO L140 encePairwiseOnDemand]: 279/281 looper letters, 0 selfloop transitions, 0 changer transitions 250/250 dead transitions. [2025-03-04 06:55:27,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 250 transitions, 620 flow [2025-03-04 06:55:27,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:27,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:27,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 764 transitions. [2025-03-04 06:55:27,529 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9062870699881376 [2025-03-04 06:55:27,529 INFO L175 Difference]: Start difference. First operand has 243 places, 234 transitions, 486 flow. Second operand 3 states and 764 transitions. [2025-03-04 06:55:27,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 250 transitions, 620 flow [2025-03-04 06:55:27,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 250 transitions, 616 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:27,531 INFO L231 Difference]: Finished difference. Result has 242 places, 0 transitions, 0 flow [2025-03-04 06:55:27,531 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=242, PETRI_TRANSITIONS=0} [2025-03-04 06:55:27,532 INFO L279 CegarLoopForPetriNet]: 265 programPoint places, -23 predicate places. [2025-03-04 06:55:27,532 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 0 transitions, 0 flow [2025-03-04 06:55:27,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 242.66666666666666) internal successors, (728), 3 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:27,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (29 of 30 remaining) [2025-03-04 06:55:27,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (28 of 30 remaining) [2025-03-04 06:55:27,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (27 of 30 remaining) [2025-03-04 06:55:27,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (26 of 30 remaining) [2025-03-04 06:55:27,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (25 of 30 remaining) [2025-03-04 06:55:27,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (24 of 30 remaining) [2025-03-04 06:55:27,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (23 of 30 remaining) [2025-03-04 06:55:27,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (22 of 30 remaining) [2025-03-04 06:55:27,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (21 of 30 remaining) [2025-03-04 06:55:27,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (20 of 30 remaining) [2025-03-04 06:55:27,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (19 of 30 remaining) [2025-03-04 06:55:27,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 30 remaining) [2025-03-04 06:55:27,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 30 remaining) [2025-03-04 06:55:27,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 30 remaining) [2025-03-04 06:55:27,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 30 remaining) [2025-03-04 06:55:27,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 30 remaining) [2025-03-04 06:55:27,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (13 of 30 remaining) [2025-03-04 06:55:27,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (12 of 30 remaining) [2025-03-04 06:55:27,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (11 of 30 remaining) [2025-03-04 06:55:27,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (10 of 30 remaining) [2025-03-04 06:55:27,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (9 of 30 remaining) [2025-03-04 06:55:27,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (8 of 30 remaining) [2025-03-04 06:55:27,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (7 of 30 remaining) [2025-03-04 06:55:27,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (6 of 30 remaining) [2025-03-04 06:55:27,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (5 of 30 remaining) [2025-03-04 06:55:27,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (4 of 30 remaining) [2025-03-04 06:55:27,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (3 of 30 remaining) [2025-03-04 06:55:27,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (2 of 30 remaining) [2025-03-04 06:55:27,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (1 of 30 remaining) [2025-03-04 06:55:27,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (0 of 30 remaining) [2025-03-04 06:55:27,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 06:55:27,538 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:55:27,544 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 06:55:27,544 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 06:55:27,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 06:55:27 BasicIcfg [2025-03-04 06:55:27,552 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 06:55:27,554 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 06:55:27,554 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 06:55:27,554 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 06:55:27,555 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:54:47" (3/4) ... [2025-03-04 06:55:27,556 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 06:55:27,559 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-04 06:55:27,559 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-04 06:55:27,559 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-04 06:55:27,559 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread4 [2025-03-04 06:55:27,559 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread5 [2025-03-04 06:55:27,563 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-04 06:55:27,563 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 06:55:27,564 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-04 06:55:27,564 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 06:55:27,630 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 06:55:27,630 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 06:55:27,630 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 06:55:27,631 INFO L158 Benchmark]: Toolchain (without parser) took 40532.04ms. Allocated memory was 142.6MB in the beginning and 12.1GB in the end (delta: 11.9GB). Free memory was 111.1MB in the beginning and 8.8GB in the end (delta: -8.7GB). Peak memory consumption was 3.3GB. Max. memory is 16.1GB. [2025-03-04 06:55:27,632 INFO L158 Benchmark]: CDTParser took 1.49ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:55:27,632 INFO L158 Benchmark]: CACSL2BoogieTranslator took 195.26ms. Allocated memory is still 142.6MB. Free memory was 111.1MB in the beginning and 98.6MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:55:27,632 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.22ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 97.1MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:55:27,633 INFO L158 Benchmark]: Boogie Preprocessor took 25.40ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 96.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:55:27,634 INFO L158 Benchmark]: IcfgBuilder took 470.75ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 71.9MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 06:55:27,634 INFO L158 Benchmark]: TraceAbstraction took 39721.13ms. Allocated memory was 142.6MB in the beginning and 12.1GB in the end (delta: 11.9GB). Free memory was 71.9MB in the beginning and 8.8GB in the end (delta: -8.7GB). Peak memory consumption was 3.4GB. Max. memory is 16.1GB. [2025-03-04 06:55:27,634 INFO L158 Benchmark]: Witness Printer took 76.91ms. Allocated memory is still 12.1GB. Free memory was 8.8GB in the beginning and 8.8GB in the end (delta: 8.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:55:27,636 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.49ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 195.26ms. Allocated memory is still 142.6MB. Free memory was 111.1MB in the beginning and 98.6MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.22ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 97.1MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.40ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 96.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 470.75ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 71.9MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 39721.13ms. Allocated memory was 142.6MB in the beginning and 12.1GB in the end (delta: 11.9GB). Free memory was 71.9MB in the beginning and 8.8GB in the end (delta: -8.7GB). Peak memory consumption was 3.4GB. Max. memory is 16.1GB. * Witness Printer took 76.91ms. Allocated memory is still 12.1GB. Free memory was 8.8GB in the beginning and 8.8GB in the end (delta: 8.4MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: 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: 62]: 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: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: 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: 74]: 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: 84]: 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 11 procedures, 406 locations, 30 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: 39.6s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 38.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 445 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 252 mSDsluCounter, 69 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1252 IncrementalHoareTripleChecker+Invalid, 1267 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 69 mSDtfsCounter, 1252 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=545occurred in iteration=0, InterpolantAutomatonStates: 45, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 1300 NumberOfCodeBlocks, 1300 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1285 ConstructedInterpolants, 0 QuantifiedInterpolants, 1315 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 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 15 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 06:55:27,654 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