./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-simpl-str-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 735b3cc8 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-simpl-str-trans.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 f7b74cf7a2419cab3ab4545eb4bb4cb738b0dd565da7b17a0ca0e4253475f1b6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:43:29,156 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:43:29,215 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-14 01:43:29,221 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:43:29,221 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:43:29,235 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:43:29,235 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:43:29,235 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:43:29,236 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:43:29,236 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:43:29,236 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:43:29,236 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:43:29,236 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:43:29,236 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:43:29,236 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:43:29,236 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:43:29,236 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:43:29,236 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:43:29,236 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:43:29,236 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:43:29,236 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:43:29,236 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:43:29,236 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-14 01:43:29,237 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-14 01:43:29,237 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:43:29,237 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:43:29,237 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:43:29,237 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:43:29,237 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:43:29,237 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:43:29,237 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:43:29,237 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:43:29,237 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:43:29,237 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:43:29,237 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:43:29,237 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:43:29,237 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:43:29,237 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:43:29,237 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:43:29,237 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:43:29,237 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:43:29,238 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:43:29,238 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 -> f7b74cf7a2419cab3ab4545eb4bb4cb738b0dd565da7b17a0ca0e4253475f1b6 [2025-03-14 01:43:29,460 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:43:29,468 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:43:29,469 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:43:29,470 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:43:29,470 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:43:29,473 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-simpl-str-trans.wvr.c [2025-03-14 01:43:30,588 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64876c349/8d5bc62f7b5b4c9e9b1a667bf74c3c95/FLAGeb9a220ce [2025-03-14 01:43:30,810 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:43:30,810 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-simpl-str-trans.wvr.c [2025-03-14 01:43:30,819 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64876c349/8d5bc62f7b5b4c9e9b1a667bf74c3c95/FLAGeb9a220ce [2025-03-14 01:43:31,158 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64876c349/8d5bc62f7b5b4c9e9b1a667bf74c3c95 [2025-03-14 01:43:31,160 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:43:31,161 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:43:31,162 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:43:31,162 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:43:31,165 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:43:31,165 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:43:31" (1/1) ... [2025-03-14 01:43:31,167 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3da69076 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:43:31, skipping insertion in model container [2025-03-14 01:43:31,167 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:43:31" (1/1) ... [2025-03-14 01:43:31,178 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:43:31,285 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:43:31,294 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:43:31,312 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:43:31,323 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:43:31,323 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:43:31 WrapperNode [2025-03-14 01:43:31,323 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:43:31,324 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:43:31,324 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:43:31,324 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:43:31,328 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:43:31" (1/1) ... [2025-03-14 01:43:31,333 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:43:31" (1/1) ... [2025-03-14 01:43:31,346 INFO L138 Inliner]: procedures = 22, calls = 16, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 235 [2025-03-14 01:43:31,347 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:43:31,347 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:43:31,347 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:43:31,347 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:43:31,354 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:43:31" (1/1) ... [2025-03-14 01:43:31,354 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:43:31" (1/1) ... [2025-03-14 01:43:31,355 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:43:31" (1/1) ... [2025-03-14 01:43:31,356 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:43:31" (1/1) ... [2025-03-14 01:43:31,359 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:43:31" (1/1) ... [2025-03-14 01:43:31,360 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:43:31" (1/1) ... [2025-03-14 01:43:31,361 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:43:31" (1/1) ... [2025-03-14 01:43:31,361 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:43:31" (1/1) ... [2025-03-14 01:43:31,363 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:43:31,364 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:43:31,364 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:43:31,364 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:43:31,364 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:43:31" (1/1) ... [2025-03-14 01:43:31,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:43:31,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:43:31,393 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-14 01:43:31,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-14 01:43:31,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:43:31,413 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-14 01:43:31,413 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-14 01:43:31,413 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-14 01:43:31,413 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-14 01:43:31,413 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-14 01:43:31,413 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-14 01:43:31,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 01:43:31,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:43:31,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:43:31,414 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:43:31,488 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:43:31,490 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:43:31,743 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:43:31,744 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:43:31,744 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:43:31,765 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:43:31,767 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:43:31 BoogieIcfgContainer [2025-03-14 01:43:31,767 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:43:31,770 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:43:31,771 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:43:31,775 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:43:31,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:43:31" (1/3) ... [2025-03-14 01:43:31,776 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c26336d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:43:31, skipping insertion in model container [2025-03-14 01:43:31,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:43:31" (2/3) ... [2025-03-14 01:43:31,777 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c26336d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:43:31, skipping insertion in model container [2025-03-14 01:43:31,777 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:43:31" (3/3) ... [2025-03-14 01:43:31,778 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-simpl-str-trans.wvr.c [2025-03-14 01:43:31,790 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:43:31,792 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-simpl-str-trans.wvr.c that has 4 procedures, 302 locations, 1 initial locations, 0 loop locations, and 27 error locations. [2025-03-14 01:43:31,792 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:43:31,876 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-14 01:43:31,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 311 places, 316 transitions, 653 flow [2025-03-14 01:43:32,018 INFO L124 PetriNetUnfolderBase]: 15/313 cut-off events. [2025-03-14 01:43:32,022 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-14 01:43:32,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 326 conditions, 313 events. 15/313 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 771 event pairs, 0 based on Foata normal form. 0/271 useless extension candidates. Maximal degree in co-relation 215. Up to 2 conditions per place. [2025-03-14 01:43:32,045 INFO L82 GeneralOperation]: Start removeDead. Operand has 311 places, 316 transitions, 653 flow [2025-03-14 01:43:32,054 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 289 places, 292 transitions, 602 flow [2025-03-14 01:43:32,063 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:43:32,074 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;@c732fe7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:43:32,075 INFO L334 AbstractCegarLoop]: Starting to check reachability of 48 error locations. [2025-03-14 01:43:32,083 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:43:32,083 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2025-03-14 01:43:32,083 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:43:32,084 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:32,084 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:43:32,084 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-03-14 01:43:32,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:32,089 INFO L85 PathProgramCache]: Analyzing trace with hash -470606183, now seen corresponding path program 1 times [2025-03-14 01:43:32,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:32,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854309160] [2025-03-14 01:43:32,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:32,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:32,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-14 01:43:32,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 01:43:32,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:32,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:32,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:43:32,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:32,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854309160] [2025-03-14 01:43:32,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854309160] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:32,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:32,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:32,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448295860] [2025-03-14 01:43:32,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:32,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:32,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:32,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:32,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:32,291 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 293 out of 316 [2025-03-14 01:43:32,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 292 transitions, 602 flow. Second operand has 3 states, 3 states have (on average 294.3333333333333) internal successors, (883), 3 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:32,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:32,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 293 of 316 [2025-03-14 01:43:32,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:32,404 INFO L124 PetriNetUnfolderBase]: 18/466 cut-off events. [2025-03-14 01:43:32,405 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-14 01:43:32,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 509 conditions, 466 events. 18/466 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2043 event pairs, 5 based on Foata normal form. 18/414 useless extension candidates. Maximal degree in co-relation 386. Up to 22 conditions per place. [2025-03-14 01:43:32,411 INFO L140 encePairwiseOnDemand]: 307/316 looper letters, 11 selfloop transitions, 2 changer transitions 0/285 dead transitions. [2025-03-14 01:43:32,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 285 transitions, 614 flow [2025-03-14 01:43:32,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:32,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:32,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 899 transitions. [2025-03-14 01:43:32,422 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9483122362869199 [2025-03-14 01:43:32,423 INFO L175 Difference]: Start difference. First operand has 289 places, 292 transitions, 602 flow. Second operand 3 states and 899 transitions. [2025-03-14 01:43:32,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 285 transitions, 614 flow [2025-03-14 01:43:32,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 285 transitions, 602 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-14 01:43:32,431 INFO L231 Difference]: Finished difference. Result has 284 places, 285 transitions, 580 flow [2025-03-14 01:43:32,436 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=316, PETRI_DIFFERENCE_MINUEND_FLOW=576, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=580, PETRI_PLACES=284, PETRI_TRANSITIONS=285} [2025-03-14 01:43:32,438 INFO L279 CegarLoopForPetriNet]: 289 programPoint places, -5 predicate places. [2025-03-14 01:43:32,438 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 285 transitions, 580 flow [2025-03-14 01:43:32,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 294.3333333333333) internal successors, (883), 3 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:32,439 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:32,439 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] [2025-03-14 01:43:32,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:43:32,439 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-03-14 01:43:32,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:32,440 INFO L85 PathProgramCache]: Analyzing trace with hash 16568942, now seen corresponding path program 1 times [2025-03-14 01:43:32,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:32,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139000257] [2025-03-14 01:43:32,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:32,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:32,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-14 01:43:32,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-14 01:43:32,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:32,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:32,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:43:32,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:32,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139000257] [2025-03-14 01:43:32,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139000257] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:32,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:32,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:32,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040893712] [2025-03-14 01:43:32,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:32,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:32,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:32,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:32,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:32,511 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 293 out of 316 [2025-03-14 01:43:32,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 285 transitions, 580 flow. Second operand has 3 states, 3 states have (on average 294.3333333333333) internal successors, (883), 3 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:32,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:32,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 293 of 316 [2025-03-14 01:43:32,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:32,587 INFO L124 PetriNetUnfolderBase]: 16/418 cut-off events. [2025-03-14 01:43:32,587 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-03-14 01:43:32,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 451 conditions, 418 events. 16/418 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1692 event pairs, 5 based on Foata normal form. 0/360 useless extension candidates. Maximal degree in co-relation 417. Up to 22 conditions per place. [2025-03-14 01:43:32,591 INFO L140 encePairwiseOnDemand]: 313/316 looper letters, 11 selfloop transitions, 2 changer transitions 0/284 dead transitions. [2025-03-14 01:43:32,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 284 transitions, 604 flow [2025-03-14 01:43:32,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:32,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:32,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 893 transitions. [2025-03-14 01:43:32,594 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9419831223628692 [2025-03-14 01:43:32,594 INFO L175 Difference]: Start difference. First operand has 284 places, 285 transitions, 580 flow. Second operand 3 states and 893 transitions. [2025-03-14 01:43:32,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 284 transitions, 604 flow [2025-03-14 01:43:32,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 284 transitions, 600 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:43:32,598 INFO L231 Difference]: Finished difference. Result has 283 places, 284 transitions, 578 flow [2025-03-14 01:43:32,599 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=316, PETRI_DIFFERENCE_MINUEND_FLOW=574, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=578, PETRI_PLACES=283, PETRI_TRANSITIONS=284} [2025-03-14 01:43:32,599 INFO L279 CegarLoopForPetriNet]: 289 programPoint places, -6 predicate places. [2025-03-14 01:43:32,599 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 284 transitions, 578 flow [2025-03-14 01:43:32,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 294.3333333333333) internal successors, (883), 3 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:32,600 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:32,600 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] [2025-03-14 01:43:32,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:43:32,600 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-03-14 01:43:32,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:32,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1805997228, now seen corresponding path program 1 times [2025-03-14 01:43:32,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:32,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952937654] [2025-03-14 01:43:32,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:32,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:32,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-14 01:43:32,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-14 01:43:32,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:32,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:32,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:43:32,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:32,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952937654] [2025-03-14 01:43:32,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952937654] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:32,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:32,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:32,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006086874] [2025-03-14 01:43:32,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:32,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:32,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:32,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:32,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:32,666 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 292 out of 316 [2025-03-14 01:43:32,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 284 transitions, 578 flow. Second operand has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:32,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:32,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 292 of 316 [2025-03-14 01:43:32,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:32,756 INFO L124 PetriNetUnfolderBase]: 33/686 cut-off events. [2025-03-14 01:43:32,757 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-14 01:43:32,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 737 conditions, 686 events. 33/686 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 3718 event pairs, 12 based on Foata normal form. 0/580 useless extension candidates. Maximal degree in co-relation 695. Up to 35 conditions per place. [2025-03-14 01:43:32,763 INFO L140 encePairwiseOnDemand]: 313/316 looper letters, 12 selfloop transitions, 2 changer transitions 0/283 dead transitions. [2025-03-14 01:43:32,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 283 transitions, 604 flow [2025-03-14 01:43:32,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:32,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:32,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 891 transitions. [2025-03-14 01:43:32,767 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.939873417721519 [2025-03-14 01:43:32,767 INFO L175 Difference]: Start difference. First operand has 283 places, 284 transitions, 578 flow. Second operand 3 states and 891 transitions. [2025-03-14 01:43:32,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 283 transitions, 604 flow [2025-03-14 01:43:32,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 283 transitions, 600 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:43:32,772 INFO L231 Difference]: Finished difference. Result has 282 places, 283 transitions, 576 flow [2025-03-14 01:43:32,773 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=316, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=576, PETRI_PLACES=282, PETRI_TRANSITIONS=283} [2025-03-14 01:43:32,774 INFO L279 CegarLoopForPetriNet]: 289 programPoint places, -7 predicate places. [2025-03-14 01:43:32,774 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 283 transitions, 576 flow [2025-03-14 01:43:32,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:32,775 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:32,775 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] [2025-03-14 01:43:32,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:43:32,776 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-03-14 01:43:32,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:32,777 INFO L85 PathProgramCache]: Analyzing trace with hash -2036155331, now seen corresponding path program 1 times [2025-03-14 01:43:32,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:32,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320838464] [2025-03-14 01:43:32,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:32,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:32,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-14 01:43:32,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-14 01:43:32,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:32,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:32,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:43:32,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:32,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320838464] [2025-03-14 01:43:32,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320838464] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:32,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:32,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:32,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993301022] [2025-03-14 01:43:32,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:32,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:32,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:32,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:32,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:32,847 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 293 out of 316 [2025-03-14 01:43:32,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 283 transitions, 576 flow. Second operand has 3 states, 3 states have (on average 294.3333333333333) internal successors, (883), 3 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:32,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:32,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 293 of 316 [2025-03-14 01:43:32,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:32,910 INFO L124 PetriNetUnfolderBase]: 22/541 cut-off events. [2025-03-14 01:43:32,910 INFO L125 PetriNetUnfolderBase]: For 2/5 co-relation queries the response was YES. [2025-03-14 01:43:32,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 579 conditions, 541 events. 22/541 cut-off events. For 2/5 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2509 event pairs, 7 based on Foata normal form. 0/463 useless extension candidates. Maximal degree in co-relation 529. Up to 25 conditions per place. [2025-03-14 01:43:32,915 INFO L140 encePairwiseOnDemand]: 313/316 looper letters, 11 selfloop transitions, 2 changer transitions 0/282 dead transitions. [2025-03-14 01:43:32,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 282 transitions, 600 flow [2025-03-14 01:43:32,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:32,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:32,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 893 transitions. [2025-03-14 01:43:32,917 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9419831223628692 [2025-03-14 01:43:32,917 INFO L175 Difference]: Start difference. First operand has 282 places, 283 transitions, 576 flow. Second operand 3 states and 893 transitions. [2025-03-14 01:43:32,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 282 transitions, 600 flow [2025-03-14 01:43:32,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 282 transitions, 596 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:43:32,921 INFO L231 Difference]: Finished difference. Result has 281 places, 282 transitions, 574 flow [2025-03-14 01:43:32,921 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=316, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=574, PETRI_PLACES=281, PETRI_TRANSITIONS=282} [2025-03-14 01:43:32,921 INFO L279 CegarLoopForPetriNet]: 289 programPoint places, -8 predicate places. [2025-03-14 01:43:32,922 INFO L471 AbstractCegarLoop]: Abstraction has has 281 places, 282 transitions, 574 flow [2025-03-14 01:43:32,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 294.3333333333333) internal successors, (883), 3 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:32,922 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:32,922 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] [2025-03-14 01:43:32,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:43:32,923 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-03-14 01:43:32,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:32,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1154936828, now seen corresponding path program 1 times [2025-03-14 01:43:32,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:32,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672251053] [2025-03-14 01:43:32,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:32,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:32,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-14 01:43:32,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-14 01:43:32,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:32,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:32,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:43:32,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:32,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672251053] [2025-03-14 01:43:32,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672251053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:32,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:32,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:32,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161515990] [2025-03-14 01:43:32,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:32,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:32,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:32,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:32,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:33,011 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 316 [2025-03-14 01:43:33,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 282 transitions, 574 flow. Second operand has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:33,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:33,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 316 [2025-03-14 01:43:33,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:33,106 INFO L124 PetriNetUnfolderBase]: 43/725 cut-off events. [2025-03-14 01:43:33,107 INFO L125 PetriNetUnfolderBase]: For 13/17 co-relation queries the response was YES. [2025-03-14 01:43:33,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 786 conditions, 725 events. 43/725 cut-off events. For 13/17 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3737 event pairs, 20 based on Foata normal form. 0/625 useless extension candidates. Maximal degree in co-relation 728. Up to 50 conditions per place. [2025-03-14 01:43:33,115 INFO L140 encePairwiseOnDemand]: 313/316 looper letters, 13 selfloop transitions, 2 changer transitions 0/281 dead transitions. [2025-03-14 01:43:33,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 281 transitions, 602 flow [2025-03-14 01:43:33,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:33,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:33,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 889 transitions. [2025-03-14 01:43:33,117 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9377637130801688 [2025-03-14 01:43:33,117 INFO L175 Difference]: Start difference. First operand has 281 places, 282 transitions, 574 flow. Second operand 3 states and 889 transitions. [2025-03-14 01:43:33,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 281 transitions, 602 flow [2025-03-14 01:43:33,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 281 transitions, 598 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:43:33,120 INFO L231 Difference]: Finished difference. Result has 280 places, 281 transitions, 572 flow [2025-03-14 01:43:33,121 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=316, PETRI_DIFFERENCE_MINUEND_FLOW=568, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=572, PETRI_PLACES=280, PETRI_TRANSITIONS=281} [2025-03-14 01:43:33,123 INFO L279 CegarLoopForPetriNet]: 289 programPoint places, -9 predicate places. [2025-03-14 01:43:33,124 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 281 transitions, 572 flow [2025-03-14 01:43:33,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:33,124 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:33,125 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] [2025-03-14 01:43:33,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:43:33,125 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-03-14 01:43:33,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:33,126 INFO L85 PathProgramCache]: Analyzing trace with hash -111585269, now seen corresponding path program 1 times [2025-03-14 01:43:33,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:33,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279980319] [2025-03-14 01:43:33,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:33,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:33,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-14 01:43:33,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-14 01:43:33,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:33,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:33,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:43:33,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:33,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279980319] [2025-03-14 01:43:33,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279980319] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:33,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:33,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:33,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282266059] [2025-03-14 01:43:33,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:33,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:33,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:33,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:33,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:33,205 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 293 out of 316 [2025-03-14 01:43:33,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 281 transitions, 572 flow. Second operand has 3 states, 3 states have (on average 294.3333333333333) internal successors, (883), 3 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:33,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:33,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 293 of 316 [2025-03-14 01:43:33,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:33,248 INFO L124 PetriNetUnfolderBase]: 16/353 cut-off events. [2025-03-14 01:43:33,248 INFO L125 PetriNetUnfolderBase]: For 4/7 co-relation queries the response was YES. [2025-03-14 01:43:33,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 388 conditions, 353 events. 16/353 cut-off events. For 4/7 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1259 event pairs, 7 based on Foata normal form. 0/309 useless extension candidates. Maximal degree in co-relation 322. Up to 25 conditions per place. [2025-03-14 01:43:33,252 INFO L140 encePairwiseOnDemand]: 313/316 looper letters, 11 selfloop transitions, 2 changer transitions 0/280 dead transitions. [2025-03-14 01:43:33,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 280 transitions, 596 flow [2025-03-14 01:43:33,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:33,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:33,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 893 transitions. [2025-03-14 01:43:33,254 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9419831223628692 [2025-03-14 01:43:33,254 INFO L175 Difference]: Start difference. First operand has 280 places, 281 transitions, 572 flow. Second operand 3 states and 893 transitions. [2025-03-14 01:43:33,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 280 transitions, 596 flow [2025-03-14 01:43:33,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 280 transitions, 592 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:43:33,258 INFO L231 Difference]: Finished difference. Result has 279 places, 280 transitions, 570 flow [2025-03-14 01:43:33,259 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=316, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=570, PETRI_PLACES=279, PETRI_TRANSITIONS=280} [2025-03-14 01:43:33,261 INFO L279 CegarLoopForPetriNet]: 289 programPoint places, -10 predicate places. [2025-03-14 01:43:33,261 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 280 transitions, 570 flow [2025-03-14 01:43:33,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 294.3333333333333) internal successors, (883), 3 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:33,262 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:33,262 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] [2025-03-14 01:43:33,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:43:33,262 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-03-14 01:43:33,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:33,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1715694576, now seen corresponding path program 1 times [2025-03-14 01:43:33,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:33,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246647221] [2025-03-14 01:43:33,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:33,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:33,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-14 01:43:33,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-14 01:43:33,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:33,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:33,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:43:33,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:33,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246647221] [2025-03-14 01:43:33,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246647221] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:33,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:33,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:33,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251564489] [2025-03-14 01:43:33,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:33,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:33,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:33,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:33,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:33,328 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 295 out of 316 [2025-03-14 01:43:33,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 280 transitions, 570 flow. Second operand has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:33,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:33,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 295 of 316 [2025-03-14 01:43:33,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:33,436 INFO L124 PetriNetUnfolderBase]: 33/699 cut-off events. [2025-03-14 01:43:33,436 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-14 01:43:33,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 746 conditions, 699 events. 33/699 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3898 event pairs, 8 based on Foata normal form. 0/600 useless extension candidates. Maximal degree in co-relation 672. Up to 31 conditions per place. [2025-03-14 01:43:33,448 INFO L140 encePairwiseOnDemand]: 312/316 looper letters, 13 selfloop transitions, 2 changer transitions 0/282 dead transitions. [2025-03-14 01:43:33,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 282 transitions, 606 flow [2025-03-14 01:43:33,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:33,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:33,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 902 transitions. [2025-03-14 01:43:33,450 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9514767932489452 [2025-03-14 01:43:33,450 INFO L175 Difference]: Start difference. First operand has 279 places, 280 transitions, 570 flow. Second operand 3 states and 902 transitions. [2025-03-14 01:43:33,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 282 transitions, 606 flow [2025-03-14 01:43:33,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 282 transitions, 602 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:43:33,454 INFO L231 Difference]: Finished difference. Result has 278 places, 280 transitions, 576 flow [2025-03-14 01:43:33,454 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=316, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=576, PETRI_PLACES=278, PETRI_TRANSITIONS=280} [2025-03-14 01:43:33,456 INFO L279 CegarLoopForPetriNet]: 289 programPoint places, -11 predicate places. [2025-03-14 01:43:33,456 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 280 transitions, 576 flow [2025-03-14 01:43:33,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:33,457 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:33,457 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:43:33,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:43:33,457 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-03-14 01:43:33,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:33,458 INFO L85 PathProgramCache]: Analyzing trace with hash -2145690384, now seen corresponding path program 1 times [2025-03-14 01:43:33,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:33,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964724871] [2025-03-14 01:43:33,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:33,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:33,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-14 01:43:33,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-14 01:43:33,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:33,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:33,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:43:33,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:33,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964724871] [2025-03-14 01:43:33,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964724871] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:33,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:33,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:33,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278538462] [2025-03-14 01:43:33,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:33,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:33,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:33,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:33,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:33,526 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 292 out of 316 [2025-03-14 01:43:33,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 280 transitions, 576 flow. Second operand has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:33,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:33,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 292 of 316 [2025-03-14 01:43:33,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:33,645 INFO L124 PetriNetUnfolderBase]: 70/1041 cut-off events. [2025-03-14 01:43:33,645 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-14 01:43:33,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1148 conditions, 1041 events. 70/1041 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 7318 event pairs, 10 based on Foata normal form. 0/896 useless extension candidates. Maximal degree in co-relation 1005. Up to 73 conditions per place. [2025-03-14 01:43:33,657 INFO L140 encePairwiseOnDemand]: 310/316 looper letters, 15 selfloop transitions, 3 changer transitions 0/282 dead transitions. [2025-03-14 01:43:33,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 282 transitions, 618 flow [2025-03-14 01:43:33,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:33,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:33,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 897 transitions. [2025-03-14 01:43:33,660 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9462025316455697 [2025-03-14 01:43:33,660 INFO L175 Difference]: Start difference. First operand has 278 places, 280 transitions, 576 flow. Second operand 3 states and 897 transitions. [2025-03-14 01:43:33,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 282 transitions, 618 flow [2025-03-14 01:43:33,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 282 transitions, 618 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:43:33,664 INFO L231 Difference]: Finished difference. Result has 278 places, 280 transitions, 591 flow [2025-03-14 01:43:33,664 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=316, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=591, PETRI_PLACES=278, PETRI_TRANSITIONS=280} [2025-03-14 01:43:33,664 INFO L279 CegarLoopForPetriNet]: 289 programPoint places, -11 predicate places. [2025-03-14 01:43:33,665 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 280 transitions, 591 flow [2025-03-14 01:43:33,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:33,665 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:33,665 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] [2025-03-14 01:43:33,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:43:33,665 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-03-14 01:43:33,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:33,666 INFO L85 PathProgramCache]: Analyzing trace with hash -263353575, now seen corresponding path program 1 times [2025-03-14 01:43:33,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:33,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158238547] [2025-03-14 01:43:33,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:33,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:33,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-14 01:43:33,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-14 01:43:33,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:33,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:33,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:43:33,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:33,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158238547] [2025-03-14 01:43:33,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158238547] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:33,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:33,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:33,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976025845] [2025-03-14 01:43:33,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:33,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:33,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:33,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:33,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:33,720 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 295 out of 316 [2025-03-14 01:43:33,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 280 transitions, 591 flow. Second operand has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:33,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:33,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 295 of 316 [2025-03-14 01:43:33,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:33,824 INFO L124 PetriNetUnfolderBase]: 31/808 cut-off events. [2025-03-14 01:43:33,824 INFO L125 PetriNetUnfolderBase]: For 9/11 co-relation queries the response was YES. [2025-03-14 01:43:33,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 880 conditions, 808 events. 31/808 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 4377 event pairs, 2 based on Foata normal form. 0/718 useless extension candidates. Maximal degree in co-relation 723. Up to 38 conditions per place. [2025-03-14 01:43:33,833 INFO L140 encePairwiseOnDemand]: 312/316 looper letters, 16 selfloop transitions, 2 changer transitions 0/285 dead transitions. [2025-03-14 01:43:33,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 285 transitions, 642 flow [2025-03-14 01:43:33,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:33,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:33,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 905 transitions. [2025-03-14 01:43:33,835 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9546413502109705 [2025-03-14 01:43:33,835 INFO L175 Difference]: Start difference. First operand has 278 places, 280 transitions, 591 flow. Second operand 3 states and 905 transitions. [2025-03-14 01:43:33,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 285 transitions, 642 flow [2025-03-14 01:43:33,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 285 transitions, 642 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:43:33,839 INFO L231 Difference]: Finished difference. Result has 279 places, 280 transitions, 601 flow [2025-03-14 01:43:33,839 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=316, PETRI_DIFFERENCE_MINUEND_FLOW=587, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=601, PETRI_PLACES=279, PETRI_TRANSITIONS=280} [2025-03-14 01:43:33,840 INFO L279 CegarLoopForPetriNet]: 289 programPoint places, -10 predicate places. [2025-03-14 01:43:33,840 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 280 transitions, 601 flow [2025-03-14 01:43:33,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:33,840 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:33,840 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:43:33,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 01:43:33,841 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-03-14 01:43:33,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:33,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1925791227, now seen corresponding path program 1 times [2025-03-14 01:43:33,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:33,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008273492] [2025-03-14 01:43:33,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:33,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:33,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-14 01:43:33,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-14 01:43:33,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:33,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:33,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:43:33,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:33,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008273492] [2025-03-14 01:43:33,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008273492] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:33,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:33,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:33,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117072200] [2025-03-14 01:43:33,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:33,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:33,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:33,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:33,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:33,900 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 316 [2025-03-14 01:43:33,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 280 transitions, 601 flow. Second operand has 3 states, 3 states have (on average 297.3333333333333) internal successors, (892), 3 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:33,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:33,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 316 [2025-03-14 01:43:33,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:34,002 INFO L124 PetriNetUnfolderBase]: 39/807 cut-off events. [2025-03-14 01:43:34,002 INFO L125 PetriNetUnfolderBase]: For 3/8 co-relation queries the response was YES. [2025-03-14 01:43:34,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 913 conditions, 807 events. 39/807 cut-off events. For 3/8 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 4580 event pairs, 8 based on Foata normal form. 1/711 useless extension candidates. Maximal degree in co-relation 756. Up to 32 conditions per place. [2025-03-14 01:43:34,013 INFO L140 encePairwiseOnDemand]: 313/316 looper letters, 11 selfloop transitions, 2 changer transitions 0/281 dead transitions. [2025-03-14 01:43:34,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 281 transitions, 631 flow [2025-03-14 01:43:34,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:34,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:34,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 902 transitions. [2025-03-14 01:43:34,015 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9514767932489452 [2025-03-14 01:43:34,015 INFO L175 Difference]: Start difference. First operand has 279 places, 280 transitions, 601 flow. Second operand 3 states and 902 transitions. [2025-03-14 01:43:34,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 281 transitions, 631 flow [2025-03-14 01:43:34,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 281 transitions, 631 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:43:34,018 INFO L231 Difference]: Finished difference. Result has 280 places, 279 transitions, 603 flow [2025-03-14 01:43:34,018 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=316, PETRI_DIFFERENCE_MINUEND_FLOW=599, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=603, PETRI_PLACES=280, PETRI_TRANSITIONS=279} [2025-03-14 01:43:34,018 INFO L279 CegarLoopForPetriNet]: 289 programPoint places, -9 predicate places. [2025-03-14 01:43:34,018 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 279 transitions, 603 flow [2025-03-14 01:43:34,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 297.3333333333333) internal successors, (892), 3 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:34,019 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:34,019 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:43:34,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 01:43:34,019 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-03-14 01:43:34,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:34,020 INFO L85 PathProgramCache]: Analyzing trace with hash 320304828, now seen corresponding path program 1 times [2025-03-14 01:43:34,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:34,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716010938] [2025-03-14 01:43:34,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:34,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:34,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-14 01:43:34,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-14 01:43:34,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:34,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:34,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:43:34,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:34,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716010938] [2025-03-14 01:43:34,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716010938] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:34,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:34,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:34,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652356460] [2025-03-14 01:43:34,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:34,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:34,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:34,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:34,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:34,067 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 295 out of 316 [2025-03-14 01:43:34,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 279 transitions, 603 flow. Second operand has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:34,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:34,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 295 of 316 [2025-03-14 01:43:34,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:34,170 INFO L124 PetriNetUnfolderBase]: 43/1122 cut-off events. [2025-03-14 01:43:34,170 INFO L125 PetriNetUnfolderBase]: For 9/21 co-relation queries the response was YES. [2025-03-14 01:43:34,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1251 conditions, 1122 events. 43/1122 cut-off events. For 9/21 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 7375 event pairs, 6 based on Foata normal form. 1/1006 useless extension candidates. Maximal degree in co-relation 1092. Up to 64 conditions per place. [2025-03-14 01:43:34,184 INFO L140 encePairwiseOnDemand]: 312/316 looper letters, 16 selfloop transitions, 2 changer transitions 0/284 dead transitions. [2025-03-14 01:43:34,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 284 transitions, 654 flow [2025-03-14 01:43:34,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:34,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:34,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 905 transitions. [2025-03-14 01:43:34,186 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9546413502109705 [2025-03-14 01:43:34,186 INFO L175 Difference]: Start difference. First operand has 280 places, 279 transitions, 603 flow. Second operand 3 states and 905 transitions. [2025-03-14 01:43:34,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 284 transitions, 654 flow [2025-03-14 01:43:34,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 284 transitions, 650 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:43:34,190 INFO L231 Difference]: Finished difference. Result has 279 places, 279 transitions, 609 flow [2025-03-14 01:43:34,191 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=316, PETRI_DIFFERENCE_MINUEND_FLOW=595, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=609, PETRI_PLACES=279, PETRI_TRANSITIONS=279} [2025-03-14 01:43:34,191 INFO L279 CegarLoopForPetriNet]: 289 programPoint places, -10 predicate places. [2025-03-14 01:43:34,191 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 279 transitions, 609 flow [2025-03-14 01:43:34,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:34,192 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:34,192 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] [2025-03-14 01:43:34,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 01:43:34,192 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-03-14 01:43:34,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:34,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1346806206, now seen corresponding path program 1 times [2025-03-14 01:43:34,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:34,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946091981] [2025-03-14 01:43:34,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:34,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:34,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-14 01:43:34,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-14 01:43:34,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:34,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:34,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:43:34,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:34,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946091981] [2025-03-14 01:43:34,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946091981] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:34,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:34,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:34,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401776202] [2025-03-14 01:43:34,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:34,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:34,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:34,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:34,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:34,256 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 289 out of 316 [2025-03-14 01:43:34,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 279 transitions, 609 flow. Second operand has 3 states, 3 states have (on average 290.6666666666667) internal successors, (872), 3 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:34,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:34,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 289 of 316 [2025-03-14 01:43:34,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:34,476 INFO L124 PetriNetUnfolderBase]: 230/2786 cut-off events. [2025-03-14 01:43:34,476 INFO L125 PetriNetUnfolderBase]: For 71/213 co-relation queries the response was YES. [2025-03-14 01:43:34,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3267 conditions, 2786 events. 230/2786 cut-off events. For 71/213 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 25437 event pairs, 102 based on Foata normal form. 1/2484 useless extension candidates. Maximal degree in co-relation 2770. Up to 337 conditions per place. [2025-03-14 01:43:34,494 INFO L140 encePairwiseOnDemand]: 308/316 looper letters, 17 selfloop transitions, 4 changer transitions 0/281 dead transitions. [2025-03-14 01:43:34,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 281 transitions, 657 flow [2025-03-14 01:43:34,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:34,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:34,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 892 transitions. [2025-03-14 01:43:34,496 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9409282700421941 [2025-03-14 01:43:34,496 INFO L175 Difference]: Start difference. First operand has 279 places, 279 transitions, 609 flow. Second operand 3 states and 892 transitions. [2025-03-14 01:43:34,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 281 transitions, 657 flow [2025-03-14 01:43:34,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 281 transitions, 657 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:43:34,499 INFO L231 Difference]: Finished difference. Result has 278 places, 279 transitions, 629 flow [2025-03-14 01:43:34,500 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=316, PETRI_DIFFERENCE_MINUEND_FLOW=601, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=629, PETRI_PLACES=278, PETRI_TRANSITIONS=279} [2025-03-14 01:43:34,500 INFO L279 CegarLoopForPetriNet]: 289 programPoint places, -11 predicate places. [2025-03-14 01:43:34,500 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 279 transitions, 629 flow [2025-03-14 01:43:34,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 290.6666666666667) internal successors, (872), 3 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:34,501 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:34,501 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] [2025-03-14 01:43:34,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-14 01:43:34,501 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-03-14 01:43:34,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:34,502 INFO L85 PathProgramCache]: Analyzing trace with hash 980924839, now seen corresponding path program 1 times [2025-03-14 01:43:34,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:34,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819464265] [2025-03-14 01:43:34,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:34,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:34,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-14 01:43:34,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-14 01:43:34,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:34,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:34,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:43:34,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:34,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819464265] [2025-03-14 01:43:34,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819464265] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:34,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:34,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:34,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217564490] [2025-03-14 01:43:34,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:34,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:34,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:34,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:34,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:34,541 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 295 out of 316 [2025-03-14 01:43:34,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 279 transitions, 629 flow. Second operand has 3 states, 3 states have (on average 296.6666666666667) internal successors, (890), 3 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:34,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:34,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 295 of 316 [2025-03-14 01:43:34,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:34,733 INFO L124 PetriNetUnfolderBase]: 115/2657 cut-off events. [2025-03-14 01:43:34,733 INFO L125 PetriNetUnfolderBase]: For 36/42 co-relation queries the response was YES. [2025-03-14 01:43:34,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2959 conditions, 2657 events. 115/2657 cut-off events. For 36/42 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 23789 event pairs, 16 based on Foata normal form. 0/2401 useless extension candidates. Maximal degree in co-relation 2527. Up to 168 conditions per place. [2025-03-14 01:43:34,754 INFO L140 encePairwiseOnDemand]: 312/316 looper letters, 15 selfloop transitions, 2 changer transitions 0/283 dead transitions. [2025-03-14 01:43:34,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 283 transitions, 675 flow [2025-03-14 01:43:34,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:34,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:34,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 904 transitions. [2025-03-14 01:43:34,755 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9535864978902954 [2025-03-14 01:43:34,755 INFO L175 Difference]: Start difference. First operand has 278 places, 279 transitions, 629 flow. Second operand 3 states and 904 transitions. [2025-03-14 01:43:34,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 283 transitions, 675 flow [2025-03-14 01:43:34,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 283 transitions, 675 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:43:34,759 INFO L231 Difference]: Finished difference. Result has 279 places, 279 transitions, 639 flow [2025-03-14 01:43:34,759 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=316, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=639, PETRI_PLACES=279, PETRI_TRANSITIONS=279} [2025-03-14 01:43:34,759 INFO L279 CegarLoopForPetriNet]: 289 programPoint places, -10 predicate places. [2025-03-14 01:43:34,759 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 279 transitions, 639 flow [2025-03-14 01:43:34,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 296.6666666666667) internal successors, (890), 3 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:34,760 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:34,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] [2025-03-14 01:43:34,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-14 01:43:34,760 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-03-14 01:43:34,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:34,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1708556058, now seen corresponding path program 1 times [2025-03-14 01:43:34,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:34,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022941160] [2025-03-14 01:43:34,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:34,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:34,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-14 01:43:34,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-14 01:43:34,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:34,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:34,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:43:34,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:34,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022941160] [2025-03-14 01:43:34,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022941160] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:34,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:34,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:34,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876269806] [2025-03-14 01:43:34,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:34,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:34,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:34,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:34,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:34,796 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 316 [2025-03-14 01:43:34,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 279 transitions, 639 flow. Second operand has 3 states, 3 states have (on average 297.6666666666667) internal successors, (893), 3 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:34,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:34,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 316 [2025-03-14 01:43:34,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:34,961 INFO L124 PetriNetUnfolderBase]: 108/2291 cut-off events. [2025-03-14 01:43:34,961 INFO L125 PetriNetUnfolderBase]: For 24/59 co-relation queries the response was YES. [2025-03-14 01:43:34,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2687 conditions, 2291 events. 108/2291 cut-off events. For 24/59 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 19852 event pairs, 22 based on Foata normal form. 2/2086 useless extension candidates. Maximal degree in co-relation 2191. Up to 80 conditions per place. [2025-03-14 01:43:34,981 INFO L140 encePairwiseOnDemand]: 313/316 looper letters, 11 selfloop transitions, 2 changer transitions 0/280 dead transitions. [2025-03-14 01:43:34,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 280 transitions, 669 flow [2025-03-14 01:43:34,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:34,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:34,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 902 transitions. [2025-03-14 01:43:34,983 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9514767932489452 [2025-03-14 01:43:34,983 INFO L175 Difference]: Start difference. First operand has 279 places, 279 transitions, 639 flow. Second operand 3 states and 902 transitions. [2025-03-14 01:43:34,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 280 transitions, 669 flow [2025-03-14 01:43:34,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 280 transitions, 669 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:43:34,986 INFO L231 Difference]: Finished difference. Result has 280 places, 278 transitions, 641 flow [2025-03-14 01:43:34,986 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=316, PETRI_DIFFERENCE_MINUEND_FLOW=637, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=641, PETRI_PLACES=280, PETRI_TRANSITIONS=278} [2025-03-14 01:43:34,987 INFO L279 CegarLoopForPetriNet]: 289 programPoint places, -9 predicate places. [2025-03-14 01:43:34,987 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 278 transitions, 641 flow [2025-03-14 01:43:34,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 297.6666666666667) internal successors, (893), 3 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:34,987 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:34,987 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] [2025-03-14 01:43:34,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-14 01:43:34,988 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-03-14 01:43:34,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:34,988 INFO L85 PathProgramCache]: Analyzing trace with hash -903691715, now seen corresponding path program 1 times [2025-03-14 01:43:34,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:34,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419454815] [2025-03-14 01:43:34,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:34,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:34,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-14 01:43:35,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-14 01:43:35,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:35,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:35,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:43:35,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:35,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419454815] [2025-03-14 01:43:35,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419454815] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:35,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:35,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:35,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132475079] [2025-03-14 01:43:35,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:35,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:35,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:35,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:35,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:35,041 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 316 [2025-03-14 01:43:35,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 278 transitions, 641 flow. Second operand has 3 states, 3 states have (on average 298.0) internal successors, (894), 3 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:35,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:35,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 316 [2025-03-14 01:43:35,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:35,205 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([770] L55-6-->L55-5: Formula: true InVars {} OutVars{thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~nondet12#1][182], [Black: 351#true, 338#(= |#race~length_2~0| 0), Black: 355#true, 359#true, 362#true, 233#L77true, 349#(= |#race~to_int_3~0| 0), 173#L55-5true, Black: 332#true, 353#(= |#race~length_4~0| 0), Black: 336#true, 334#(= |#race~length_0~0| 0), Black: 340#true, 357#(= |#race~to_int_5~0| 0), Black: 347#true, 342#(= |#race~to_int_1~0| 0)]) [2025-03-14 01:43:35,206 INFO L294 olderBase$Statistics]: this new event has 187 ancestors and is cut-off event [2025-03-14 01:43:35,206 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2025-03-14 01:43:35,206 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2025-03-14 01:43:35,206 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2025-03-14 01:43:35,209 INFO L124 PetriNetUnfolderBase]: 136/1683 cut-off events. [2025-03-14 01:43:35,209 INFO L125 PetriNetUnfolderBase]: For 87/114 co-relation queries the response was YES. [2025-03-14 01:43:35,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2156 conditions, 1683 events. 136/1683 cut-off events. For 87/114 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 13935 event pairs, 36 based on Foata normal form. 1/1548 useless extension candidates. Maximal degree in co-relation 1861. Up to 160 conditions per place. [2025-03-14 01:43:35,220 INFO L140 encePairwiseOnDemand]: 313/316 looper letters, 11 selfloop transitions, 2 changer transitions 0/279 dead transitions. [2025-03-14 01:43:35,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 279 transitions, 671 flow [2025-03-14 01:43:35,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:35,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:35,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 902 transitions. [2025-03-14 01:43:35,222 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9514767932489452 [2025-03-14 01:43:35,222 INFO L175 Difference]: Start difference. First operand has 280 places, 278 transitions, 641 flow. Second operand 3 states and 902 transitions. [2025-03-14 01:43:35,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 279 transitions, 671 flow [2025-03-14 01:43:35,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 279 transitions, 667 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:43:35,225 INFO L231 Difference]: Finished difference. Result has 279 places, 277 transitions, 639 flow [2025-03-14 01:43:35,225 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=316, PETRI_DIFFERENCE_MINUEND_FLOW=635, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=639, PETRI_PLACES=279, PETRI_TRANSITIONS=277} [2025-03-14 01:43:35,226 INFO L279 CegarLoopForPetriNet]: 289 programPoint places, -10 predicate places. [2025-03-14 01:43:35,226 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 277 transitions, 639 flow [2025-03-14 01:43:35,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 298.0) internal successors, (894), 3 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:35,226 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:35,227 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:43:35,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-14 01:43:35,227 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-03-14 01:43:35,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:35,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1153066281, now seen corresponding path program 1 times [2025-03-14 01:43:35,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:35,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106671592] [2025-03-14 01:43:35,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:35,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:35,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-14 01:43:35,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-14 01:43:35,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:35,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:35,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:43:35,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:35,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106671592] [2025-03-14 01:43:35,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106671592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:35,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:35,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:35,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919610536] [2025-03-14 01:43:35,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:35,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:35,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:35,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:35,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:35,267 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 298 out of 316 [2025-03-14 01:43:35,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 277 transitions, 639 flow. Second operand has 3 states, 3 states have (on average 301.0) internal successors, (903), 3 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:35,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:35,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 298 of 316 [2025-03-14 01:43:35,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:35,414 INFO L124 PetriNetUnfolderBase]: 73/1997 cut-off events. [2025-03-14 01:43:35,414 INFO L125 PetriNetUnfolderBase]: For 8/20 co-relation queries the response was YES. [2025-03-14 01:43:35,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2353 conditions, 1997 events. 73/1997 cut-off events. For 8/20 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 16201 event pairs, 4 based on Foata normal form. 0/1858 useless extension candidates. Maximal degree in co-relation 1998. Up to 66 conditions per place. [2025-03-14 01:43:35,430 INFO L140 encePairwiseOnDemand]: 314/316 looper letters, 8 selfloop transitions, 1 changer transitions 0/276 dead transitions. [2025-03-14 01:43:35,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 276 transitions, 655 flow [2025-03-14 01:43:35,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:35,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:35,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 904 transitions. [2025-03-14 01:43:35,432 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9535864978902954 [2025-03-14 01:43:35,432 INFO L175 Difference]: Start difference. First operand has 279 places, 277 transitions, 639 flow. Second operand 3 states and 904 transitions. [2025-03-14 01:43:35,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 276 transitions, 655 flow [2025-03-14 01:43:35,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 276 transitions, 651 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:43:35,436 INFO L231 Difference]: Finished difference. Result has 278 places, 276 transitions, 635 flow [2025-03-14 01:43:35,437 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=316, PETRI_DIFFERENCE_MINUEND_FLOW=633, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=635, PETRI_PLACES=278, PETRI_TRANSITIONS=276} [2025-03-14 01:43:35,437 INFO L279 CegarLoopForPetriNet]: 289 programPoint places, -11 predicate places. [2025-03-14 01:43:35,437 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 276 transitions, 635 flow [2025-03-14 01:43:35,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 301.0) internal successors, (903), 3 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:35,438 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:35,438 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:43:35,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-14 01:43:35,438 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-03-14 01:43:35,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:35,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1502529062, now seen corresponding path program 1 times [2025-03-14 01:43:35,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:35,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130938254] [2025-03-14 01:43:35,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:35,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:35,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-14 01:43:35,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-14 01:43:35,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:35,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:35,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:43:35,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:35,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130938254] [2025-03-14 01:43:35,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130938254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:35,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:35,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:35,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370573462] [2025-03-14 01:43:35,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:35,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:35,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:35,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:35,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:35,477 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 298 out of 316 [2025-03-14 01:43:35,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 276 transitions, 635 flow. Second operand has 3 states, 3 states have (on average 301.0) internal successors, (903), 3 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:35,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:35,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 298 of 316 [2025-03-14 01:43:35,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:35,668 INFO L124 PetriNetUnfolderBase]: 70/2132 cut-off events. [2025-03-14 01:43:35,668 INFO L125 PetriNetUnfolderBase]: For 8/22 co-relation queries the response was YES. [2025-03-14 01:43:35,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2431 conditions, 2132 events. 70/2132 cut-off events. For 8/22 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 17494 event pairs, 11 based on Foata normal form. 0/1985 useless extension candidates. Maximal degree in co-relation 2327. Up to 67 conditions per place. [2025-03-14 01:43:35,685 INFO L140 encePairwiseOnDemand]: 314/316 looper letters, 8 selfloop transitions, 1 changer transitions 0/275 dead transitions. [2025-03-14 01:43:35,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 275 transitions, 651 flow [2025-03-14 01:43:35,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:35,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:35,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 904 transitions. [2025-03-14 01:43:35,687 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9535864978902954 [2025-03-14 01:43:35,687 INFO L175 Difference]: Start difference. First operand has 278 places, 276 transitions, 635 flow. Second operand 3 states and 904 transitions. [2025-03-14 01:43:35,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 275 transitions, 651 flow [2025-03-14 01:43:35,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 275 transitions, 650 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:43:35,691 INFO L231 Difference]: Finished difference. Result has 278 places, 275 transitions, 634 flow [2025-03-14 01:43:35,692 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=316, PETRI_DIFFERENCE_MINUEND_FLOW=632, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=634, PETRI_PLACES=278, PETRI_TRANSITIONS=275} [2025-03-14 01:43:35,692 INFO L279 CegarLoopForPetriNet]: 289 programPoint places, -11 predicate places. [2025-03-14 01:43:35,692 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 275 transitions, 634 flow [2025-03-14 01:43:35,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 301.0) internal successors, (903), 3 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:35,693 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:35,693 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:43:35,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-14 01:43:35,693 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-03-14 01:43:35,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:35,694 INFO L85 PathProgramCache]: Analyzing trace with hash -2098860236, now seen corresponding path program 1 times [2025-03-14 01:43:35,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:35,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115301942] [2025-03-14 01:43:35,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:35,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:35,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-14 01:43:35,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-14 01:43:35,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:35,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:35,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:43:35,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:35,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115301942] [2025-03-14 01:43:35,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115301942] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:35,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:35,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:35,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584887096] [2025-03-14 01:43:35,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:35,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:35,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:35,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:35,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:35,750 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 298 out of 316 [2025-03-14 01:43:35,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 275 transitions, 634 flow. Second operand has 3 states, 3 states have (on average 301.0) internal successors, (903), 3 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:35,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:35,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 298 of 316 [2025-03-14 01:43:35,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:35,874 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([774] L55-5-->L55-3: Formula: (= |v_#race~result_8~0_3| |v_thread3Thread1of1ForFork0_#t~nondet12#1_3|) InVars {thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|} OutVars{#race~result_8~0=|v_#race~result_8~0_3|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|} AuxVars[] AssignedVars[#race~result_8~0][189], [368#true, Black: 351#true, 338#(= |#race~length_2~0| 0), 18#L55-3true, Black: 355#true, 233#L77true, 349#(= |#race~to_int_3~0| 0), Black: 332#true, 353#(= |#race~length_4~0| 0), Black: 336#true, 334#(= |#race~length_0~0| 0), Black: 340#true, 357#(= |#race~to_int_5~0| 0), 371#true, Black: 347#true, 342#(= |#race~to_int_1~0| 0)]) [2025-03-14 01:43:35,874 INFO L294 olderBase$Statistics]: this new event has 216 ancestors and is cut-off event [2025-03-14 01:43:35,874 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-03-14 01:43:35,875 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-03-14 01:43:35,875 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-03-14 01:43:35,876 INFO L124 PetriNetUnfolderBase]: 68/1501 cut-off events. [2025-03-14 01:43:35,876 INFO L125 PetriNetUnfolderBase]: For 21/36 co-relation queries the response was YES. [2025-03-14 01:43:35,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1771 conditions, 1501 events. 68/1501 cut-off events. For 21/36 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 11439 event pairs, 18 based on Foata normal form. 10/1395 useless extension candidates. Maximal degree in co-relation 1722. Up to 87 conditions per place. [2025-03-14 01:43:35,886 INFO L140 encePairwiseOnDemand]: 314/316 looper letters, 0 selfloop transitions, 0 changer transitions 274/274 dead transitions. [2025-03-14 01:43:35,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 274 transitions, 648 flow [2025-03-14 01:43:35,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:35,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:35,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 903 transitions. [2025-03-14 01:43:35,888 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9525316455696202 [2025-03-14 01:43:35,888 INFO L175 Difference]: Start difference. First operand has 278 places, 275 transitions, 634 flow. Second operand 3 states and 903 transitions. [2025-03-14 01:43:35,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 274 transitions, 648 flow [2025-03-14 01:43:35,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 274 transitions, 647 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:43:35,891 INFO L231 Difference]: Finished difference. Result has 278 places, 0 transitions, 0 flow [2025-03-14 01:43:35,891 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=316, PETRI_DIFFERENCE_MINUEND_FLOW=631, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=278, PETRI_TRANSITIONS=0} [2025-03-14 01:43:35,892 INFO L279 CegarLoopForPetriNet]: 289 programPoint places, -11 predicate places. [2025-03-14 01:43:35,892 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 0 transitions, 0 flow [2025-03-14 01:43:35,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 301.0) internal successors, (903), 3 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:35,894 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (47 of 48 remaining) [2025-03-14 01:43:35,894 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (46 of 48 remaining) [2025-03-14 01:43:35,895 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (45 of 48 remaining) [2025-03-14 01:43:35,895 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (44 of 48 remaining) [2025-03-14 01:43:35,895 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (43 of 48 remaining) [2025-03-14 01:43:35,895 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (42 of 48 remaining) [2025-03-14 01:43:35,895 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (41 of 48 remaining) [2025-03-14 01:43:35,895 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (40 of 48 remaining) [2025-03-14 01:43:35,895 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (39 of 48 remaining) [2025-03-14 01:43:35,895 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (38 of 48 remaining) [2025-03-14 01:43:35,895 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (37 of 48 remaining) [2025-03-14 01:43:35,895 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (36 of 48 remaining) [2025-03-14 01:43:35,895 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (35 of 48 remaining) [2025-03-14 01:43:35,896 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (34 of 48 remaining) [2025-03-14 01:43:35,896 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (33 of 48 remaining) [2025-03-14 01:43:35,896 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (32 of 48 remaining) [2025-03-14 01:43:35,896 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (31 of 48 remaining) [2025-03-14 01:43:35,896 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (30 of 48 remaining) [2025-03-14 01:43:35,896 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (29 of 48 remaining) [2025-03-14 01:43:35,896 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (28 of 48 remaining) [2025-03-14 01:43:35,896 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (27 of 48 remaining) [2025-03-14 01:43:35,896 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (26 of 48 remaining) [2025-03-14 01:43:35,896 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (25 of 48 remaining) [2025-03-14 01:43:35,896 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (24 of 48 remaining) [2025-03-14 01:43:35,896 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (23 of 48 remaining) [2025-03-14 01:43:35,896 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (22 of 48 remaining) [2025-03-14 01:43:35,897 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (21 of 48 remaining) [2025-03-14 01:43:35,897 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 48 remaining) [2025-03-14 01:43:35,897 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 48 remaining) [2025-03-14 01:43:35,897 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 48 remaining) [2025-03-14 01:43:35,897 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (17 of 48 remaining) [2025-03-14 01:43:35,897 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (16 of 48 remaining) [2025-03-14 01:43:35,897 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (15 of 48 remaining) [2025-03-14 01:43:35,898 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (14 of 48 remaining) [2025-03-14 01:43:35,898 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (13 of 48 remaining) [2025-03-14 01:43:35,898 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (12 of 48 remaining) [2025-03-14 01:43:35,898 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (11 of 48 remaining) [2025-03-14 01:43:35,898 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (10 of 48 remaining) [2025-03-14 01:43:35,898 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (9 of 48 remaining) [2025-03-14 01:43:35,898 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (8 of 48 remaining) [2025-03-14 01:43:35,898 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (7 of 48 remaining) [2025-03-14 01:43:35,898 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (6 of 48 remaining) [2025-03-14 01:43:35,898 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (5 of 48 remaining) [2025-03-14 01:43:35,898 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (4 of 48 remaining) [2025-03-14 01:43:35,898 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (3 of 48 remaining) [2025-03-14 01:43:35,898 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (2 of 48 remaining) [2025-03-14 01:43:35,898 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (1 of 48 remaining) [2025-03-14 01:43:35,898 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (0 of 48 remaining) [2025-03-14 01:43:35,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-14 01:43:35,899 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:43:35,903 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-14 01:43:35,903 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-14 01:43:35,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.03 01:43:35 BasicIcfg [2025-03-14 01:43:35,910 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-14 01:43:35,910 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-14 01:43:35,911 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-14 01:43:35,911 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-14 01:43:35,911 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:43:31" (3/4) ... [2025-03-14 01:43:35,912 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-14 01:43:35,914 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-14 01:43:35,914 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-14 01:43:35,914 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-14 01:43:35,917 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-14 01:43:35,917 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-14 01:43:35,917 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-14 01:43:35,917 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-14 01:43:35,968 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-14 01:43:35,969 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-14 01:43:35,969 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-14 01:43:35,969 INFO L158 Benchmark]: Toolchain (without parser) took 4808.06ms. Allocated memory was 142.6MB in the beginning and 478.2MB in the end (delta: 335.5MB). Free memory was 105.3MB in the beginning and 237.2MB in the end (delta: -132.0MB). Peak memory consumption was 200.3MB. Max. memory is 16.1GB. [2025-03-14 01:43:35,969 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:43:35,970 INFO L158 Benchmark]: CACSL2BoogieTranslator took 161.45ms. Allocated memory is still 142.6MB. Free memory was 105.3MB in the beginning and 93.9MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 01:43:35,970 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.03ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 91.1MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 01:43:35,971 INFO L158 Benchmark]: Boogie Preprocessor took 15.84ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 90.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:43:35,972 INFO L158 Benchmark]: IcfgBuilder took 403.47ms. Allocated memory is still 142.6MB. Free memory was 90.0MB in the beginning and 68.2MB in the end (delta: 21.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-14 01:43:35,972 INFO L158 Benchmark]: TraceAbstraction took 4140.37ms. Allocated memory was 142.6MB in the beginning and 478.2MB in the end (delta: 335.5MB). Free memory was 67.1MB in the beginning and 245.9MB in the end (delta: -178.8MB). Peak memory consumption was 149.9MB. Max. memory is 16.1GB. [2025-03-14 01:43:35,972 INFO L158 Benchmark]: Witness Printer took 58.30ms. Allocated memory is still 478.2MB. Free memory was 245.9MB in the beginning and 237.2MB in the end (delta: 8.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 01:43:35,974 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 161.45ms. Allocated memory is still 142.6MB. Free memory was 105.3MB in the beginning and 93.9MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.03ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 91.1MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 15.84ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 90.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 403.47ms. Allocated memory is still 142.6MB. Free memory was 90.0MB in the beginning and 68.2MB in the end (delta: 21.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4140.37ms. Allocated memory was 142.6MB in the beginning and 478.2MB in the end (delta: 335.5MB). Free memory was 67.1MB in the beginning and 245.9MB in the end (delta: -178.8MB). Peak memory consumption was 149.9MB. Max. memory is 16.1GB. * Witness Printer took 58.30ms. Allocated memory is still 478.2MB. Free memory was 245.9MB in the beginning and 237.2MB in the end (delta: 8.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 43]: 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: 43]: 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: 43]: 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: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: 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 7 procedures, 479 locations, 48 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: 4.0s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 314 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 109 mSDsluCounter, 76 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 482 IncrementalHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 76 mSDtfsCounter, 482 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=641occurred in iteration=14, InterpolantAutomatonStates: 54, 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, 1469 NumberOfCodeBlocks, 1469 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1451 ConstructedInterpolants, 0 QuantifiedInterpolants, 1487 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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 27 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-14 01:43:35,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE