./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/unroll-4.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/unroll-4.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 bb07434636f33664cc09ed992a41516efeea5f96121c916fb8904844e76d9fcd --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:46:23,341 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:46:23,388 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-14 01:46:23,393 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:46:23,393 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:46:23,413 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:46:23,413 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:46:23,413 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:46:23,414 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:46:23,414 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:46:23,414 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:46:23,414 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:46:23,414 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:46:23,414 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:46:23,414 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:46:23,414 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:46:23,414 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:46:23,414 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:46:23,414 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:46:23,415 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:46:23,416 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:46:23,416 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:46:23,417 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-14 01:46:23,417 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-14 01:46:23,417 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:46:23,417 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:46:23,417 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:46:23,417 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:46:23,417 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:46:23,417 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:46:23,417 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:46:23,417 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:46:23,418 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:46:23,418 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:46:23,418 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:46:23,418 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:46:23,418 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:46:23,418 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:46:23,418 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:46:23,418 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:46:23,419 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:46:23,419 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:46:23,419 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 -> bb07434636f33664cc09ed992a41516efeea5f96121c916fb8904844e76d9fcd [2025-03-14 01:46:23,659 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:46:23,668 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:46:23,670 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:46:23,671 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:46:23,671 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:46:23,672 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/unroll-4.wvr.c [2025-03-14 01:46:24,865 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96b89df0f/4b2538e530344dd3be09309c0d23e271/FLAG1010f3811 [2025-03-14 01:46:25,090 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:46:25,101 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/unroll-4.wvr.c [2025-03-14 01:46:25,113 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96b89df0f/4b2538e530344dd3be09309c0d23e271/FLAG1010f3811 [2025-03-14 01:46:25,438 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96b89df0f/4b2538e530344dd3be09309c0d23e271 [2025-03-14 01:46:25,439 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:46:25,441 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:46:25,442 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:46:25,442 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:46:25,445 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:46:25,445 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:46:25" (1/1) ... [2025-03-14 01:46:25,446 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@82a2e25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:46:25, skipping insertion in model container [2025-03-14 01:46:25,446 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:46:25" (1/1) ... [2025-03-14 01:46:25,456 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:46:25,597 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:46:25,608 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:46:25,628 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:46:25,644 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:46:25,645 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:46:25 WrapperNode [2025-03-14 01:46:25,645 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:46:25,646 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:46:25,646 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:46:25,647 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:46:25,651 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:46:25" (1/1) ... [2025-03-14 01:46:25,661 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:46:25" (1/1) ... [2025-03-14 01:46:25,686 INFO L138 Inliner]: procedures = 23, calls = 27, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 292 [2025-03-14 01:46:25,690 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:46:25,691 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:46:25,691 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:46:25,691 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:46:25,696 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:46:25" (1/1) ... [2025-03-14 01:46:25,697 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:46:25" (1/1) ... [2025-03-14 01:46:25,702 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:46:25" (1/1) ... [2025-03-14 01:46:25,703 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:46:25" (1/1) ... [2025-03-14 01:46:25,719 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:46:25" (1/1) ... [2025-03-14 01:46:25,721 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:46:25" (1/1) ... [2025-03-14 01:46:25,726 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:46:25" (1/1) ... [2025-03-14 01:46:25,727 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:46:25" (1/1) ... [2025-03-14 01:46:25,728 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:46:25,732 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:46:25,732 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:46:25,732 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:46:25,733 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:46:25" (1/1) ... [2025-03-14 01:46:25,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:46:25,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:46:25,760 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:46:25,762 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:46:25,779 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:46:25,780 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-14 01:46:25,780 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-14 01:46:25,780 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-14 01:46:25,780 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-14 01:46:25,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 01:46:25,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-14 01:46:25,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-14 01:46:25,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:46:25,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:46:25,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-14 01:46:25,782 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:46:25,856 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:46:25,857 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:46:26,303 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:46:26,303 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:46:26,304 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:46:26,318 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:46:26,318 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:46:26 BoogieIcfgContainer [2025-03-14 01:46:26,318 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:46:26,320 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:46:26,320 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:46:26,327 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:46:26,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:46:25" (1/3) ... [2025-03-14 01:46:26,331 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dcf7a7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:46:26, skipping insertion in model container [2025-03-14 01:46:26,331 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:46:25" (2/3) ... [2025-03-14 01:46:26,331 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dcf7a7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:46:26, skipping insertion in model container [2025-03-14 01:46:26,331 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:46:26" (3/3) ... [2025-03-14 01:46:26,332 INFO L128 eAbstractionObserver]: Analyzing ICFG unroll-4.wvr.c [2025-03-14 01:46:26,341 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:46:26,342 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unroll-4.wvr.c that has 3 procedures, 374 locations, 1 initial locations, 3 loop locations, and 46 error locations. [2025-03-14 01:46:26,343 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:46:26,443 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-14 01:46:26,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 380 places, 393 transitions, 800 flow [2025-03-14 01:46:26,596 INFO L124 PetriNetUnfolderBase]: 20/391 cut-off events. [2025-03-14 01:46:26,600 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:46:26,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 400 conditions, 391 events. 20/391 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 542 event pairs, 0 based on Foata normal form. 0/325 useless extension candidates. Maximal degree in co-relation 255. Up to 2 conditions per place. [2025-03-14 01:46:26,609 INFO L82 GeneralOperation]: Start removeDead. Operand has 380 places, 393 transitions, 800 flow [2025-03-14 01:46:26,630 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 362 places, 374 transitions, 760 flow [2025-03-14 01:46:26,639 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:46:26,652 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;@36e8038e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:46:26,652 INFO L334 AbstractCegarLoop]: Starting to check reachability of 85 error locations. [2025-03-14 01:46:26,656 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:46:26,656 INFO L124 PetriNetUnfolderBase]: 0/20 cut-off events. [2025-03-14 01:46:26,656 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:46:26,656 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:26,657 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] [2025-03-14 01:46:26,657 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2025-03-14 01:46:26,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:26,661 INFO L85 PathProgramCache]: Analyzing trace with hash -333536296, now seen corresponding path program 1 times [2025-03-14 01:46:26,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:26,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657066757] [2025-03-14 01:46:26,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:26,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:26,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-14 01:46:26,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-14 01:46:26,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:26,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:26,762 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:46:26,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:26,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657066757] [2025-03-14 01:46:26,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657066757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:26,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:26,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:46:26,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531609035] [2025-03-14 01:46:26,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:26,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:46:26,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:26,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:46:26,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:46:26,818 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 393 [2025-03-14 01:46:26,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 374 transitions, 760 flow. Second operand has 3 states, 3 states have (on average 367.3333333333333) internal successors, (1102), 3 states have internal predecessors, (1102), 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:46:26,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:26,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 393 [2025-03-14 01:46:26,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:26,896 INFO L124 PetriNetUnfolderBase]: 15/470 cut-off events. [2025-03-14 01:46:26,896 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-14 01:46:26,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 503 conditions, 470 events. 15/470 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1078 event pairs, 3 based on Foata normal form. 11/397 useless extension candidates. Maximal degree in co-relation 365. Up to 19 conditions per place. [2025-03-14 01:46:26,901 INFO L140 encePairwiseOnDemand]: 379/393 looper letters, 10 selfloop transitions, 2 changer transitions 4/362 dead transitions. [2025-03-14 01:46:26,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 362 transitions, 760 flow [2025-03-14 01:46:26,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:46:26,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:46:26,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1122 transitions. [2025-03-14 01:46:26,911 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9516539440203562 [2025-03-14 01:46:26,912 INFO L175 Difference]: Start difference. First operand has 362 places, 374 transitions, 760 flow. Second operand 3 states and 1122 transitions. [2025-03-14 01:46:26,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 362 transitions, 760 flow [2025-03-14 01:46:26,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 362 transitions, 752 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-14 01:46:26,921 INFO L231 Difference]: Finished difference. Result has 359 places, 358 transitions, 724 flow [2025-03-14 01:46:26,923 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=728, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=724, PETRI_PLACES=359, PETRI_TRANSITIONS=358} [2025-03-14 01:46:26,925 INFO L279 CegarLoopForPetriNet]: 362 programPoint places, -3 predicate places. [2025-03-14 01:46:26,925 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 358 transitions, 724 flow [2025-03-14 01:46:26,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 367.3333333333333) internal successors, (1102), 3 states have internal predecessors, (1102), 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:46:26,926 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:26,926 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:46:26,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:46:26,926 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2025-03-14 01:46:26,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:26,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1626852551, now seen corresponding path program 1 times [2025-03-14 01:46:26,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:26,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812692247] [2025-03-14 01:46:26,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:26,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:26,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-14 01:46:26,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-14 01:46:26,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:26,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:26,959 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:46:26,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:26,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812692247] [2025-03-14 01:46:26,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812692247] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:26,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:26,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:46:26,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935180967] [2025-03-14 01:46:26,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:26,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:46:26,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:26,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:46:26,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:46:27,008 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 362 out of 393 [2025-03-14 01:46:27,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 358 transitions, 724 flow. Second operand has 3 states, 3 states have (on average 363.3333333333333) internal successors, (1090), 3 states have internal predecessors, (1090), 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:46:27,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:27,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 362 of 393 [2025-03-14 01:46:27,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:27,098 INFO L124 PetriNetUnfolderBase]: 22/558 cut-off events. [2025-03-14 01:46:27,098 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-14 01:46:27,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 600 conditions, 558 events. 22/558 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1424 event pairs, 9 based on Foata normal form. 0/459 useless extension candidates. Maximal degree in co-relation 572. Up to 33 conditions per place. [2025-03-14 01:46:27,103 INFO L140 encePairwiseOnDemand]: 390/393 looper letters, 14 selfloop transitions, 2 changer transitions 0/357 dead transitions. [2025-03-14 01:46:27,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 357 transitions, 754 flow [2025-03-14 01:46:27,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:46:27,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:46:27,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1103 transitions. [2025-03-14 01:46:27,107 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9355385920271416 [2025-03-14 01:46:27,107 INFO L175 Difference]: Start difference. First operand has 359 places, 358 transitions, 724 flow. Second operand 3 states and 1103 transitions. [2025-03-14 01:46:27,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 357 transitions, 754 flow [2025-03-14 01:46:27,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 357 transitions, 750 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:46:27,116 INFO L231 Difference]: Finished difference. Result has 354 places, 357 transitions, 722 flow [2025-03-14 01:46:27,117 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=718, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=722, PETRI_PLACES=354, PETRI_TRANSITIONS=357} [2025-03-14 01:46:27,117 INFO L279 CegarLoopForPetriNet]: 362 programPoint places, -8 predicate places. [2025-03-14 01:46:27,117 INFO L471 AbstractCegarLoop]: Abstraction has has 354 places, 357 transitions, 722 flow [2025-03-14 01:46:27,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 363.3333333333333) internal successors, (1090), 3 states have internal predecessors, (1090), 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:46:27,118 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:27,118 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:46:27,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:46:27,118 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2025-03-14 01:46:27,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:27,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1374382448, now seen corresponding path program 1 times [2025-03-14 01:46:27,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:27,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850564613] [2025-03-14 01:46:27,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:27,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:27,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-14 01:46:27,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-14 01:46:27,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:27,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:27,172 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:46:27,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:27,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850564613] [2025-03-14 01:46:27,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850564613] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:27,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:27,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:46:27,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049628733] [2025-03-14 01:46:27,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:27,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:46:27,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:27,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:46:27,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:46:27,214 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 354 out of 393 [2025-03-14 01:46:27,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 357 transitions, 722 flow. Second operand has 3 states, 3 states have (on average 355.0) internal successors, (1065), 3 states have internal predecessors, (1065), 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:46:27,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:27,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 354 of 393 [2025-03-14 01:46:27,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:27,369 INFO L124 PetriNetUnfolderBase]: 79/1186 cut-off events. [2025-03-14 01:46:27,370 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-03-14 01:46:27,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1293 conditions, 1186 events. 79/1186 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 5242 event pairs, 26 based on Foata normal form. 0/968 useless extension candidates. Maximal degree in co-relation 1257. Up to 97 conditions per place. [2025-03-14 01:46:27,379 INFO L140 encePairwiseOnDemand]: 385/393 looper letters, 18 selfloop transitions, 1 changer transitions 0/350 dead transitions. [2025-03-14 01:46:27,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 350 transitions, 746 flow [2025-03-14 01:46:27,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:46:27,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:46:27,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1088 transitions. [2025-03-14 01:46:27,397 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9228159457167091 [2025-03-14 01:46:27,397 INFO L175 Difference]: Start difference. First operand has 354 places, 357 transitions, 722 flow. Second operand 3 states and 1088 transitions. [2025-03-14 01:46:27,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 350 transitions, 746 flow [2025-03-14 01:46:27,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 350 transitions, 742 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:46:27,403 INFO L231 Difference]: Finished difference. Result has 347 places, 350 transitions, 706 flow [2025-03-14 01:46:27,403 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=706, PETRI_PLACES=347, PETRI_TRANSITIONS=350} [2025-03-14 01:46:27,404 INFO L279 CegarLoopForPetriNet]: 362 programPoint places, -15 predicate places. [2025-03-14 01:46:27,405 INFO L471 AbstractCegarLoop]: Abstraction has has 347 places, 350 transitions, 706 flow [2025-03-14 01:46:27,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 355.0) internal successors, (1065), 3 states have internal predecessors, (1065), 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:46:27,405 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:27,405 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] [2025-03-14 01:46:27,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:46:27,406 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2025-03-14 01:46:27,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:27,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1711378639, now seen corresponding path program 1 times [2025-03-14 01:46:27,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:27,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743214381] [2025-03-14 01:46:27,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:27,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:27,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-14 01:46:27,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-14 01:46:27,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:27,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:27,994 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:46:27,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:27,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743214381] [2025-03-14 01:46:27,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743214381] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:27,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:27,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:46:27,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404167331] [2025-03-14 01:46:27,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:27,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:46:27,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:27,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:46:27,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:46:28,121 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 342 out of 393 [2025-03-14 01:46:28,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 350 transitions, 706 flow. Second operand has 6 states, 6 states have (on average 343.5) internal successors, (2061), 6 states have internal predecessors, (2061), 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:46:28,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:28,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 342 of 393 [2025-03-14 01:46:28,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:28,286 INFO L124 PetriNetUnfolderBase]: 154/1467 cut-off events. [2025-03-14 01:46:28,286 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-03-14 01:46:28,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1721 conditions, 1467 events. 154/1467 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 7334 event pairs, 84 based on Foata normal form. 0/1218 useless extension candidates. Maximal degree in co-relation 1686. Up to 240 conditions per place. [2025-03-14 01:46:28,296 INFO L140 encePairwiseOnDemand]: 387/393 looper letters, 32 selfloop transitions, 5 changer transitions 0/349 dead transitions. [2025-03-14 01:46:28,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 349 transitions, 778 flow [2025-03-14 01:46:28,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:46:28,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:46:28,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2090 transitions. [2025-03-14 01:46:28,300 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8863443596268024 [2025-03-14 01:46:28,300 INFO L175 Difference]: Start difference. First operand has 347 places, 350 transitions, 706 flow. Second operand 6 states and 2090 transitions. [2025-03-14 01:46:28,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 349 transitions, 778 flow [2025-03-14 01:46:28,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 350 places, 349 transitions, 777 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:46:28,305 INFO L231 Difference]: Finished difference. Result has 350 places, 349 transitions, 713 flow [2025-03-14 01:46:28,306 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=703, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=344, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=713, PETRI_PLACES=350, PETRI_TRANSITIONS=349} [2025-03-14 01:46:28,306 INFO L279 CegarLoopForPetriNet]: 362 programPoint places, -12 predicate places. [2025-03-14 01:46:28,307 INFO L471 AbstractCegarLoop]: Abstraction has has 350 places, 349 transitions, 713 flow [2025-03-14 01:46:28,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 343.5) internal successors, (2061), 6 states have internal predecessors, (2061), 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:46:28,308 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:28,308 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] [2025-03-14 01:46:28,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:46:28,308 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2025-03-14 01:46:28,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:28,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1801623471, now seen corresponding path program 1 times [2025-03-14 01:46:28,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:28,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863581977] [2025-03-14 01:46:28,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:28,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:28,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-14 01:46:28,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-14 01:46:28,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:28,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:28,347 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:46:28,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:28,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863581977] [2025-03-14 01:46:28,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863581977] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:28,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:28,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:46:28,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977291585] [2025-03-14 01:46:28,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:28,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:46:28,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:28,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:46:28,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:46:28,372 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 393 [2025-03-14 01:46:28,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 349 transitions, 713 flow. Second operand has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 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:46:28,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:28,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 393 [2025-03-14 01:46:28,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:28,421 INFO L124 PetriNetUnfolderBase]: 22/545 cut-off events. [2025-03-14 01:46:28,422 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-14 01:46:28,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 589 conditions, 545 events. 22/545 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1373 event pairs, 9 based on Foata normal form. 0/459 useless extension candidates. Maximal degree in co-relation 571. Up to 31 conditions per place. [2025-03-14 01:46:28,425 INFO L140 encePairwiseOnDemand]: 390/393 looper letters, 12 selfloop transitions, 2 changer transitions 0/348 dead transitions. [2025-03-14 01:46:28,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 348 transitions, 739 flow [2025-03-14 01:46:28,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:46:28,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:46:28,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1107 transitions. [2025-03-14 01:46:28,427 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9389312977099237 [2025-03-14 01:46:28,427 INFO L175 Difference]: Start difference. First operand has 350 places, 349 transitions, 713 flow. Second operand 3 states and 1107 transitions. [2025-03-14 01:46:28,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 348 transitions, 739 flow [2025-03-14 01:46:28,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 348 transitions, 729 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:46:28,432 INFO L231 Difference]: Finished difference. Result has 346 places, 348 transitions, 705 flow [2025-03-14 01:46:28,432 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=701, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=705, PETRI_PLACES=346, PETRI_TRANSITIONS=348} [2025-03-14 01:46:28,433 INFO L279 CegarLoopForPetriNet]: 362 programPoint places, -16 predicate places. [2025-03-14 01:46:28,433 INFO L471 AbstractCegarLoop]: Abstraction has has 346 places, 348 transitions, 705 flow [2025-03-14 01:46:28,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 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:46:28,434 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:28,434 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] [2025-03-14 01:46:28,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:46:28,434 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2025-03-14 01:46:28,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:28,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1154686870, now seen corresponding path program 1 times [2025-03-14 01:46:28,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:28,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475312509] [2025-03-14 01:46:28,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:28,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:28,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-14 01:46:28,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-14 01:46:28,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:28,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:28,469 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:46:28,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:28,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475312509] [2025-03-14 01:46:28,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475312509] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:28,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:28,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:46:28,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281520772] [2025-03-14 01:46:28,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:28,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:46:28,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:28,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:46:28,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:46:28,481 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 393 [2025-03-14 01:46:28,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 348 transitions, 705 flow. Second operand has 3 states, 3 states have (on average 367.0) internal successors, (1101), 3 states have internal predecessors, (1101), 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:46:28,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:28,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 393 [2025-03-14 01:46:28,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:28,568 INFO L124 PetriNetUnfolderBase]: 36/989 cut-off events. [2025-03-14 01:46:28,568 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-14 01:46:28,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1032 conditions, 989 events. 36/989 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 4017 event pairs, 8 based on Foata normal form. 0/824 useless extension candidates. Maximal degree in co-relation 996. Up to 32 conditions per place. [2025-03-14 01:46:28,574 INFO L140 encePairwiseOnDemand]: 389/393 looper letters, 10 selfloop transitions, 1 changer transitions 0/345 dead transitions. [2025-03-14 01:46:28,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 345 transitions, 721 flow [2025-03-14 01:46:28,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:46:28,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:46:28,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1112 transitions. [2025-03-14 01:46:28,577 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9431721798134012 [2025-03-14 01:46:28,577 INFO L175 Difference]: Start difference. First operand has 346 places, 348 transitions, 705 flow. Second operand 3 states and 1112 transitions. [2025-03-14 01:46:28,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 345 transitions, 721 flow [2025-03-14 01:46:28,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 345 transitions, 717 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:46:28,582 INFO L231 Difference]: Finished difference. Result has 343 places, 345 transitions, 697 flow [2025-03-14 01:46:28,582 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=695, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=344, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=697, PETRI_PLACES=343, PETRI_TRANSITIONS=345} [2025-03-14 01:46:28,584 INFO L279 CegarLoopForPetriNet]: 362 programPoint places, -19 predicate places. [2025-03-14 01:46:28,584 INFO L471 AbstractCegarLoop]: Abstraction has has 343 places, 345 transitions, 697 flow [2025-03-14 01:46:28,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 367.0) internal successors, (1101), 3 states have internal predecessors, (1101), 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:46:28,585 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:28,585 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] [2025-03-14 01:46:28,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:46:28,586 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2025-03-14 01:46:28,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:28,586 INFO L85 PathProgramCache]: Analyzing trace with hash 238744115, now seen corresponding path program 1 times [2025-03-14 01:46:28,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:28,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300951894] [2025-03-14 01:46:28,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:28,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:28,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-14 01:46:28,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-14 01:46:28,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:28,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:28,638 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:46:28,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:28,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300951894] [2025-03-14 01:46:28,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300951894] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:28,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:28,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:46:28,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707453910] [2025-03-14 01:46:28,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:28,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:46:28,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:28,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:46:28,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:46:28,656 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 363 out of 393 [2025-03-14 01:46:28,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 345 transitions, 697 flow. Second operand has 3 states, 3 states have (on average 364.0) internal successors, (1092), 3 states have internal predecessors, (1092), 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:46:28,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:28,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 363 of 393 [2025-03-14 01:46:28,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:28,724 INFO L124 PetriNetUnfolderBase]: 21/563 cut-off events. [2025-03-14 01:46:28,724 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:46:28,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 604 conditions, 563 events. 21/563 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1140 event pairs, 1 based on Foata normal form. 0/486 useless extension candidates. Maximal degree in co-relation 569. Up to 20 conditions per place. [2025-03-14 01:46:28,729 INFO L140 encePairwiseOnDemand]: 386/393 looper letters, 11 selfloop transitions, 3 changer transitions 0/342 dead transitions. [2025-03-14 01:46:28,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 342 transitions, 720 flow [2025-03-14 01:46:28,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:46:28,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:46:28,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1107 transitions. [2025-03-14 01:46:28,731 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9389312977099237 [2025-03-14 01:46:28,731 INFO L175 Difference]: Start difference. First operand has 343 places, 345 transitions, 697 flow. Second operand 3 states and 1107 transitions. [2025-03-14 01:46:28,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 342 transitions, 720 flow [2025-03-14 01:46:28,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 342 transitions, 719 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:46:28,739 INFO L231 Difference]: Finished difference. Result has 340 places, 341 transitions, 694 flow [2025-03-14 01:46:28,739 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=338, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=694, PETRI_PLACES=340, PETRI_TRANSITIONS=341} [2025-03-14 01:46:28,740 INFO L279 CegarLoopForPetriNet]: 362 programPoint places, -22 predicate places. [2025-03-14 01:46:28,740 INFO L471 AbstractCegarLoop]: Abstraction has has 340 places, 341 transitions, 694 flow [2025-03-14 01:46:28,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 364.0) internal successors, (1092), 3 states have internal predecessors, (1092), 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:46:28,740 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:28,740 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] [2025-03-14 01:46:28,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:46:28,741 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err27ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2025-03-14 01:46:28,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:28,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1381865551, now seen corresponding path program 1 times [2025-03-14 01:46:28,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:28,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844482148] [2025-03-14 01:46:28,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:28,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:28,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-14 01:46:28,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-14 01:46:28,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:28,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:28,780 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:46:28,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:28,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844482148] [2025-03-14 01:46:28,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844482148] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:28,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:28,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:46:28,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670908590] [2025-03-14 01:46:28,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:28,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:46:28,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:28,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:46:28,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:46:28,836 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 393 [2025-03-14 01:46:28,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 341 transitions, 694 flow. Second operand has 3 states, 3 states have (on average 334.3333333333333) internal successors, (1003), 3 states have internal predecessors, (1003), 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:46:28,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:28,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 393 [2025-03-14 01:46:28,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:28,902 INFO L124 PetriNetUnfolderBase]: 40/488 cut-off events. [2025-03-14 01:46:28,903 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2025-03-14 01:46:28,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 587 conditions, 488 events. 40/488 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1383 event pairs, 4 based on Foata normal form. 1/445 useless extension candidates. Maximal degree in co-relation 552. Up to 73 conditions per place. [2025-03-14 01:46:28,906 INFO L140 encePairwiseOnDemand]: 371/393 looper letters, 24 selfloop transitions, 8 changer transitions 4/329 dead transitions. [2025-03-14 01:46:28,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 329 transitions, 739 flow [2025-03-14 01:46:28,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:46:28,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:46:28,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1046 transitions. [2025-03-14 01:46:28,908 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8871925360474979 [2025-03-14 01:46:28,908 INFO L175 Difference]: Start difference. First operand has 340 places, 341 transitions, 694 flow. Second operand 3 states and 1046 transitions. [2025-03-14 01:46:28,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 329 transitions, 739 flow [2025-03-14 01:46:28,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 329 transitions, 733 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:46:28,913 INFO L231 Difference]: Finished difference. Result has 327 places, 324 transitions, 669 flow [2025-03-14 01:46:28,913 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=662, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=669, PETRI_PLACES=327, PETRI_TRANSITIONS=324} [2025-03-14 01:46:28,914 INFO L279 CegarLoopForPetriNet]: 362 programPoint places, -35 predicate places. [2025-03-14 01:46:28,914 INFO L471 AbstractCegarLoop]: Abstraction has has 327 places, 324 transitions, 669 flow [2025-03-14 01:46:28,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 334.3333333333333) internal successors, (1003), 3 states have internal predecessors, (1003), 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:46:28,915 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:28,915 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:46:28,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:46:28,915 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2025-03-14 01:46:28,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:28,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1617421717, now seen corresponding path program 1 times [2025-03-14 01:46:28,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:28,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136678924] [2025-03-14 01:46:28,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:28,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:28,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-14 01:46:28,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-14 01:46:28,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:28,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:28,950 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:46:28,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:28,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136678924] [2025-03-14 01:46:28,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136678924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:28,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:28,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:46:28,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913771651] [2025-03-14 01:46:28,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:28,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:46:28,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:28,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:46:28,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:46:28,970 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 360 out of 393 [2025-03-14 01:46:28,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 324 transitions, 669 flow. Second operand has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 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:46:28,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:28,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 360 of 393 [2025-03-14 01:46:28,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:29,070 INFO L124 PetriNetUnfolderBase]: 71/991 cut-off events. [2025-03-14 01:46:29,070 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-03-14 01:46:29,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1123 conditions, 991 events. 71/991 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 3923 event pairs, 8 based on Foata normal form. 0/896 useless extension candidates. Maximal degree in co-relation 1088. Up to 86 conditions per place. [2025-03-14 01:46:29,074 INFO L140 encePairwiseOnDemand]: 386/393 looper letters, 16 selfloop transitions, 2 changer transitions 0/323 dead transitions. [2025-03-14 01:46:29,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 323 transitions, 705 flow [2025-03-14 01:46:29,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:46:29,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:46:29,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1103 transitions. [2025-03-14 01:46:29,077 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9355385920271416 [2025-03-14 01:46:29,077 INFO L175 Difference]: Start difference. First operand has 327 places, 324 transitions, 669 flow. Second operand 3 states and 1103 transitions. [2025-03-14 01:46:29,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 323 transitions, 705 flow [2025-03-14 01:46:29,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 323 transitions, 689 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:46:29,083 INFO L231 Difference]: Finished difference. Result has 319 places, 321 transitions, 657 flow [2025-03-14 01:46:29,083 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=643, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=657, PETRI_PLACES=319, PETRI_TRANSITIONS=321} [2025-03-14 01:46:29,084 INFO L279 CegarLoopForPetriNet]: 362 programPoint places, -43 predicate places. [2025-03-14 01:46:29,084 INFO L471 AbstractCegarLoop]: Abstraction has has 319 places, 321 transitions, 657 flow [2025-03-14 01:46:29,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 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:46:29,085 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:29,085 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:46:29,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 01:46:29,085 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2025-03-14 01:46:29,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:29,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1755028345, now seen corresponding path program 1 times [2025-03-14 01:46:29,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:29,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477137134] [2025-03-14 01:46:29,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:29,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:29,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-14 01:46:29,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-14 01:46:29,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:29,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:29,193 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:46:29,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:29,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477137134] [2025-03-14 01:46:29,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477137134] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:29,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:29,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 01:46:29,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117154632] [2025-03-14 01:46:29,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:29,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 01:46:29,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:29,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 01:46:29,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-14 01:46:29,216 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 369 out of 393 [2025-03-14 01:46:29,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 321 transitions, 657 flow. Second operand has 4 states, 4 states have (on average 370.25) internal successors, (1481), 4 states have internal predecessors, (1481), 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:46:29,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:29,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 369 of 393 [2025-03-14 01:46:29,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:29,323 INFO L124 PetriNetUnfolderBase]: 44/1153 cut-off events. [2025-03-14 01:46:29,324 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:46:29,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1224 conditions, 1153 events. 44/1153 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 4419 event pairs, 3 based on Foata normal form. 0/1041 useless extension candidates. Maximal degree in co-relation 1188. Up to 18 conditions per place. [2025-03-14 01:46:29,330 INFO L140 encePairwiseOnDemand]: 387/393 looper letters, 13 selfloop transitions, 6 changer transitions 0/330 dead transitions. [2025-03-14 01:46:29,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 330 transitions, 717 flow [2025-03-14 01:46:29,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:46:29,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:46:29,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1865 transitions. [2025-03-14 01:46:29,333 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9491094147582697 [2025-03-14 01:46:29,334 INFO L175 Difference]: Start difference. First operand has 319 places, 321 transitions, 657 flow. Second operand 5 states and 1865 transitions. [2025-03-14 01:46:29,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 330 transitions, 717 flow [2025-03-14 01:46:29,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 330 transitions, 717 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:46:29,337 INFO L231 Difference]: Finished difference. Result has 326 places, 325 transitions, 695 flow [2025-03-14 01:46:29,338 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=657, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=695, PETRI_PLACES=326, PETRI_TRANSITIONS=325} [2025-03-14 01:46:29,339 INFO L279 CegarLoopForPetriNet]: 362 programPoint places, -36 predicate places. [2025-03-14 01:46:29,339 INFO L471 AbstractCegarLoop]: Abstraction has has 326 places, 325 transitions, 695 flow [2025-03-14 01:46:29,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 370.25) internal successors, (1481), 4 states have internal predecessors, (1481), 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:46:29,340 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:29,340 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] [2025-03-14 01:46:29,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 01:46:29,340 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2025-03-14 01:46:29,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:29,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1254407495, now seen corresponding path program 1 times [2025-03-14 01:46:29,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:29,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087404991] [2025-03-14 01:46:29,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:29,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:29,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-14 01:46:29,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-14 01:46:29,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:29,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:29,667 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:46:29,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:29,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087404991] [2025-03-14 01:46:29,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087404991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:29,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:29,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:46:29,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747201726] [2025-03-14 01:46:29,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:29,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:46:29,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:29,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:46:29,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:46:29,910 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 362 out of 393 [2025-03-14 01:46:29,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 325 transitions, 695 flow. Second operand has 6 states, 6 states have (on average 363.5) internal successors, (2181), 6 states have internal predecessors, (2181), 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:46:29,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:29,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 362 of 393 [2025-03-14 01:46:29,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:30,002 INFO L124 PetriNetUnfolderBase]: 38/895 cut-off events. [2025-03-14 01:46:30,002 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2025-03-14 01:46:30,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 993 conditions, 895 events. 38/895 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2804 event pairs, 2 based on Foata normal form. 0/816 useless extension candidates. Maximal degree in co-relation 951. Up to 17 conditions per place. [2025-03-14 01:46:30,009 INFO L140 encePairwiseOnDemand]: 387/393 looper letters, 15 selfloop transitions, 6 changer transitions 0/328 dead transitions. [2025-03-14 01:46:30,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 328 transitions, 747 flow [2025-03-14 01:46:30,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:46:30,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:46:30,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2193 transitions. [2025-03-14 01:46:30,012 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9300254452926209 [2025-03-14 01:46:30,012 INFO L175 Difference]: Start difference. First operand has 326 places, 325 transitions, 695 flow. Second operand 6 states and 2193 transitions. [2025-03-14 01:46:30,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 328 transitions, 747 flow [2025-03-14 01:46:30,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 328 transitions, 747 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:46:30,017 INFO L231 Difference]: Finished difference. Result has 330 places, 324 transitions, 705 flow [2025-03-14 01:46:30,017 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=693, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=705, PETRI_PLACES=330, PETRI_TRANSITIONS=324} [2025-03-14 01:46:30,018 INFO L279 CegarLoopForPetriNet]: 362 programPoint places, -32 predicate places. [2025-03-14 01:46:30,018 INFO L471 AbstractCegarLoop]: Abstraction has has 330 places, 324 transitions, 705 flow [2025-03-14 01:46:30,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 363.5) internal successors, (2181), 6 states have internal predecessors, (2181), 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:46:30,019 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:30,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:30,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 01:46:30,019 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err22ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2025-03-14 01:46:30,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:30,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1220409804, now seen corresponding path program 1 times [2025-03-14 01:46:30,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:30,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075382147] [2025-03-14 01:46:30,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:30,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:30,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-14 01:46:30,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-14 01:46:30,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:30,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:30,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:46:30,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:30,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075382147] [2025-03-14 01:46:30,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075382147] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:30,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:30,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 01:46:30,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025711927] [2025-03-14 01:46:30,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:30,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 01:46:30,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:30,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 01:46:30,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-14 01:46:30,147 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 393 [2025-03-14 01:46:30,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 324 transitions, 705 flow. Second operand has 4 states, 4 states have (on average 367.5) internal successors, (1470), 4 states have internal predecessors, (1470), 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:46:30,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:30,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 393 [2025-03-14 01:46:30,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:30,260 INFO L124 PetriNetUnfolderBase]: 56/1124 cut-off events. [2025-03-14 01:46:30,260 INFO L125 PetriNetUnfolderBase]: For 34/35 co-relation queries the response was YES. [2025-03-14 01:46:30,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1268 conditions, 1124 events. 56/1124 cut-off events. For 34/35 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 4906 event pairs, 6 based on Foata normal form. 0/1021 useless extension candidates. Maximal degree in co-relation 1226. Up to 60 conditions per place. [2025-03-14 01:46:30,266 INFO L140 encePairwiseOnDemand]: 387/393 looper letters, 15 selfloop transitions, 6 changer transitions 0/332 dead transitions. [2025-03-14 01:46:30,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 332 transitions, 766 flow [2025-03-14 01:46:30,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:46:30,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:46:30,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1852 transitions. [2025-03-14 01:46:30,269 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9424936386768448 [2025-03-14 01:46:30,270 INFO L175 Difference]: Start difference. First operand has 330 places, 324 transitions, 705 flow. Second operand 5 states and 1852 transitions. [2025-03-14 01:46:30,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 332 transitions, 766 flow [2025-03-14 01:46:30,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 332 transitions, 754 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:46:30,273 INFO L231 Difference]: Finished difference. Result has 332 places, 328 transitions, 731 flow [2025-03-14 01:46:30,274 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=693, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=731, PETRI_PLACES=332, PETRI_TRANSITIONS=328} [2025-03-14 01:46:30,275 INFO L279 CegarLoopForPetriNet]: 362 programPoint places, -30 predicate places. [2025-03-14 01:46:30,275 INFO L471 AbstractCegarLoop]: Abstraction has has 332 places, 328 transitions, 731 flow [2025-03-14 01:46:30,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 367.5) internal successors, (1470), 4 states have internal predecessors, (1470), 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:46:30,276 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:30,276 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] [2025-03-14 01:46:30,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-14 01:46:30,276 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2025-03-14 01:46:30,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:30,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1299223035, now seen corresponding path program 1 times [2025-03-14 01:46:30,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:30,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228439003] [2025-03-14 01:46:30,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:30,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:30,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-14 01:46:30,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-14 01:46:30,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:30,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:30,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:46:30,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:30,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228439003] [2025-03-14 01:46:30,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228439003] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:30,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:30,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:46:30,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049114685] [2025-03-14 01:46:30,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:30,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:46:30,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:30,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:46:30,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:46:30,327 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 367 out of 393 [2025-03-14 01:46:30,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 328 transitions, 731 flow. Second operand has 3 states, 3 states have (on average 369.3333333333333) internal successors, (1108), 3 states have internal predecessors, (1108), 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:46:30,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:30,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 367 of 393 [2025-03-14 01:46:30,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:30,447 INFO L124 PetriNetUnfolderBase]: 51/1450 cut-off events. [2025-03-14 01:46:30,447 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-03-14 01:46:30,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1635 conditions, 1450 events. 51/1450 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 6552 event pairs, 10 based on Foata normal form. 0/1328 useless extension candidates. Maximal degree in co-relation 1590. Up to 34 conditions per place. [2025-03-14 01:46:30,461 INFO L140 encePairwiseOnDemand]: 390/393 looper letters, 9 selfloop transitions, 2 changer transitions 0/328 dead transitions. [2025-03-14 01:46:30,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 328 transitions, 754 flow [2025-03-14 01:46:30,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:46:30,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:46:30,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1113 transitions. [2025-03-14 01:46:30,463 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9440203562340967 [2025-03-14 01:46:30,463 INFO L175 Difference]: Start difference. First operand has 332 places, 328 transitions, 731 flow. Second operand 3 states and 1113 transitions. [2025-03-14 01:46:30,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 328 transitions, 754 flow [2025-03-14 01:46:30,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 328 transitions, 754 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:46:30,468 INFO L231 Difference]: Finished difference. Result has 333 places, 327 transitions, 733 flow [2025-03-14 01:46:30,469 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=729, PETRI_DIFFERENCE_MINUEND_PLACES=331, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=733, PETRI_PLACES=333, PETRI_TRANSITIONS=327} [2025-03-14 01:46:30,470 INFO L279 CegarLoopForPetriNet]: 362 programPoint places, -29 predicate places. [2025-03-14 01:46:30,470 INFO L471 AbstractCegarLoop]: Abstraction has has 333 places, 327 transitions, 733 flow [2025-03-14 01:46:30,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 369.3333333333333) internal successors, (1108), 3 states have internal predecessors, (1108), 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:46:30,471 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:30,471 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:46:30,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-14 01:46:30,471 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err22ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2025-03-14 01:46:30,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:30,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1035847851, now seen corresponding path program 1 times [2025-03-14 01:46:30,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:30,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196140519] [2025-03-14 01:46:30,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:30,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:30,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-14 01:46:30,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-14 01:46:30,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:30,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:30,787 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:46:30,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:30,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196140519] [2025-03-14 01:46:30,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196140519] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:30,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:30,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:46:30,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805208925] [2025-03-14 01:46:30,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:30,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:46:30,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:30,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:46:30,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:46:30,987 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 341 out of 393 [2025-03-14 01:46:30,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 327 transitions, 733 flow. Second operand has 6 states, 6 states have (on average 342.6666666666667) internal successors, (2056), 6 states have internal predecessors, (2056), 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:46:30,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:30,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 341 of 393 [2025-03-14 01:46:30,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:31,122 INFO L124 PetriNetUnfolderBase]: 86/976 cut-off events. [2025-03-14 01:46:31,123 INFO L125 PetriNetUnfolderBase]: For 79/80 co-relation queries the response was YES. [2025-03-14 01:46:31,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1283 conditions, 976 events. 86/976 cut-off events. For 79/80 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4695 event pairs, 10 based on Foata normal form. 0/914 useless extension candidates. Maximal degree in co-relation 1235. Up to 70 conditions per place. [2025-03-14 01:46:31,127 INFO L140 encePairwiseOnDemand]: 369/393 looper letters, 18 selfloop transitions, 21 changer transitions 0/327 dead transitions. [2025-03-14 01:46:31,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 327 transitions, 815 flow [2025-03-14 01:46:31,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:46:31,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:46:31,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2088 transitions. [2025-03-14 01:46:31,131 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8854961832061069 [2025-03-14 01:46:31,131 INFO L175 Difference]: Start difference. First operand has 333 places, 327 transitions, 733 flow. Second operand 6 states and 2088 transitions. [2025-03-14 01:46:31,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 327 transitions, 815 flow [2025-03-14 01:46:31,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 327 transitions, 811 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:46:31,135 INFO L231 Difference]: Finished difference. Result has 332 places, 323 transitions, 763 flow [2025-03-14 01:46:31,135 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=721, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=763, PETRI_PLACES=332, PETRI_TRANSITIONS=323} [2025-03-14 01:46:31,136 INFO L279 CegarLoopForPetriNet]: 362 programPoint places, -30 predicate places. [2025-03-14 01:46:31,136 INFO L471 AbstractCegarLoop]: Abstraction has has 332 places, 323 transitions, 763 flow [2025-03-14 01:46:31,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 342.6666666666667) internal successors, (2056), 6 states have internal predecessors, (2056), 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:46:31,136 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:31,137 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:46:31,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-14 01:46:31,137 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err21ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2025-03-14 01:46:31,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:31,137 INFO L85 PathProgramCache]: Analyzing trace with hash -561140137, now seen corresponding path program 1 times [2025-03-14 01:46:31,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:31,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078641893] [2025-03-14 01:46:31,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:31,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:31,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-14 01:46:31,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-14 01:46:31,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:31,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:31,169 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:46:31,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:31,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078641893] [2025-03-14 01:46:31,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078641893] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:31,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:31,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:46:31,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88953176] [2025-03-14 01:46:31,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:31,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:46:31,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:31,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:46:31,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:46:31,225 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 355 out of 393 [2025-03-14 01:46:31,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 323 transitions, 763 flow. Second operand has 3 states, 3 states have (on average 357.6666666666667) internal successors, (1073), 3 states have internal predecessors, (1073), 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:46:31,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:31,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 355 of 393 [2025-03-14 01:46:31,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:31,354 INFO L124 PetriNetUnfolderBase]: 76/1111 cut-off events. [2025-03-14 01:46:31,355 INFO L125 PetriNetUnfolderBase]: For 78/79 co-relation queries the response was YES. [2025-03-14 01:46:31,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1482 conditions, 1111 events. 76/1111 cut-off events. For 78/79 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 5208 event pairs, 42 based on Foata normal form. 0/1044 useless extension candidates. Maximal degree in co-relation 1436. Up to 142 conditions per place. [2025-03-14 01:46:31,361 INFO L140 encePairwiseOnDemand]: 390/393 looper letters, 21 selfloop transitions, 2 changer transitions 0/323 dead transitions. [2025-03-14 01:46:31,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 323 transitions, 810 flow [2025-03-14 01:46:31,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:46:31,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:46:31,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1089 transitions. [2025-03-14 01:46:31,363 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9236641221374046 [2025-03-14 01:46:31,364 INFO L175 Difference]: Start difference. First operand has 332 places, 323 transitions, 763 flow. Second operand 3 states and 1089 transitions. [2025-03-14 01:46:31,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 323 transitions, 810 flow [2025-03-14 01:46:31,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 323 transitions, 768 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:46:31,368 INFO L231 Difference]: Finished difference. Result has 328 places, 322 transitions, 723 flow [2025-03-14 01:46:31,368 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=719, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=723, PETRI_PLACES=328, PETRI_TRANSITIONS=322} [2025-03-14 01:46:31,369 INFO L279 CegarLoopForPetriNet]: 362 programPoint places, -34 predicate places. [2025-03-14 01:46:31,369 INFO L471 AbstractCegarLoop]: Abstraction has has 328 places, 322 transitions, 723 flow [2025-03-14 01:46:31,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 357.6666666666667) internal successors, (1073), 3 states have internal predecessors, (1073), 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:46:31,369 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:31,369 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:46:31,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-14 01:46:31,370 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2025-03-14 01:46:31,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:31,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1771869675, now seen corresponding path program 1 times [2025-03-14 01:46:31,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:31,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046852675] [2025-03-14 01:46:31,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:31,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:31,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-14 01:46:31,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-14 01:46:31,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:31,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:31,414 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:46:31,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:31,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046852675] [2025-03-14 01:46:31,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046852675] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:31,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:31,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:46:31,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810620104] [2025-03-14 01:46:31,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:31,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:46:31,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:31,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:46:31,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:46:31,474 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 355 out of 393 [2025-03-14 01:46:31,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 322 transitions, 723 flow. Second operand has 3 states, 3 states have (on average 358.6666666666667) internal successors, (1076), 3 states have internal predecessors, (1076), 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:46:31,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:31,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 355 of 393 [2025-03-14 01:46:31,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:31,568 INFO L124 PetriNetUnfolderBase]: 75/1074 cut-off events. [2025-03-14 01:46:31,568 INFO L125 PetriNetUnfolderBase]: For 71/72 co-relation queries the response was YES. [2025-03-14 01:46:31,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1335 conditions, 1074 events. 75/1074 cut-off events. For 71/72 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 4999 event pairs, 42 based on Foata normal form. 0/1013 useless extension candidates. Maximal degree in co-relation 1289. Up to 142 conditions per place. [2025-03-14 01:46:31,573 INFO L140 encePairwiseOnDemand]: 390/393 looper letters, 21 selfloop transitions, 2 changer transitions 0/322 dead transitions. [2025-03-14 01:46:31,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 322 transitions, 770 flow [2025-03-14 01:46:31,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:46:31,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:46:31,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1089 transitions. [2025-03-14 01:46:31,576 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9236641221374046 [2025-03-14 01:46:31,576 INFO L175 Difference]: Start difference. First operand has 328 places, 322 transitions, 723 flow. Second operand 3 states and 1089 transitions. [2025-03-14 01:46:31,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 322 transitions, 770 flow [2025-03-14 01:46:31,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 322 transitions, 766 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:46:31,580 INFO L231 Difference]: Finished difference. Result has 327 places, 321 transitions, 721 flow [2025-03-14 01:46:31,581 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=717, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=721, PETRI_PLACES=327, PETRI_TRANSITIONS=321} [2025-03-14 01:46:31,581 INFO L279 CegarLoopForPetriNet]: 362 programPoint places, -35 predicate places. [2025-03-14 01:46:31,581 INFO L471 AbstractCegarLoop]: Abstraction has has 327 places, 321 transitions, 721 flow [2025-03-14 01:46:31,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 358.6666666666667) internal successors, (1076), 3 states have internal predecessors, (1076), 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:46:31,582 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:31,582 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:46:31,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-14 01:46:31,582 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2025-03-14 01:46:31,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:31,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1791897311, now seen corresponding path program 1 times [2025-03-14 01:46:31,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:31,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027927950] [2025-03-14 01:46:31,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:31,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:31,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-14 01:46:31,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-14 01:46:31,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:31,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:31,629 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:46:31,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:31,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027927950] [2025-03-14 01:46:31,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027927950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:31,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:31,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:46:31,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505598823] [2025-03-14 01:46:31,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:31,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:46:31,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:31,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:46:31,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:46:31,681 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 355 out of 393 [2025-03-14 01:46:31,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 321 transitions, 721 flow. Second operand has 3 states, 3 states have (on average 359.6666666666667) internal successors, (1079), 3 states have internal predecessors, (1079), 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:46:31,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:31,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 355 of 393 [2025-03-14 01:46:31,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:31,776 INFO L124 PetriNetUnfolderBase]: 74/1036 cut-off events. [2025-03-14 01:46:31,776 INFO L125 PetriNetUnfolderBase]: For 70/71 co-relation queries the response was YES. [2025-03-14 01:46:31,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1296 conditions, 1036 events. 74/1036 cut-off events. For 70/71 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 4702 event pairs, 42 based on Foata normal form. 0/981 useless extension candidates. Maximal degree in co-relation 1250. Up to 142 conditions per place. [2025-03-14 01:46:31,783 INFO L140 encePairwiseOnDemand]: 390/393 looper letters, 21 selfloop transitions, 2 changer transitions 0/321 dead transitions. [2025-03-14 01:46:31,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 321 transitions, 768 flow [2025-03-14 01:46:31,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:46:31,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:46:31,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1089 transitions. [2025-03-14 01:46:31,785 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9236641221374046 [2025-03-14 01:46:31,786 INFO L175 Difference]: Start difference. First operand has 327 places, 321 transitions, 721 flow. Second operand 3 states and 1089 transitions. [2025-03-14 01:46:31,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 321 transitions, 768 flow [2025-03-14 01:46:31,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 321 transitions, 764 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:46:31,789 INFO L231 Difference]: Finished difference. Result has 326 places, 320 transitions, 719 flow [2025-03-14 01:46:31,790 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=715, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=719, PETRI_PLACES=326, PETRI_TRANSITIONS=320} [2025-03-14 01:46:31,790 INFO L279 CegarLoopForPetriNet]: 362 programPoint places, -36 predicate places. [2025-03-14 01:46:31,791 INFO L471 AbstractCegarLoop]: Abstraction has has 326 places, 320 transitions, 719 flow [2025-03-14 01:46:31,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 359.6666666666667) internal successors, (1079), 3 states have internal predecessors, (1079), 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:46:31,791 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:31,791 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:46:31,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-14 01:46:31,791 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2025-03-14 01:46:31,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:31,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1000222413, now seen corresponding path program 1 times [2025-03-14 01:46:31,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:31,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871011365] [2025-03-14 01:46:31,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:31,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:31,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-14 01:46:31,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-14 01:46:31,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:31,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:31,848 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:46:31,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:31,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871011365] [2025-03-14 01:46:31,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871011365] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:31,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:31,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:46:31,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829124853] [2025-03-14 01:46:31,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:31,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:46:31,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:31,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:46:31,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:46:31,902 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 355 out of 393 [2025-03-14 01:46:31,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 320 transitions, 719 flow. Second operand has 3 states, 3 states have (on average 360.6666666666667) internal successors, (1082), 3 states have internal predecessors, (1082), 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:46:31,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:31,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 355 of 393 [2025-03-14 01:46:31,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:31,986 INFO L124 PetriNetUnfolderBase]: 73/998 cut-off events. [2025-03-14 01:46:31,986 INFO L125 PetriNetUnfolderBase]: For 70/71 co-relation queries the response was YES. [2025-03-14 01:46:31,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1258 conditions, 998 events. 73/998 cut-off events. For 70/71 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 4522 event pairs, 42 based on Foata normal form. 0/949 useless extension candidates. Maximal degree in co-relation 1212. Up to 142 conditions per place. [2025-03-14 01:46:31,991 INFO L140 encePairwiseOnDemand]: 390/393 looper letters, 0 selfloop transitions, 0 changer transitions 320/320 dead transitions. [2025-03-14 01:46:31,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 320 transitions, 766 flow [2025-03-14 01:46:31,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:46:31,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:46:31,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1089 transitions. [2025-03-14 01:46:31,993 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9236641221374046 [2025-03-14 01:46:31,993 INFO L175 Difference]: Start difference. First operand has 326 places, 320 transitions, 719 flow. Second operand 3 states and 1089 transitions. [2025-03-14 01:46:31,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 320 transitions, 766 flow [2025-03-14 01:46:31,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 320 transitions, 762 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:46:31,997 INFO L231 Difference]: Finished difference. Result has 325 places, 0 transitions, 0 flow [2025-03-14 01:46:31,997 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=713, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=325, PETRI_TRANSITIONS=0} [2025-03-14 01:46:31,997 INFO L279 CegarLoopForPetriNet]: 362 programPoint places, -37 predicate places. [2025-03-14 01:46:31,998 INFO L471 AbstractCegarLoop]: Abstraction has has 325 places, 0 transitions, 0 flow [2025-03-14 01:46:31,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 360.6666666666667) internal successors, (1082), 3 states have internal predecessors, (1082), 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:46:32,000 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (84 of 85 remaining) [2025-03-14 01:46:32,000 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (83 of 85 remaining) [2025-03-14 01:46:32,000 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (82 of 85 remaining) [2025-03-14 01:46:32,000 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (81 of 85 remaining) [2025-03-14 01:46:32,001 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (80 of 85 remaining) [2025-03-14 01:46:32,001 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (79 of 85 remaining) [2025-03-14 01:46:32,001 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (78 of 85 remaining) [2025-03-14 01:46:32,001 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (77 of 85 remaining) [2025-03-14 01:46:32,001 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err28ASSERT_VIOLATIONDATA_RACE (76 of 85 remaining) [2025-03-14 01:46:32,001 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err27ASSERT_VIOLATIONDATA_RACE (75 of 85 remaining) [2025-03-14 01:46:32,001 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err26ASSERT_VIOLATIONDATA_RACE (74 of 85 remaining) [2025-03-14 01:46:32,001 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err25ASSERT_VIOLATIONDATA_RACE (73 of 85 remaining) [2025-03-14 01:46:32,001 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (72 of 85 remaining) [2025-03-14 01:46:32,001 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (71 of 85 remaining) [2025-03-14 01:46:32,001 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (70 of 85 remaining) [2025-03-14 01:46:32,001 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (69 of 85 remaining) [2025-03-14 01:46:32,001 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (68 of 85 remaining) [2025-03-14 01:46:32,001 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (67 of 85 remaining) [2025-03-14 01:46:32,001 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (66 of 85 remaining) [2025-03-14 01:46:32,002 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (65 of 85 remaining) [2025-03-14 01:46:32,002 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (64 of 85 remaining) [2025-03-14 01:46:32,002 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (63 of 85 remaining) [2025-03-14 01:46:32,002 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (62 of 85 remaining) [2025-03-14 01:46:32,002 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (61 of 85 remaining) [2025-03-14 01:46:32,002 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (60 of 85 remaining) [2025-03-14 01:46:32,002 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (59 of 85 remaining) [2025-03-14 01:46:32,002 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (58 of 85 remaining) [2025-03-14 01:46:32,002 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (57 of 85 remaining) [2025-03-14 01:46:32,002 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (56 of 85 remaining) [2025-03-14 01:46:32,002 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (55 of 85 remaining) [2025-03-14 01:46:32,002 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (54 of 85 remaining) [2025-03-14 01:46:32,002 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (53 of 85 remaining) [2025-03-14 01:46:32,002 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (52 of 85 remaining) [2025-03-14 01:46:32,002 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (51 of 85 remaining) [2025-03-14 01:46:32,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (50 of 85 remaining) [2025-03-14 01:46:32,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (49 of 85 remaining) [2025-03-14 01:46:32,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (48 of 85 remaining) [2025-03-14 01:46:32,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (47 of 85 remaining) [2025-03-14 01:46:32,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (46 of 85 remaining) [2025-03-14 01:46:32,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (45 of 85 remaining) [2025-03-14 01:46:32,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (44 of 85 remaining) [2025-03-14 01:46:32,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (43 of 85 remaining) [2025-03-14 01:46:32,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (42 of 85 remaining) [2025-03-14 01:46:32,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (41 of 85 remaining) [2025-03-14 01:46:32,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (40 of 85 remaining) [2025-03-14 01:46:32,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (39 of 85 remaining) [2025-03-14 01:46:32,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 85 remaining) [2025-03-14 01:46:32,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 85 remaining) [2025-03-14 01:46:32,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (36 of 85 remaining) [2025-03-14 01:46:32,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (35 of 85 remaining) [2025-03-14 01:46:32,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (34 of 85 remaining) [2025-03-14 01:46:32,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (33 of 85 remaining) [2025-03-14 01:46:32,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (32 of 85 remaining) [2025-03-14 01:46:32,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (31 of 85 remaining) [2025-03-14 01:46:32,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (30 of 85 remaining) [2025-03-14 01:46:32,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (29 of 85 remaining) [2025-03-14 01:46:32,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err28ASSERT_VIOLATIONDATA_RACE (28 of 85 remaining) [2025-03-14 01:46:32,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err27ASSERT_VIOLATIONDATA_RACE (27 of 85 remaining) [2025-03-14 01:46:32,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err26ASSERT_VIOLATIONDATA_RACE (26 of 85 remaining) [2025-03-14 01:46:32,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err25ASSERT_VIOLATIONDATA_RACE (25 of 85 remaining) [2025-03-14 01:46:32,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (24 of 85 remaining) [2025-03-14 01:46:32,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (23 of 85 remaining) [2025-03-14 01:46:32,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (22 of 85 remaining) [2025-03-14 01:46:32,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (21 of 85 remaining) [2025-03-14 01:46:32,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (20 of 85 remaining) [2025-03-14 01:46:32,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (19 of 85 remaining) [2025-03-14 01:46:32,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (18 of 85 remaining) [2025-03-14 01:46:32,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (17 of 85 remaining) [2025-03-14 01:46:32,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (16 of 85 remaining) [2025-03-14 01:46:32,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (15 of 85 remaining) [2025-03-14 01:46:32,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (14 of 85 remaining) [2025-03-14 01:46:32,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (13 of 85 remaining) [2025-03-14 01:46:32,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (12 of 85 remaining) [2025-03-14 01:46:32,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (11 of 85 remaining) [2025-03-14 01:46:32,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (10 of 85 remaining) [2025-03-14 01:46:32,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (9 of 85 remaining) [2025-03-14 01:46:32,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (8 of 85 remaining) [2025-03-14 01:46:32,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (7 of 85 remaining) [2025-03-14 01:46:32,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (6 of 85 remaining) [2025-03-14 01:46:32,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (5 of 85 remaining) [2025-03-14 01:46:32,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (4 of 85 remaining) [2025-03-14 01:46:32,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (3 of 85 remaining) [2025-03-14 01:46:32,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (2 of 85 remaining) [2025-03-14 01:46:32,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (1 of 85 remaining) [2025-03-14 01:46:32,005 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (0 of 85 remaining) [2025-03-14 01:46:32,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-14 01:46:32,005 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:46:32,009 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-14 01:46:32,009 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-14 01:46:32,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.03 01:46:32 BasicIcfg [2025-03-14 01:46:32,013 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-14 01:46:32,014 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-14 01:46:32,014 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-14 01:46:32,014 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-14 01:46:32,014 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:46:26" (3/4) ... [2025-03-14 01:46:32,015 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-14 01:46:32,017 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-14 01:46:32,017 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-14 01:46:32,021 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2025-03-14 01:46:32,021 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-14 01:46:32,021 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-14 01:46:32,021 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-14 01:46:32,086 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-14 01:46:32,087 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-14 01:46:32,087 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-14 01:46:32,087 INFO L158 Benchmark]: Toolchain (without parser) took 6646.68ms. Allocated memory was 167.8MB in the beginning and 402.7MB in the end (delta: 234.9MB). Free memory was 122.3MB in the beginning and 201.7MB in the end (delta: -79.5MB). Peak memory consumption was 151.2MB. Max. memory is 16.1GB. [2025-03-14 01:46:32,088 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:46:32,088 INFO L158 Benchmark]: CACSL2BoogieTranslator took 204.19ms. Allocated memory is still 167.8MB. Free memory was 122.3MB in the beginning and 109.8MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 01:46:32,089 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.16ms. Allocated memory is still 167.8MB. Free memory was 109.8MB in the beginning and 107.6MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 01:46:32,089 INFO L158 Benchmark]: Boogie Preprocessor took 40.59ms. Allocated memory is still 167.8MB. Free memory was 107.6MB in the beginning and 105.5MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:46:32,089 INFO L158 Benchmark]: IcfgBuilder took 586.45ms. Allocated memory is still 167.8MB. Free memory was 105.5MB in the beginning and 75.1MB in the end (delta: 30.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-14 01:46:32,089 INFO L158 Benchmark]: TraceAbstraction took 5693.41ms. Allocated memory was 167.8MB in the beginning and 402.7MB in the end (delta: 234.9MB). Free memory was 74.0MB in the beginning and 210.1MB in the end (delta: -136.1MB). Peak memory consumption was 92.5MB. Max. memory is 16.1GB. [2025-03-14 01:46:32,089 INFO L158 Benchmark]: Witness Printer took 73.04ms. Allocated memory is still 402.7MB. Free memory was 210.1MB in the beginning and 201.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 01:46:32,090 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.19ms. Allocated memory is still 201.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 204.19ms. Allocated memory is still 167.8MB. Free memory was 122.3MB in the beginning and 109.8MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.16ms. Allocated memory is still 167.8MB. Free memory was 109.8MB in the beginning and 107.6MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.59ms. Allocated memory is still 167.8MB. Free memory was 107.6MB in the beginning and 105.5MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 586.45ms. Allocated memory is still 167.8MB. Free memory was 105.5MB in the beginning and 75.1MB in the end (delta: 30.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5693.41ms. Allocated memory was 167.8MB in the beginning and 402.7MB in the end (delta: 234.9MB). Free memory was 74.0MB in the beginning and 210.1MB in the end (delta: -136.1MB). Peak memory consumption was 92.5MB. Max. memory is 16.1GB. * Witness Printer took 73.04ms. Allocated memory is still 402.7MB. Free memory was 210.1MB in the beginning and 201.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: 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: 64]: 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: 66]: 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: 67]: 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: 67]: 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: 69]: 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: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 609 locations, 85 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: 5.5s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1408 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 606 mSDsluCounter, 139 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20 mSDsCounter, 256 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1541 IncrementalHoareTripleChecker+Invalid, 1797 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 256 mSolverCounterUnsat, 119 mSDtfsCounter, 1541 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=763occurred in iteration=14, InterpolantAutomatonStates: 67, 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, 1.6s InterpolantComputationTime, 1845 NumberOfCodeBlocks, 1845 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1827 ConstructedInterpolants, 0 QuantifiedInterpolants, 2544 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 46 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-14 01:46:32,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE