./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-match-subst.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/chl-match-subst.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 2c931aeff3bd4feb775048ea000220a43a3b08d8a3667f51cb57a0babc9201aa --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 22:23:10,161 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 22:23:10,216 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 22:23:10,221 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 22:23:10,222 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 22:23:10,240 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 22:23:10,240 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 22:23:10,240 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 22:23:10,241 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 22:23:10,241 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 22:23:10,241 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 22:23:10,241 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 22:23:10,241 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 22:23:10,241 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 22:23:10,241 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 22:23:10,241 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 22:23:10,241 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 22:23:10,241 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 22:23:10,241 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 22:23:10,241 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 22:23:10,242 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 22:23:10,242 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 22:23:10,242 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 22:23:10,242 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 22:23:10,242 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 22:23:10,242 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 22:23:10,242 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 22:23:10,242 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 22:23:10,242 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 22:23:10,242 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 22:23:10,242 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 22:23:10,242 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:23:10,242 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 22:23:10,242 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 22:23:10,242 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 22:23:10,242 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 22:23:10,242 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 22:23:10,242 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 22:23:10,243 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 22:23:10,243 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 22:23:10,243 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 22:23:10,243 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 22:23:10,243 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 -> 2c931aeff3bd4feb775048ea000220a43a3b08d8a3667f51cb57a0babc9201aa [2025-03-13 22:23:10,479 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 22:23:10,491 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 22:23:10,493 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 22:23:10,495 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 22:23:10,495 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 22:23:10,497 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-match-subst.wvr.c [2025-03-13 22:23:11,745 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9c94908c/379e6997331b45c48b14a2c5c5430d38/FLAGf8dfc1ca6 [2025-03-13 22:23:11,948 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 22:23:11,948 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-match-subst.wvr.c [2025-03-13 22:23:11,954 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9c94908c/379e6997331b45c48b14a2c5c5430d38/FLAGf8dfc1ca6 [2025-03-13 22:23:11,966 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9c94908c/379e6997331b45c48b14a2c5c5430d38 [2025-03-13 22:23:11,968 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 22:23:11,969 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 22:23:11,970 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 22:23:11,970 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 22:23:11,973 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 22:23:11,973 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:23:11" (1/1) ... [2025-03-13 22:23:11,975 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70edca1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:11, skipping insertion in model container [2025-03-13 22:23:11,975 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:23:11" (1/1) ... [2025-03-13 22:23:11,988 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 22:23:12,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:23:12,130 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 22:23:12,166 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:23:12,178 INFO L204 MainTranslator]: Completed translation [2025-03-13 22:23:12,178 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:12 WrapperNode [2025-03-13 22:23:12,178 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 22:23:12,179 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 22:23:12,179 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 22:23:12,180 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 22:23:12,184 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:23:12" (1/1) ... [2025-03-13 22:23:12,189 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:23:12" (1/1) ... [2025-03-13 22:23:12,216 INFO L138 Inliner]: procedures = 22, calls = 20, calls flagged for inlining = 13, calls inlined = 23, statements flattened = 323 [2025-03-13 22:23:12,219 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 22:23:12,219 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 22:23:12,220 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 22:23:12,220 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 22:23:12,225 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:12" (1/1) ... [2025-03-13 22:23:12,225 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:12" (1/1) ... [2025-03-13 22:23:12,231 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:12" (1/1) ... [2025-03-13 22:23:12,231 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:12" (1/1) ... [2025-03-13 22:23:12,240 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:12" (1/1) ... [2025-03-13 22:23:12,241 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:12" (1/1) ... [2025-03-13 22:23:12,242 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:12" (1/1) ... [2025-03-13 22:23:12,242 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:12" (1/1) ... [2025-03-13 22:23:12,248 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 22:23:12,249 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 22:23:12,249 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 22:23:12,249 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 22:23:12,249 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:12" (1/1) ... [2025-03-13 22:23:12,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:23:12,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:23:12,275 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:23:12,280 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:23:12,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 22:23:12,294 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-13 22:23:12,294 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-13 22:23:12,295 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-13 22:23:12,295 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-13 22:23:12,295 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-13 22:23:12,295 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-13 22:23:12,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 22:23:12,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 22:23:12,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 22:23:12,296 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:23:12,373 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 22:23:12,375 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 22:23:12,717 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 22:23:12,718 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 22:23:12,718 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 22:23:12,741 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 22:23:12,742 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:23:12 BoogieIcfgContainer [2025-03-13 22:23:12,742 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 22:23:12,744 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 22:23:12,746 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 22:23:12,749 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 22:23:12,749 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 10:23:11" (1/3) ... [2025-03-13 22:23:12,750 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50943bcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:23:12, skipping insertion in model container [2025-03-13 22:23:12,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:12" (2/3) ... [2025-03-13 22:23:12,750 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50943bcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:23:12, skipping insertion in model container [2025-03-13 22:23:12,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:23:12" (3/3) ... [2025-03-13 22:23:12,751 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-match-subst.wvr.c [2025-03-13 22:23:12,763 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 22:23:12,764 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-match-subst.wvr.c that has 4 procedures, 437 locations, 1 initial locations, 0 loop locations, and 41 error locations. [2025-03-13 22:23:12,765 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 22:23:12,880 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-13 22:23:12,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 446 places, 454 transitions, 929 flow [2025-03-13 22:23:13,061 INFO L124 PetriNetUnfolderBase]: 18/451 cut-off events. [2025-03-13 22:23:13,065 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-13 22:23:13,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 464 conditions, 451 events. 18/451 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 817 event pairs, 0 based on Foata normal form. 0/392 useless extension candidates. Maximal degree in co-relation 311. Up to 2 conditions per place. [2025-03-13 22:23:13,077 INFO L82 GeneralOperation]: Start removeDead. Operand has 446 places, 454 transitions, 929 flow [2025-03-13 22:23:13,083 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 425 places, 431 transitions, 880 flow [2025-03-13 22:23:13,089 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:23:13,097 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;@32c2b94f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:23:13,098 INFO L334 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2025-03-13 22:23:13,103 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:23:13,103 INFO L124 PetriNetUnfolderBase]: 0/29 cut-off events. [2025-03-13 22:23:13,103 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:23:13,103 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:13,103 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] [2025-03-13 22:23:13,103 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-13 22:23:13,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:13,107 INFO L85 PathProgramCache]: Analyzing trace with hash -656263710, now seen corresponding path program 1 times [2025-03-13 22:23:13,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:13,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786343065] [2025-03-13 22:23:13,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:13,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:13,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-13 22:23:13,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-13 22:23:13,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:13,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:13,240 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:23:13,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:13,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786343065] [2025-03-13 22:23:13,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786343065] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:13,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:13,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:13,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133914014] [2025-03-13 22:23:13,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:13,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:13,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:13,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:13,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:13,295 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 422 out of 454 [2025-03-13 22:23:13,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 431 transitions, 880 flow. Second operand has 3 states, 3 states have (on average 423.3333333333333) internal successors, (1270), 3 states have internal predecessors, (1270), 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:23:13,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:13,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 422 of 454 [2025-03-13 22:23:13,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:13,556 INFO L124 PetriNetUnfolderBase]: 33/1375 cut-off events. [2025-03-13 22:23:13,557 INFO L125 PetriNetUnfolderBase]: For 26/28 co-relation queries the response was YES. [2025-03-13 22:23:13,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1462 conditions, 1375 events. 33/1375 cut-off events. For 26/28 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 6189 event pairs, 20 based on Foata normal form. 76/1250 useless extension candidates. Maximal degree in co-relation 1300. Up to 50 conditions per place. [2025-03-13 22:23:13,571 INFO L140 encePairwiseOnDemand]: 438/454 looper letters, 13 selfloop transitions, 2 changer transitions 1/417 dead transitions. [2025-03-13 22:23:13,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 417 transitions, 882 flow [2025-03-13 22:23:13,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:13,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:13,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1295 transitions. [2025-03-13 22:23:13,584 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9508076358296622 [2025-03-13 22:23:13,587 INFO L175 Difference]: Start difference. First operand has 425 places, 431 transitions, 880 flow. Second operand 3 states and 1295 transitions. [2025-03-13 22:23:13,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 426 places, 417 transitions, 882 flow [2025-03-13 22:23:13,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 420 places, 417 transitions, 870 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-13 22:23:13,599 INFO L231 Difference]: Finished difference. Result has 420 places, 416 transitions, 842 flow [2025-03-13 22:23:13,602 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=840, PETRI_DIFFERENCE_MINUEND_PLACES=418, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=417, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=415, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=842, PETRI_PLACES=420, PETRI_TRANSITIONS=416} [2025-03-13 22:23:13,604 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -5 predicate places. [2025-03-13 22:23:13,605 INFO L471 AbstractCegarLoop]: Abstraction has has 420 places, 416 transitions, 842 flow [2025-03-13 22:23:13,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 423.3333333333333) internal successors, (1270), 3 states have internal predecessors, (1270), 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:23:13,606 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:13,607 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] [2025-03-13 22:23:13,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 22:23:13,607 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-13 22:23:13,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:13,608 INFO L85 PathProgramCache]: Analyzing trace with hash 948622931, now seen corresponding path program 1 times [2025-03-13 22:23:13,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:13,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150949574] [2025-03-13 22:23:13,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:13,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:13,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-13 22:23:13,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-13 22:23:13,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:13,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:13,656 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:23:13,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:13,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150949574] [2025-03-13 22:23:13,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150949574] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:13,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:13,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:13,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844479832] [2025-03-13 22:23:13,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:13,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:13,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:13,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:13,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:13,681 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 454 [2025-03-13 22:23:13,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 420 places, 416 transitions, 842 flow. Second operand has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 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:23:13,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:13,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 454 [2025-03-13 22:23:13,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:13,833 INFO L124 PetriNetUnfolderBase]: 16/956 cut-off events. [2025-03-13 22:23:13,833 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-13 22:23:13,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 994 conditions, 956 events. 16/956 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 4050 event pairs, 7 based on Foata normal form. 0/814 useless extension candidates. Maximal degree in co-relation 957. Up to 25 conditions per place. [2025-03-13 22:23:13,849 INFO L140 encePairwiseOnDemand]: 451/454 looper letters, 11 selfloop transitions, 2 changer transitions 0/415 dead transitions. [2025-03-13 22:23:13,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 420 places, 415 transitions, 866 flow [2025-03-13 22:23:13,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:13,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:13,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1286 transitions. [2025-03-13 22:23:13,854 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9441997063142438 [2025-03-13 22:23:13,854 INFO L175 Difference]: Start difference. First operand has 420 places, 416 transitions, 842 flow. Second operand 3 states and 1286 transitions. [2025-03-13 22:23:13,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 420 places, 415 transitions, 866 flow [2025-03-13 22:23:13,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 418 places, 415 transitions, 862 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:13,860 INFO L231 Difference]: Finished difference. Result has 418 places, 415 transitions, 840 flow [2025-03-13 22:23:13,860 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=836, PETRI_DIFFERENCE_MINUEND_PLACES=416, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=415, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=840, PETRI_PLACES=418, PETRI_TRANSITIONS=415} [2025-03-13 22:23:13,861 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -7 predicate places. [2025-03-13 22:23:13,861 INFO L471 AbstractCegarLoop]: Abstraction has has 418 places, 415 transitions, 840 flow [2025-03-13 22:23:13,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 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:23:13,862 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:13,862 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] [2025-03-13 22:23:13,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 22:23:13,862 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-13 22:23:13,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:13,863 INFO L85 PathProgramCache]: Analyzing trace with hash 42244856, now seen corresponding path program 1 times [2025-03-13 22:23:13,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:13,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128426445] [2025-03-13 22:23:13,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:13,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:13,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-13 22:23:13,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-13 22:23:13,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:13,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:13,916 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:23:13,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:13,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128426445] [2025-03-13 22:23:13,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128426445] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:13,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:13,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:13,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394977650] [2025-03-13 22:23:13,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:13,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:13,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:13,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:13,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:13,942 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 454 [2025-03-13 22:23:13,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 418 places, 415 transitions, 840 flow. Second operand has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 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:23:13,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:13,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 454 [2025-03-13 22:23:13,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:14,055 INFO L124 PetriNetUnfolderBase]: 16/937 cut-off events. [2025-03-13 22:23:14,055 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-13 22:23:14,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 975 conditions, 937 events. 16/937 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3958 event pairs, 7 based on Foata normal form. 0/803 useless extension candidates. Maximal degree in co-relation 930. Up to 25 conditions per place. [2025-03-13 22:23:14,065 INFO L140 encePairwiseOnDemand]: 451/454 looper letters, 11 selfloop transitions, 2 changer transitions 0/414 dead transitions. [2025-03-13 22:23:14,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 419 places, 414 transitions, 864 flow [2025-03-13 22:23:14,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:14,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:14,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1286 transitions. [2025-03-13 22:23:14,067 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9441997063142438 [2025-03-13 22:23:14,067 INFO L175 Difference]: Start difference. First operand has 418 places, 415 transitions, 840 flow. Second operand 3 states and 1286 transitions. [2025-03-13 22:23:14,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 419 places, 414 transitions, 864 flow [2025-03-13 22:23:14,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 417 places, 414 transitions, 860 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:14,075 INFO L231 Difference]: Finished difference. Result has 417 places, 414 transitions, 838 flow [2025-03-13 22:23:14,076 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=834, PETRI_DIFFERENCE_MINUEND_PLACES=415, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=414, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=412, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=838, PETRI_PLACES=417, PETRI_TRANSITIONS=414} [2025-03-13 22:23:14,076 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -8 predicate places. [2025-03-13 22:23:14,076 INFO L471 AbstractCegarLoop]: Abstraction has has 417 places, 414 transitions, 838 flow [2025-03-13 22:23:14,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 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:23:14,077 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:14,077 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] [2025-03-13 22:23:14,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 22:23:14,077 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-13 22:23:14,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:14,078 INFO L85 PathProgramCache]: Analyzing trace with hash -946362878, now seen corresponding path program 1 times [2025-03-13 22:23:14,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:14,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940840437] [2025-03-13 22:23:14,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:14,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:14,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-13 22:23:14,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-13 22:23:14,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:14,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:14,122 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:23:14,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:14,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940840437] [2025-03-13 22:23:14,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940840437] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:14,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:14,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:14,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022081729] [2025-03-13 22:23:14,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:14,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:14,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:14,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:14,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:14,146 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 422 out of 454 [2025-03-13 22:23:14,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 417 places, 414 transitions, 838 flow. Second operand has 3 states, 3 states have (on average 423.3333333333333) internal successors, (1270), 3 states have internal predecessors, (1270), 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:23:14,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:14,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 422 of 454 [2025-03-13 22:23:14,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:14,250 INFO L124 PetriNetUnfolderBase]: 19/807 cut-off events. [2025-03-13 22:23:14,250 INFO L125 PetriNetUnfolderBase]: For 4/8 co-relation queries the response was YES. [2025-03-13 22:23:14,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 858 conditions, 807 events. 19/807 cut-off events. For 4/8 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2838 event pairs, 12 based on Foata normal form. 0/697 useless extension candidates. Maximal degree in co-relation 805. Up to 38 conditions per place. [2025-03-13 22:23:14,261 INFO L140 encePairwiseOnDemand]: 451/454 looper letters, 13 selfloop transitions, 2 changer transitions 0/413 dead transitions. [2025-03-13 22:23:14,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 418 places, 413 transitions, 866 flow [2025-03-13 22:23:14,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:14,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:14,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1282 transitions. [2025-03-13 22:23:14,264 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9412628487518355 [2025-03-13 22:23:14,264 INFO L175 Difference]: Start difference. First operand has 417 places, 414 transitions, 838 flow. Second operand 3 states and 1282 transitions. [2025-03-13 22:23:14,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 418 places, 413 transitions, 866 flow [2025-03-13 22:23:14,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 416 places, 413 transitions, 862 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:14,270 INFO L231 Difference]: Finished difference. Result has 416 places, 413 transitions, 836 flow [2025-03-13 22:23:14,270 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=832, PETRI_DIFFERENCE_MINUEND_PLACES=414, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=836, PETRI_PLACES=416, PETRI_TRANSITIONS=413} [2025-03-13 22:23:14,271 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -9 predicate places. [2025-03-13 22:23:14,272 INFO L471 AbstractCegarLoop]: Abstraction has has 416 places, 413 transitions, 836 flow [2025-03-13 22:23:14,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 423.3333333333333) internal successors, (1270), 3 states have internal predecessors, (1270), 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:23:14,272 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:14,272 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] [2025-03-13 22:23:14,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 22:23:14,273 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-13 22:23:14,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:14,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1446485017, now seen corresponding path program 1 times [2025-03-13 22:23:14,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:14,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522120687] [2025-03-13 22:23:14,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:14,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:14,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-13 22:23:14,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-13 22:23:14,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:14,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:14,331 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:23:14,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:14,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522120687] [2025-03-13 22:23:14,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522120687] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:14,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:14,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:14,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825004520] [2025-03-13 22:23:14,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:14,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:14,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:14,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:14,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:14,357 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 454 [2025-03-13 22:23:14,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 416 places, 413 transitions, 836 flow. Second operand has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 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:23:14,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:14,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 454 [2025-03-13 22:23:14,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:14,467 INFO L124 PetriNetUnfolderBase]: 12/784 cut-off events. [2025-03-13 22:23:14,467 INFO L125 PetriNetUnfolderBase]: For 5/10 co-relation queries the response was YES. [2025-03-13 22:23:14,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 817 conditions, 784 events. 12/784 cut-off events. For 5/10 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2145 event pairs, 5 based on Foata normal form. 0/673 useless extension candidates. Maximal degree in co-relation 756. Up to 22 conditions per place. [2025-03-13 22:23:14,478 INFO L140 encePairwiseOnDemand]: 451/454 looper letters, 11 selfloop transitions, 2 changer transitions 0/412 dead transitions. [2025-03-13 22:23:14,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 417 places, 412 transitions, 860 flow [2025-03-13 22:23:14,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:14,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:14,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1286 transitions. [2025-03-13 22:23:14,483 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9441997063142438 [2025-03-13 22:23:14,483 INFO L175 Difference]: Start difference. First operand has 416 places, 413 transitions, 836 flow. Second operand 3 states and 1286 transitions. [2025-03-13 22:23:14,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 417 places, 412 transitions, 860 flow [2025-03-13 22:23:14,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 415 places, 412 transitions, 856 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:14,490 INFO L231 Difference]: Finished difference. Result has 415 places, 412 transitions, 834 flow [2025-03-13 22:23:14,491 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=830, PETRI_DIFFERENCE_MINUEND_PLACES=413, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=410, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=834, PETRI_PLACES=415, PETRI_TRANSITIONS=412} [2025-03-13 22:23:14,491 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -10 predicate places. [2025-03-13 22:23:14,491 INFO L471 AbstractCegarLoop]: Abstraction has has 415 places, 412 transitions, 834 flow [2025-03-13 22:23:14,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 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:23:14,492 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:14,492 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:14,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 22:23:14,492 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-13 22:23:14,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:14,493 INFO L85 PathProgramCache]: Analyzing trace with hash 921770405, now seen corresponding path program 1 times [2025-03-13 22:23:14,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:14,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861604804] [2025-03-13 22:23:14,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:14,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:14,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-13 22:23:14,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-13 22:23:14,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:14,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:14,552 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:23:14,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:14,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861604804] [2025-03-13 22:23:14,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861604804] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:14,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:14,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:14,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428184425] [2025-03-13 22:23:14,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:14,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:14,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:14,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:14,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:14,575 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 454 [2025-03-13 22:23:14,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 412 transitions, 834 flow. Second operand has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 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:23:14,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:14,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 454 [2025-03-13 22:23:14,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:14,652 INFO L124 PetriNetUnfolderBase]: 12/777 cut-off events. [2025-03-13 22:23:14,652 INFO L125 PetriNetUnfolderBase]: For 5/10 co-relation queries the response was YES. [2025-03-13 22:23:14,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 810 conditions, 777 events. 12/777 cut-off events. For 5/10 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2107 event pairs, 5 based on Foata normal form. 0/669 useless extension candidates. Maximal degree in co-relation 741. Up to 22 conditions per place. [2025-03-13 22:23:14,660 INFO L140 encePairwiseOnDemand]: 451/454 looper letters, 11 selfloop transitions, 2 changer transitions 0/411 dead transitions. [2025-03-13 22:23:14,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 411 transitions, 858 flow [2025-03-13 22:23:14,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:14,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:14,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1286 transitions. [2025-03-13 22:23:14,662 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9441997063142438 [2025-03-13 22:23:14,662 INFO L175 Difference]: Start difference. First operand has 415 places, 412 transitions, 834 flow. Second operand 3 states and 1286 transitions. [2025-03-13 22:23:14,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 411 transitions, 858 flow [2025-03-13 22:23:14,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 414 places, 411 transitions, 854 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:14,668 INFO L231 Difference]: Finished difference. Result has 414 places, 411 transitions, 832 flow [2025-03-13 22:23:14,669 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=828, PETRI_DIFFERENCE_MINUEND_PLACES=412, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=411, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=409, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=832, PETRI_PLACES=414, PETRI_TRANSITIONS=411} [2025-03-13 22:23:14,669 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -11 predicate places. [2025-03-13 22:23:14,669 INFO L471 AbstractCegarLoop]: Abstraction has has 414 places, 411 transitions, 832 flow [2025-03-13 22:23:14,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 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:23:14,670 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:14,670 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] [2025-03-13 22:23:14,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 22:23:14,670 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-13 22:23:14,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:14,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1226321235, now seen corresponding path program 1 times [2025-03-13 22:23:14,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:14,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819331753] [2025-03-13 22:23:14,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:14,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:14,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-13 22:23:14,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-13 22:23:14,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:14,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:14,710 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:23:14,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:14,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819331753] [2025-03-13 22:23:14,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819331753] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:14,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:14,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:14,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133307852] [2025-03-13 22:23:14,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:14,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:14,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:14,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:14,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:14,741 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 422 out of 454 [2025-03-13 22:23:14,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 414 places, 411 transitions, 832 flow. Second operand has 3 states, 3 states have (on average 423.3333333333333) internal successors, (1270), 3 states have internal predecessors, (1270), 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:23:14,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:14,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 422 of 454 [2025-03-13 22:23:14,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:14,821 INFO L124 PetriNetUnfolderBase]: 25/626 cut-off events. [2025-03-13 22:23:14,821 INFO L125 PetriNetUnfolderBase]: For 9/13 co-relation queries the response was YES. [2025-03-13 22:23:14,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 687 conditions, 626 events. 25/626 cut-off events. For 9/13 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2197 event pairs, 20 based on Foata normal form. 0/549 useless extension candidates. Maximal degree in co-relation 610. Up to 50 conditions per place. [2025-03-13 22:23:14,826 INFO L140 encePairwiseOnDemand]: 451/454 looper letters, 13 selfloop transitions, 2 changer transitions 0/410 dead transitions. [2025-03-13 22:23:14,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 415 places, 410 transitions, 860 flow [2025-03-13 22:23:14,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:14,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:14,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1282 transitions. [2025-03-13 22:23:14,828 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9412628487518355 [2025-03-13 22:23:14,828 INFO L175 Difference]: Start difference. First operand has 414 places, 411 transitions, 832 flow. Second operand 3 states and 1282 transitions. [2025-03-13 22:23:14,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 415 places, 410 transitions, 860 flow [2025-03-13 22:23:14,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 413 places, 410 transitions, 856 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:14,832 INFO L231 Difference]: Finished difference. Result has 413 places, 410 transitions, 830 flow [2025-03-13 22:23:14,833 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=826, PETRI_DIFFERENCE_MINUEND_PLACES=411, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=410, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=830, PETRI_PLACES=413, PETRI_TRANSITIONS=410} [2025-03-13 22:23:14,833 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -12 predicate places. [2025-03-13 22:23:14,834 INFO L471 AbstractCegarLoop]: Abstraction has has 413 places, 410 transitions, 830 flow [2025-03-13 22:23:14,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 423.3333333333333) internal successors, (1270), 3 states have internal predecessors, (1270), 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:23:14,834 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:14,834 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] [2025-03-13 22:23:14,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 22:23:14,835 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-13 22:23:14,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:14,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1866351931, now seen corresponding path program 1 times [2025-03-13 22:23:14,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:14,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263944640] [2025-03-13 22:23:14,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:14,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:14,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-13 22:23:14,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-13 22:23:14,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:14,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:14,871 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:23:14,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:14,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263944640] [2025-03-13 22:23:14,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263944640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:14,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:14,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:14,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69928666] [2025-03-13 22:23:14,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:14,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:14,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:14,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:14,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:14,888 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 454 [2025-03-13 22:23:14,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 413 places, 410 transitions, 830 flow. Second operand has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 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:23:14,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:14,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 454 [2025-03-13 22:23:14,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:14,955 INFO L124 PetriNetUnfolderBase]: 14/681 cut-off events. [2025-03-13 22:23:14,955 INFO L125 PetriNetUnfolderBase]: For 6/15 co-relation queries the response was YES. [2025-03-13 22:23:14,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 716 conditions, 681 events. 14/681 cut-off events. For 6/15 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1754 event pairs, 7 based on Foata normal form. 0/587 useless extension candidates. Maximal degree in co-relation 631. Up to 25 conditions per place. [2025-03-13 22:23:14,963 INFO L140 encePairwiseOnDemand]: 451/454 looper letters, 11 selfloop transitions, 2 changer transitions 0/409 dead transitions. [2025-03-13 22:23:14,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 409 transitions, 854 flow [2025-03-13 22:23:14,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:14,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:14,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1286 transitions. [2025-03-13 22:23:14,965 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9441997063142438 [2025-03-13 22:23:14,965 INFO L175 Difference]: Start difference. First operand has 413 places, 410 transitions, 830 flow. Second operand 3 states and 1286 transitions. [2025-03-13 22:23:14,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 414 places, 409 transitions, 854 flow [2025-03-13 22:23:14,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 409 transitions, 850 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:14,970 INFO L231 Difference]: Finished difference. Result has 412 places, 409 transitions, 828 flow [2025-03-13 22:23:14,970 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=410, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=409, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=407, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=828, PETRI_PLACES=412, PETRI_TRANSITIONS=409} [2025-03-13 22:23:14,971 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -13 predicate places. [2025-03-13 22:23:14,971 INFO L471 AbstractCegarLoop]: Abstraction has has 412 places, 409 transitions, 828 flow [2025-03-13 22:23:14,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 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:23:14,972 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:14,972 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] [2025-03-13 22:23:14,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 22:23:14,972 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-13 22:23:14,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:14,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1382391037, now seen corresponding path program 1 times [2025-03-13 22:23:14,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:14,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918496026] [2025-03-13 22:23:14,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:14,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:14,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-13 22:23:14,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-13 22:23:14,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:14,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:15,021 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:23:15,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:15,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918496026] [2025-03-13 22:23:15,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918496026] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:15,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:15,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:15,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994605052] [2025-03-13 22:23:15,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:15,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:15,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:15,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:15,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:15,036 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 454 [2025-03-13 22:23:15,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 409 transitions, 828 flow. Second operand has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 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:23:15,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:15,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 454 [2025-03-13 22:23:15,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:15,109 INFO L124 PetriNetUnfolderBase]: 14/671 cut-off events. [2025-03-13 22:23:15,109 INFO L125 PetriNetUnfolderBase]: For 6/15 co-relation queries the response was YES. [2025-03-13 22:23:15,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 706 conditions, 671 events. 14/671 cut-off events. For 6/15 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1697 event pairs, 7 based on Foata normal form. 0/581 useless extension candidates. Maximal degree in co-relation 613. Up to 25 conditions per place. [2025-03-13 22:23:15,115 INFO L140 encePairwiseOnDemand]: 451/454 looper letters, 11 selfloop transitions, 2 changer transitions 0/408 dead transitions. [2025-03-13 22:23:15,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 408 transitions, 852 flow [2025-03-13 22:23:15,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:15,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:15,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1286 transitions. [2025-03-13 22:23:15,117 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9441997063142438 [2025-03-13 22:23:15,117 INFO L175 Difference]: Start difference. First operand has 412 places, 409 transitions, 828 flow. Second operand 3 states and 1286 transitions. [2025-03-13 22:23:15,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 408 transitions, 852 flow [2025-03-13 22:23:15,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 411 places, 408 transitions, 848 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:15,122 INFO L231 Difference]: Finished difference. Result has 411 places, 408 transitions, 826 flow [2025-03-13 22:23:15,122 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=822, PETRI_DIFFERENCE_MINUEND_PLACES=409, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=826, PETRI_PLACES=411, PETRI_TRANSITIONS=408} [2025-03-13 22:23:15,123 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -14 predicate places. [2025-03-13 22:23:15,123 INFO L471 AbstractCegarLoop]: Abstraction has has 411 places, 408 transitions, 826 flow [2025-03-13 22:23:15,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 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:23:15,124 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:15,124 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:23:15,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 22:23:15,124 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-13 22:23:15,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:15,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1488648862, now seen corresponding path program 1 times [2025-03-13 22:23:15,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:15,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282494822] [2025-03-13 22:23:15,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:15,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:15,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-13 22:23:15,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-13 22:23:15,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:15,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:15,173 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:23:15,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:15,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282494822] [2025-03-13 22:23:15,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282494822] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:15,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:15,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:15,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859099760] [2025-03-13 22:23:15,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:15,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:15,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:15,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:15,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:15,194 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 454 [2025-03-13 22:23:15,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 408 transitions, 826 flow. Second operand has 3 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 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:23:15,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:15,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 454 [2025-03-13 22:23:15,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:15,306 INFO L124 PetriNetUnfolderBase]: 34/1406 cut-off events. [2025-03-13 22:23:15,306 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-13 22:23:15,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1471 conditions, 1406 events. 34/1406 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 8123 event pairs, 13 based on Foata normal form. 0/1207 useless extension candidates. Maximal degree in co-relation 1370. Up to 43 conditions per place. [2025-03-13 22:23:15,319 INFO L140 encePairwiseOnDemand]: 450/454 looper letters, 13 selfloop transitions, 2 changer transitions 0/410 dead transitions. [2025-03-13 22:23:15,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 410 transitions, 862 flow [2025-03-13 22:23:15,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:15,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:15,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1295 transitions. [2025-03-13 22:23:15,321 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9508076358296622 [2025-03-13 22:23:15,321 INFO L175 Difference]: Start difference. First operand has 411 places, 408 transitions, 826 flow. Second operand 3 states and 1295 transitions. [2025-03-13 22:23:15,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 410 transitions, 862 flow [2025-03-13 22:23:15,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 410 transitions, 858 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:15,342 INFO L231 Difference]: Finished difference. Result has 410 places, 408 transitions, 832 flow [2025-03-13 22:23:15,342 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=818, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=832, PETRI_PLACES=410, PETRI_TRANSITIONS=408} [2025-03-13 22:23:15,342 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -15 predicate places. [2025-03-13 22:23:15,343 INFO L471 AbstractCegarLoop]: Abstraction has has 410 places, 408 transitions, 832 flow [2025-03-13 22:23:15,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 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:23:15,343 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:15,343 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:23:15,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 22:23:15,343 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-13 22:23:15,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:15,345 INFO L85 PathProgramCache]: Analyzing trace with hash -367418557, now seen corresponding path program 1 times [2025-03-13 22:23:15,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:15,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708341475] [2025-03-13 22:23:15,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:15,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:15,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-13 22:23:15,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-13 22:23:15,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:15,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:15,387 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:23:15,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:15,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708341475] [2025-03-13 22:23:15,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708341475] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:15,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:15,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:15,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404643220] [2025-03-13 22:23:15,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:15,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:15,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:15,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:15,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:15,398 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 454 [2025-03-13 22:23:15,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 410 places, 408 transitions, 832 flow. Second operand has 3 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 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:23:15,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:15,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 454 [2025-03-13 22:23:15,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:15,534 INFO L124 PetriNetUnfolderBase]: 40/1646 cut-off events. [2025-03-13 22:23:15,534 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-13 22:23:15,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1724 conditions, 1646 events. 40/1646 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 10635 event pairs, 14 based on Foata normal form. 0/1421 useless extension candidates. Maximal degree in co-relation 1337. Up to 49 conditions per place. [2025-03-13 22:23:15,580 INFO L140 encePairwiseOnDemand]: 450/454 looper letters, 13 selfloop transitions, 2 changer transitions 0/410 dead transitions. [2025-03-13 22:23:15,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 410 transitions, 868 flow [2025-03-13 22:23:15,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:15,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:15,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1295 transitions. [2025-03-13 22:23:15,582 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9508076358296622 [2025-03-13 22:23:15,582 INFO L175 Difference]: Start difference. First operand has 410 places, 408 transitions, 832 flow. Second operand 3 states and 1295 transitions. [2025-03-13 22:23:15,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 410 transitions, 868 flow [2025-03-13 22:23:15,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 410 places, 410 transitions, 868 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:23:15,587 INFO L231 Difference]: Finished difference. Result has 411 places, 408 transitions, 842 flow [2025-03-13 22:23:15,587 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=828, PETRI_DIFFERENCE_MINUEND_PLACES=408, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=842, PETRI_PLACES=411, PETRI_TRANSITIONS=408} [2025-03-13 22:23:15,588 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -14 predicate places. [2025-03-13 22:23:15,588 INFO L471 AbstractCegarLoop]: Abstraction has has 411 places, 408 transitions, 842 flow [2025-03-13 22:23:15,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 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:23:15,589 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:15,589 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] [2025-03-13 22:23:15,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-13 22:23:15,589 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread3Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-13 22:23:15,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:15,589 INFO L85 PathProgramCache]: Analyzing trace with hash -2097842577, now seen corresponding path program 1 times [2025-03-13 22:23:15,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:15,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537789754] [2025-03-13 22:23:15,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:15,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:15,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-13 22:23:15,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-13 22:23:15,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:15,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:15,621 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:23:15,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:15,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537789754] [2025-03-13 22:23:15,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537789754] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:15,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:15,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:15,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449018151] [2025-03-13 22:23:15,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:15,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:15,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:15,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:15,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:15,631 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 454 [2025-03-13 22:23:15,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 408 transitions, 842 flow. Second operand has 3 states, 3 states have (on average 428.0) internal successors, (1284), 3 states have internal predecessors, (1284), 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:23:15,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:15,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 454 [2025-03-13 22:23:15,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:15,764 INFO L124 PetriNetUnfolderBase]: 24/902 cut-off events. [2025-03-13 22:23:15,764 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-13 22:23:15,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 962 conditions, 902 events. 24/902 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4361 event pairs, 4 based on Foata normal form. 0/786 useless extension candidates. Maximal degree in co-relation 759. Up to 31 conditions per place. [2025-03-13 22:23:15,777 INFO L140 encePairwiseOnDemand]: 450/454 looper letters, 13 selfloop transitions, 2 changer transitions 0/410 dead transitions. [2025-03-13 22:23:15,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 410 transitions, 878 flow [2025-03-13 22:23:15,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:15,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:15,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1295 transitions. [2025-03-13 22:23:15,779 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9508076358296622 [2025-03-13 22:23:15,779 INFO L175 Difference]: Start difference. First operand has 411 places, 408 transitions, 842 flow. Second operand 3 states and 1295 transitions. [2025-03-13 22:23:15,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 410 transitions, 878 flow [2025-03-13 22:23:15,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 411 places, 410 transitions, 878 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:23:15,783 INFO L231 Difference]: Finished difference. Result has 412 places, 408 transitions, 852 flow [2025-03-13 22:23:15,784 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=838, PETRI_DIFFERENCE_MINUEND_PLACES=409, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=852, PETRI_PLACES=412, PETRI_TRANSITIONS=408} [2025-03-13 22:23:15,784 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -13 predicate places. [2025-03-13 22:23:15,785 INFO L471 AbstractCegarLoop]: Abstraction has has 412 places, 408 transitions, 852 flow [2025-03-13 22:23:15,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 428.0) internal successors, (1284), 3 states have internal predecessors, (1284), 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:23:15,785 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:15,785 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:23:15,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 22:23:15,786 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-13 22:23:15,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:15,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1687020400, now seen corresponding path program 1 times [2025-03-13 22:23:15,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:15,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644863845] [2025-03-13 22:23:15,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:15,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:15,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-13 22:23:15,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-13 22:23:15,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:15,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:15,829 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:23:15,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:15,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644863845] [2025-03-13 22:23:15,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644863845] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:15,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:15,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:15,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628259274] [2025-03-13 22:23:15,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:15,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:15,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:15,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:15,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:15,837 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 454 [2025-03-13 22:23:15,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 408 transitions, 852 flow. Second operand has 3 states, 3 states have (on average 428.0) internal successors, (1284), 3 states have internal predecessors, (1284), 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:23:15,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:15,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 454 [2025-03-13 22:23:15,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:15,942 INFO L124 PetriNetUnfolderBase]: 26/943 cut-off events. [2025-03-13 22:23:15,942 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-13 22:23:15,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1014 conditions, 943 events. 26/943 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4675 event pairs, 4 based on Foata normal form. 0/826 useless extension candidates. Maximal degree in co-relation 810. Up to 35 conditions per place. [2025-03-13 22:23:15,952 INFO L140 encePairwiseOnDemand]: 450/454 looper letters, 13 selfloop transitions, 2 changer transitions 0/410 dead transitions. [2025-03-13 22:23:15,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 412 places, 410 transitions, 888 flow [2025-03-13 22:23:15,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:15,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:15,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1295 transitions. [2025-03-13 22:23:15,954 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9508076358296622 [2025-03-13 22:23:15,954 INFO L175 Difference]: Start difference. First operand has 412 places, 408 transitions, 852 flow. Second operand 3 states and 1295 transitions. [2025-03-13 22:23:15,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 412 places, 410 transitions, 888 flow [2025-03-13 22:23:15,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 410 transitions, 888 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:23:15,959 INFO L231 Difference]: Finished difference. Result has 413 places, 408 transitions, 862 flow [2025-03-13 22:23:15,959 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=848, PETRI_DIFFERENCE_MINUEND_PLACES=410, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=862, PETRI_PLACES=413, PETRI_TRANSITIONS=408} [2025-03-13 22:23:15,960 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -12 predicate places. [2025-03-13 22:23:15,960 INFO L471 AbstractCegarLoop]: Abstraction has has 413 places, 408 transitions, 862 flow [2025-03-13 22:23:15,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 428.0) internal successors, (1284), 3 states have internal predecessors, (1284), 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:23:15,961 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:15,961 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] [2025-03-13 22:23:15,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-13 22:23:15,961 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-13 22:23:15,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:15,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1954762881, now seen corresponding path program 1 times [2025-03-13 22:23:15,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:15,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658107108] [2025-03-13 22:23:15,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:15,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:15,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-13 22:23:15,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-13 22:23:15,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:15,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:16,007 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:23:16,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:16,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658107108] [2025-03-13 22:23:16,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658107108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:16,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:16,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:16,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550691508] [2025-03-13 22:23:16,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:16,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:16,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:16,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:16,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:16,019 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 454 [2025-03-13 22:23:16,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 413 places, 408 transitions, 862 flow. Second operand has 3 states, 3 states have (on average 427.6666666666667) internal successors, (1283), 3 states have internal predecessors, (1283), 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:23:16,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:16,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 454 [2025-03-13 22:23:16,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:16,213 INFO L124 PetriNetUnfolderBase]: 66/1778 cut-off events. [2025-03-13 22:23:16,213 INFO L125 PetriNetUnfolderBase]: For 21/25 co-relation queries the response was YES. [2025-03-13 22:23:16,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1908 conditions, 1778 events. 66/1778 cut-off events. For 21/25 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 10927 event pairs, 10 based on Foata normal form. 0/1515 useless extension candidates. Maximal degree in co-relation 1461. Up to 80 conditions per place. [2025-03-13 22:23:16,227 INFO L140 encePairwiseOnDemand]: 450/454 looper letters, 13 selfloop transitions, 2 changer transitions 0/410 dead transitions. [2025-03-13 22:23:16,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 410 transitions, 898 flow [2025-03-13 22:23:16,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:16,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:16,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1295 transitions. [2025-03-13 22:23:16,230 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9508076358296622 [2025-03-13 22:23:16,230 INFO L175 Difference]: Start difference. First operand has 413 places, 408 transitions, 862 flow. Second operand 3 states and 1295 transitions. [2025-03-13 22:23:16,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 410 transitions, 898 flow [2025-03-13 22:23:16,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 413 places, 410 transitions, 898 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:23:16,234 INFO L231 Difference]: Finished difference. Result has 414 places, 408 transitions, 872 flow [2025-03-13 22:23:16,235 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=411, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=872, PETRI_PLACES=414, PETRI_TRANSITIONS=408} [2025-03-13 22:23:16,236 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -11 predicate places. [2025-03-13 22:23:16,236 INFO L471 AbstractCegarLoop]: Abstraction has has 414 places, 408 transitions, 872 flow [2025-03-13 22:23:16,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 427.6666666666667) internal successors, (1283), 3 states have internal predecessors, (1283), 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:23:16,236 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:16,237 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] [2025-03-13 22:23:16,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-13 22:23:16,237 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-13 22:23:16,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:16,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1626387936, now seen corresponding path program 1 times [2025-03-13 22:23:16,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:16,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415467856] [2025-03-13 22:23:16,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:16,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:16,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-13 22:23:16,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-13 22:23:16,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:16,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:16,284 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:23:16,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:16,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415467856] [2025-03-13 22:23:16,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415467856] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:16,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:16,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:16,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409235973] [2025-03-13 22:23:16,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:16,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:16,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:16,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:16,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:16,293 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 454 [2025-03-13 22:23:16,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 414 places, 408 transitions, 872 flow. Second operand has 3 states, 3 states have (on average 427.6666666666667) internal successors, (1283), 3 states have internal predecessors, (1283), 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:23:16,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:16,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 454 [2025-03-13 22:23:16,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:16,500 INFO L124 PetriNetUnfolderBase]: 75/1940 cut-off events. [2025-03-13 22:23:16,500 INFO L125 PetriNetUnfolderBase]: For 23/27 co-relation queries the response was YES. [2025-03-13 22:23:16,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2095 conditions, 1940 events. 75/1940 cut-off events. For 23/27 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 12016 event pairs, 19 based on Foata normal form. 0/1662 useless extension candidates. Maximal degree in co-relation 1659. Up to 90 conditions per place. [2025-03-13 22:23:16,513 INFO L140 encePairwiseOnDemand]: 450/454 looper letters, 13 selfloop transitions, 2 changer transitions 0/410 dead transitions. [2025-03-13 22:23:16,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 410 transitions, 908 flow [2025-03-13 22:23:16,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:16,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:16,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1295 transitions. [2025-03-13 22:23:16,515 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9508076358296622 [2025-03-13 22:23:16,515 INFO L175 Difference]: Start difference. First operand has 414 places, 408 transitions, 872 flow. Second operand 3 states and 1295 transitions. [2025-03-13 22:23:16,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 414 places, 410 transitions, 908 flow [2025-03-13 22:23:16,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 414 places, 410 transitions, 908 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:23:16,519 INFO L231 Difference]: Finished difference. Result has 415 places, 408 transitions, 882 flow [2025-03-13 22:23:16,520 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=868, PETRI_DIFFERENCE_MINUEND_PLACES=412, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=882, PETRI_PLACES=415, PETRI_TRANSITIONS=408} [2025-03-13 22:23:16,520 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -10 predicate places. [2025-03-13 22:23:16,520 INFO L471 AbstractCegarLoop]: Abstraction has has 415 places, 408 transitions, 882 flow [2025-03-13 22:23:16,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 427.6666666666667) internal successors, (1283), 3 states have internal predecessors, (1283), 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:23:16,521 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:16,521 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] [2025-03-13 22:23:16,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-13 22:23:16,521 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-13 22:23:16,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:16,522 INFO L85 PathProgramCache]: Analyzing trace with hash 713552194, now seen corresponding path program 1 times [2025-03-13 22:23:16,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:16,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274460716] [2025-03-13 22:23:16,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:16,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:16,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-13 22:23:16,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-13 22:23:16,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:16,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:16,568 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:23:16,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:16,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274460716] [2025-03-13 22:23:16,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274460716] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:16,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:16,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:16,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221102092] [2025-03-13 22:23:16,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:16,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:16,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:16,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:16,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:16,582 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 420 out of 454 [2025-03-13 22:23:16,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 408 transitions, 882 flow. Second operand has 3 states, 3 states have (on average 421.3333333333333) internal successors, (1264), 3 states have internal predecessors, (1264), 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:23:16,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:16,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 420 of 454 [2025-03-13 22:23:16,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:16,777 INFO L124 PetriNetUnfolderBase]: 163/1738 cut-off events. [2025-03-13 22:23:16,777 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-03-13 22:23:16,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2090 conditions, 1738 events. 163/1738 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 12360 event pairs, 60 based on Foata normal form. 0/1489 useless extension candidates. Maximal degree in co-relation 1724. Up to 239 conditions per place. [2025-03-13 22:23:16,790 INFO L140 encePairwiseOnDemand]: 448/454 looper letters, 17 selfloop transitions, 2 changer transitions 0/408 dead transitions. [2025-03-13 22:23:16,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 408 transitions, 922 flow [2025-03-13 22:23:16,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:16,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:16,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1283 transitions. [2025-03-13 22:23:16,793 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9419970631424376 [2025-03-13 22:23:16,793 INFO L175 Difference]: Start difference. First operand has 415 places, 408 transitions, 882 flow. Second operand 3 states and 1283 transitions. [2025-03-13 22:23:16,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 408 transitions, 922 flow [2025-03-13 22:23:16,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 413 places, 408 transitions, 922 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:23:16,800 INFO L231 Difference]: Finished difference. Result has 414 places, 406 transitions, 888 flow [2025-03-13 22:23:16,800 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=874, PETRI_DIFFERENCE_MINUEND_PLACES=411, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=402, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=888, PETRI_PLACES=414, PETRI_TRANSITIONS=406} [2025-03-13 22:23:16,801 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -11 predicate places. [2025-03-13 22:23:16,801 INFO L471 AbstractCegarLoop]: Abstraction has has 414 places, 406 transitions, 888 flow [2025-03-13 22:23:16,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 421.3333333333333) internal successors, (1264), 3 states have internal predecessors, (1264), 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:23:16,802 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:16,802 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] [2025-03-13 22:23:16,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-13 22:23:16,802 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-13 22:23:16,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:16,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1471078493, now seen corresponding path program 1 times [2025-03-13 22:23:16,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:16,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089406488] [2025-03-13 22:23:16,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:16,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:16,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-13 22:23:16,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-13 22:23:16,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:16,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:16,861 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:23:16,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:16,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089406488] [2025-03-13 22:23:16,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089406488] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:16,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:16,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:16,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184871263] [2025-03-13 22:23:16,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:16,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:16,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:16,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:16,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:16,877 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 420 out of 454 [2025-03-13 22:23:16,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 414 places, 406 transitions, 888 flow. Second operand has 3 states, 3 states have (on average 421.3333333333333) internal successors, (1264), 3 states have internal predecessors, (1264), 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:23:16,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:16,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 420 of 454 [2025-03-13 22:23:16,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:17,124 INFO L124 PetriNetUnfolderBase]: 121/1554 cut-off events. [2025-03-13 22:23:17,124 INFO L125 PetriNetUnfolderBase]: For 21/45 co-relation queries the response was YES. [2025-03-13 22:23:17,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1849 conditions, 1554 events. 121/1554 cut-off events. For 21/45 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 9847 event pairs, 52 based on Foata normal form. 3/1362 useless extension candidates. Maximal degree in co-relation 1555. Up to 191 conditions per place. [2025-03-13 22:23:17,143 INFO L140 encePairwiseOnDemand]: 448/454 looper letters, 17 selfloop transitions, 2 changer transitions 0/406 dead transitions. [2025-03-13 22:23:17,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 412 places, 406 transitions, 928 flow [2025-03-13 22:23:17,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:17,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:17,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1283 transitions. [2025-03-13 22:23:17,146 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9419970631424376 [2025-03-13 22:23:17,146 INFO L175 Difference]: Start difference. First operand has 414 places, 406 transitions, 888 flow. Second operand 3 states and 1283 transitions. [2025-03-13 22:23:17,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 412 places, 406 transitions, 928 flow [2025-03-13 22:23:17,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 406 transitions, 928 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:23:17,152 INFO L231 Difference]: Finished difference. Result has 413 places, 404 transitions, 894 flow [2025-03-13 22:23:17,152 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=880, PETRI_DIFFERENCE_MINUEND_PLACES=410, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=402, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=400, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=894, PETRI_PLACES=413, PETRI_TRANSITIONS=404} [2025-03-13 22:23:17,152 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -12 predicate places. [2025-03-13 22:23:17,152 INFO L471 AbstractCegarLoop]: Abstraction has has 413 places, 404 transitions, 894 flow [2025-03-13 22:23:17,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 421.3333333333333) internal successors, (1264), 3 states have internal predecessors, (1264), 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:23:17,153 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:17,153 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] [2025-03-13 22:23:17,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-13 22:23:17,153 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-13 22:23:17,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:17,154 INFO L85 PathProgramCache]: Analyzing trace with hash -429594352, now seen corresponding path program 1 times [2025-03-13 22:23:17,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:17,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755990270] [2025-03-13 22:23:17,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:17,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:17,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-13 22:23:17,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-13 22:23:17,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:17,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:17,205 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:23:17,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:17,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755990270] [2025-03-13 22:23:17,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755990270] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:17,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:17,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:17,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459759670] [2025-03-13 22:23:17,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:17,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:17,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:17,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:17,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:17,223 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 420 out of 454 [2025-03-13 22:23:17,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 413 places, 404 transitions, 894 flow. Second operand has 3 states, 3 states have (on average 421.6666666666667) internal successors, (1265), 3 states have internal predecessors, (1265), 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:23:17,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:17,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 420 of 454 [2025-03-13 22:23:17,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:17,538 INFO L124 PetriNetUnfolderBase]: 231/1986 cut-off events. [2025-03-13 22:23:17,539 INFO L125 PetriNetUnfolderBase]: For 51/53 co-relation queries the response was YES. [2025-03-13 22:23:17,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2492 conditions, 1986 events. 231/1986 cut-off events. For 51/53 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 13038 event pairs, 76 based on Foata normal form. 0/1789 useless extension candidates. Maximal degree in co-relation 2096. Up to 364 conditions per place. [2025-03-13 22:23:17,551 INFO L140 encePairwiseOnDemand]: 448/454 looper letters, 17 selfloop transitions, 2 changer transitions 0/404 dead transitions. [2025-03-13 22:23:17,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 404 transitions, 934 flow [2025-03-13 22:23:17,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:17,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:17,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1283 transitions. [2025-03-13 22:23:17,554 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9419970631424376 [2025-03-13 22:23:17,554 INFO L175 Difference]: Start difference. First operand has 413 places, 404 transitions, 894 flow. Second operand 3 states and 1283 transitions. [2025-03-13 22:23:17,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 404 transitions, 934 flow [2025-03-13 22:23:17,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 411 places, 404 transitions, 934 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:23:17,558 INFO L231 Difference]: Finished difference. Result has 412 places, 402 transitions, 900 flow [2025-03-13 22:23:17,559 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=886, PETRI_DIFFERENCE_MINUEND_PLACES=409, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=398, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=900, PETRI_PLACES=412, PETRI_TRANSITIONS=402} [2025-03-13 22:23:17,559 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -13 predicate places. [2025-03-13 22:23:17,559 INFO L471 AbstractCegarLoop]: Abstraction has has 412 places, 402 transitions, 900 flow [2025-03-13 22:23:17,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 421.6666666666667) internal successors, (1265), 3 states have internal predecessors, (1265), 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:23:17,560 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:17,560 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] [2025-03-13 22:23:17,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-13 22:23:17,560 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-13 22:23:17,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:17,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1985565941, now seen corresponding path program 1 times [2025-03-13 22:23:17,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:17,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320045980] [2025-03-13 22:23:17,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:17,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:17,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-13 22:23:17,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-13 22:23:17,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:17,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:17,603 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:23:17,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:17,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320045980] [2025-03-13 22:23:17,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320045980] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:17,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:17,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:17,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243507617] [2025-03-13 22:23:17,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:17,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:17,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:17,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:17,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:17,617 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 427 out of 454 [2025-03-13 22:23:17,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 402 transitions, 900 flow. Second operand has 3 states, 3 states have (on average 428.3333333333333) internal successors, (1285), 3 states have internal predecessors, (1285), 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:23:17,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:17,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 427 of 454 [2025-03-13 22:23:17,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:17,758 INFO L124 PetriNetUnfolderBase]: 55/1300 cut-off events. [2025-03-13 22:23:17,759 INFO L125 PetriNetUnfolderBase]: For 7/31 co-relation queries the response was YES. [2025-03-13 22:23:17,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1519 conditions, 1300 events. 55/1300 cut-off events. For 7/31 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 6940 event pairs, 4 based on Foata normal form. 4/1205 useless extension candidates. Maximal degree in co-relation 1196. Up to 30 conditions per place. [2025-03-13 22:23:17,773 INFO L140 encePairwiseOnDemand]: 451/454 looper letters, 11 selfloop transitions, 2 changer transitions 0/403 dead transitions. [2025-03-13 22:23:17,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 403 transitions, 930 flow [2025-03-13 22:23:17,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:17,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:17,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1295 transitions. [2025-03-13 22:23:17,776 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9508076358296622 [2025-03-13 22:23:17,776 INFO L175 Difference]: Start difference. First operand has 412 places, 402 transitions, 900 flow. Second operand 3 states and 1295 transitions. [2025-03-13 22:23:17,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 403 transitions, 930 flow [2025-03-13 22:23:17,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 413 places, 403 transitions, 930 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:23:17,782 INFO L231 Difference]: Finished difference. Result has 413 places, 401 transitions, 902 flow [2025-03-13 22:23:17,782 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=898, PETRI_DIFFERENCE_MINUEND_PLACES=411, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=902, PETRI_PLACES=413, PETRI_TRANSITIONS=401} [2025-03-13 22:23:17,782 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -12 predicate places. [2025-03-13 22:23:17,782 INFO L471 AbstractCegarLoop]: Abstraction has has 413 places, 401 transitions, 902 flow [2025-03-13 22:23:17,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 428.3333333333333) internal successors, (1285), 3 states have internal predecessors, (1285), 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:23:17,783 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:17,783 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] [2025-03-13 22:23:17,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-13 22:23:17,784 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-13 22:23:17,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:17,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1647885832, now seen corresponding path program 1 times [2025-03-13 22:23:17,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:17,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570321025] [2025-03-13 22:23:17,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:17,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:17,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-13 22:23:17,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-13 22:23:17,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:17,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:17,832 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:23:17,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:17,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570321025] [2025-03-13 22:23:17,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570321025] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:17,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:17,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:17,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360045117] [2025-03-13 22:23:17,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:17,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:17,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:17,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:17,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:17,845 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 454 [2025-03-13 22:23:17,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 413 places, 401 transitions, 902 flow. Second operand has 3 states, 3 states have (on average 427.6666666666667) internal successors, (1283), 3 states have internal predecessors, (1283), 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:23:17,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:17,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 454 [2025-03-13 22:23:17,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:18,011 INFO L124 PetriNetUnfolderBase]: 81/1576 cut-off events. [2025-03-13 22:23:18,011 INFO L125 PetriNetUnfolderBase]: For 19/31 co-relation queries the response was YES. [2025-03-13 22:23:18,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1889 conditions, 1576 events. 81/1576 cut-off events. For 19/31 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 9355 event pairs, 14 based on Foata normal form. 1/1465 useless extension candidates. Maximal degree in co-relation 1758. Up to 53 conditions per place. [2025-03-13 22:23:18,027 INFO L140 encePairwiseOnDemand]: 451/454 looper letters, 12 selfloop transitions, 2 changer transitions 0/402 dead transitions. [2025-03-13 22:23:18,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 402 transitions, 934 flow [2025-03-13 22:23:18,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:18,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:18,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1293 transitions. [2025-03-13 22:23:18,029 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9493392070484582 [2025-03-13 22:23:18,029 INFO L175 Difference]: Start difference. First operand has 413 places, 401 transitions, 902 flow. Second operand 3 states and 1293 transitions. [2025-03-13 22:23:18,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 414 places, 402 transitions, 934 flow [2025-03-13 22:23:18,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 402 transitions, 930 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:18,035 INFO L231 Difference]: Finished difference. Result has 412 places, 400 transitions, 900 flow [2025-03-13 22:23:18,036 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=896, PETRI_DIFFERENCE_MINUEND_PLACES=410, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=398, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=900, PETRI_PLACES=412, PETRI_TRANSITIONS=400} [2025-03-13 22:23:18,036 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -13 predicate places. [2025-03-13 22:23:18,037 INFO L471 AbstractCegarLoop]: Abstraction has has 412 places, 400 transitions, 900 flow [2025-03-13 22:23:18,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 427.6666666666667) internal successors, (1283), 3 states have internal predecessors, (1283), 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:23:18,037 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:18,037 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] [2025-03-13 22:23:18,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-13 22:23:18,037 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-13 22:23:18,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:18,038 INFO L85 PathProgramCache]: Analyzing trace with hash -876010472, now seen corresponding path program 1 times [2025-03-13 22:23:18,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:18,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472374633] [2025-03-13 22:23:18,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:18,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:18,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-13 22:23:18,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-13 22:23:18,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:18,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:18,092 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:23:18,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:18,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472374633] [2025-03-13 22:23:18,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472374633] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:18,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:18,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:18,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065196950] [2025-03-13 22:23:18,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:18,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:18,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:18,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:18,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:18,106 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 454 [2025-03-13 22:23:18,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 400 transitions, 900 flow. Second operand has 3 states, 3 states have (on average 428.0) internal successors, (1284), 3 states have internal predecessors, (1284), 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:23:18,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:18,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 454 [2025-03-13 22:23:18,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:18,236 INFO L124 PetriNetUnfolderBase]: 65/1219 cut-off events. [2025-03-13 22:23:18,236 INFO L125 PetriNetUnfolderBase]: For 25/31 co-relation queries the response was YES. [2025-03-13 22:23:18,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1506 conditions, 1219 events. 65/1219 cut-off events. For 25/31 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 6108 event pairs, 10 based on Foata normal form. 0/1146 useless extension candidates. Maximal degree in co-relation 1397. Up to 63 conditions per place. [2025-03-13 22:23:18,247 INFO L140 encePairwiseOnDemand]: 451/454 looper letters, 12 selfloop transitions, 2 changer transitions 0/401 dead transitions. [2025-03-13 22:23:18,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 401 transitions, 932 flow [2025-03-13 22:23:18,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:18,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:18,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1293 transitions. [2025-03-13 22:23:18,249 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9493392070484582 [2025-03-13 22:23:18,249 INFO L175 Difference]: Start difference. First operand has 412 places, 400 transitions, 900 flow. Second operand 3 states and 1293 transitions. [2025-03-13 22:23:18,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 401 transitions, 932 flow [2025-03-13 22:23:18,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 411 places, 401 transitions, 928 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:18,254 INFO L231 Difference]: Finished difference. Result has 411 places, 399 transitions, 898 flow [2025-03-13 22:23:18,254 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=894, PETRI_DIFFERENCE_MINUEND_PLACES=409, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=397, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=898, PETRI_PLACES=411, PETRI_TRANSITIONS=399} [2025-03-13 22:23:18,255 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -14 predicate places. [2025-03-13 22:23:18,255 INFO L471 AbstractCegarLoop]: Abstraction has has 411 places, 399 transitions, 898 flow [2025-03-13 22:23:18,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 428.0) internal successors, (1284), 3 states have internal predecessors, (1284), 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:23:18,256 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:18,256 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:18,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-13 22:23:18,256 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-13 22:23:18,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:18,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1527442181, now seen corresponding path program 1 times [2025-03-13 22:23:18,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:18,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212324670] [2025-03-13 22:23:18,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:18,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:18,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 331 statements into 1 equivalence classes. [2025-03-13 22:23:18,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 331 of 331 statements. [2025-03-13 22:23:18,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:18,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:18,329 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:23:18,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:18,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212324670] [2025-03-13 22:23:18,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212324670] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:18,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:18,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:18,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674036029] [2025-03-13 22:23:18,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:18,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:18,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:18,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:18,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:18,338 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 429 out of 454 [2025-03-13 22:23:18,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 399 transitions, 898 flow. Second operand has 3 states, 3 states have (on average 432.0) internal successors, (1296), 3 states have internal predecessors, (1296), 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:23:18,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:18,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 429 of 454 [2025-03-13 22:23:18,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:18,463 INFO L124 PetriNetUnfolderBase]: 49/1259 cut-off events. [2025-03-13 22:23:18,463 INFO L125 PetriNetUnfolderBase]: For 7/16 co-relation queries the response was YES. [2025-03-13 22:23:18,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1483 conditions, 1259 events. 49/1259 cut-off events. For 7/16 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 6536 event pairs, 2 based on Foata normal form. 0/1185 useless extension candidates. Maximal degree in co-relation 1326. Up to 30 conditions per place. [2025-03-13 22:23:18,476 INFO L140 encePairwiseOnDemand]: 452/454 looper letters, 8 selfloop transitions, 1 changer transitions 0/398 dead transitions. [2025-03-13 22:23:18,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 412 places, 398 transitions, 914 flow [2025-03-13 22:23:18,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:18,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:18,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1297 transitions. [2025-03-13 22:23:18,480 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9522760646108663 [2025-03-13 22:23:18,480 INFO L175 Difference]: Start difference. First operand has 411 places, 399 transitions, 898 flow. Second operand 3 states and 1297 transitions. [2025-03-13 22:23:18,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 412 places, 398 transitions, 914 flow [2025-03-13 22:23:18,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 410 places, 398 transitions, 910 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:18,484 INFO L231 Difference]: Finished difference. Result has 410 places, 398 transitions, 894 flow [2025-03-13 22:23:18,485 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=892, PETRI_DIFFERENCE_MINUEND_PLACES=408, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=397, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=894, PETRI_PLACES=410, PETRI_TRANSITIONS=398} [2025-03-13 22:23:18,486 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -15 predicate places. [2025-03-13 22:23:18,486 INFO L471 AbstractCegarLoop]: Abstraction has has 410 places, 398 transitions, 894 flow [2025-03-13 22:23:18,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 432.0) internal successors, (1296), 3 states have internal predecessors, (1296), 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:23:18,487 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:18,487 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:18,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-13 22:23:18,487 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-13 22:23:18,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:18,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1008284728, now seen corresponding path program 1 times [2025-03-13 22:23:18,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:18,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223256260] [2025-03-13 22:23:18,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:18,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:18,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes. [2025-03-13 22:23:18,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements. [2025-03-13 22:23:18,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:18,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:18,549 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:23:18,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:18,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223256260] [2025-03-13 22:23:18,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223256260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:18,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:18,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:18,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058389386] [2025-03-13 22:23:18,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:18,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:18,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:18,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:18,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:18,558 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 454 [2025-03-13 22:23:18,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 410 places, 398 transitions, 894 flow. Second operand has 3 states, 3 states have (on average 429.0) internal successors, (1287), 3 states have internal predecessors, (1287), 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:23:18,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:18,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 454 [2025-03-13 22:23:18,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:18,721 INFO L124 PetriNetUnfolderBase]: 60/1492 cut-off events. [2025-03-13 22:23:18,721 INFO L125 PetriNetUnfolderBase]: For 7/13 co-relation queries the response was YES. [2025-03-13 22:23:18,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1730 conditions, 1492 events. 60/1492 cut-off events. For 7/13 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 8541 event pairs, 7 based on Foata normal form. 0/1401 useless extension candidates. Maximal degree in co-relation 1694. Up to 36 conditions per place. [2025-03-13 22:23:18,730 INFO L140 encePairwiseOnDemand]: 451/454 looper letters, 10 selfloop transitions, 1 changer transitions 0/396 dead transitions. [2025-03-13 22:23:18,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 396 transitions, 912 flow [2025-03-13 22:23:18,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:18,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:18,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1291 transitions. [2025-03-13 22:23:18,732 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9478707782672541 [2025-03-13 22:23:18,732 INFO L175 Difference]: Start difference. First operand has 410 places, 398 transitions, 894 flow. Second operand 3 states and 1291 transitions. [2025-03-13 22:23:18,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 396 transitions, 912 flow [2025-03-13 22:23:18,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 396 transitions, 911 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:23:18,736 INFO L231 Difference]: Finished difference. Result has 409 places, 396 transitions, 891 flow [2025-03-13 22:23:18,736 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=889, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=395, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=891, PETRI_PLACES=409, PETRI_TRANSITIONS=396} [2025-03-13 22:23:18,736 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -16 predicate places. [2025-03-13 22:23:18,737 INFO L471 AbstractCegarLoop]: Abstraction has has 409 places, 396 transitions, 891 flow [2025-03-13 22:23:18,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 429.0) internal successors, (1287), 3 states have internal predecessors, (1287), 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:23:18,737 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:18,737 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:18,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-13 22:23:18,737 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-13 22:23:18,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:18,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1095718236, now seen corresponding path program 1 times [2025-03-13 22:23:18,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:18,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758256015] [2025-03-13 22:23:18,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:18,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:18,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 341 statements into 1 equivalence classes. [2025-03-13 22:23:18,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 341 of 341 statements. [2025-03-13 22:23:18,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:18,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:18,793 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:23:18,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:18,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758256015] [2025-03-13 22:23:18,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758256015] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:18,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:18,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:18,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040056336] [2025-03-13 22:23:18,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:18,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:18,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:18,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:18,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:18,803 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 454 [2025-03-13 22:23:18,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 396 transitions, 891 flow. Second operand has 3 states, 3 states have (on average 429.0) internal successors, (1287), 3 states have internal predecessors, (1287), 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:23:18,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:18,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 454 [2025-03-13 22:23:18,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:18,910 INFO L124 PetriNetUnfolderBase]: 50/1171 cut-off events. [2025-03-13 22:23:18,910 INFO L125 PetriNetUnfolderBase]: For 10/16 co-relation queries the response was YES. [2025-03-13 22:23:18,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1374 conditions, 1171 events. 50/1171 cut-off events. For 10/16 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 5821 event pairs, 5 based on Foata normal form. 1/1103 useless extension candidates. Maximal degree in co-relation 1349. Up to 36 conditions per place. [2025-03-13 22:23:18,920 INFO L140 encePairwiseOnDemand]: 451/454 looper letters, 0 selfloop transitions, 0 changer transitions 394/394 dead transitions. [2025-03-13 22:23:18,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 394 transitions, 907 flow [2025-03-13 22:23:18,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:18,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:18,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1290 transitions. [2025-03-13 22:23:18,922 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.947136563876652 [2025-03-13 22:23:18,922 INFO L175 Difference]: Start difference. First operand has 409 places, 396 transitions, 891 flow. Second operand 3 states and 1290 transitions. [2025-03-13 22:23:18,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 394 transitions, 907 flow [2025-03-13 22:23:18,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 394 transitions, 906 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:23:18,925 INFO L231 Difference]: Finished difference. Result has 408 places, 0 transitions, 0 flow [2025-03-13 22:23:18,926 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=886, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=408, PETRI_TRANSITIONS=0} [2025-03-13 22:23:18,926 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -17 predicate places. [2025-03-13 22:23:18,926 INFO L471 AbstractCegarLoop]: Abstraction has has 408 places, 0 transitions, 0 flow [2025-03-13 22:23:18,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 429.0) internal successors, (1287), 3 states have internal predecessors, (1287), 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:23:18,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (70 of 71 remaining) [2025-03-13 22:23:18,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (69 of 71 remaining) [2025-03-13 22:23:18,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (68 of 71 remaining) [2025-03-13 22:23:18,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (67 of 71 remaining) [2025-03-13 22:23:18,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (66 of 71 remaining) [2025-03-13 22:23:18,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (65 of 71 remaining) [2025-03-13 22:23:18,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (64 of 71 remaining) [2025-03-13 22:23:18,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (63 of 71 remaining) [2025-03-13 22:23:18,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (62 of 71 remaining) [2025-03-13 22:23:18,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (61 of 71 remaining) [2025-03-13 22:23:18,930 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (60 of 71 remaining) [2025-03-13 22:23:18,930 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (59 of 71 remaining) [2025-03-13 22:23:18,930 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (58 of 71 remaining) [2025-03-13 22:23:18,930 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (57 of 71 remaining) [2025-03-13 22:23:18,930 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (56 of 71 remaining) [2025-03-13 22:23:18,930 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (55 of 71 remaining) [2025-03-13 22:23:18,930 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (54 of 71 remaining) [2025-03-13 22:23:18,930 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (53 of 71 remaining) [2025-03-13 22:23:18,930 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (52 of 71 remaining) [2025-03-13 22:23:18,930 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (51 of 71 remaining) [2025-03-13 22:23:18,930 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (50 of 71 remaining) [2025-03-13 22:23:18,930 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (49 of 71 remaining) [2025-03-13 22:23:18,930 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (48 of 71 remaining) [2025-03-13 22:23:18,930 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (47 of 71 remaining) [2025-03-13 22:23:18,930 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (46 of 71 remaining) [2025-03-13 22:23:18,930 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (45 of 71 remaining) [2025-03-13 22:23:18,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (44 of 71 remaining) [2025-03-13 22:23:18,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (43 of 71 remaining) [2025-03-13 22:23:18,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (42 of 71 remaining) [2025-03-13 22:23:18,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (41 of 71 remaining) [2025-03-13 22:23:18,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (40 of 71 remaining) [2025-03-13 22:23:18,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (39 of 71 remaining) [2025-03-13 22:23:18,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (38 of 71 remaining) [2025-03-13 22:23:18,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (37 of 71 remaining) [2025-03-13 22:23:18,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (36 of 71 remaining) [2025-03-13 22:23:18,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (35 of 71 remaining) [2025-03-13 22:23:18,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (34 of 71 remaining) [2025-03-13 22:23:18,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (33 of 71 remaining) [2025-03-13 22:23:18,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (32 of 71 remaining) [2025-03-13 22:23:18,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (31 of 71 remaining) [2025-03-13 22:23:18,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (30 of 71 remaining) [2025-03-13 22:23:18,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 71 remaining) [2025-03-13 22:23:18,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 71 remaining) [2025-03-13 22:23:18,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 71 remaining) [2025-03-13 22:23:18,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (26 of 71 remaining) [2025-03-13 22:23:18,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (25 of 71 remaining) [2025-03-13 22:23:18,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (24 of 71 remaining) [2025-03-13 22:23:18,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (23 of 71 remaining) [2025-03-13 22:23:18,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (22 of 71 remaining) [2025-03-13 22:23:18,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (21 of 71 remaining) [2025-03-13 22:23:18,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (20 of 71 remaining) [2025-03-13 22:23:18,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (19 of 71 remaining) [2025-03-13 22:23:18,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (18 of 71 remaining) [2025-03-13 22:23:18,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (17 of 71 remaining) [2025-03-13 22:23:18,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (16 of 71 remaining) [2025-03-13 22:23:18,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (15 of 71 remaining) [2025-03-13 22:23:18,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (14 of 71 remaining) [2025-03-13 22:23:18,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (13 of 71 remaining) [2025-03-13 22:23:18,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (12 of 71 remaining) [2025-03-13 22:23:18,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (11 of 71 remaining) [2025-03-13 22:23:18,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (10 of 71 remaining) [2025-03-13 22:23:18,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (9 of 71 remaining) [2025-03-13 22:23:18,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (8 of 71 remaining) [2025-03-13 22:23:18,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (7 of 71 remaining) [2025-03-13 22:23:18,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (6 of 71 remaining) [2025-03-13 22:23:18,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (5 of 71 remaining) [2025-03-13 22:23:18,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (4 of 71 remaining) [2025-03-13 22:23:18,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (3 of 71 remaining) [2025-03-13 22:23:18,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (2 of 71 remaining) [2025-03-13 22:23:18,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (1 of 71 remaining) [2025-03-13 22:23:18,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (0 of 71 remaining) [2025-03-13 22:23:18,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-13 22:23:18,934 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:23:18,939 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-13 22:23:18,939 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-13 22:23:18,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.03 10:23:18 BasicIcfg [2025-03-13 22:23:18,944 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-13 22:23:18,944 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-13 22:23:18,944 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-13 22:23:18,944 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-13 22:23:18,945 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:23:12" (3/4) ... [2025-03-13 22:23:18,946 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-13 22:23:18,948 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-13 22:23:18,948 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-13 22:23:18,948 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-13 22:23:18,952 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-03-13 22:23:18,952 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-13 22:23:18,953 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-13 22:23:18,953 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-13 22:23:19,014 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-13 22:23:19,014 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-13 22:23:19,014 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-13 22:23:19,015 INFO L158 Benchmark]: Toolchain (without parser) took 7045.48ms. Allocated memory was 142.6MB in the beginning and 570.4MB in the end (delta: 427.8MB). Free memory was 112.2MB in the beginning and 346.8MB in the end (delta: -234.7MB). Peak memory consumption was 188.5MB. Max. memory is 16.1GB. [2025-03-13 22:23:19,015 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 22:23:19,016 INFO L158 Benchmark]: CACSL2BoogieTranslator took 208.85ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 99.9MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 22:23:19,017 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.91ms. Allocated memory is still 142.6MB. Free memory was 99.9MB in the beginning and 97.4MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 22:23:19,017 INFO L158 Benchmark]: Boogie Preprocessor took 28.55ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 96.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 22:23:19,017 INFO L158 Benchmark]: IcfgBuilder took 493.38ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 67.1MB in the end (delta: 29.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-13 22:23:19,017 INFO L158 Benchmark]: TraceAbstraction took 6200.28ms. Allocated memory was 142.6MB in the beginning and 570.4MB in the end (delta: 427.8MB). Free memory was 66.3MB in the beginning and 355.2MB in the end (delta: -289.0MB). Peak memory consumption was 138.2MB. Max. memory is 16.1GB. [2025-03-13 22:23:19,017 INFO L158 Benchmark]: Witness Printer took 69.69ms. Allocated memory is still 570.4MB. Free memory was 355.2MB in the beginning and 346.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 22:23:19,018 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 208.85ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 99.9MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.91ms. Allocated memory is still 142.6MB. Free memory was 99.9MB in the beginning and 97.4MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.55ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 96.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 493.38ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 67.1MB in the end (delta: 29.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6200.28ms. Allocated memory was 142.6MB in the beginning and 570.4MB in the end (delta: 427.8MB). Free memory was 66.3MB in the beginning and 355.2MB in the end (delta: -289.0MB). Peak memory consumption was 138.2MB. Max. memory is 16.1GB. * Witness Printer took 69.69ms. Allocated memory is still 570.4MB. Free memory was 355.2MB in the beginning and 346.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: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: 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: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: 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: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: 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: 71]: 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: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: 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: 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: 88]: 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: 88]: 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 - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 710 locations, 71 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: 6.0s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 527 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 168 mSDsluCounter, 129 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 84 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 642 IncrementalHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 84 mSolverCounterUnsat, 129 mSDtfsCounter, 642 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=902occurred in iteration=19, InterpolantAutomatonStates: 72, 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, 0.8s InterpolantComputationTime, 3270 NumberOfCodeBlocks, 3270 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 3246 ConstructedInterpolants, 0 QuantifiedInterpolants, 3294 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 41 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-13 22:23:19,033 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