./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/unroll-cond-5.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version f8ab0bd5 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-cond-5.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 052a68c73a5d1c6e7122fc0c660c02483f37277d0239d876d93b351fcdd64a16 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 22:26:46,248 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 22:26:46,299 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 22:26:46,304 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 22:26:46,304 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 22:26:46,324 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 22:26:46,324 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 22:26:46,326 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 22:26:46,326 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 22:26:46,327 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 22:26:46,327 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 22:26:46,327 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 22:26:46,327 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 22:26:46,327 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 22:26:46,327 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 22:26:46,327 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 22:26:46,327 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 22:26:46,327 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 22:26:46,327 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 22:26:46,327 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 22:26:46,327 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 22:26:46,327 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 22:26:46,327 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 22:26:46,327 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 22:26:46,327 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 22:26:46,327 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 22:26:46,328 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 22:26:46,328 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 22:26:46,328 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 22:26:46,328 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 22:26:46,328 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 22:26:46,328 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:26:46,328 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 22:26:46,328 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 22:26:46,328 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 22:26:46,328 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 22:26:46,328 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 22:26:46,328 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 22:26:46,328 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 22:26:46,328 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 22:26:46,328 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 22:26:46,328 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 22:26:46,328 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 -> 052a68c73a5d1c6e7122fc0c660c02483f37277d0239d876d93b351fcdd64a16 [2025-03-13 22:26:46,557 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 22:26:46,562 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 22:26:46,567 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 22:26:46,568 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 22:26:46,568 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 22:26:46,570 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/unroll-cond-5.wvr.c [2025-03-13 22:26:47,699 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e4cf0290/d1dac13bf71947c794b37947058137f2/FLAG75dfcc6b6 [2025-03-13 22:26:47,936 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 22:26:47,954 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/unroll-cond-5.wvr.c [2025-03-13 22:26:47,976 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e4cf0290/d1dac13bf71947c794b37947058137f2/FLAG75dfcc6b6 [2025-03-13 22:26:48,271 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e4cf0290/d1dac13bf71947c794b37947058137f2 [2025-03-13 22:26:48,272 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 22:26:48,273 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 22:26:48,274 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 22:26:48,274 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 22:26:48,278 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 22:26:48,278 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:26:48" (1/1) ... [2025-03-13 22:26:48,279 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@374b78d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:48, skipping insertion in model container [2025-03-13 22:26:48,279 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:26:48" (1/1) ... [2025-03-13 22:26:48,292 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 22:26:48,435 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:26:48,443 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 22:26:48,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:26:48,495 INFO L204 MainTranslator]: Completed translation [2025-03-13 22:26:48,496 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:48 WrapperNode [2025-03-13 22:26:48,497 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 22:26:48,498 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 22:26:48,498 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 22:26:48,498 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 22:26:48,503 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:48" (1/1) ... [2025-03-13 22:26:48,516 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:48" (1/1) ... [2025-03-13 22:26:48,550 INFO L138 Inliner]: procedures = 23, calls = 36, calls flagged for inlining = 18, calls inlined = 18, statements flattened = 463 [2025-03-13 22:26:48,551 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 22:26:48,551 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 22:26:48,551 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 22:26:48,551 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 22:26:48,558 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:48" (1/1) ... [2025-03-13 22:26:48,559 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:48" (1/1) ... [2025-03-13 22:26:48,568 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:48" (1/1) ... [2025-03-13 22:26:48,568 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:48" (1/1) ... [2025-03-13 22:26:48,583 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:48" (1/1) ... [2025-03-13 22:26:48,585 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:48" (1/1) ... [2025-03-13 22:26:48,588 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:48" (1/1) ... [2025-03-13 22:26:48,590 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:48" (1/1) ... [2025-03-13 22:26:48,598 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 22:26:48,599 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 22:26:48,599 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 22:26:48,599 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 22:26:48,600 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:48" (1/1) ... [2025-03-13 22:26:48,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:26:48,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:26:48,628 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-13 22:26:48,633 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-13 22:26:48,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 22:26:48,648 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-13 22:26:48,648 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-13 22:26:48,648 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-13 22:26:48,648 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-13 22:26:48,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 22:26:48,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-13 22:26:48,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-13 22:26:48,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 22:26:48,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 22:26:48,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-13 22:26:48,650 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 22:26:48,741 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 22:26:48,742 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 22:26:49,360 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 22:26:49,361 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 22:26:49,361 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 22:26:49,377 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 22:26:49,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:26:49 BoogieIcfgContainer [2025-03-13 22:26:49,378 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 22:26:49,380 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 22:26:49,380 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 22:26:49,383 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 22:26:49,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 10:26:48" (1/3) ... [2025-03-13 22:26:49,384 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@470cc8cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:26:49, skipping insertion in model container [2025-03-13 22:26:49,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:48" (2/3) ... [2025-03-13 22:26:49,384 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@470cc8cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:26:49, skipping insertion in model container [2025-03-13 22:26:49,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:26:49" (3/3) ... [2025-03-13 22:26:49,386 INFO L128 eAbstractionObserver]: Analyzing ICFG unroll-cond-5.wvr.c [2025-03-13 22:26:49,398 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 22:26:49,399 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unroll-cond-5.wvr.c that has 3 procedures, 595 locations, 1 initial locations, 3 loop locations, and 84 error locations. [2025-03-13 22:26:49,400 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 22:26:49,544 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-13 22:26:49,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 601 places, 627 transitions, 1268 flow [2025-03-13 22:26:49,724 INFO L124 PetriNetUnfolderBase]: 33/625 cut-off events. [2025-03-13 22:26:49,726 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 22:26:49,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 634 conditions, 625 events. 33/625 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1870 event pairs, 0 based on Foata normal form. 0/508 useless extension candidates. Maximal degree in co-relation 500. Up to 2 conditions per place. [2025-03-13 22:26:49,740 INFO L82 GeneralOperation]: Start removeDead. Operand has 601 places, 627 transitions, 1268 flow [2025-03-13 22:26:49,750 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 583 places, 608 transitions, 1228 flow [2025-03-13 22:26:49,758 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:26:49,767 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;@464d9946, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:26:49,767 INFO L334 AbstractCegarLoop]: Starting to check reachability of 162 error locations. [2025-03-13 22:26:49,771 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:26:49,771 INFO L124 PetriNetUnfolderBase]: 0/20 cut-off events. [2025-03-13 22:26:49,771 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:26:49,771 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:49,771 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:49,771 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2025-03-13 22:26:49,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:49,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1499517781, now seen corresponding path program 1 times [2025-03-13 22:26:49,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:49,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503196257] [2025-03-13 22:26:49,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:49,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:49,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-13 22:26:49,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-13 22:26:49,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:49,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:49,914 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-13 22:26:49,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:49,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503196257] [2025-03-13 22:26:49,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503196257] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:49,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:49,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:49,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621425770] [2025-03-13 22:26:49,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:49,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:49,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:49,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:49,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:49,980 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 593 out of 627 [2025-03-13 22:26:49,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 583 places, 608 transitions, 1228 flow. Second operand has 3 states, 3 states have (on average 594.3333333333334) internal successors, (1783), 3 states have internal predecessors, (1783), 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-13 22:26:49,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:49,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 593 of 627 [2025-03-13 22:26:49,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:50,091 INFO L124 PetriNetUnfolderBase]: 40/920 cut-off events. [2025-03-13 22:26:50,092 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-03-13 22:26:50,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 980 conditions, 920 events. 40/920 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 4504 event pairs, 11 based on Foata normal form. 19/760 useless extension candidates. Maximal degree in co-relation 833. Up to 42 conditions per place. [2025-03-13 22:26:50,101 INFO L140 encePairwiseOnDemand]: 609/627 looper letters, 13 selfloop transitions, 2 changer transitions 3/592 dead transitions. [2025-03-13 22:26:50,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 584 places, 592 transitions, 1226 flow [2025-03-13 22:26:50,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:50,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:50,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1810 transitions. [2025-03-13 22:26:50,114 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.962254120148857 [2025-03-13 22:26:50,115 INFO L175 Difference]: Start difference. First operand has 583 places, 608 transitions, 1228 flow. Second operand 3 states and 1810 transitions. [2025-03-13 22:26:50,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 584 places, 592 transitions, 1226 flow [2025-03-13 22:26:50,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 580 places, 592 transitions, 1218 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-13 22:26:50,127 INFO L231 Difference]: Finished difference. Result has 580 places, 589 transitions, 1186 flow [2025-03-13 22:26:50,130 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=627, PETRI_DIFFERENCE_MINUEND_FLOW=1188, PETRI_DIFFERENCE_MINUEND_PLACES=578, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=592, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=590, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1186, PETRI_PLACES=580, PETRI_TRANSITIONS=589} [2025-03-13 22:26:50,156 INFO L279 CegarLoopForPetriNet]: 583 programPoint places, -3 predicate places. [2025-03-13 22:26:50,156 INFO L471 AbstractCegarLoop]: Abstraction has has 580 places, 589 transitions, 1186 flow [2025-03-13 22:26:50,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 594.3333333333334) internal successors, (1783), 3 states have internal predecessors, (1783), 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-13 22:26:50,157 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:50,157 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-13 22:26:50,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 22:26:50,157 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2025-03-13 22:26:50,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:50,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1642353247, now seen corresponding path program 1 times [2025-03-13 22:26:50,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:50,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748025113] [2025-03-13 22:26:50,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:50,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:50,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-13 22:26:50,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-13 22:26:50,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:50,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:50,195 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-13 22:26:50,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:50,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748025113] [2025-03-13 22:26:50,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748025113] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:50,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:50,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:50,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438942149] [2025-03-13 22:26:50,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:50,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:50,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:50,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:50,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:50,249 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 587 out of 627 [2025-03-13 22:26:50,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 580 places, 589 transitions, 1186 flow. Second operand has 3 states, 3 states have (on average 588.3333333333334) internal successors, (1765), 3 states have internal predecessors, (1765), 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-13 22:26:50,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:50,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 587 of 627 [2025-03-13 22:26:50,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:50,364 INFO L124 PetriNetUnfolderBase]: 50/1044 cut-off events. [2025-03-13 22:26:50,364 INFO L125 PetriNetUnfolderBase]: For 11/12 co-relation queries the response was YES. [2025-03-13 22:26:50,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1111 conditions, 1044 events. 50/1044 cut-off events. For 11/12 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 4886 event pairs, 19 based on Foata normal form. 0/835 useless extension candidates. Maximal degree in co-relation 1083. Up to 58 conditions per place. [2025-03-13 22:26:50,370 INFO L140 encePairwiseOnDemand]: 624/627 looper letters, 19 selfloop transitions, 2 changer transitions 0/588 dead transitions. [2025-03-13 22:26:50,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 578 places, 588 transitions, 1226 flow [2025-03-13 22:26:50,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:50,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:50,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1783 transitions. [2025-03-13 22:26:50,376 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.947900053163211 [2025-03-13 22:26:50,376 INFO L175 Difference]: Start difference. First operand has 580 places, 589 transitions, 1186 flow. Second operand 3 states and 1783 transitions. [2025-03-13 22:26:50,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 578 places, 588 transitions, 1226 flow [2025-03-13 22:26:50,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 576 places, 588 transitions, 1222 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:50,385 INFO L231 Difference]: Finished difference. Result has 576 places, 588 transitions, 1184 flow [2025-03-13 22:26:50,386 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=627, PETRI_DIFFERENCE_MINUEND_FLOW=1180, PETRI_DIFFERENCE_MINUEND_PLACES=574, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=588, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=586, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1184, PETRI_PLACES=576, PETRI_TRANSITIONS=588} [2025-03-13 22:26:50,387 INFO L279 CegarLoopForPetriNet]: 583 programPoint places, -7 predicate places. [2025-03-13 22:26:50,387 INFO L471 AbstractCegarLoop]: Abstraction has has 576 places, 588 transitions, 1184 flow [2025-03-13 22:26:50,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 588.3333333333334) internal successors, (1765), 3 states have internal predecessors, (1765), 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-13 22:26:50,388 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:50,388 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-13 22:26:50,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 22:26:50,388 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2025-03-13 22:26:50,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:50,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1524469472, now seen corresponding path program 1 times [2025-03-13 22:26:50,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:50,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16405386] [2025-03-13 22:26:50,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:50,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:50,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-13 22:26:50,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-13 22:26:50,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:50,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:50,439 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-13 22:26:50,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:50,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16405386] [2025-03-13 22:26:50,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16405386] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:50,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:50,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:50,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705347661] [2025-03-13 22:26:50,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:50,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:50,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:50,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:50,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:50,479 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 569 out of 627 [2025-03-13 22:26:50,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 576 places, 588 transitions, 1184 flow. Second operand has 3 states, 3 states have (on average 570.0) internal successors, (1710), 3 states have internal predecessors, (1710), 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-13 22:26:50,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:50,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 569 of 627 [2025-03-13 22:26:50,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:50,769 INFO L124 PetriNetUnfolderBase]: 180/2417 cut-off events. [2025-03-13 22:26:50,769 INFO L125 PetriNetUnfolderBase]: For 41/42 co-relation queries the response was YES. [2025-03-13 22:26:50,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2624 conditions, 2417 events. 180/2417 cut-off events. For 41/42 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 15866 event pairs, 56 based on Foata normal form. 0/1938 useless extension candidates. Maximal degree in co-relation 2588. Up to 197 conditions per place. [2025-03-13 22:26:50,792 INFO L140 encePairwiseOnDemand]: 614/627 looper letters, 28 selfloop transitions, 1 changer transitions 0/576 dead transitions. [2025-03-13 22:26:50,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 566 places, 576 transitions, 1218 flow [2025-03-13 22:26:50,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:50,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:50,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1748 transitions. [2025-03-13 22:26:50,797 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9292929292929293 [2025-03-13 22:26:50,797 INFO L175 Difference]: Start difference. First operand has 576 places, 588 transitions, 1184 flow. Second operand 3 states and 1748 transitions. [2025-03-13 22:26:50,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 566 places, 576 transitions, 1218 flow [2025-03-13 22:26:50,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 564 places, 576 transitions, 1214 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:50,805 INFO L231 Difference]: Finished difference. Result has 564 places, 576 transitions, 1158 flow [2025-03-13 22:26:50,805 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=627, PETRI_DIFFERENCE_MINUEND_FLOW=1156, PETRI_DIFFERENCE_MINUEND_PLACES=562, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=576, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=575, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1158, PETRI_PLACES=564, PETRI_TRANSITIONS=576} [2025-03-13 22:26:50,806 INFO L279 CegarLoopForPetriNet]: 583 programPoint places, -19 predicate places. [2025-03-13 22:26:50,807 INFO L471 AbstractCegarLoop]: Abstraction has has 564 places, 576 transitions, 1158 flow [2025-03-13 22:26:50,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 570.0) internal successors, (1710), 3 states have internal predecessors, (1710), 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-13 22:26:50,808 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:50,808 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-13 22:26:50,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 22:26:50,808 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2025-03-13 22:26:50,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:50,809 INFO L85 PathProgramCache]: Analyzing trace with hash -185885204, now seen corresponding path program 1 times [2025-03-13 22:26:50,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:50,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465324752] [2025-03-13 22:26:50,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:50,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:50,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-13 22:26:50,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-13 22:26:50,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:50,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:50,890 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-13 22:26:50,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:50,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465324752] [2025-03-13 22:26:50,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465324752] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:50,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:50,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:50,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582677342] [2025-03-13 22:26:50,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:50,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:50,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:50,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:50,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:50,955 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 589 out of 627 [2025-03-13 22:26:50,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 564 places, 576 transitions, 1158 flow. Second operand has 3 states, 3 states have (on average 590.3333333333334) internal successors, (1771), 3 states have internal predecessors, (1771), 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-13 22:26:50,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:50,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 589 of 627 [2025-03-13 22:26:50,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:51,068 INFO L124 PetriNetUnfolderBase]: 50/1022 cut-off events. [2025-03-13 22:26:51,068 INFO L125 PetriNetUnfolderBase]: For 11/12 co-relation queries the response was YES. [2025-03-13 22:26:51,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1086 conditions, 1022 events. 50/1022 cut-off events. For 11/12 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 4780 event pairs, 19 based on Foata normal form. 0/835 useless extension candidates. Maximal degree in co-relation 1050. Up to 56 conditions per place. [2025-03-13 22:26:51,078 INFO L140 encePairwiseOnDemand]: 624/627 looper letters, 17 selfloop transitions, 2 changer transitions 0/575 dead transitions. [2025-03-13 22:26:51,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 565 places, 575 transitions, 1194 flow [2025-03-13 22:26:51,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:51,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:51,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1787 transitions. [2025-03-13 22:26:51,082 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.950026581605529 [2025-03-13 22:26:51,082 INFO L175 Difference]: Start difference. First operand has 564 places, 576 transitions, 1158 flow. Second operand 3 states and 1787 transitions. [2025-03-13 22:26:51,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 565 places, 575 transitions, 1194 flow [2025-03-13 22:26:51,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 564 places, 575 transitions, 1193 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:26:51,094 INFO L231 Difference]: Finished difference. Result has 564 places, 575 transitions, 1159 flow [2025-03-13 22:26:51,095 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=627, PETRI_DIFFERENCE_MINUEND_FLOW=1155, PETRI_DIFFERENCE_MINUEND_PLACES=562, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=575, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=573, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1159, PETRI_PLACES=564, PETRI_TRANSITIONS=575} [2025-03-13 22:26:51,096 INFO L279 CegarLoopForPetriNet]: 583 programPoint places, -19 predicate places. [2025-03-13 22:26:51,096 INFO L471 AbstractCegarLoop]: Abstraction has has 564 places, 575 transitions, 1159 flow [2025-03-13 22:26:51,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 590.3333333333334) internal successors, (1771), 3 states have internal predecessors, (1771), 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-13 22:26:51,097 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:51,097 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-13 22:26:51,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 22:26:51,097 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2025-03-13 22:26:51,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:51,099 INFO L85 PathProgramCache]: Analyzing trace with hash 730234998, now seen corresponding path program 1 times [2025-03-13 22:26:51,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:51,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293911126] [2025-03-13 22:26:51,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:51,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:51,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-13 22:26:51,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-13 22:26:51,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:51,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:51,575 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-13 22:26:51,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:51,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293911126] [2025-03-13 22:26:51,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293911126] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:51,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:51,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:26:51,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618470055] [2025-03-13 22:26:51,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:51,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:26:51,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:51,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:26:51,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:26:51,821 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 552 out of 627 [2025-03-13 22:26:51,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 564 places, 575 transitions, 1159 flow. Second operand has 6 states, 6 states have (on average 553.5) internal successors, (3321), 6 states have internal predecessors, (3321), 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-13 22:26:51,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:51,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 552 of 627 [2025-03-13 22:26:51,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:52,155 INFO L124 PetriNetUnfolderBase]: 368/3207 cut-off events. [2025-03-13 22:26:52,155 INFO L125 PetriNetUnfolderBase]: For 76/77 co-relation queries the response was YES. [2025-03-13 22:26:52,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3739 conditions, 3207 events. 368/3207 cut-off events. For 76/77 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 22887 event pairs, 184 based on Foata normal form. 0/2592 useless extension candidates. Maximal degree in co-relation 3704. Up to 516 conditions per place. [2025-03-13 22:26:52,169 INFO L140 encePairwiseOnDemand]: 621/627 looper letters, 52 selfloop transitions, 5 changer transitions 0/574 dead transitions. [2025-03-13 22:26:52,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 568 places, 574 transitions, 1271 flow [2025-03-13 22:26:52,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:26:52,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:26:52,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3370 transitions. [2025-03-13 22:26:52,174 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8958001063264222 [2025-03-13 22:26:52,174 INFO L175 Difference]: Start difference. First operand has 564 places, 575 transitions, 1159 flow. Second operand 6 states and 3370 transitions. [2025-03-13 22:26:52,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 568 places, 574 transitions, 1271 flow [2025-03-13 22:26:52,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 566 places, 574 transitions, 1267 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:52,181 INFO L231 Difference]: Finished difference. Result has 566 places, 574 transitions, 1163 flow [2025-03-13 22:26:52,182 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=627, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=561, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=574, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=569, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1163, PETRI_PLACES=566, PETRI_TRANSITIONS=574} [2025-03-13 22:26:52,183 INFO L279 CegarLoopForPetriNet]: 583 programPoint places, -17 predicate places. [2025-03-13 22:26:52,184 INFO L471 AbstractCegarLoop]: Abstraction has has 566 places, 574 transitions, 1163 flow [2025-03-13 22:26:52,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 553.5) internal successors, (3321), 6 states have internal predecessors, (3321), 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-13 22:26:52,186 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:52,187 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:52,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 22:26:52,187 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2025-03-13 22:26:52,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:52,188 INFO L85 PathProgramCache]: Analyzing trace with hash 185309371, now seen corresponding path program 1 times [2025-03-13 22:26:52,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:52,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691722427] [2025-03-13 22:26:52,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:52,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:52,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-13 22:26:52,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-13 22:26:52,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:52,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:52,225 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-13 22:26:52,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:52,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691722427] [2025-03-13 22:26:52,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691722427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:52,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:52,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:52,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312822388] [2025-03-13 22:26:52,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:52,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:52,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:52,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:52,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:52,246 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 587 out of 627 [2025-03-13 22:26:52,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 566 places, 574 transitions, 1163 flow. Second operand has 3 states, 3 states have (on average 588.3333333333334) internal successors, (1765), 3 states have internal predecessors, (1765), 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-13 22:26:52,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:52,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 587 of 627 [2025-03-13 22:26:52,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:52,379 INFO L124 PetriNetUnfolderBase]: 104/1939 cut-off events. [2025-03-13 22:26:52,380 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-03-13 22:26:52,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2049 conditions, 1939 events. 104/1939 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 12257 event pairs, 20 based on Foata normal form. 0/1591 useless extension candidates. Maximal degree in co-relation 2031. Up to 94 conditions per place. [2025-03-13 22:26:52,391 INFO L140 encePairwiseOnDemand]: 619/627 looper letters, 18 selfloop transitions, 2 changer transitions 0/571 dead transitions. [2025-03-13 22:26:52,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 562 places, 571 transitions, 1198 flow [2025-03-13 22:26:52,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:52,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:52,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1787 transitions. [2025-03-13 22:26:52,395 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.950026581605529 [2025-03-13 22:26:52,395 INFO L175 Difference]: Start difference. First operand has 566 places, 574 transitions, 1163 flow. Second operand 3 states and 1787 transitions. [2025-03-13 22:26:52,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 562 places, 571 transitions, 1198 flow [2025-03-13 22:26:52,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 557 places, 571 transitions, 1188 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:26:52,404 INFO L231 Difference]: Finished difference. Result has 558 places, 570 transitions, 1155 flow [2025-03-13 22:26:52,404 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=627, PETRI_DIFFERENCE_MINUEND_FLOW=1141, PETRI_DIFFERENCE_MINUEND_PLACES=555, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=568, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=566, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1155, PETRI_PLACES=558, PETRI_TRANSITIONS=570} [2025-03-13 22:26:52,405 INFO L279 CegarLoopForPetriNet]: 583 programPoint places, -25 predicate places. [2025-03-13 22:26:52,405 INFO L471 AbstractCegarLoop]: Abstraction has has 558 places, 570 transitions, 1155 flow [2025-03-13 22:26:52,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 588.3333333333334) internal successors, (1765), 3 states have internal predecessors, (1765), 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-13 22:26:52,406 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:52,406 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:52,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 22:26:52,406 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2025-03-13 22:26:52,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:52,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1519716595, now seen corresponding path program 1 times [2025-03-13 22:26:52,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:52,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874517733] [2025-03-13 22:26:52,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:52,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:52,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-13 22:26:52,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-13 22:26:52,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:52,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:52,453 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-13 22:26:52,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:52,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874517733] [2025-03-13 22:26:52,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874517733] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:52,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:52,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:52,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793457947] [2025-03-13 22:26:52,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:52,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:52,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:52,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:52,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:52,472 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 593 out of 627 [2025-03-13 22:26:52,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 558 places, 570 transitions, 1155 flow. Second operand has 3 states, 3 states have (on average 594.0) internal successors, (1782), 3 states have internal predecessors, (1782), 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-13 22:26:52,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:52,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 593 of 627 [2025-03-13 22:26:52,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:52,581 INFO L124 PetriNetUnfolderBase]: 55/1431 cut-off events. [2025-03-13 22:26:52,582 INFO L125 PetriNetUnfolderBase]: For 2/9 co-relation queries the response was YES. [2025-03-13 22:26:52,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1482 conditions, 1431 events. 55/1431 cut-off events. For 2/9 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 7136 event pairs, 1 based on Foata normal form. 1/1190 useless extension candidates. Maximal degree in co-relation 1447. Up to 20 conditions per place. [2025-03-13 22:26:52,589 INFO L140 encePairwiseOnDemand]: 620/627 looper letters, 11 selfloop transitions, 3 changer transitions 0/567 dead transitions. [2025-03-13 22:26:52,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 556 places, 567 transitions, 1178 flow [2025-03-13 22:26:52,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:52,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:52,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1797 transitions. [2025-03-13 22:26:52,592 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9553429027113237 [2025-03-13 22:26:52,592 INFO L175 Difference]: Start difference. First operand has 558 places, 570 transitions, 1155 flow. Second operand 3 states and 1797 transitions. [2025-03-13 22:26:52,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 556 places, 567 transitions, 1178 flow [2025-03-13 22:26:52,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 556 places, 567 transitions, 1178 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:26:52,598 INFO L231 Difference]: Finished difference. Result has 556 places, 566 transitions, 1153 flow [2025-03-13 22:26:52,599 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=627, PETRI_DIFFERENCE_MINUEND_FLOW=1147, PETRI_DIFFERENCE_MINUEND_PLACES=554, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=566, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=563, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1153, PETRI_PLACES=556, PETRI_TRANSITIONS=566} [2025-03-13 22:26:52,601 INFO L279 CegarLoopForPetriNet]: 583 programPoint places, -27 predicate places. [2025-03-13 22:26:52,601 INFO L471 AbstractCegarLoop]: Abstraction has has 556 places, 566 transitions, 1153 flow [2025-03-13 22:26:52,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 594.0) internal successors, (1782), 3 states have internal predecessors, (1782), 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-13 22:26:52,602 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:52,602 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:52,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 22:26:52,602 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err66ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2025-03-13 22:26:52,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:52,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1006140501, now seen corresponding path program 1 times [2025-03-13 22:26:52,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:52,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819630839] [2025-03-13 22:26:52,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:52,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:52,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-13 22:26:52,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-13 22:26:52,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:52,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:52,647 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-13 22:26:52,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:52,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819630839] [2025-03-13 22:26:52,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819630839] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:52,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:52,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:52,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411715815] [2025-03-13 22:26:52,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:52,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:52,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:52,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:52,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:52,757 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 513 out of 627 [2025-03-13 22:26:52,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 556 places, 566 transitions, 1153 flow. Second operand has 3 states, 3 states have (on average 514.3333333333334) internal successors, (1543), 3 states have internal predecessors, (1543), 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-13 22:26:52,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:52,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 513 of 627 [2025-03-13 22:26:52,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:52,868 INFO L124 PetriNetUnfolderBase]: 105/1283 cut-off events. [2025-03-13 22:26:52,869 INFO L125 PetriNetUnfolderBase]: For 65/66 co-relation queries the response was YES. [2025-03-13 22:26:52,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1560 conditions, 1283 events. 105/1283 cut-off events. For 65/66 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 7022 event pairs, 9 based on Foata normal form. 1/1136 useless extension candidates. Maximal degree in co-relation 1524. Up to 217 conditions per place. [2025-03-13 22:26:52,876 INFO L140 encePairwiseOnDemand]: 580/627 looper letters, 49 selfloop transitions, 18 changer transitions 4/539 dead transitions. [2025-03-13 22:26:52,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 530 places, 539 transitions, 1238 flow [2025-03-13 22:26:52,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:52,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:52,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1636 transitions. [2025-03-13 22:26:52,882 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8697501329080276 [2025-03-13 22:26:52,882 INFO L175 Difference]: Start difference. First operand has 556 places, 566 transitions, 1153 flow. Second operand 3 states and 1636 transitions. [2025-03-13 22:26:52,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 530 places, 539 transitions, 1238 flow [2025-03-13 22:26:52,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 528 places, 539 transitions, 1232 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:52,889 INFO L231 Difference]: Finished difference. Result has 528 places, 534 transitions, 1118 flow [2025-03-13 22:26:52,890 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=627, PETRI_DIFFERENCE_MINUEND_FLOW=1091, PETRI_DIFFERENCE_MINUEND_PLACES=526, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=538, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=520, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1118, PETRI_PLACES=528, PETRI_TRANSITIONS=534} [2025-03-13 22:26:52,890 INFO L279 CegarLoopForPetriNet]: 583 programPoint places, -55 predicate places. [2025-03-13 22:26:52,890 INFO L471 AbstractCegarLoop]: Abstraction has has 528 places, 534 transitions, 1118 flow [2025-03-13 22:26:52,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 514.3333333333334) internal successors, (1543), 3 states have internal predecessors, (1543), 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-13 22:26:52,892 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:52,892 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:52,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 22:26:52,892 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2025-03-13 22:26:52,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:52,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1819919401, now seen corresponding path program 1 times [2025-03-13 22:26:52,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:52,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658987322] [2025-03-13 22:26:52,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:52,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:52,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-13 22:26:52,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-13 22:26:52,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:52,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:52,928 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-13 22:26:52,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:52,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658987322] [2025-03-13 22:26:52,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658987322] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:52,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:52,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:52,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433476112] [2025-03-13 22:26:52,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:52,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:52,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:52,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:52,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:52,958 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 575 out of 627 [2025-03-13 22:26:52,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 528 places, 534 transitions, 1118 flow. Second operand has 3 states, 3 states have (on average 576.3333333333334) internal successors, (1729), 3 states have internal predecessors, (1729), 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-13 22:26:52,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:52,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 575 of 627 [2025-03-13 22:26:52,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:53,127 INFO L124 PetriNetUnfolderBase]: 174/2498 cut-off events. [2025-03-13 22:26:53,127 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-03-13 22:26:53,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2813 conditions, 2498 events. 174/2498 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 16807 event pairs, 19 based on Foata normal form. 0/2225 useless extension candidates. Maximal degree in co-relation 2777. Up to 180 conditions per place. [2025-03-13 22:26:53,138 INFO L140 encePairwiseOnDemand]: 611/627 looper letters, 26 selfloop transitions, 6 changer transitions 0/532 dead transitions. [2025-03-13 22:26:53,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 516 places, 532 transitions, 1180 flow [2025-03-13 22:26:53,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:53,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:53,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1767 transitions. [2025-03-13 22:26:53,141 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9393939393939394 [2025-03-13 22:26:53,141 INFO L175 Difference]: Start difference. First operand has 528 places, 534 transitions, 1118 flow. Second operand 3 states and 1767 transitions. [2025-03-13 22:26:53,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 516 places, 532 transitions, 1180 flow [2025-03-13 22:26:53,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 514 places, 532 transitions, 1144 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:53,147 INFO L231 Difference]: Finished difference. Result has 515 places, 530 transitions, 1104 flow [2025-03-13 22:26:53,147 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=627, PETRI_DIFFERENCE_MINUEND_FLOW=1062, PETRI_DIFFERENCE_MINUEND_PLACES=512, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=524, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=518, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1104, PETRI_PLACES=515, PETRI_TRANSITIONS=530} [2025-03-13 22:26:53,148 INFO L279 CegarLoopForPetriNet]: 583 programPoint places, -68 predicate places. [2025-03-13 22:26:53,148 INFO L471 AbstractCegarLoop]: Abstraction has has 515 places, 530 transitions, 1104 flow [2025-03-13 22:26:53,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 576.3333333333334) internal successors, (1729), 3 states have internal predecessors, (1729), 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-13 22:26:53,149 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:53,149 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-13 22:26:53,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 22:26:53,149 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2025-03-13 22:26:53,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:53,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1186672627, now seen corresponding path program 1 times [2025-03-13 22:26:53,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:53,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168813464] [2025-03-13 22:26:53,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:53,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:53,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-13 22:26:53,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-13 22:26:53,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:53,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:53,214 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-13 22:26:53,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:53,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168813464] [2025-03-13 22:26:53,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168813464] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:53,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:53,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 22:26:53,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752243526] [2025-03-13 22:26:53,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:53,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 22:26:53,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:53,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 22:26:53,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 22:26:53,237 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 599 out of 627 [2025-03-13 22:26:53,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 515 places, 530 transitions, 1104 flow. Second operand has 4 states, 4 states have (on average 600.25) internal successors, (2401), 4 states have internal predecessors, (2401), 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-13 22:26:53,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:53,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 599 of 627 [2025-03-13 22:26:53,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:53,494 INFO L124 PetriNetUnfolderBase]: 157/3092 cut-off events. [2025-03-13 22:26:53,495 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 22:26:53,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3268 conditions, 3092 events. 157/3092 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 21481 event pairs, 8 based on Foata normal form. 0/2753 useless extension candidates. Maximal degree in co-relation 3231. Up to 73 conditions per place. [2025-03-13 22:26:53,510 INFO L140 encePairwiseOnDemand]: 621/627 looper letters, 13 selfloop transitions, 6 changer transitions 0/539 dead transitions. [2025-03-13 22:26:53,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 519 places, 539 transitions, 1164 flow [2025-03-13 22:26:53,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 22:26:53,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 22:26:53,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3015 transitions. [2025-03-13 22:26:53,516 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9617224880382775 [2025-03-13 22:26:53,516 INFO L175 Difference]: Start difference. First operand has 515 places, 530 transitions, 1104 flow. Second operand 5 states and 3015 transitions. [2025-03-13 22:26:53,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 519 places, 539 transitions, 1164 flow [2025-03-13 22:26:53,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 519 places, 539 transitions, 1164 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:26:53,524 INFO L231 Difference]: Finished difference. Result has 522 places, 534 transitions, 1142 flow [2025-03-13 22:26:53,524 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=627, PETRI_DIFFERENCE_MINUEND_FLOW=1104, PETRI_DIFFERENCE_MINUEND_PLACES=515, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=530, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=525, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1142, PETRI_PLACES=522, PETRI_TRANSITIONS=534} [2025-03-13 22:26:53,525 INFO L279 CegarLoopForPetriNet]: 583 programPoint places, -61 predicate places. [2025-03-13 22:26:53,526 INFO L471 AbstractCegarLoop]: Abstraction has has 522 places, 534 transitions, 1142 flow [2025-03-13 22:26:53,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 600.25) internal successors, (2401), 4 states have internal predecessors, (2401), 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-13 22:26:53,527 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:53,527 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] [2025-03-13 22:26:53,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 22:26:53,527 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2025-03-13 22:26:53,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:53,528 INFO L85 PathProgramCache]: Analyzing trace with hash 962500473, now seen corresponding path program 1 times [2025-03-13 22:26:53,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:53,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981975716] [2025-03-13 22:26:53,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:53,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:53,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-13 22:26:53,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-13 22:26:53,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:53,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:53,797 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-13 22:26:53,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:53,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981975716] [2025-03-13 22:26:53,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981975716] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:53,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:53,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:26:53,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895296571] [2025-03-13 22:26:53,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:53,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:26:53,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:53,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:26:53,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:26:54,218 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 592 out of 627 [2025-03-13 22:26:54,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 522 places, 534 transitions, 1142 flow. Second operand has 6 states, 6 states have (on average 593.5) internal successors, (3561), 6 states have internal predecessors, (3561), 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-13 22:26:54,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:54,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 592 of 627 [2025-03-13 22:26:54,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:54,400 INFO L124 PetriNetUnfolderBase]: 125/2383 cut-off events. [2025-03-13 22:26:54,400 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2025-03-13 22:26:54,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2586 conditions, 2383 events. 125/2383 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 15092 event pairs, 7 based on Foata normal form. 0/2135 useless extension candidates. Maximal degree in co-relation 2543. Up to 57 conditions per place. [2025-03-13 22:26:54,412 INFO L140 encePairwiseOnDemand]: 621/627 looper letters, 15 selfloop transitions, 6 changer transitions 0/537 dead transitions. [2025-03-13 22:26:54,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 526 places, 537 transitions, 1194 flow [2025-03-13 22:26:54,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:26:54,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:26:54,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3573 transitions. [2025-03-13 22:26:54,417 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9497607655502392 [2025-03-13 22:26:54,418 INFO L175 Difference]: Start difference. First operand has 522 places, 534 transitions, 1142 flow. Second operand 6 states and 3573 transitions. [2025-03-13 22:26:54,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 526 places, 537 transitions, 1194 flow [2025-03-13 22:26:54,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 526 places, 537 transitions, 1194 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:26:54,425 INFO L231 Difference]: Finished difference. Result has 526 places, 533 transitions, 1152 flow [2025-03-13 22:26:54,426 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=627, PETRI_DIFFERENCE_MINUEND_FLOW=1140, PETRI_DIFFERENCE_MINUEND_PLACES=521, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=533, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=527, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1152, PETRI_PLACES=526, PETRI_TRANSITIONS=533} [2025-03-13 22:26:54,426 INFO L279 CegarLoopForPetriNet]: 583 programPoint places, -57 predicate places. [2025-03-13 22:26:54,426 INFO L471 AbstractCegarLoop]: Abstraction has has 526 places, 533 transitions, 1152 flow [2025-03-13 22:26:54,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 593.5) internal successors, (3561), 6 states have internal predecessors, (3561), 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-13 22:26:54,428 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:54,428 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] [2025-03-13 22:26:54,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-13 22:26:54,428 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err61ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2025-03-13 22:26:54,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:54,429 INFO L85 PathProgramCache]: Analyzing trace with hash -2013158331, now seen corresponding path program 1 times [2025-03-13 22:26:54,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:54,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824518978] [2025-03-13 22:26:54,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:54,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:54,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-13 22:26:54,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-13 22:26:54,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:54,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:54,492 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-13 22:26:54,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:54,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824518978] [2025-03-13 22:26:54,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824518978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:54,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:54,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 22:26:54,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897268814] [2025-03-13 22:26:54,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:54,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 22:26:54,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:54,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 22:26:54,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 22:26:54,614 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 591 out of 627 [2025-03-13 22:26:54,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 526 places, 533 transitions, 1152 flow. Second operand has 4 states, 4 states have (on average 592.5) internal successors, (2370), 4 states have internal predecessors, (2370), 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-13 22:26:54,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:54,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 591 of 627 [2025-03-13 22:26:54,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:54,872 INFO L124 PetriNetUnfolderBase]: 192/3289 cut-off events. [2025-03-13 22:26:54,872 INFO L125 PetriNetUnfolderBase]: For 54/55 co-relation queries the response was YES. [2025-03-13 22:26:54,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3679 conditions, 3289 events. 192/3289 cut-off events. For 54/55 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 22195 event pairs, 16 based on Foata normal form. 0/2942 useless extension candidates. Maximal degree in co-relation 3636. Up to 133 conditions per place. [2025-03-13 22:26:54,888 INFO L140 encePairwiseOnDemand]: 617/627 looper letters, 20 selfloop transitions, 10 changer transitions 0/545 dead transitions. [2025-03-13 22:26:54,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 530 places, 545 transitions, 1239 flow [2025-03-13 22:26:54,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 22:26:54,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 22:26:54,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2986 transitions. [2025-03-13 22:26:54,893 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9524720893141946 [2025-03-13 22:26:54,893 INFO L175 Difference]: Start difference. First operand has 526 places, 533 transitions, 1152 flow. Second operand 5 states and 2986 transitions. [2025-03-13 22:26:54,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 530 places, 545 transitions, 1239 flow [2025-03-13 22:26:54,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 525 places, 545 transitions, 1227 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:26:54,899 INFO L231 Difference]: Finished difference. Result has 528 places, 541 transitions, 1210 flow [2025-03-13 22:26:54,900 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=627, PETRI_DIFFERENCE_MINUEND_FLOW=1140, PETRI_DIFFERENCE_MINUEND_PLACES=521, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=533, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=524, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1210, PETRI_PLACES=528, PETRI_TRANSITIONS=541} [2025-03-13 22:26:54,900 INFO L279 CegarLoopForPetriNet]: 583 programPoint places, -55 predicate places. [2025-03-13 22:26:54,900 INFO L471 AbstractCegarLoop]: Abstraction has has 528 places, 541 transitions, 1210 flow [2025-03-13 22:26:54,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 592.5) internal successors, (2370), 4 states have internal predecessors, (2370), 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-13 22:26:54,901 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:54,901 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] [2025-03-13 22:26:54,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 22:26:54,902 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2025-03-13 22:26:54,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:54,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1288217669, now seen corresponding path program 1 times [2025-03-13 22:26:54,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:54,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061663394] [2025-03-13 22:26:54,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:54,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:54,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-13 22:26:54,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-13 22:26:54,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:54,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:54,929 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-13 22:26:54,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:54,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061663394] [2025-03-13 22:26:54,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061663394] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:54,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:54,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:54,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538619958] [2025-03-13 22:26:54,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:54,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:54,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:54,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:54,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:54,947 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 597 out of 627 [2025-03-13 22:26:54,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 528 places, 541 transitions, 1210 flow. Second operand has 3 states, 3 states have (on average 599.3333333333334) internal successors, (1798), 3 states have internal predecessors, (1798), 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-13 22:26:54,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:54,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 597 of 627 [2025-03-13 22:26:54,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:55,282 INFO L124 PetriNetUnfolderBase]: 221/4640 cut-off events. [2025-03-13 22:26:55,283 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2025-03-13 22:26:55,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5104 conditions, 4640 events. 221/4640 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 36668 event pairs, 20 based on Foata normal form. 0/4162 useless extension candidates. Maximal degree in co-relation 5058. Up to 113 conditions per place. [2025-03-13 22:26:55,305 INFO L140 encePairwiseOnDemand]: 624/627 looper letters, 9 selfloop transitions, 2 changer transitions 0/541 dead transitions. [2025-03-13 22:26:55,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 529 places, 541 transitions, 1233 flow [2025-03-13 22:26:55,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:55,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:55,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1803 transitions. [2025-03-13 22:26:55,309 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9585326953748007 [2025-03-13 22:26:55,310 INFO L175 Difference]: Start difference. First operand has 528 places, 541 transitions, 1210 flow. Second operand 3 states and 1803 transitions. [2025-03-13 22:26:55,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 529 places, 541 transitions, 1233 flow [2025-03-13 22:26:55,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 529 places, 541 transitions, 1233 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:26:55,319 INFO L231 Difference]: Finished difference. Result has 529 places, 540 transitions, 1212 flow [2025-03-13 22:26:55,320 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=627, PETRI_DIFFERENCE_MINUEND_FLOW=1208, PETRI_DIFFERENCE_MINUEND_PLACES=527, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=540, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=538, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1212, PETRI_PLACES=529, PETRI_TRANSITIONS=540} [2025-03-13 22:26:55,321 INFO L279 CegarLoopForPetriNet]: 583 programPoint places, -54 predicate places. [2025-03-13 22:26:55,321 INFO L471 AbstractCegarLoop]: Abstraction has has 529 places, 540 transitions, 1212 flow [2025-03-13 22:26:55,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 599.3333333333334) internal successors, (1798), 3 states have internal predecessors, (1798), 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-13 22:26:55,322 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:55,322 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] [2025-03-13 22:26:55,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-13 22:26:55,323 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err25ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2025-03-13 22:26:55,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:55,324 INFO L85 PathProgramCache]: Analyzing trace with hash -2057995352, now seen corresponding path program 1 times [2025-03-13 22:26:55,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:55,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679129873] [2025-03-13 22:26:55,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:55,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:55,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-13 22:26:55,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-13 22:26:55,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:55,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:55,389 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-13 22:26:55,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:55,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679129873] [2025-03-13 22:26:55,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679129873] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:55,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:55,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 22:26:55,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144186781] [2025-03-13 22:26:55,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:55,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 22:26:55,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:55,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 22:26:55,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 22:26:55,515 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 591 out of 627 [2025-03-13 22:26:55,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 529 places, 540 transitions, 1212 flow. Second operand has 4 states, 4 states have (on average 592.5) internal successors, (2370), 4 states have internal predecessors, (2370), 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-13 22:26:55,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:55,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 591 of 627 [2025-03-13 22:26:55,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:55,747 INFO L124 PetriNetUnfolderBase]: 189/3275 cut-off events. [2025-03-13 22:26:55,747 INFO L125 PetriNetUnfolderBase]: For 176/177 co-relation queries the response was YES. [2025-03-13 22:26:55,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3767 conditions, 3275 events. 189/3275 cut-off events. For 176/177 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 22078 event pairs, 16 based on Foata normal form. 0/2948 useless extension candidates. Maximal degree in co-relation 3719. Up to 133 conditions per place. [2025-03-13 22:26:55,762 INFO L140 encePairwiseOnDemand]: 617/627 looper letters, 20 selfloop transitions, 10 changer transitions 0/547 dead transitions. [2025-03-13 22:26:55,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 533 places, 547 transitions, 1289 flow [2025-03-13 22:26:55,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 22:26:55,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 22:26:55,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2986 transitions. [2025-03-13 22:26:55,767 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9524720893141946 [2025-03-13 22:26:55,767 INFO L175 Difference]: Start difference. First operand has 529 places, 540 transitions, 1212 flow. Second operand 5 states and 2986 transitions. [2025-03-13 22:26:55,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 533 places, 547 transitions, 1289 flow [2025-03-13 22:26:55,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 531 places, 547 transitions, 1285 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:55,773 INFO L231 Difference]: Finished difference. Result has 534 places, 543 transitions, 1258 flow [2025-03-13 22:26:55,774 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=627, PETRI_DIFFERENCE_MINUEND_FLOW=1208, PETRI_DIFFERENCE_MINUEND_PLACES=527, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=540, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=531, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1258, PETRI_PLACES=534, PETRI_TRANSITIONS=543} [2025-03-13 22:26:55,774 INFO L279 CegarLoopForPetriNet]: 583 programPoint places, -49 predicate places. [2025-03-13 22:26:55,774 INFO L471 AbstractCegarLoop]: Abstraction has has 534 places, 543 transitions, 1258 flow [2025-03-13 22:26:55,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 592.5) internal successors, (2370), 4 states have internal predecessors, (2370), 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-13 22:26:55,775 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:55,776 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] [2025-03-13 22:26:55,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-13 22:26:55,776 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err61ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2025-03-13 22:26:55,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:55,776 INFO L85 PathProgramCache]: Analyzing trace with hash -520049010, now seen corresponding path program 1 times [2025-03-13 22:26:55,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:55,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139887841] [2025-03-13 22:26:55,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:55,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:55,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-13 22:26:55,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-13 22:26:55,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:55,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:56,000 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-13 22:26:56,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:56,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139887841] [2025-03-13 22:26:56,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139887841] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:56,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:56,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:26:56,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818847499] [2025-03-13 22:26:56,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:56,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:26:56,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:56,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:26:56,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:26:56,382 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 536 out of 627 [2025-03-13 22:26:56,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 534 places, 543 transitions, 1258 flow. Second operand has 6 states, 6 states have (on average 537.6666666666666) internal successors, (3226), 6 states have internal predecessors, (3226), 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-13 22:26:56,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:56,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 536 of 627 [2025-03-13 22:26:56,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:56,679 INFO L124 PetriNetUnfolderBase]: 287/2739 cut-off events. [2025-03-13 22:26:56,679 INFO L125 PetriNetUnfolderBase]: For 375/376 co-relation queries the response was YES. [2025-03-13 22:26:56,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3786 conditions, 2739 events. 287/2739 cut-off events. For 375/376 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 17800 event pairs, 30 based on Foata normal form. 0/2536 useless extension candidates. Maximal degree in co-relation 3733. Up to 224 conditions per place. [2025-03-13 22:26:56,693 INFO L140 encePairwiseOnDemand]: 573/627 looper letters, 23 selfloop transitions, 50 changer transitions 0/538 dead transitions. [2025-03-13 22:26:56,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 530 places, 538 transitions, 1398 flow [2025-03-13 22:26:56,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:26:56,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:26:56,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3293 transitions. [2025-03-13 22:26:56,698 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8753322700691122 [2025-03-13 22:26:56,698 INFO L175 Difference]: Start difference. First operand has 534 places, 543 transitions, 1258 flow. Second operand 6 states and 3293 transitions. [2025-03-13 22:26:56,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 530 places, 538 transitions, 1398 flow [2025-03-13 22:26:56,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 530 places, 538 transitions, 1398 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:26:56,706 INFO L231 Difference]: Finished difference. Result has 530 places, 534 transitions, 1340 flow [2025-03-13 22:26:56,707 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=627, PETRI_DIFFERENCE_MINUEND_FLOW=1240, PETRI_DIFFERENCE_MINUEND_PLACES=525, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=534, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=484, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1340, PETRI_PLACES=530, PETRI_TRANSITIONS=534} [2025-03-13 22:26:56,707 INFO L279 CegarLoopForPetriNet]: 583 programPoint places, -53 predicate places. [2025-03-13 22:26:56,707 INFO L471 AbstractCegarLoop]: Abstraction has has 530 places, 534 transitions, 1340 flow [2025-03-13 22:26:56,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 537.6666666666666) internal successors, (3226), 6 states have internal predecessors, (3226), 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-13 22:26:56,709 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:56,709 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:56,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-13 22:26:56,709 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err60ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2025-03-13 22:26:56,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:56,713 INFO L85 PathProgramCache]: Analyzing trace with hash -9087302, now seen corresponding path program 1 times [2025-03-13 22:26:56,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:56,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98810354] [2025-03-13 22:26:56,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:56,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:56,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-13 22:26:56,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-13 22:26:56,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:56,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:56,760 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-13 22:26:56,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:56,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98810354] [2025-03-13 22:26:56,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98810354] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:56,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:56,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:56,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125410876] [2025-03-13 22:26:56,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:56,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:56,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:56,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:56,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:56,893 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 627 [2025-03-13 22:26:56,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 530 places, 534 transitions, 1340 flow. Second operand has 3 states, 3 states have (on average 567.6666666666666) internal successors, (1703), 3 states have internal predecessors, (1703), 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-13 22:26:56,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:56,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 627 [2025-03-13 22:26:56,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:57,171 INFO L124 PetriNetUnfolderBase]: 249/3089 cut-off events. [2025-03-13 22:26:57,171 INFO L125 PetriNetUnfolderBase]: For 381/382 co-relation queries the response was YES. [2025-03-13 22:26:57,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4234 conditions, 3089 events. 249/3089 cut-off events. For 381/382 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 20733 event pairs, 116 based on Foata normal form. 0/2841 useless extension candidates. Maximal degree in co-relation 4182. Up to 420 conditions per place. [2025-03-13 22:26:57,188 INFO L140 encePairwiseOnDemand]: 624/627 looper letters, 41 selfloop transitions, 2 changer transitions 0/534 dead transitions. [2025-03-13 22:26:57,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 531 places, 534 transitions, 1427 flow [2025-03-13 22:26:57,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:57,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:57,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1739 transitions. [2025-03-13 22:26:57,190 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.924508240297714 [2025-03-13 22:26:57,190 INFO L175 Difference]: Start difference. First operand has 530 places, 534 transitions, 1340 flow. Second operand 3 states and 1739 transitions. [2025-03-13 22:26:57,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 531 places, 534 transitions, 1427 flow [2025-03-13 22:26:57,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 526 places, 534 transitions, 1327 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:26:57,198 INFO L231 Difference]: Finished difference. Result has 526 places, 533 transitions, 1242 flow [2025-03-13 22:26:57,198 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=627, PETRI_DIFFERENCE_MINUEND_FLOW=1238, PETRI_DIFFERENCE_MINUEND_PLACES=524, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=533, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=531, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1242, PETRI_PLACES=526, PETRI_TRANSITIONS=533} [2025-03-13 22:26:57,198 INFO L279 CegarLoopForPetriNet]: 583 programPoint places, -57 predicate places. [2025-03-13 22:26:57,198 INFO L471 AbstractCegarLoop]: Abstraction has has 526 places, 533 transitions, 1242 flow [2025-03-13 22:26:57,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 567.6666666666666) internal successors, (1703), 3 states have internal predecessors, (1703), 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-13 22:26:57,199 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:57,199 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:57,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-13 22:26:57,199 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err16ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2025-03-13 22:26:57,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:57,200 INFO L85 PathProgramCache]: Analyzing trace with hash -285431717, now seen corresponding path program 1 times [2025-03-13 22:26:57,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:57,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061694254] [2025-03-13 22:26:57,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:57,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:57,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-13 22:26:57,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-13 22:26:57,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:57,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:57,225 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-13 22:26:57,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:57,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061694254] [2025-03-13 22:26:57,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061694254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:57,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:57,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:57,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269317630] [2025-03-13 22:26:57,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:57,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:57,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:57,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:57,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:57,349 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 627 [2025-03-13 22:26:57,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 526 places, 533 transitions, 1242 flow. Second operand has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 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-13 22:26:57,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:57,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 627 [2025-03-13 22:26:57,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:57,583 INFO L124 PetriNetUnfolderBase]: 245/2996 cut-off events. [2025-03-13 22:26:57,583 INFO L125 PetriNetUnfolderBase]: For 277/278 co-relation queries the response was YES. [2025-03-13 22:26:57,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3797 conditions, 2996 events. 245/2996 cut-off events. For 277/278 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 20148 event pairs, 116 based on Foata normal form. 0/2757 useless extension candidates. Maximal degree in co-relation 3745. Up to 417 conditions per place. [2025-03-13 22:26:57,599 INFO L140 encePairwiseOnDemand]: 624/627 looper letters, 41 selfloop transitions, 2 changer transitions 0/533 dead transitions. [2025-03-13 22:26:57,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 527 places, 533 transitions, 1329 flow [2025-03-13 22:26:57,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:57,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:57,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1739 transitions. [2025-03-13 22:26:57,602 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.924508240297714 [2025-03-13 22:26:57,602 INFO L175 Difference]: Start difference. First operand has 526 places, 533 transitions, 1242 flow. Second operand 3 states and 1739 transitions. [2025-03-13 22:26:57,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 527 places, 533 transitions, 1329 flow [2025-03-13 22:26:57,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 525 places, 533 transitions, 1325 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:57,609 INFO L231 Difference]: Finished difference. Result has 525 places, 532 transitions, 1240 flow [2025-03-13 22:26:57,609 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=627, PETRI_DIFFERENCE_MINUEND_FLOW=1236, PETRI_DIFFERENCE_MINUEND_PLACES=523, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=532, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=530, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1240, PETRI_PLACES=525, PETRI_TRANSITIONS=532} [2025-03-13 22:26:57,610 INFO L279 CegarLoopForPetriNet]: 583 programPoint places, -58 predicate places. [2025-03-13 22:26:57,610 INFO L471 AbstractCegarLoop]: Abstraction has has 525 places, 532 transitions, 1240 flow [2025-03-13 22:26:57,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 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-13 22:26:57,610 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:57,611 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] [2025-03-13 22:26:57,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-13 22:26:57,611 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err24ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2025-03-13 22:26:57,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:57,612 INFO L85 PathProgramCache]: Analyzing trace with hash -2022068619, now seen corresponding path program 1 times [2025-03-13 22:26:57,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:57,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85152865] [2025-03-13 22:26:57,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:57,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:57,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-13 22:26:57,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-13 22:26:57,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:57,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:57,640 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-13 22:26:57,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:57,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85152865] [2025-03-13 22:26:57,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85152865] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:57,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:57,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:57,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976924506] [2025-03-13 22:26:57,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:57,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:57,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:57,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:57,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:57,740 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 627 [2025-03-13 22:26:57,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 525 places, 532 transitions, 1240 flow. Second operand has 3 states, 3 states have (on average 567.6666666666666) internal successors, (1703), 3 states have internal predecessors, (1703), 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-13 22:26:57,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:57,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 627 [2025-03-13 22:26:57,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:57,977 INFO L124 PetriNetUnfolderBase]: 244/2942 cut-off events. [2025-03-13 22:26:57,977 INFO L125 PetriNetUnfolderBase]: For 279/280 co-relation queries the response was YES. [2025-03-13 22:26:57,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3741 conditions, 2942 events. 244/2942 cut-off events. For 279/280 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 19605 event pairs, 116 based on Foata normal form. 0/2706 useless extension candidates. Maximal degree in co-relation 3689. Up to 418 conditions per place. [2025-03-13 22:26:57,987 INFO L140 encePairwiseOnDemand]: 624/627 looper letters, 41 selfloop transitions, 2 changer transitions 0/532 dead transitions. [2025-03-13 22:26:57,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 526 places, 532 transitions, 1327 flow [2025-03-13 22:26:57,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:57,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:57,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1739 transitions. [2025-03-13 22:26:57,989 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.924508240297714 [2025-03-13 22:26:57,989 INFO L175 Difference]: Start difference. First operand has 525 places, 532 transitions, 1240 flow. Second operand 3 states and 1739 transitions. [2025-03-13 22:26:57,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 526 places, 532 transitions, 1327 flow [2025-03-13 22:26:57,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 524 places, 532 transitions, 1323 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:57,996 INFO L231 Difference]: Finished difference. Result has 524 places, 531 transitions, 1238 flow [2025-03-13 22:26:57,997 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=627, PETRI_DIFFERENCE_MINUEND_FLOW=1234, PETRI_DIFFERENCE_MINUEND_PLACES=522, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=531, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=529, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1238, PETRI_PLACES=524, PETRI_TRANSITIONS=531} [2025-03-13 22:26:57,997 INFO L279 CegarLoopForPetriNet]: 583 programPoint places, -59 predicate places. [2025-03-13 22:26:57,997 INFO L471 AbstractCegarLoop]: Abstraction has has 524 places, 531 transitions, 1238 flow [2025-03-13 22:26:57,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 567.6666666666666) internal successors, (1703), 3 states have internal predecessors, (1703), 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-13 22:26:57,997 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:57,997 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-13 22:26:57,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-13 22:26:57,998 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2025-03-13 22:26:57,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:57,998 INFO L85 PathProgramCache]: Analyzing trace with hash -55736057, now seen corresponding path program 1 times [2025-03-13 22:26:57,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:57,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025094675] [2025-03-13 22:26:57,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:57,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:58,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-13 22:26:58,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-13 22:26:58,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:58,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:58,035 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-13 22:26:58,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:58,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025094675] [2025-03-13 22:26:58,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025094675] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:58,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:58,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:58,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173363445] [2025-03-13 22:26:58,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:58,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:58,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:58,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:58,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:58,154 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 627 [2025-03-13 22:26:58,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 524 places, 531 transitions, 1238 flow. Second operand has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 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-13 22:26:58,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:58,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 627 [2025-03-13 22:26:58,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:58,378 INFO L124 PetriNetUnfolderBase]: 240/2875 cut-off events. [2025-03-13 22:26:58,378 INFO L125 PetriNetUnfolderBase]: For 278/279 co-relation queries the response was YES. [2025-03-13 22:26:58,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3667 conditions, 2875 events. 240/2875 cut-off events. For 278/279 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 18976 event pairs, 116 based on Foata normal form. 0/2645 useless extension candidates. Maximal degree in co-relation 3615. Up to 416 conditions per place. [2025-03-13 22:26:58,395 INFO L140 encePairwiseOnDemand]: 624/627 looper letters, 41 selfloop transitions, 2 changer transitions 0/531 dead transitions. [2025-03-13 22:26:58,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 525 places, 531 transitions, 1325 flow [2025-03-13 22:26:58,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:58,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:58,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1739 transitions. [2025-03-13 22:26:58,398 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.924508240297714 [2025-03-13 22:26:58,398 INFO L175 Difference]: Start difference. First operand has 524 places, 531 transitions, 1238 flow. Second operand 3 states and 1739 transitions. [2025-03-13 22:26:58,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 525 places, 531 transitions, 1325 flow [2025-03-13 22:26:58,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 523 places, 531 transitions, 1321 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:58,405 INFO L231 Difference]: Finished difference. Result has 523 places, 530 transitions, 1236 flow [2025-03-13 22:26:58,405 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=627, PETRI_DIFFERENCE_MINUEND_FLOW=1232, PETRI_DIFFERENCE_MINUEND_PLACES=521, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=530, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=528, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1236, PETRI_PLACES=523, PETRI_TRANSITIONS=530} [2025-03-13 22:26:58,405 INFO L279 CegarLoopForPetriNet]: 583 programPoint places, -60 predicate places. [2025-03-13 22:26:58,406 INFO L471 AbstractCegarLoop]: Abstraction has has 523 places, 530 transitions, 1236 flow [2025-03-13 22:26:58,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 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-13 22:26:58,406 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:58,406 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] [2025-03-13 22:26:58,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-13 22:26:58,406 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2025-03-13 22:26:58,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:58,407 INFO L85 PathProgramCache]: Analyzing trace with hash 924785354, now seen corresponding path program 1 times [2025-03-13 22:26:58,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:58,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728820691] [2025-03-13 22:26:58,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:58,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:58,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-13 22:26:58,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-13 22:26:58,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:58,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:58,439 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-13 22:26:58,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:58,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728820691] [2025-03-13 22:26:58,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728820691] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:58,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:58,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:58,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093477921] [2025-03-13 22:26:58,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:58,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:58,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:58,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:58,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:58,564 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 627 [2025-03-13 22:26:58,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 523 places, 530 transitions, 1236 flow. Second operand has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 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-13 22:26:58,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:58,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 627 [2025-03-13 22:26:58,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:58,772 INFO L124 PetriNetUnfolderBase]: 239/2866 cut-off events. [2025-03-13 22:26:58,772 INFO L125 PetriNetUnfolderBase]: For 277/278 co-relation queries the response was YES. [2025-03-13 22:26:58,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3656 conditions, 2866 events. 239/2866 cut-off events. For 277/278 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 18833 event pairs, 116 based on Foata normal form. 0/2641 useless extension candidates. Maximal degree in co-relation 3604. Up to 415 conditions per place. [2025-03-13 22:26:58,787 INFO L140 encePairwiseOnDemand]: 624/627 looper letters, 40 selfloop transitions, 2 changer transitions 1/530 dead transitions. [2025-03-13 22:26:58,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 524 places, 530 transitions, 1323 flow [2025-03-13 22:26:58,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:58,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:58,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1739 transitions. [2025-03-13 22:26:58,790 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.924508240297714 [2025-03-13 22:26:58,790 INFO L175 Difference]: Start difference. First operand has 523 places, 530 transitions, 1236 flow. Second operand 3 states and 1739 transitions. [2025-03-13 22:26:58,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 524 places, 530 transitions, 1323 flow [2025-03-13 22:26:58,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 522 places, 530 transitions, 1319 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:58,796 INFO L231 Difference]: Finished difference. Result has 522 places, 529 transitions, 1234 flow [2025-03-13 22:26:58,796 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=627, PETRI_DIFFERENCE_MINUEND_FLOW=1230, PETRI_DIFFERENCE_MINUEND_PLACES=520, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=529, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=527, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1234, PETRI_PLACES=522, PETRI_TRANSITIONS=529} [2025-03-13 22:26:58,796 INFO L279 CegarLoopForPetriNet]: 583 programPoint places, -61 predicate places. [2025-03-13 22:26:58,796 INFO L471 AbstractCegarLoop]: Abstraction has has 522 places, 529 transitions, 1234 flow [2025-03-13 22:26:58,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 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-13 22:26:58,797 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:58,797 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] [2025-03-13 22:26:58,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-13 22:26:58,797 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err53ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2025-03-13 22:26:58,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:58,798 INFO L85 PathProgramCache]: Analyzing trace with hash 26740519, now seen corresponding path program 1 times [2025-03-13 22:26:58,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:58,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561820226] [2025-03-13 22:26:58,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:58,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:58,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-13 22:26:58,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-13 22:26:58,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:58,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:58,823 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-13 22:26:58,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:58,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561820226] [2025-03-13 22:26:58,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561820226] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:58,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:58,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:58,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044585862] [2025-03-13 22:26:58,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:58,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:58,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:58,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:58,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:58,920 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 627 [2025-03-13 22:26:58,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 522 places, 529 transitions, 1234 flow. Second operand has 3 states, 3 states have (on average 568.6666666666666) internal successors, (1706), 3 states have internal predecessors, (1706), 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-13 22:26:58,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:58,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 627 [2025-03-13 22:26:58,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:59,153 INFO L124 PetriNetUnfolderBase]: 248/3035 cut-off events. [2025-03-13 22:26:59,153 INFO L125 PetriNetUnfolderBase]: For 279/280 co-relation queries the response was YES. [2025-03-13 22:26:59,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3845 conditions, 3035 events. 248/3035 cut-off events. For 279/280 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 20185 event pairs, 116 based on Foata normal form. 0/2809 useless extension candidates. Maximal degree in co-relation 3793. Up to 420 conditions per place. [2025-03-13 22:26:59,163 INFO L140 encePairwiseOnDemand]: 624/627 looper letters, 41 selfloop transitions, 2 changer transitions 0/529 dead transitions. [2025-03-13 22:26:59,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 523 places, 529 transitions, 1321 flow [2025-03-13 22:26:59,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:59,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:59,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1739 transitions. [2025-03-13 22:26:59,165 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.924508240297714 [2025-03-13 22:26:59,165 INFO L175 Difference]: Start difference. First operand has 522 places, 529 transitions, 1234 flow. Second operand 3 states and 1739 transitions. [2025-03-13 22:26:59,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 523 places, 529 transitions, 1321 flow [2025-03-13 22:26:59,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 521 places, 529 transitions, 1317 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:59,171 INFO L231 Difference]: Finished difference. Result has 521 places, 528 transitions, 1232 flow [2025-03-13 22:26:59,171 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=627, PETRI_DIFFERENCE_MINUEND_FLOW=1228, PETRI_DIFFERENCE_MINUEND_PLACES=519, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=528, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=526, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1232, PETRI_PLACES=521, PETRI_TRANSITIONS=528} [2025-03-13 22:26:59,171 INFO L279 CegarLoopForPetriNet]: 583 programPoint places, -62 predicate places. [2025-03-13 22:26:59,171 INFO L471 AbstractCegarLoop]: Abstraction has has 521 places, 528 transitions, 1232 flow [2025-03-13 22:26:59,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 568.6666666666666) internal successors, (1706), 3 states have internal predecessors, (1706), 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-13 22:26:59,172 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:59,172 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] [2025-03-13 22:26:59,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-13 22:26:59,172 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err46ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2025-03-13 22:26:59,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:59,173 INFO L85 PathProgramCache]: Analyzing trace with hash -126364773, now seen corresponding path program 1 times [2025-03-13 22:26:59,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:59,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460445802] [2025-03-13 22:26:59,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:59,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:59,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-13 22:26:59,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-13 22:26:59,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:59,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:59,211 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-13 22:26:59,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:59,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460445802] [2025-03-13 22:26:59,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460445802] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:59,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:59,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:59,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19244245] [2025-03-13 22:26:59,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:59,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:59,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:59,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:59,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:59,329 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 627 [2025-03-13 22:26:59,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 521 places, 528 transitions, 1232 flow. Second operand has 3 states, 3 states have (on average 569.6666666666666) internal successors, (1709), 3 states have internal predecessors, (1709), 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-13 22:26:59,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:59,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 627 [2025-03-13 22:26:59,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:59,556 INFO L124 PetriNetUnfolderBase]: 247/2996 cut-off events. [2025-03-13 22:26:59,557 INFO L125 PetriNetUnfolderBase]: For 279/280 co-relation queries the response was YES. [2025-03-13 22:26:59,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3807 conditions, 2996 events. 247/2996 cut-off events. For 279/280 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 19748 event pairs, 116 based on Foata normal form. 0/2776 useless extension candidates. Maximal degree in co-relation 3755. Up to 420 conditions per place. [2025-03-13 22:26:59,572 INFO L140 encePairwiseOnDemand]: 624/627 looper letters, 41 selfloop transitions, 2 changer transitions 0/528 dead transitions. [2025-03-13 22:26:59,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 522 places, 528 transitions, 1319 flow [2025-03-13 22:26:59,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:59,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:59,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1739 transitions. [2025-03-13 22:26:59,575 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.924508240297714 [2025-03-13 22:26:59,575 INFO L175 Difference]: Start difference. First operand has 521 places, 528 transitions, 1232 flow. Second operand 3 states and 1739 transitions. [2025-03-13 22:26:59,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 522 places, 528 transitions, 1319 flow [2025-03-13 22:26:59,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 520 places, 528 transitions, 1315 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:59,581 INFO L231 Difference]: Finished difference. Result has 520 places, 527 transitions, 1230 flow [2025-03-13 22:26:59,582 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=627, PETRI_DIFFERENCE_MINUEND_FLOW=1226, PETRI_DIFFERENCE_MINUEND_PLACES=518, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=527, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=525, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1230, PETRI_PLACES=520, PETRI_TRANSITIONS=527} [2025-03-13 22:26:59,582 INFO L279 CegarLoopForPetriNet]: 583 programPoint places, -63 predicate places. [2025-03-13 22:26:59,582 INFO L471 AbstractCegarLoop]: Abstraction has has 520 places, 527 transitions, 1230 flow [2025-03-13 22:26:59,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 569.6666666666666) internal successors, (1709), 3 states have internal predecessors, (1709), 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-13 22:26:59,582 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:59,583 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] [2025-03-13 22:26:59,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-13 22:26:59,583 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err39ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2025-03-13 22:26:59,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:59,584 INFO L85 PathProgramCache]: Analyzing trace with hash 2005043567, now seen corresponding path program 1 times [2025-03-13 22:26:59,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:59,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697934430] [2025-03-13 22:26:59,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:59,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:59,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-13 22:26:59,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-13 22:26:59,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:59,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:59,633 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-13 22:26:59,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:59,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697934430] [2025-03-13 22:26:59,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697934430] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:59,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:59,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:59,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520763084] [2025-03-13 22:26:59,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:59,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:59,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:59,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:59,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:59,733 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 627 [2025-03-13 22:26:59,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 520 places, 527 transitions, 1230 flow. Second operand has 3 states, 3 states have (on average 570.6666666666666) internal successors, (1712), 3 states have internal predecessors, (1712), 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-13 22:26:59,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:59,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 627 [2025-03-13 22:26:59,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:59,948 INFO L124 PetriNetUnfolderBase]: 246/2957 cut-off events. [2025-03-13 22:26:59,949 INFO L125 PetriNetUnfolderBase]: For 279/280 co-relation queries the response was YES. [2025-03-13 22:26:59,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3768 conditions, 2957 events. 246/2957 cut-off events. For 279/280 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 19450 event pairs, 116 based on Foata normal form. 0/2743 useless extension candidates. Maximal degree in co-relation 3716. Up to 420 conditions per place. [2025-03-13 22:26:59,963 INFO L140 encePairwiseOnDemand]: 624/627 looper letters, 41 selfloop transitions, 2 changer transitions 0/527 dead transitions. [2025-03-13 22:26:59,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 521 places, 527 transitions, 1317 flow [2025-03-13 22:26:59,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:59,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:59,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1739 transitions. [2025-03-13 22:26:59,966 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.924508240297714 [2025-03-13 22:26:59,966 INFO L175 Difference]: Start difference. First operand has 520 places, 527 transitions, 1230 flow. Second operand 3 states and 1739 transitions. [2025-03-13 22:26:59,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 521 places, 527 transitions, 1317 flow [2025-03-13 22:26:59,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 519 places, 527 transitions, 1313 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:59,972 INFO L231 Difference]: Finished difference. Result has 519 places, 526 transitions, 1228 flow [2025-03-13 22:26:59,972 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=627, PETRI_DIFFERENCE_MINUEND_FLOW=1224, PETRI_DIFFERENCE_MINUEND_PLACES=517, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=526, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=524, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1228, PETRI_PLACES=519, PETRI_TRANSITIONS=526} [2025-03-13 22:26:59,972 INFO L279 CegarLoopForPetriNet]: 583 programPoint places, -64 predicate places. [2025-03-13 22:26:59,972 INFO L471 AbstractCegarLoop]: Abstraction has has 519 places, 526 transitions, 1228 flow [2025-03-13 22:26:59,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 570.6666666666666) internal successors, (1712), 3 states have internal predecessors, (1712), 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-13 22:26:59,973 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:59,973 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:59,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-13 22:26:59,973 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err32ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2025-03-13 22:26:59,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:59,974 INFO L85 PathProgramCache]: Analyzing trace with hash 247824547, now seen corresponding path program 1 times [2025-03-13 22:26:59,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:59,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213269740] [2025-03-13 22:26:59,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:59,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:59,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-03-13 22:26:59,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-03-13 22:26:59,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:59,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:00,016 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-13 22:27:00,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:00,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213269740] [2025-03-13 22:27:00,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213269740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:00,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:00,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:27:00,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106075119] [2025-03-13 22:27:00,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:00,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:27:00,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:00,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:27:00,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:27:00,118 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 627 [2025-03-13 22:27:00,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 519 places, 526 transitions, 1228 flow. Second operand has 3 states, 3 states have (on average 571.6666666666666) internal successors, (1715), 3 states have internal predecessors, (1715), 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-13 22:27:00,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:00,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 627 [2025-03-13 22:27:00,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:00,352 INFO L124 PetriNetUnfolderBase]: 245/2918 cut-off events. [2025-03-13 22:27:00,353 INFO L125 PetriNetUnfolderBase]: For 279/280 co-relation queries the response was YES. [2025-03-13 22:27:00,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3729 conditions, 2918 events. 245/2918 cut-off events. For 279/280 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 19158 event pairs, 116 based on Foata normal form. 0/2710 useless extension candidates. Maximal degree in co-relation 3677. Up to 420 conditions per place. [2025-03-13 22:27:00,364 INFO L140 encePairwiseOnDemand]: 624/627 looper letters, 0 selfloop transitions, 0 changer transitions 526/526 dead transitions. [2025-03-13 22:27:00,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 520 places, 526 transitions, 1315 flow [2025-03-13 22:27:00,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:27:00,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:27:00,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1739 transitions. [2025-03-13 22:27:00,366 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.924508240297714 [2025-03-13 22:27:00,367 INFO L175 Difference]: Start difference. First operand has 519 places, 526 transitions, 1228 flow. Second operand 3 states and 1739 transitions. [2025-03-13 22:27:00,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 520 places, 526 transitions, 1315 flow [2025-03-13 22:27:00,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 518 places, 526 transitions, 1311 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:27:00,372 INFO L231 Difference]: Finished difference. Result has 518 places, 0 transitions, 0 flow [2025-03-13 22:27:00,372 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=627, PETRI_DIFFERENCE_MINUEND_FLOW=1222, PETRI_DIFFERENCE_MINUEND_PLACES=516, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=525, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=525, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=518, PETRI_TRANSITIONS=0} [2025-03-13 22:27:00,373 INFO L279 CegarLoopForPetriNet]: 583 programPoint places, -65 predicate places. [2025-03-13 22:27:00,373 INFO L471 AbstractCegarLoop]: Abstraction has has 518 places, 0 transitions, 0 flow [2025-03-13 22:27:00,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 571.6666666666666) internal successors, (1715), 3 states have internal predecessors, (1715), 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-13 22:27:00,375 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (161 of 162 remaining) [2025-03-13 22:27:00,375 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (160 of 162 remaining) [2025-03-13 22:27:00,376 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (159 of 162 remaining) [2025-03-13 22:27:00,376 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (158 of 162 remaining) [2025-03-13 22:27:00,376 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (157 of 162 remaining) [2025-03-13 22:27:00,376 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (156 of 162 remaining) [2025-03-13 22:27:00,376 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (155 of 162 remaining) [2025-03-13 22:27:00,376 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (154 of 162 remaining) [2025-03-13 22:27:00,376 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err67ASSERT_VIOLATIONDATA_RACE (153 of 162 remaining) [2025-03-13 22:27:00,376 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err31ASSERT_VIOLATIONDATA_RACE (152 of 162 remaining) [2025-03-13 22:27:00,376 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err66ASSERT_VIOLATIONDATA_RACE (151 of 162 remaining) [2025-03-13 22:27:00,376 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err30ASSERT_VIOLATIONDATA_RACE (150 of 162 remaining) [2025-03-13 22:27:00,376 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (149 of 162 remaining) [2025-03-13 22:27:00,377 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err65ASSERT_VIOLATIONDATA_RACE (148 of 162 remaining) [2025-03-13 22:27:00,377 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (147 of 162 remaining) [2025-03-13 22:27:00,377 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (146 of 162 remaining) [2025-03-13 22:27:00,377 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err29ASSERT_VIOLATIONDATA_RACE (145 of 162 remaining) [2025-03-13 22:27:00,377 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err64ASSERT_VIOLATIONDATA_RACE (144 of 162 remaining) [2025-03-13 22:27:00,377 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err28ASSERT_VIOLATIONDATA_RACE (143 of 162 remaining) [2025-03-13 22:27:00,377 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (142 of 162 remaining) [2025-03-13 22:27:00,377 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (141 of 162 remaining) [2025-03-13 22:27:00,377 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (140 of 162 remaining) [2025-03-13 22:27:00,377 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (139 of 162 remaining) [2025-03-13 22:27:00,377 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (138 of 162 remaining) [2025-03-13 22:27:00,377 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err63ASSERT_VIOLATIONDATA_RACE (137 of 162 remaining) [2025-03-13 22:27:00,377 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (136 of 162 remaining) [2025-03-13 22:27:00,377 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err27ASSERT_VIOLATIONDATA_RACE (135 of 162 remaining) [2025-03-13 22:27:00,378 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err62ASSERT_VIOLATIONDATA_RACE (134 of 162 remaining) [2025-03-13 22:27:00,378 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (133 of 162 remaining) [2025-03-13 22:27:00,378 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err26ASSERT_VIOLATIONDATA_RACE (132 of 162 remaining) [2025-03-13 22:27:00,378 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (131 of 162 remaining) [2025-03-13 22:27:00,378 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (130 of 162 remaining) [2025-03-13 22:27:00,378 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (129 of 162 remaining) [2025-03-13 22:27:00,378 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (128 of 162 remaining) [2025-03-13 22:27:00,378 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (127 of 162 remaining) [2025-03-13 22:27:00,378 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err61ASSERT_VIOLATIONDATA_RACE (126 of 162 remaining) [2025-03-13 22:27:00,378 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err25ASSERT_VIOLATIONDATA_RACE (125 of 162 remaining) [2025-03-13 22:27:00,378 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (124 of 162 remaining) [2025-03-13 22:27:00,378 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (123 of 162 remaining) [2025-03-13 22:27:00,378 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err60ASSERT_VIOLATIONDATA_RACE (122 of 162 remaining) [2025-03-13 22:27:00,378 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (121 of 162 remaining) [2025-03-13 22:27:00,378 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (120 of 162 remaining) [2025-03-13 22:27:00,378 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (119 of 162 remaining) [2025-03-13 22:27:00,378 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (118 of 162 remaining) [2025-03-13 22:27:00,379 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (117 of 162 remaining) [2025-03-13 22:27:00,379 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (116 of 162 remaining) [2025-03-13 22:27:00,379 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err59ASSERT_VIOLATIONDATA_RACE (115 of 162 remaining) [2025-03-13 22:27:00,379 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (114 of 162 remaining) [2025-03-13 22:27:00,379 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (113 of 162 remaining) [2025-03-13 22:27:00,379 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err58ASSERT_VIOLATIONDATA_RACE (112 of 162 remaining) [2025-03-13 22:27:00,379 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err57ASSERT_VIOLATIONDATA_RACE (111 of 162 remaining) [2025-03-13 22:27:00,379 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err56ASSERT_VIOLATIONDATA_RACE (110 of 162 remaining) [2025-03-13 22:27:00,379 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err55ASSERT_VIOLATIONDATA_RACE (109 of 162 remaining) [2025-03-13 22:27:00,379 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err54ASSERT_VIOLATIONDATA_RACE (108 of 162 remaining) [2025-03-13 22:27:00,379 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err53ASSERT_VIOLATIONDATA_RACE (107 of 162 remaining) [2025-03-13 22:27:00,379 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err52ASSERT_VIOLATIONDATA_RACE (106 of 162 remaining) [2025-03-13 22:27:00,379 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err51ASSERT_VIOLATIONDATA_RACE (105 of 162 remaining) [2025-03-13 22:27:00,379 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err50ASSERT_VIOLATIONDATA_RACE (104 of 162 remaining) [2025-03-13 22:27:00,379 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err49ASSERT_VIOLATIONDATA_RACE (103 of 162 remaining) [2025-03-13 22:27:00,379 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err48ASSERT_VIOLATIONDATA_RACE (102 of 162 remaining) [2025-03-13 22:27:00,380 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err47ASSERT_VIOLATIONDATA_RACE (101 of 162 remaining) [2025-03-13 22:27:00,380 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err46ASSERT_VIOLATIONDATA_RACE (100 of 162 remaining) [2025-03-13 22:27:00,380 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err45ASSERT_VIOLATIONDATA_RACE (99 of 162 remaining) [2025-03-13 22:27:00,380 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err44ASSERT_VIOLATIONDATA_RACE (98 of 162 remaining) [2025-03-13 22:27:00,380 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err43ASSERT_VIOLATIONDATA_RACE (97 of 162 remaining) [2025-03-13 22:27:00,380 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err42ASSERT_VIOLATIONDATA_RACE (96 of 162 remaining) [2025-03-13 22:27:00,380 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err41ASSERT_VIOLATIONDATA_RACE (95 of 162 remaining) [2025-03-13 22:27:00,380 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err40ASSERT_VIOLATIONDATA_RACE (94 of 162 remaining) [2025-03-13 22:27:00,380 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err39ASSERT_VIOLATIONDATA_RACE (93 of 162 remaining) [2025-03-13 22:27:00,380 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err38ASSERT_VIOLATIONDATA_RACE (92 of 162 remaining) [2025-03-13 22:27:00,380 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err37ASSERT_VIOLATIONDATA_RACE (91 of 162 remaining) [2025-03-13 22:27:00,380 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err36ASSERT_VIOLATIONDATA_RACE (90 of 162 remaining) [2025-03-13 22:27:00,380 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err35ASSERT_VIOLATIONDATA_RACE (89 of 162 remaining) [2025-03-13 22:27:00,380 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err34ASSERT_VIOLATIONDATA_RACE (88 of 162 remaining) [2025-03-13 22:27:00,380 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err33ASSERT_VIOLATIONDATA_RACE (87 of 162 remaining) [2025-03-13 22:27:00,380 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err32ASSERT_VIOLATIONDATA_RACE (86 of 162 remaining) [2025-03-13 22:27:00,380 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (85 of 162 remaining) [2025-03-13 22:27:00,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (84 of 162 remaining) [2025-03-13 22:27:00,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (83 of 162 remaining) [2025-03-13 22:27:00,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (82 of 162 remaining) [2025-03-13 22:27:00,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (81 of 162 remaining) [2025-03-13 22:27:00,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (80 of 162 remaining) [2025-03-13 22:27:00,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (79 of 162 remaining) [2025-03-13 22:27:00,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (78 of 162 remaining) [2025-03-13 22:27:00,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (77 of 162 remaining) [2025-03-13 22:27:00,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (76 of 162 remaining) [2025-03-13 22:27:00,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (75 of 162 remaining) [2025-03-13 22:27:00,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (74 of 162 remaining) [2025-03-13 22:27:00,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (73 of 162 remaining) [2025-03-13 22:27:00,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (72 of 162 remaining) [2025-03-13 22:27:00,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (71 of 162 remaining) [2025-03-13 22:27:00,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (70 of 162 remaining) [2025-03-13 22:27:00,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (69 of 162 remaining) [2025-03-13 22:27:00,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (68 of 162 remaining) [2025-03-13 22:27:00,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err67ASSERT_VIOLATIONDATA_RACE (67 of 162 remaining) [2025-03-13 22:27:00,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err31ASSERT_VIOLATIONDATA_RACE (66 of 162 remaining) [2025-03-13 22:27:00,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err66ASSERT_VIOLATIONDATA_RACE (65 of 162 remaining) [2025-03-13 22:27:00,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err30ASSERT_VIOLATIONDATA_RACE (64 of 162 remaining) [2025-03-13 22:27:00,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (63 of 162 remaining) [2025-03-13 22:27:00,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err65ASSERT_VIOLATIONDATA_RACE (62 of 162 remaining) [2025-03-13 22:27:00,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (61 of 162 remaining) [2025-03-13 22:27:00,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (60 of 162 remaining) [2025-03-13 22:27:00,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err29ASSERT_VIOLATIONDATA_RACE (59 of 162 remaining) [2025-03-13 22:27:00,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err64ASSERT_VIOLATIONDATA_RACE (58 of 162 remaining) [2025-03-13 22:27:00,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err28ASSERT_VIOLATIONDATA_RACE (57 of 162 remaining) [2025-03-13 22:27:00,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (56 of 162 remaining) [2025-03-13 22:27:00,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (55 of 162 remaining) [2025-03-13 22:27:00,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (54 of 162 remaining) [2025-03-13 22:27:00,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (53 of 162 remaining) [2025-03-13 22:27:00,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (52 of 162 remaining) [2025-03-13 22:27:00,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err63ASSERT_VIOLATIONDATA_RACE (51 of 162 remaining) [2025-03-13 22:27:00,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (50 of 162 remaining) [2025-03-13 22:27:00,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err27ASSERT_VIOLATIONDATA_RACE (49 of 162 remaining) [2025-03-13 22:27:00,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err62ASSERT_VIOLATIONDATA_RACE (48 of 162 remaining) [2025-03-13 22:27:00,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (47 of 162 remaining) [2025-03-13 22:27:00,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err26ASSERT_VIOLATIONDATA_RACE (46 of 162 remaining) [2025-03-13 22:27:00,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (45 of 162 remaining) [2025-03-13 22:27:00,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (44 of 162 remaining) [2025-03-13 22:27:00,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (43 of 162 remaining) [2025-03-13 22:27:00,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (42 of 162 remaining) [2025-03-13 22:27:00,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (41 of 162 remaining) [2025-03-13 22:27:00,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err61ASSERT_VIOLATIONDATA_RACE (40 of 162 remaining) [2025-03-13 22:27:00,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err25ASSERT_VIOLATIONDATA_RACE (39 of 162 remaining) [2025-03-13 22:27:00,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (38 of 162 remaining) [2025-03-13 22:27:00,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (37 of 162 remaining) [2025-03-13 22:27:00,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err60ASSERT_VIOLATIONDATA_RACE (36 of 162 remaining) [2025-03-13 22:27:00,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (35 of 162 remaining) [2025-03-13 22:27:00,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (34 of 162 remaining) [2025-03-13 22:27:00,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (33 of 162 remaining) [2025-03-13 22:27:00,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (32 of 162 remaining) [2025-03-13 22:27:00,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (31 of 162 remaining) [2025-03-13 22:27:00,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (30 of 162 remaining) [2025-03-13 22:27:00,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err59ASSERT_VIOLATIONDATA_RACE (29 of 162 remaining) [2025-03-13 22:27:00,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (28 of 162 remaining) [2025-03-13 22:27:00,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (27 of 162 remaining) [2025-03-13 22:27:00,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err58ASSERT_VIOLATIONDATA_RACE (26 of 162 remaining) [2025-03-13 22:27:00,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err57ASSERT_VIOLATIONDATA_RACE (25 of 162 remaining) [2025-03-13 22:27:00,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err56ASSERT_VIOLATIONDATA_RACE (24 of 162 remaining) [2025-03-13 22:27:00,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err55ASSERT_VIOLATIONDATA_RACE (23 of 162 remaining) [2025-03-13 22:27:00,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err54ASSERT_VIOLATIONDATA_RACE (22 of 162 remaining) [2025-03-13 22:27:00,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err53ASSERT_VIOLATIONDATA_RACE (21 of 162 remaining) [2025-03-13 22:27:00,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err52ASSERT_VIOLATIONDATA_RACE (20 of 162 remaining) [2025-03-13 22:27:00,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err51ASSERT_VIOLATIONDATA_RACE (19 of 162 remaining) [2025-03-13 22:27:00,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err50ASSERT_VIOLATIONDATA_RACE (18 of 162 remaining) [2025-03-13 22:27:00,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err49ASSERT_VIOLATIONDATA_RACE (17 of 162 remaining) [2025-03-13 22:27:00,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err48ASSERT_VIOLATIONDATA_RACE (16 of 162 remaining) [2025-03-13 22:27:00,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err47ASSERT_VIOLATIONDATA_RACE (15 of 162 remaining) [2025-03-13 22:27:00,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err46ASSERT_VIOLATIONDATA_RACE (14 of 162 remaining) [2025-03-13 22:27:00,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err45ASSERT_VIOLATIONDATA_RACE (13 of 162 remaining) [2025-03-13 22:27:00,385 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err44ASSERT_VIOLATIONDATA_RACE (12 of 162 remaining) [2025-03-13 22:27:00,385 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err43ASSERT_VIOLATIONDATA_RACE (11 of 162 remaining) [2025-03-13 22:27:00,385 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err42ASSERT_VIOLATIONDATA_RACE (10 of 162 remaining) [2025-03-13 22:27:00,385 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err41ASSERT_VIOLATIONDATA_RACE (9 of 162 remaining) [2025-03-13 22:27:00,385 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err40ASSERT_VIOLATIONDATA_RACE (8 of 162 remaining) [2025-03-13 22:27:00,385 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err39ASSERT_VIOLATIONDATA_RACE (7 of 162 remaining) [2025-03-13 22:27:00,385 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err38ASSERT_VIOLATIONDATA_RACE (6 of 162 remaining) [2025-03-13 22:27:00,385 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err37ASSERT_VIOLATIONDATA_RACE (5 of 162 remaining) [2025-03-13 22:27:00,385 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err36ASSERT_VIOLATIONDATA_RACE (4 of 162 remaining) [2025-03-13 22:27:00,385 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err35ASSERT_VIOLATIONDATA_RACE (3 of 162 remaining) [2025-03-13 22:27:00,385 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err34ASSERT_VIOLATIONDATA_RACE (2 of 162 remaining) [2025-03-13 22:27:00,385 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err33ASSERT_VIOLATIONDATA_RACE (1 of 162 remaining) [2025-03-13 22:27:00,385 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err32ASSERT_VIOLATIONDATA_RACE (0 of 162 remaining) [2025-03-13 22:27:00,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-13 22:27:00,385 INFO L422 BasicCegarLoop]: Path program 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] [2025-03-13 22:27:00,391 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-13 22:27:00,391 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-13 22:27:00,396 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.03 10:27:00 BasicIcfg [2025-03-13 22:27:00,397 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-13 22:27:00,397 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-13 22:27:00,397 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-13 22:27:00,397 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-13 22:27:00,398 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:26:49" (3/4) ... [2025-03-13 22:27:00,399 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-13 22:27:00,402 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-13 22:27:00,402 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-13 22:27:00,406 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-03-13 22:27:00,406 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-13 22:27:00,406 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-13 22:27:00,406 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-13 22:27:00,465 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-13 22:27:00,465 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-13 22:27:00,465 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-13 22:27:00,466 INFO L158 Benchmark]: Toolchain (without parser) took 12192.38ms. Allocated memory was 142.6MB in the beginning and 528.5MB in the end (delta: 385.9MB). Free memory was 106.0MB in the beginning and 363.8MB in the end (delta: -257.8MB). Peak memory consumption was 123.6MB. Max. memory is 16.1GB. [2025-03-13 22:27:00,467 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 22:27:00,467 INFO L158 Benchmark]: CACSL2BoogieTranslator took 222.67ms. Allocated memory is still 142.6MB. Free memory was 106.0MB in the beginning and 92.1MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-13 22:27:00,468 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.23ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 89.0MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 22:27:00,469 INFO L158 Benchmark]: Boogie Preprocessor took 47.52ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 85.9MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 22:27:00,469 INFO L158 Benchmark]: IcfgBuilder took 778.70ms. Allocated memory is still 142.6MB. Free memory was 85.9MB in the beginning and 43.6MB in the end (delta: 42.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-13 22:27:00,469 INFO L158 Benchmark]: TraceAbstraction took 11016.99ms. Allocated memory was 142.6MB in the beginning and 528.5MB in the end (delta: 385.9MB). Free memory was 42.8MB in the beginning and 372.2MB in the end (delta: -329.4MB). Peak memory consumption was 266.2MB. Max. memory is 16.1GB. [2025-03-13 22:27:00,470 INFO L158 Benchmark]: Witness Printer took 68.11ms. Allocated memory is still 528.5MB. Free memory was 372.2MB in the beginning and 363.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 22:27:00,471 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 222.67ms. Allocated memory is still 142.6MB. Free memory was 106.0MB in the beginning and 92.1MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.23ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 89.0MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.52ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 85.9MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 778.70ms. Allocated memory is still 142.6MB. Free memory was 85.9MB in the beginning and 43.6MB in the end (delta: 42.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 11016.99ms. Allocated memory was 142.6MB in the beginning and 528.5MB in the end (delta: 385.9MB). Free memory was 42.8MB in the beginning and 372.2MB in the end (delta: -329.4MB). Peak memory consumption was 266.2MB. Max. memory is 16.1GB. * Witness Printer took 68.11ms. Allocated memory is still 528.5MB. Free memory was 372.2MB in the beginning and 363.8MB 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: 76]: 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: 77]: 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: 60]: 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: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: 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: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: 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: 92]: 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: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: 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: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: 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: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: 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: 61]: 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: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: 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: 93]: 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: 88]: 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: 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: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 106]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 126]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 106]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: 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, 1061 locations, 162 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: 10.8s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4417 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1612 mSDsluCounter, 1005 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 199 mSDsCounter, 491 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4249 IncrementalHoareTripleChecker+Invalid, 4740 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 491 mSolverCounterUnsat, 806 mSDtfsCounter, 4249 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1340occurred in iteration=15, InterpolantAutomatonStates: 87, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 2586 NumberOfCodeBlocks, 2586 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 2562 ConstructedInterpolants, 0 QuantifiedInterpolants, 3425 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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 84 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-13 22:27:00,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE