./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-word-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8fc3dc66 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-word-symm.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 bf81f7b3bd1ceac2bf46c7c37f69effc0af9de17b18c7565156301fb49a6164e --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:12:35,355 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:12:35,410 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 11:12:35,417 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:12:35,418 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:12:35,436 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:12:35,436 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:12:35,436 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:12:35,437 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:12:35,437 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:12:35,438 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:12:35,438 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:12:35,438 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:12:35,438 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:12:35,439 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 11:12:35,439 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:12:35,439 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:12:35,439 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:12:35,439 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:12:35,439 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 11:12:35,439 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:12:35,439 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 11:12:35,439 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 11:12:35,439 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:12:35,439 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:12:35,439 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 11:12:35,439 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:12:35,439 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:12:35,439 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:12:35,439 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:12:35,439 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:12:35,440 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:12:35,440 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:12:35,440 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:12:35,440 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 11:12:35,440 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 11:12:35,440 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:12:35,440 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:12:35,440 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:12:35,440 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:12:35,440 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:12:35,440 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:12:35,440 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 -> bf81f7b3bd1ceac2bf46c7c37f69effc0af9de17b18c7565156301fb49a6164e [2025-03-17 11:12:35,649 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:12:35,657 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:12:35,659 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:12:35,660 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:12:35,660 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:12:35,661 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-word-symm.wvr.c [2025-03-17 11:12:36,793 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/229a9cbd3/ab5c295506ae466da54496dffaeaac80/FLAGee1332cd0 [2025-03-17 11:12:37,003 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:12:37,003 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-word-symm.wvr.c [2025-03-17 11:12:37,010 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/229a9cbd3/ab5c295506ae466da54496dffaeaac80/FLAGee1332cd0 [2025-03-17 11:12:37,356 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/229a9cbd3/ab5c295506ae466da54496dffaeaac80 [2025-03-17 11:12:37,358 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:12:37,359 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:12:37,360 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:12:37,360 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:12:37,363 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:12:37,364 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:12:37" (1/1) ... [2025-03-17 11:12:37,365 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f1f16c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:12:37, skipping insertion in model container [2025-03-17 11:12:37,365 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:12:37" (1/1) ... [2025-03-17 11:12:37,380 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:12:37,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:12:37,556 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:12:37,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:12:37,594 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:12:37,595 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:12:37 WrapperNode [2025-03-17 11:12:37,596 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:12:37,596 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:12:37,596 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:12:37,597 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:12:37,601 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:12:37" (1/1) ... [2025-03-17 11:12:37,609 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:12:37" (1/1) ... [2025-03-17 11:12:37,632 INFO L138 Inliner]: procedures = 23, calls = 26, calls flagged for inlining = 10, calls inlined = 12, statements flattened = 185 [2025-03-17 11:12:37,632 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:12:37,633 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:12:37,633 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:12:37,633 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:12:37,640 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:12:37" (1/1) ... [2025-03-17 11:12:37,640 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:12:37" (1/1) ... [2025-03-17 11:12:37,646 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:12:37" (1/1) ... [2025-03-17 11:12:37,651 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:12:37" (1/1) ... [2025-03-17 11:12:37,665 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:12:37" (1/1) ... [2025-03-17 11:12:37,670 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:12:37" (1/1) ... [2025-03-17 11:12:37,671 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:12:37" (1/1) ... [2025-03-17 11:12:37,675 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:12:37" (1/1) ... [2025-03-17 11:12:37,677 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:12:37,678 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:12:37,678 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:12:37,678 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:12:37,682 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:12:37" (1/1) ... [2025-03-17 11:12:37,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:12:37,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:12:37,712 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-17 11:12:37,715 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-17 11:12:37,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:12:37,734 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-17 11:12:37,734 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-17 11:12:37,734 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-17 11:12:37,734 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-17 11:12:37,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 11:12:37,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 11:12:37,735 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 11:12:37,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:12:37,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:12:37,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 11:12:37,736 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 11:12:37,817 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:12:37,819 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:12:38,333 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 11:12:38,334 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:12:38,352 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:12:38,353 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:12:38,353 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:12:38 BoogieIcfgContainer [2025-03-17 11:12:38,353 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:12:38,354 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:12:38,354 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:12:38,357 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:12:38,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:12:37" (1/3) ... [2025-03-17 11:12:38,358 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36bad00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:12:38, skipping insertion in model container [2025-03-17 11:12:38,358 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:12:37" (2/3) ... [2025-03-17 11:12:38,358 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36bad00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:12:38, skipping insertion in model container [2025-03-17 11:12:38,358 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:12:38" (3/3) ... [2025-03-17 11:12:38,359 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-word-symm.wvr.c [2025-03-17 11:12:38,370 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:12:38,371 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-word-symm.wvr.c that has 3 procedures, 450 locations, 1 initial locations, 4 loop locations, and 54 error locations. [2025-03-17 11:12:38,371 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 11:12:38,482 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-17 11:12:38,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 456 places, 473 transitions, 960 flow [2025-03-17 11:12:38,670 INFO L124 PetriNetUnfolderBase]: 24/471 cut-off events. [2025-03-17 11:12:38,673 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 11:12:38,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 480 conditions, 471 events. 24/471 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1104 event pairs, 0 based on Foata normal form. 0/393 useless extension candidates. Maximal degree in co-relation 290. Up to 3 conditions per place. [2025-03-17 11:12:38,680 INFO L82 GeneralOperation]: Start removeDead. Operand has 456 places, 473 transitions, 960 flow [2025-03-17 11:12:38,689 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 436 places, 451 transitions, 914 flow [2025-03-17 11:12:38,694 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:12:38,705 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;@6dd72d1c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:12:38,705 INFO L334 AbstractCegarLoop]: Starting to check reachability of 94 error locations. [2025-03-17 11:12:38,711 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:12:38,711 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2025-03-17 11:12:38,711 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:12:38,713 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:38,713 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:12:38,714 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-17 11:12:38,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:38,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1051833652, now seen corresponding path program 1 times [2025-03-17 11:12:38,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:38,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045274844] [2025-03-17 11:12:38,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:38,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:38,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 11:12:38,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 11:12:38,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:38,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:38,840 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-17 11:12:38,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:38,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045274844] [2025-03-17 11:12:38,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045274844] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:38,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:38,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:38,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271606903] [2025-03-17 11:12:38,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:38,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:38,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:38,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:38,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:38,903 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 473 [2025-03-17 11:12:38,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 436 places, 451 transitions, 914 flow. Second operand has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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-17 11:12:38,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:38,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 473 [2025-03-17 11:12:38,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:39,064 INFO L124 PetriNetUnfolderBase]: 37/782 cut-off events. [2025-03-17 11:12:39,064 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-17 11:12:39,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 827 conditions, 782 events. 37/782 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3435 event pairs, 8 based on Foata normal form. 13/648 useless extension candidates. Maximal degree in co-relation 591. Up to 28 conditions per place. [2025-03-17 11:12:39,074 INFO L140 encePairwiseOnDemand]: 462/473 looper letters, 11 selfloop transitions, 2 changer transitions 6/442 dead transitions. [2025-03-17 11:12:39,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 442 transitions, 922 flow [2025-03-17 11:12:39,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:39,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:39,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1366 transitions. [2025-03-17 11:12:39,089 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9626497533474278 [2025-03-17 11:12:39,092 INFO L175 Difference]: Start difference. First operand has 436 places, 451 transitions, 914 flow. Second operand 3 states and 1366 transitions. [2025-03-17 11:12:39,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 437 places, 442 transitions, 922 flow [2025-03-17 11:12:39,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 433 places, 442 transitions, 914 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 11:12:39,109 INFO L231 Difference]: Finished difference. Result has 433 places, 436 transitions, 880 flow [2025-03-17 11:12:39,111 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=888, PETRI_DIFFERENCE_MINUEND_PLACES=431, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=442, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=440, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=880, PETRI_PLACES=433, PETRI_TRANSITIONS=436} [2025-03-17 11:12:39,116 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -3 predicate places. [2025-03-17 11:12:39,116 INFO L471 AbstractCegarLoop]: Abstraction has has 433 places, 436 transitions, 880 flow [2025-03-17 11:12:39,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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-17 11:12:39,117 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:39,117 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:12:39,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:12:39,117 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-17 11:12:39,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:39,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1212271600, now seen corresponding path program 1 times [2025-03-17 11:12:39,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:39,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089139867] [2025-03-17 11:12:39,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:39,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:39,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 11:12:39,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 11:12:39,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:39,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:39,168 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-17 11:12:39,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:39,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089139867] [2025-03-17 11:12:39,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089139867] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:39,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:39,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:39,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235908415] [2025-03-17 11:12:39,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:39,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:39,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:39,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:39,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:39,204 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 473 [2025-03-17 11:12:39,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 433 places, 436 transitions, 880 flow. Second operand has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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-17 11:12:39,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:39,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 473 [2025-03-17 11:12:39,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:39,297 INFO L124 PetriNetUnfolderBase]: 37/766 cut-off events. [2025-03-17 11:12:39,298 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-17 11:12:39,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 804 conditions, 766 events. 37/766 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3392 event pairs, 8 based on Foata normal form. 0/632 useless extension candidates. Maximal degree in co-relation 772. Up to 28 conditions per place. [2025-03-17 11:12:39,304 INFO L140 encePairwiseOnDemand]: 470/473 looper letters, 11 selfloop transitions, 2 changer transitions 0/435 dead transitions. [2025-03-17 11:12:39,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 428 places, 435 transitions, 904 flow [2025-03-17 11:12:39,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:39,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:39,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1358 transitions. [2025-03-17 11:12:39,307 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9570119802677942 [2025-03-17 11:12:39,307 INFO L175 Difference]: Start difference. First operand has 433 places, 436 transitions, 880 flow. Second operand 3 states and 1358 transitions. [2025-03-17 11:12:39,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 428 places, 435 transitions, 904 flow [2025-03-17 11:12:39,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 426 places, 435 transitions, 900 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:39,314 INFO L231 Difference]: Finished difference. Result has 426 places, 435 transitions, 878 flow [2025-03-17 11:12:39,315 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=874, PETRI_DIFFERENCE_MINUEND_PLACES=424, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=878, PETRI_PLACES=426, PETRI_TRANSITIONS=435} [2025-03-17 11:12:39,315 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -10 predicate places. [2025-03-17 11:12:39,315 INFO L471 AbstractCegarLoop]: Abstraction has has 426 places, 435 transitions, 878 flow [2025-03-17 11:12:39,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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-17 11:12:39,316 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:39,316 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] [2025-03-17 11:12:39,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:12:39,317 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-17 11:12:39,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:39,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1791721410, now seen corresponding path program 1 times [2025-03-17 11:12:39,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:39,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356494695] [2025-03-17 11:12:39,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:39,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:39,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 11:12:39,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 11:12:39,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:39,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:39,359 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-17 11:12:39,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:39,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356494695] [2025-03-17 11:12:39,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356494695] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:39,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:39,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:39,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79250588] [2025-03-17 11:12:39,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:39,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:39,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:39,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:39,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:39,389 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 447 out of 473 [2025-03-17 11:12:39,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 426 places, 435 transitions, 878 flow. Second operand has 3 states, 3 states have (on average 448.3333333333333) internal successors, (1345), 3 states have internal predecessors, (1345), 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-17 11:12:39,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:39,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 447 of 473 [2025-03-17 11:12:39,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:39,498 INFO L124 PetriNetUnfolderBase]: 32/674 cut-off events. [2025-03-17 11:12:39,498 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-03-17 11:12:39,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 713 conditions, 674 events. 32/674 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2600 event pairs, 8 based on Foata normal form. 0/558 useless extension candidates. Maximal degree in co-relation 673. Up to 29 conditions per place. [2025-03-17 11:12:39,504 INFO L140 encePairwiseOnDemand]: 470/473 looper letters, 12 selfloop transitions, 2 changer transitions 0/434 dead transitions. [2025-03-17 11:12:39,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 427 places, 434 transitions, 904 flow [2025-03-17 11:12:39,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:39,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:39,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1356 transitions. [2025-03-17 11:12:39,508 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9556025369978859 [2025-03-17 11:12:39,508 INFO L175 Difference]: Start difference. First operand has 426 places, 435 transitions, 878 flow. Second operand 3 states and 1356 transitions. [2025-03-17 11:12:39,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 427 places, 434 transitions, 904 flow [2025-03-17 11:12:39,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 425 places, 434 transitions, 900 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:39,515 INFO L231 Difference]: Finished difference. Result has 425 places, 434 transitions, 876 flow [2025-03-17 11:12:39,516 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=872, PETRI_DIFFERENCE_MINUEND_PLACES=423, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=434, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=432, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=876, PETRI_PLACES=425, PETRI_TRANSITIONS=434} [2025-03-17 11:12:39,516 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -11 predicate places. [2025-03-17 11:12:39,516 INFO L471 AbstractCegarLoop]: Abstraction has has 425 places, 434 transitions, 876 flow [2025-03-17 11:12:39,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 448.3333333333333) internal successors, (1345), 3 states have internal predecessors, (1345), 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-17 11:12:39,517 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:39,517 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] [2025-03-17 11:12:39,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:12:39,517 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-17 11:12:39,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:39,518 INFO L85 PathProgramCache]: Analyzing trace with hash 2032644587, now seen corresponding path program 1 times [2025-03-17 11:12:39,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:39,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84777955] [2025-03-17 11:12:39,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:39,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:39,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-17 11:12:39,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 11:12:39,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:39,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:39,545 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-17 11:12:39,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:39,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84777955] [2025-03-17 11:12:39,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84777955] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:39,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:39,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:39,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798890647] [2025-03-17 11:12:39,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:39,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:39,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:39,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:39,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:39,570 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 447 out of 473 [2025-03-17 11:12:39,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 434 transitions, 876 flow. Second operand has 3 states, 3 states have (on average 448.3333333333333) internal successors, (1345), 3 states have internal predecessors, (1345), 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-17 11:12:39,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:39,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 447 of 473 [2025-03-17 11:12:39,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:39,635 INFO L124 PetriNetUnfolderBase]: 36/761 cut-off events. [2025-03-17 11:12:39,635 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2025-03-17 11:12:39,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 801 conditions, 761 events. 36/761 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3190 event pairs, 8 based on Foata normal form. 0/628 useless extension candidates. Maximal degree in co-relation 753. Up to 30 conditions per place. [2025-03-17 11:12:39,640 INFO L140 encePairwiseOnDemand]: 470/473 looper letters, 12 selfloop transitions, 2 changer transitions 0/433 dead transitions. [2025-03-17 11:12:39,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 433 transitions, 902 flow [2025-03-17 11:12:39,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:39,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:39,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1356 transitions. [2025-03-17 11:12:39,646 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9556025369978859 [2025-03-17 11:12:39,646 INFO L175 Difference]: Start difference. First operand has 425 places, 434 transitions, 876 flow. Second operand 3 states and 1356 transitions. [2025-03-17 11:12:39,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 426 places, 433 transitions, 902 flow [2025-03-17 11:12:39,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 424 places, 433 transitions, 898 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:39,651 INFO L231 Difference]: Finished difference. Result has 424 places, 433 transitions, 874 flow [2025-03-17 11:12:39,651 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=870, PETRI_DIFFERENCE_MINUEND_PLACES=422, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=431, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=874, PETRI_PLACES=424, PETRI_TRANSITIONS=433} [2025-03-17 11:12:39,652 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -12 predicate places. [2025-03-17 11:12:39,652 INFO L471 AbstractCegarLoop]: Abstraction has has 424 places, 433 transitions, 874 flow [2025-03-17 11:12:39,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 448.3333333333333) internal successors, (1345), 3 states have internal predecessors, (1345), 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-17 11:12:39,653 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:39,653 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:12:39,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:12:39,653 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-17 11:12:39,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:39,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1515680932, now seen corresponding path program 1 times [2025-03-17 11:12:39,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:39,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570852384] [2025-03-17 11:12:39,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:39,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:39,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-17 11:12:39,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 11:12:39,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:39,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:39,694 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-17 11:12:39,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:39,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570852384] [2025-03-17 11:12:39,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570852384] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:39,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:39,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:39,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76234006] [2025-03-17 11:12:39,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:39,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:39,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:39,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:39,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:39,717 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 443 out of 473 [2025-03-17 11:12:39,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 424 places, 433 transitions, 874 flow. Second operand has 3 states, 3 states have (on average 444.0) internal successors, (1332), 3 states have internal predecessors, (1332), 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-17 11:12:39,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:39,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 443 of 473 [2025-03-17 11:12:39,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:39,840 INFO L124 PetriNetUnfolderBase]: 83/1184 cut-off events. [2025-03-17 11:12:39,840 INFO L125 PetriNetUnfolderBase]: For 11/12 co-relation queries the response was YES. [2025-03-17 11:12:39,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1277 conditions, 1184 events. 83/1184 cut-off events. For 11/12 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 6771 event pairs, 24 based on Foata normal form. 0/979 useless extension candidates. Maximal degree in co-relation 1221. Up to 81 conditions per place. [2025-03-17 11:12:39,849 INFO L140 encePairwiseOnDemand]: 467/473 looper letters, 14 selfloop transitions, 1 changer transitions 0/428 dead transitions. [2025-03-17 11:12:39,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 421 places, 428 transitions, 894 flow [2025-03-17 11:12:39,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:39,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:39,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1349 transitions. [2025-03-17 11:12:39,852 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9506694855532065 [2025-03-17 11:12:39,852 INFO L175 Difference]: Start difference. First operand has 424 places, 433 transitions, 874 flow. Second operand 3 states and 1349 transitions. [2025-03-17 11:12:39,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 421 places, 428 transitions, 894 flow [2025-03-17 11:12:39,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 419 places, 428 transitions, 890 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:39,859 INFO L231 Difference]: Finished difference. Result has 419 places, 428 transitions, 862 flow [2025-03-17 11:12:39,863 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=860, PETRI_DIFFERENCE_MINUEND_PLACES=417, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=428, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=427, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=862, PETRI_PLACES=419, PETRI_TRANSITIONS=428} [2025-03-17 11:12:39,863 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -17 predicate places. [2025-03-17 11:12:39,864 INFO L471 AbstractCegarLoop]: Abstraction has has 419 places, 428 transitions, 862 flow [2025-03-17 11:12:39,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 444.0) internal successors, (1332), 3 states have internal predecessors, (1332), 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-17 11:12:39,865 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:39,865 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] [2025-03-17 11:12:39,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:12:39,865 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-17 11:12:39,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:39,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1084118604, now seen corresponding path program 1 times [2025-03-17 11:12:39,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:39,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908424687] [2025-03-17 11:12:39,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:39,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:39,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-17 11:12:39,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-17 11:12:39,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:39,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:40,350 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-17 11:12:40,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:40,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908424687] [2025-03-17 11:12:40,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908424687] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:40,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:40,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:12:40,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721562444] [2025-03-17 11:12:40,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:40,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:12:40,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:40,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:12:40,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:12:40,669 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 399 out of 473 [2025-03-17 11:12:40,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 419 places, 428 transitions, 862 flow. Second operand has 6 states, 6 states have (on average 400.5) internal successors, (2403), 6 states have internal predecessors, (2403), 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-17 11:12:40,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:40,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 399 of 473 [2025-03-17 11:12:40,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:40,937 INFO L124 PetriNetUnfolderBase]: 429/2630 cut-off events. [2025-03-17 11:12:40,937 INFO L125 PetriNetUnfolderBase]: For 46/47 co-relation queries the response was YES. [2025-03-17 11:12:40,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3352 conditions, 2630 events. 429/2630 cut-off events. For 46/47 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 19422 event pairs, 288 based on Foata normal form. 0/2187 useless extension candidates. Maximal degree in co-relation 3297. Up to 691 conditions per place. [2025-03-17 11:12:40,952 INFO L140 encePairwiseOnDemand]: 461/473 looper letters, 52 selfloop transitions, 10 changer transitions 0/426 dead transitions. [2025-03-17 11:12:40,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 422 places, 426 transitions, 982 flow [2025-03-17 11:12:40,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:12:40,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:12:40,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2458 transitions. [2025-03-17 11:12:40,956 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8661028893587033 [2025-03-17 11:12:40,956 INFO L175 Difference]: Start difference. First operand has 419 places, 428 transitions, 862 flow. Second operand 6 states and 2458 transitions. [2025-03-17 11:12:40,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 422 places, 426 transitions, 982 flow [2025-03-17 11:12:40,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 421 places, 426 transitions, 981 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:12:40,961 INFO L231 Difference]: Finished difference. Result has 421 places, 426 transitions, 877 flow [2025-03-17 11:12:40,962 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=857, PETRI_DIFFERENCE_MINUEND_PLACES=416, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=426, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=877, PETRI_PLACES=421, PETRI_TRANSITIONS=426} [2025-03-17 11:12:40,962 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -15 predicate places. [2025-03-17 11:12:40,962 INFO L471 AbstractCegarLoop]: Abstraction has has 421 places, 426 transitions, 877 flow [2025-03-17 11:12:40,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 400.5) internal successors, (2403), 6 states have internal predecessors, (2403), 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-17 11:12:40,964 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:40,964 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] [2025-03-17 11:12:40,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:12:40,964 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-17 11:12:40,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:40,965 INFO L85 PathProgramCache]: Analyzing trace with hash -808296099, now seen corresponding path program 1 times [2025-03-17 11:12:40,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:40,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536850341] [2025-03-17 11:12:40,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:40,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:40,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-17 11:12:40,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-17 11:12:40,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:40,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:41,003 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-17 11:12:41,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:41,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536850341] [2025-03-17 11:12:41,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536850341] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:41,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:41,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:41,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602069270] [2025-03-17 11:12:41,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:41,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:41,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:41,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:41,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:41,024 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 473 [2025-03-17 11:12:41,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 421 places, 426 transitions, 877 flow. Second operand has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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-17 11:12:41,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:41,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 473 [2025-03-17 11:12:41,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:41,091 INFO L124 PetriNetUnfolderBase]: 32/661 cut-off events. [2025-03-17 11:12:41,091 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-17 11:12:41,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 708 conditions, 661 events. 32/661 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2474 event pairs, 8 based on Foata normal form. 0/559 useless extension candidates. Maximal degree in co-relation 675. Up to 28 conditions per place. [2025-03-17 11:12:41,095 INFO L140 encePairwiseOnDemand]: 470/473 looper letters, 11 selfloop transitions, 2 changer transitions 0/425 dead transitions. [2025-03-17 11:12:41,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 422 places, 425 transitions, 901 flow [2025-03-17 11:12:41,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:41,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:41,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1358 transitions. [2025-03-17 11:12:41,098 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9570119802677942 [2025-03-17 11:12:41,098 INFO L175 Difference]: Start difference. First operand has 421 places, 426 transitions, 877 flow. Second operand 3 states and 1358 transitions. [2025-03-17 11:12:41,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 422 places, 425 transitions, 901 flow [2025-03-17 11:12:41,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 417 places, 425 transitions, 881 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:12:41,102 INFO L231 Difference]: Finished difference. Result has 417 places, 425 transitions, 859 flow [2025-03-17 11:12:41,102 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=855, PETRI_DIFFERENCE_MINUEND_PLACES=415, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=425, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=423, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=859, PETRI_PLACES=417, PETRI_TRANSITIONS=425} [2025-03-17 11:12:41,103 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -19 predicate places. [2025-03-17 11:12:41,103 INFO L471 AbstractCegarLoop]: Abstraction has has 417 places, 425 transitions, 859 flow [2025-03-17 11:12:41,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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-17 11:12:41,104 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:41,104 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] [2025-03-17 11:12:41,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:12:41,104 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-17 11:12:41,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:41,104 INFO L85 PathProgramCache]: Analyzing trace with hash -204137640, now seen corresponding path program 1 times [2025-03-17 11:12:41,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:41,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386979701] [2025-03-17 11:12:41,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:41,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:41,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 11:12:41,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 11:12:41,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:41,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:41,135 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-17 11:12:41,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:41,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386979701] [2025-03-17 11:12:41,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386979701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:41,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:41,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:41,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457703434] [2025-03-17 11:12:41,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:41,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:41,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:41,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:41,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:41,154 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 443 out of 473 [2025-03-17 11:12:41,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 417 places, 425 transitions, 859 flow. Second operand has 3 states, 3 states have (on average 444.0) internal successors, (1332), 3 states have internal predecessors, (1332), 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-17 11:12:41,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:41,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 443 of 473 [2025-03-17 11:12:41,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:41,261 INFO L124 PetriNetUnfolderBase]: 80/1050 cut-off events. [2025-03-17 11:12:41,261 INFO L125 PetriNetUnfolderBase]: For 14/15 co-relation queries the response was YES. [2025-03-17 11:12:41,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1145 conditions, 1050 events. 80/1050 cut-off events. For 14/15 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 5716 event pairs, 24 based on Foata normal form. 0/886 useless extension candidates. Maximal degree in co-relation 1089. Up to 82 conditions per place. [2025-03-17 11:12:41,269 INFO L140 encePairwiseOnDemand]: 467/473 looper letters, 14 selfloop transitions, 1 changer transitions 0/420 dead transitions. [2025-03-17 11:12:41,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 420 transitions, 879 flow [2025-03-17 11:12:41,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:41,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:41,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1349 transitions. [2025-03-17 11:12:41,271 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9506694855532065 [2025-03-17 11:12:41,271 INFO L175 Difference]: Start difference. First operand has 417 places, 425 transitions, 859 flow. Second operand 3 states and 1349 transitions. [2025-03-17 11:12:41,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 414 places, 420 transitions, 879 flow [2025-03-17 11:12:41,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 420 transitions, 875 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:41,276 INFO L231 Difference]: Finished difference. Result has 412 places, 420 transitions, 847 flow [2025-03-17 11:12:41,277 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=845, PETRI_DIFFERENCE_MINUEND_PLACES=410, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=420, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=847, PETRI_PLACES=412, PETRI_TRANSITIONS=420} [2025-03-17 11:12:41,277 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -24 predicate places. [2025-03-17 11:12:41,277 INFO L471 AbstractCegarLoop]: Abstraction has has 412 places, 420 transitions, 847 flow [2025-03-17 11:12:41,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 444.0) internal successors, (1332), 3 states have internal predecessors, (1332), 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-17 11:12:41,278 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:41,278 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-17 11:12:41,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:12:41,278 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-17 11:12:41,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:41,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1145486399, now seen corresponding path program 1 times [2025-03-17 11:12:41,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:41,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592415191] [2025-03-17 11:12:41,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:41,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:41,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 11:12:41,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 11:12:41,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:41,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:41,319 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-17 11:12:41,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:41,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592415191] [2025-03-17 11:12:41,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592415191] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:41,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:41,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:41,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788991462] [2025-03-17 11:12:41,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:41,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:41,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:41,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:41,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:41,341 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 473 [2025-03-17 11:12:41,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 420 transitions, 847 flow. Second operand has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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-17 11:12:41,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:41,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 473 [2025-03-17 11:12:41,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:41,404 INFO L124 PetriNetUnfolderBase]: 32/651 cut-off events. [2025-03-17 11:12:41,405 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-17 11:12:41,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 689 conditions, 651 events. 32/651 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2309 event pairs, 8 based on Foata normal form. 0/559 useless extension candidates. Maximal degree in co-relation 633. Up to 28 conditions per place. [2025-03-17 11:12:41,410 INFO L140 encePairwiseOnDemand]: 470/473 looper letters, 11 selfloop transitions, 2 changer transitions 0/419 dead transitions. [2025-03-17 11:12:41,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 419 transitions, 871 flow [2025-03-17 11:12:41,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:41,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:41,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1358 transitions. [2025-03-17 11:12:41,414 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9570119802677942 [2025-03-17 11:12:41,414 INFO L175 Difference]: Start difference. First operand has 412 places, 420 transitions, 847 flow. Second operand 3 states and 1358 transitions. [2025-03-17 11:12:41,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 419 transitions, 871 flow [2025-03-17 11:12:41,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 419 transitions, 870 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:12:41,418 INFO L231 Difference]: Finished difference. Result has 412 places, 419 transitions, 848 flow [2025-03-17 11:12:41,418 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=844, PETRI_DIFFERENCE_MINUEND_PLACES=410, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=417, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=848, PETRI_PLACES=412, PETRI_TRANSITIONS=419} [2025-03-17 11:12:41,419 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -24 predicate places. [2025-03-17 11:12:41,419 INFO L471 AbstractCegarLoop]: Abstraction has has 412 places, 419 transitions, 848 flow [2025-03-17 11:12:41,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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-17 11:12:41,420 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:41,420 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] [2025-03-17 11:12:41,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 11:12:41,420 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err18ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-17 11:12:41,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:41,421 INFO L85 PathProgramCache]: Analyzing trace with hash -59624377, now seen corresponding path program 1 times [2025-03-17 11:12:41,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:41,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604462458] [2025-03-17 11:12:41,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:41,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:41,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-17 11:12:41,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-17 11:12:41,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:41,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:41,460 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-17 11:12:41,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:41,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604462458] [2025-03-17 11:12:41,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604462458] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:41,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:41,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:41,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553261054] [2025-03-17 11:12:41,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:41,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:41,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:41,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:41,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:41,477 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 473 [2025-03-17 11:12:41,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 419 transitions, 848 flow. Second operand has 3 states, 3 states have (on average 447.3333333333333) internal successors, (1342), 3 states have internal predecessors, (1342), 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-17 11:12:41,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:41,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 473 [2025-03-17 11:12:41,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:41,558 INFO L124 PetriNetUnfolderBase]: 73/1148 cut-off events. [2025-03-17 11:12:41,559 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-17 11:12:41,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1222 conditions, 1148 events. 73/1148 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 6578 event pairs, 16 based on Foata normal form. 0/976 useless extension candidates. Maximal degree in co-relation 1166. Up to 58 conditions per place. [2025-03-17 11:12:41,564 INFO L140 encePairwiseOnDemand]: 467/473 looper letters, 14 selfloop transitions, 2 changer transitions 0/418 dead transitions. [2025-03-17 11:12:41,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 418 transitions, 879 flow [2025-03-17 11:12:41,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:41,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:41,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1358 transitions. [2025-03-17 11:12:41,567 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9570119802677942 [2025-03-17 11:12:41,567 INFO L175 Difference]: Start difference. First operand has 412 places, 419 transitions, 848 flow. Second operand 3 states and 1358 transitions. [2025-03-17 11:12:41,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 418 transitions, 879 flow [2025-03-17 11:12:41,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 418 transitions, 875 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:41,574 INFO L231 Difference]: Finished difference. Result has 409 places, 417 transitions, 850 flow [2025-03-17 11:12:41,575 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=836, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=415, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=850, PETRI_PLACES=409, PETRI_TRANSITIONS=417} [2025-03-17 11:12:41,576 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -27 predicate places. [2025-03-17 11:12:41,576 INFO L471 AbstractCegarLoop]: Abstraction has has 409 places, 417 transitions, 850 flow [2025-03-17 11:12:41,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 447.3333333333333) internal successors, (1342), 3 states have internal predecessors, (1342), 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-17 11:12:41,577 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:41,577 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] [2025-03-17 11:12:41,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 11:12:41,577 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err17ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-17 11:12:41,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:41,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1464422104, now seen corresponding path program 1 times [2025-03-17 11:12:41,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:41,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78560914] [2025-03-17 11:12:41,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:41,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:41,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-17 11:12:41,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 11:12:41,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:41,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:41,610 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-17 11:12:41,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:41,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78560914] [2025-03-17 11:12:41,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78560914] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:41,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:41,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:41,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198752900] [2025-03-17 11:12:41,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:41,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:41,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:41,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:41,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:41,627 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 473 [2025-03-17 11:12:41,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 417 transitions, 850 flow. Second operand has 3 states, 3 states have (on average 447.3333333333333) internal successors, (1342), 3 states have internal predecessors, (1342), 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-17 11:12:41,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:41,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 473 [2025-03-17 11:12:41,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:41,701 INFO L124 PetriNetUnfolderBase]: 69/1082 cut-off events. [2025-03-17 11:12:41,701 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-17 11:12:41,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1165 conditions, 1082 events. 69/1082 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 6214 event pairs, 16 based on Foata normal form. 0/938 useless extension candidates. Maximal degree in co-relation 1109. Up to 60 conditions per place. [2025-03-17 11:12:41,706 INFO L140 encePairwiseOnDemand]: 467/473 looper letters, 14 selfloop transitions, 2 changer transitions 0/416 dead transitions. [2025-03-17 11:12:41,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 416 transitions, 881 flow [2025-03-17 11:12:41,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:41,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:41,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1358 transitions. [2025-03-17 11:12:41,708 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9570119802677942 [2025-03-17 11:12:41,708 INFO L175 Difference]: Start difference. First operand has 409 places, 417 transitions, 850 flow. Second operand 3 states and 1358 transitions. [2025-03-17 11:12:41,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 407 places, 416 transitions, 881 flow [2025-03-17 11:12:41,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 407 places, 416 transitions, 881 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:12:41,713 INFO L231 Difference]: Finished difference. Result has 408 places, 415 transitions, 856 flow [2025-03-17 11:12:41,713 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=842, PETRI_DIFFERENCE_MINUEND_PLACES=405, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=856, PETRI_PLACES=408, PETRI_TRANSITIONS=415} [2025-03-17 11:12:41,714 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -28 predicate places. [2025-03-17 11:12:41,714 INFO L471 AbstractCegarLoop]: Abstraction has has 408 places, 415 transitions, 856 flow [2025-03-17 11:12:41,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 447.3333333333333) internal successors, (1342), 3 states have internal predecessors, (1342), 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-17 11:12:41,715 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:41,716 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] [2025-03-17 11:12:41,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 11:12:41,716 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-17 11:12:41,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:41,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1819694372, now seen corresponding path program 1 times [2025-03-17 11:12:41,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:41,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684239043] [2025-03-17 11:12:41,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:41,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:41,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-17 11:12:41,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-17 11:12:41,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:41,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:41,754 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-17 11:12:41,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:41,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684239043] [2025-03-17 11:12:41,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684239043] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:41,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:41,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:41,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795448832] [2025-03-17 11:12:41,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:41,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:41,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:41,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:41,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:41,781 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 473 [2025-03-17 11:12:41,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 415 transitions, 856 flow. Second operand has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 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-17 11:12:41,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:41,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 473 [2025-03-17 11:12:41,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:41,853 INFO L124 PetriNetUnfolderBase]: 47/946 cut-off events. [2025-03-17 11:12:41,854 INFO L125 PetriNetUnfolderBase]: For 2/6 co-relation queries the response was YES. [2025-03-17 11:12:41,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1004 conditions, 946 events. 47/946 cut-off events. For 2/6 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 4199 event pairs, 4 based on Foata normal form. 1/824 useless extension candidates. Maximal degree in co-relation 948. Up to 20 conditions per place. [2025-03-17 11:12:41,858 INFO L140 encePairwiseOnDemand]: 470/473 looper letters, 12 selfloop transitions, 2 changer transitions 0/415 dead transitions. [2025-03-17 11:12:41,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 415 transitions, 885 flow [2025-03-17 11:12:41,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:41,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:41,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1362 transitions. [2025-03-17 11:12:41,861 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.959830866807611 [2025-03-17 11:12:41,861 INFO L175 Difference]: Start difference. First operand has 408 places, 415 transitions, 856 flow. Second operand 3 states and 1362 transitions. [2025-03-17 11:12:41,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 415 transitions, 885 flow [2025-03-17 11:12:41,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 415 transitions, 885 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:12:41,866 INFO L231 Difference]: Finished difference. Result has 409 places, 414 transitions, 858 flow [2025-03-17 11:12:41,866 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=407, 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=858, PETRI_PLACES=409, PETRI_TRANSITIONS=414} [2025-03-17 11:12:41,867 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -27 predicate places. [2025-03-17 11:12:41,867 INFO L471 AbstractCegarLoop]: Abstraction has has 409 places, 414 transitions, 858 flow [2025-03-17 11:12:41,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 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-17 11:12:41,868 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:41,868 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-17 11:12:41,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 11:12:41,869 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-17 11:12:41,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:41,869 INFO L85 PathProgramCache]: Analyzing trace with hash 637945249, now seen corresponding path program 1 times [2025-03-17 11:12:41,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:41,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190215876] [2025-03-17 11:12:41,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:41,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:41,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-17 11:12:41,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-17 11:12:41,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:41,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:41,918 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-17 11:12:41,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:41,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190215876] [2025-03-17 11:12:41,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190215876] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:41,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:41,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:12:41,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697982620] [2025-03-17 11:12:41,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:41,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:41,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:41,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:41,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:41,928 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 473 [2025-03-17 11:12:41,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 414 transitions, 858 flow. Second operand has 3 states, 3 states have (on average 452.6666666666667) internal successors, (1358), 3 states have internal predecessors, (1358), 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-17 11:12:41,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:41,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 473 [2025-03-17 11:12:41,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:42,012 INFO L124 PetriNetUnfolderBase]: 44/817 cut-off events. [2025-03-17 11:12:42,013 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2025-03-17 11:12:42,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 883 conditions, 817 events. 44/817 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3832 event pairs, 6 based on Foata normal form. 0/714 useless extension candidates. Maximal degree in co-relation 826. Up to 25 conditions per place. [2025-03-17 11:12:42,018 INFO L140 encePairwiseOnDemand]: 469/473 looper letters, 11 selfloop transitions, 3 changer transitions 0/416 dead transitions. [2025-03-17 11:12:42,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 416 transitions, 891 flow [2025-03-17 11:12:42,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:42,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:42,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1368 transitions. [2025-03-17 11:12:42,020 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9640591966173362 [2025-03-17 11:12:42,020 INFO L175 Difference]: Start difference. First operand has 409 places, 414 transitions, 858 flow. Second operand 3 states and 1368 transitions. [2025-03-17 11:12:42,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 416 transitions, 891 flow [2025-03-17 11:12:42,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 416 transitions, 887 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:42,026 INFO L231 Difference]: Finished difference. Result has 411 places, 415 transitions, 872 flow [2025-03-17 11:12:42,026 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=414, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=872, PETRI_PLACES=411, PETRI_TRANSITIONS=415} [2025-03-17 11:12:42,027 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -25 predicate places. [2025-03-17 11:12:42,027 INFO L471 AbstractCegarLoop]: Abstraction has has 411 places, 415 transitions, 872 flow [2025-03-17 11:12:42,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 452.6666666666667) internal successors, (1358), 3 states have internal predecessors, (1358), 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-17 11:12:42,028 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:42,028 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] [2025-03-17 11:12:42,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 11:12:42,028 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-17 11:12:42,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:42,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1403507886, now seen corresponding path program 1 times [2025-03-17 11:12:42,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:42,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977944524] [2025-03-17 11:12:42,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:42,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:42,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 11:12:42,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 11:12:42,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:42,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:42,071 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-17 11:12:42,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:42,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977944524] [2025-03-17 11:12:42,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977944524] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:42,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:42,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:42,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042630004] [2025-03-17 11:12:42,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:42,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:42,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:42,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:42,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:42,083 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 473 [2025-03-17 11:12:42,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 415 transitions, 872 flow. Second operand has 3 states, 3 states have (on average 447.3333333333333) internal successors, (1342), 3 states have internal predecessors, (1342), 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-17 11:12:42,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:42,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 473 [2025-03-17 11:12:42,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:42,210 INFO L124 PetriNetUnfolderBase]: 100/1449 cut-off events. [2025-03-17 11:12:42,210 INFO L125 PetriNetUnfolderBase]: For 23/27 co-relation queries the response was YES. [2025-03-17 11:12:42,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1602 conditions, 1449 events. 100/1449 cut-off events. For 23/27 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 8572 event pairs, 12 based on Foata normal form. 1/1264 useless extension candidates. Maximal degree in co-relation 1544. Up to 89 conditions per place. [2025-03-17 11:12:42,218 INFO L140 encePairwiseOnDemand]: 467/473 looper letters, 16 selfloop transitions, 2 changer transitions 0/416 dead transitions. [2025-03-17 11:12:42,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 416 transitions, 913 flow [2025-03-17 11:12:42,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:42,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:42,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1360 transitions. [2025-03-17 11:12:42,221 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9584214235377027 [2025-03-17 11:12:42,221 INFO L175 Difference]: Start difference. First operand has 411 places, 415 transitions, 872 flow. Second operand 3 states and 1360 transitions. [2025-03-17 11:12:42,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 416 transitions, 913 flow [2025-03-17 11:12:42,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 407 places, 416 transitions, 907 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:42,226 INFO L231 Difference]: Finished difference. Result has 408 places, 413 transitions, 872 flow [2025-03-17 11:12:42,227 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=405, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=411, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=409, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=872, PETRI_PLACES=408, PETRI_TRANSITIONS=413} [2025-03-17 11:12:42,228 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -28 predicate places. [2025-03-17 11:12:42,228 INFO L471 AbstractCegarLoop]: Abstraction has has 408 places, 413 transitions, 872 flow [2025-03-17 11:12:42,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 447.3333333333333) internal successors, (1342), 3 states have internal predecessors, (1342), 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-17 11:12:42,229 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:42,229 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] [2025-03-17 11:12:42,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 11:12:42,230 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-17 11:12:42,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:42,230 INFO L85 PathProgramCache]: Analyzing trace with hash 253837257, now seen corresponding path program 1 times [2025-03-17 11:12:42,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:42,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113355600] [2025-03-17 11:12:42,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:42,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:42,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-17 11:12:42,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-17 11:12:42,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:42,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:42,265 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-17 11:12:42,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:42,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113355600] [2025-03-17 11:12:42,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113355600] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:42,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:42,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:42,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190963904] [2025-03-17 11:12:42,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:42,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:42,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:42,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:42,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:42,281 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 473 [2025-03-17 11:12:42,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 413 transitions, 872 flow. Second operand has 3 states, 3 states have (on average 450.6666666666667) internal successors, (1352), 3 states have internal predecessors, (1352), 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-17 11:12:42,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:42,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 473 [2025-03-17 11:12:42,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:42,355 INFO L124 PetriNetUnfolderBase]: 61/910 cut-off events. [2025-03-17 11:12:42,355 INFO L125 PetriNetUnfolderBase]: For 20/24 co-relation queries the response was YES. [2025-03-17 11:12:42,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1024 conditions, 910 events. 61/910 cut-off events. For 20/24 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 4492 event pairs, 8 based on Foata normal form. 0/800 useless extension candidates. Maximal degree in co-relation 966. Up to 52 conditions per place. [2025-03-17 11:12:42,361 INFO L140 encePairwiseOnDemand]: 470/473 looper letters, 12 selfloop transitions, 2 changer transitions 0/413 dead transitions. [2025-03-17 11:12:42,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 413 transitions, 901 flow [2025-03-17 11:12:42,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:42,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:42,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1362 transitions. [2025-03-17 11:12:42,363 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.959830866807611 [2025-03-17 11:12:42,363 INFO L175 Difference]: Start difference. First operand has 408 places, 413 transitions, 872 flow. Second operand 3 states and 1362 transitions. [2025-03-17 11:12:42,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 413 transitions, 901 flow [2025-03-17 11:12:42,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 413 transitions, 901 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:12:42,367 INFO L231 Difference]: Finished difference. Result has 409 places, 412 transitions, 874 flow [2025-03-17 11:12:42,368 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=870, PETRI_DIFFERENCE_MINUEND_PLACES=407, 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=874, PETRI_PLACES=409, PETRI_TRANSITIONS=412} [2025-03-17 11:12:42,368 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -27 predicate places. [2025-03-17 11:12:42,368 INFO L471 AbstractCegarLoop]: Abstraction has has 409 places, 412 transitions, 874 flow [2025-03-17 11:12:42,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.6666666666667) internal successors, (1352), 3 states have internal predecessors, (1352), 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-17 11:12:42,369 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:42,369 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:12:42,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 11:12:42,369 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-17 11:12:42,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:42,370 INFO L85 PathProgramCache]: Analyzing trace with hash -658984947, now seen corresponding path program 1 times [2025-03-17 11:12:42,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:42,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107614250] [2025-03-17 11:12:42,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:42,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:42,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-17 11:12:42,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-17 11:12:42,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:42,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:42,400 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-17 11:12:42,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:42,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107614250] [2025-03-17 11:12:42,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107614250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:42,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:42,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:12:42,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211146250] [2025-03-17 11:12:42,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:42,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:42,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:42,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:42,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:42,411 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 473 [2025-03-17 11:12:42,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 412 transitions, 874 flow. Second operand has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 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-17 11:12:42,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:42,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 473 [2025-03-17 11:12:42,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:42,506 INFO L124 PetriNetUnfolderBase]: 83/1039 cut-off events. [2025-03-17 11:12:42,506 INFO L125 PetriNetUnfolderBase]: For 37/40 co-relation queries the response was YES. [2025-03-17 11:12:42,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1220 conditions, 1039 events. 83/1039 cut-off events. For 37/40 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 5500 event pairs, 12 based on Foata normal form. 0/914 useless extension candidates. Maximal degree in co-relation 1161. Up to 88 conditions per place. [2025-03-17 11:12:42,512 INFO L140 encePairwiseOnDemand]: 469/473 looper letters, 11 selfloop transitions, 3 changer transitions 0/414 dead transitions. [2025-03-17 11:12:42,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 414 transitions, 907 flow [2025-03-17 11:12:42,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:42,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:42,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1368 transitions. [2025-03-17 11:12:42,515 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9640591966173362 [2025-03-17 11:12:42,515 INFO L175 Difference]: Start difference. First operand has 409 places, 412 transitions, 874 flow. Second operand 3 states and 1368 transitions. [2025-03-17 11:12:42,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 414 transitions, 907 flow [2025-03-17 11:12:42,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 414 transitions, 903 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:42,521 INFO L231 Difference]: Finished difference. Result has 411 places, 413 transitions, 888 flow [2025-03-17 11:12:42,521 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=870, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=409, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=888, PETRI_PLACES=411, PETRI_TRANSITIONS=413} [2025-03-17 11:12:42,521 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -25 predicate places. [2025-03-17 11:12:42,522 INFO L471 AbstractCegarLoop]: Abstraction has has 411 places, 413 transitions, 888 flow [2025-03-17 11:12:42,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 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-17 11:12:42,522 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:42,523 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:12:42,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 11:12:42,523 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-17 11:12:42,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:42,523 INFO L85 PathProgramCache]: Analyzing trace with hash -467876306, now seen corresponding path program 1 times [2025-03-17 11:12:42,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:42,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883827165] [2025-03-17 11:12:42,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:42,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:42,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-17 11:12:42,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-17 11:12:42,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:42,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:42,563 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-17 11:12:42,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:42,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883827165] [2025-03-17 11:12:42,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883827165] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:42,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:42,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:42,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316833304] [2025-03-17 11:12:42,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:42,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:42,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:42,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:42,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:42,586 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 473 [2025-03-17 11:12:42,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 413 transitions, 888 flow. Second operand has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 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-17 11:12:42,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:42,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 473 [2025-03-17 11:12:42,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:42,688 INFO L124 PetriNetUnfolderBase]: 75/1317 cut-off events. [2025-03-17 11:12:42,689 INFO L125 PetriNetUnfolderBase]: For 31/35 co-relation queries the response was YES. [2025-03-17 11:12:42,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1531 conditions, 1317 events. 75/1317 cut-off events. For 31/35 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 7223 event pairs, 4 based on Foata normal form. 0/1187 useless extension candidates. Maximal degree in co-relation 1471. Up to 36 conditions per place. [2025-03-17 11:12:42,697 INFO L140 encePairwiseOnDemand]: 470/473 looper letters, 12 selfloop transitions, 2 changer transitions 0/413 dead transitions. [2025-03-17 11:12:42,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 412 places, 413 transitions, 917 flow [2025-03-17 11:12:42,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:42,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:42,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1362 transitions. [2025-03-17 11:12:42,699 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.959830866807611 [2025-03-17 11:12:42,700 INFO L175 Difference]: Start difference. First operand has 411 places, 413 transitions, 888 flow. Second operand 3 states and 1362 transitions. [2025-03-17 11:12:42,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 412 places, 413 transitions, 917 flow [2025-03-17 11:12:42,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 410 places, 413 transitions, 911 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:42,706 INFO L231 Difference]: Finished difference. Result has 410 places, 412 transitions, 884 flow [2025-03-17 11:12:42,707 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=880, PETRI_DIFFERENCE_MINUEND_PLACES=408, 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=884, PETRI_PLACES=410, PETRI_TRANSITIONS=412} [2025-03-17 11:12:42,707 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -26 predicate places. [2025-03-17 11:12:42,707 INFO L471 AbstractCegarLoop]: Abstraction has has 410 places, 412 transitions, 884 flow [2025-03-17 11:12:42,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 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-17 11:12:42,708 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:42,708 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:12:42,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 11:12:42,709 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-17 11:12:42,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:42,710 INFO L85 PathProgramCache]: Analyzing trace with hash 2081945875, now seen corresponding path program 1 times [2025-03-17 11:12:42,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:42,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230496787] [2025-03-17 11:12:42,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:42,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:42,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 11:12:42,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 11:12:42,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:42,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:42,754 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-17 11:12:42,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:42,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230496787] [2025-03-17 11:12:42,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230496787] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:42,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:42,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:42,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798572831] [2025-03-17 11:12:42,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:42,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:42,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:42,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:42,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:42,772 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 473 [2025-03-17 11:12:42,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 410 places, 412 transitions, 884 flow. Second operand has 3 states, 3 states have (on average 447.6666666666667) internal successors, (1343), 3 states have internal predecessors, (1343), 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-17 11:12:42,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:42,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 473 [2025-03-17 11:12:42,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:42,888 INFO L124 PetriNetUnfolderBase]: 106/1509 cut-off events. [2025-03-17 11:12:42,888 INFO L125 PetriNetUnfolderBase]: For 15/17 co-relation queries the response was YES. [2025-03-17 11:12:42,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1750 conditions, 1509 events. 106/1509 cut-off events. For 15/17 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 9095 event pairs, 12 based on Foata normal form. 0/1359 useless extension candidates. Maximal degree in co-relation 1707. Up to 94 conditions per place. [2025-03-17 11:12:42,897 INFO L140 encePairwiseOnDemand]: 467/473 looper letters, 16 selfloop transitions, 2 changer transitions 0/413 dead transitions. [2025-03-17 11:12:42,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 408 places, 413 transitions, 925 flow [2025-03-17 11:12:42,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:42,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:42,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1360 transitions. [2025-03-17 11:12:42,899 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9584214235377027 [2025-03-17 11:12:42,900 INFO L175 Difference]: Start difference. First operand has 410 places, 412 transitions, 884 flow. Second operand 3 states and 1360 transitions. [2025-03-17 11:12:42,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 408 places, 413 transitions, 925 flow [2025-03-17 11:12:42,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 406 places, 413 transitions, 921 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:42,904 INFO L231 Difference]: Finished difference. Result has 407 places, 410 transitions, 886 flow [2025-03-17 11:12:42,905 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=872, PETRI_DIFFERENCE_MINUEND_PLACES=404, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=886, PETRI_PLACES=407, PETRI_TRANSITIONS=410} [2025-03-17 11:12:42,905 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -29 predicate places. [2025-03-17 11:12:42,905 INFO L471 AbstractCegarLoop]: Abstraction has has 407 places, 410 transitions, 886 flow [2025-03-17 11:12:42,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 447.6666666666667) internal successors, (1343), 3 states have internal predecessors, (1343), 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-17 11:12:42,906 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:42,906 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:12:42,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 11:12:42,906 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-17 11:12:42,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:42,907 INFO L85 PathProgramCache]: Analyzing trace with hash -39081996, now seen corresponding path program 1 times [2025-03-17 11:12:42,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:42,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989271665] [2025-03-17 11:12:42,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:42,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:42,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 11:12:42,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 11:12:42,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:42,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:43,053 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-17 11:12:43,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:43,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989271665] [2025-03-17 11:12:43,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989271665] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:43,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:43,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 11:12:43,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020949236] [2025-03-17 11:12:43,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:43,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 11:12:43,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:43,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 11:12:43,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:12:43,350 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 473 [2025-03-17 11:12:43,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 407 places, 410 transitions, 886 flow. Second operand has 8 states, 8 states have (on average 431.125) internal successors, (3449), 8 states have internal predecessors, (3449), 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-17 11:12:43,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:43,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 473 [2025-03-17 11:12:43,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:43,624 INFO L124 PetriNetUnfolderBase]: 132/2124 cut-off events. [2025-03-17 11:12:43,624 INFO L125 PetriNetUnfolderBase]: For 11/27 co-relation queries the response was YES. [2025-03-17 11:12:43,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2536 conditions, 2124 events. 132/2124 cut-off events. For 11/27 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 14664 event pairs, 17 based on Foata normal form. 6/1935 useless extension candidates. Maximal degree in co-relation 2474. Up to 81 conditions per place. [2025-03-17 11:12:43,632 INFO L140 encePairwiseOnDemand]: 456/473 looper letters, 44 selfloop transitions, 19 changer transitions 0/437 dead transitions. [2025-03-17 11:12:43,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 418 places, 437 transitions, 1079 flow [2025-03-17 11:12:43,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 11:12:43,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-17 11:12:43,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 5200 transitions. [2025-03-17 11:12:43,639 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.916138125440451 [2025-03-17 11:12:43,640 INFO L175 Difference]: Start difference. First operand has 407 places, 410 transitions, 886 flow. Second operand 12 states and 5200 transitions. [2025-03-17 11:12:43,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 418 places, 437 transitions, 1079 flow [2025-03-17 11:12:43,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 418 places, 437 transitions, 1079 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:12:43,645 INFO L231 Difference]: Finished difference. Result has 424 places, 420 transitions, 987 flow [2025-03-17 11:12:43,645 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=886, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=410, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=987, PETRI_PLACES=424, PETRI_TRANSITIONS=420} [2025-03-17 11:12:43,646 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -12 predicate places. [2025-03-17 11:12:43,646 INFO L471 AbstractCegarLoop]: Abstraction has has 424 places, 420 transitions, 987 flow [2025-03-17 11:12:43,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 431.125) internal successors, (3449), 8 states have internal predecessors, (3449), 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-17 11:12:43,647 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:43,647 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] [2025-03-17 11:12:43,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 11:12:43,648 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-17 11:12:43,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:43,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1561719526, now seen corresponding path program 1 times [2025-03-17 11:12:43,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:43,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370715924] [2025-03-17 11:12:43,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:43,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:43,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 11:12:43,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 11:12:43,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:43,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:43,692 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-17 11:12:43,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:43,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370715924] [2025-03-17 11:12:43,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370715924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:43,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:43,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:43,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971190864] [2025-03-17 11:12:43,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:43,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:43,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:43,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:43,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:43,713 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 473 [2025-03-17 11:12:43,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 424 places, 420 transitions, 987 flow. Second operand has 3 states, 3 states have (on average 450.6666666666667) internal successors, (1352), 3 states have internal predecessors, (1352), 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-17 11:12:43,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:43,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 473 [2025-03-17 11:12:43,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:43,848 INFO L124 PetriNetUnfolderBase]: 113/1635 cut-off events. [2025-03-17 11:12:43,849 INFO L125 PetriNetUnfolderBase]: For 54/59 co-relation queries the response was YES. [2025-03-17 11:12:43,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2020 conditions, 1635 events. 113/1635 cut-off events. For 54/59 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 10092 event pairs, 10 based on Foata normal form. 0/1493 useless extension candidates. Maximal degree in co-relation 1950. Up to 95 conditions per place. [2025-03-17 11:12:43,859 INFO L140 encePairwiseOnDemand]: 470/473 looper letters, 12 selfloop transitions, 2 changer transitions 0/420 dead transitions. [2025-03-17 11:12:43,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 425 places, 420 transitions, 1016 flow [2025-03-17 11:12:43,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:43,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:43,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1362 transitions. [2025-03-17 11:12:43,891 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.959830866807611 [2025-03-17 11:12:43,892 INFO L175 Difference]: Start difference. First operand has 424 places, 420 transitions, 987 flow. Second operand 3 states and 1362 transitions. [2025-03-17 11:12:43,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 425 places, 420 transitions, 1016 flow [2025-03-17 11:12:43,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 425 places, 420 transitions, 1016 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:12:43,897 INFO L231 Difference]: Finished difference. Result has 425 places, 419 transitions, 989 flow [2025-03-17 11:12:43,898 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=985, PETRI_DIFFERENCE_MINUEND_PLACES=423, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=417, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=989, PETRI_PLACES=425, PETRI_TRANSITIONS=419} [2025-03-17 11:12:43,898 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -11 predicate places. [2025-03-17 11:12:43,898 INFO L471 AbstractCegarLoop]: Abstraction has has 425 places, 419 transitions, 989 flow [2025-03-17 11:12:43,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.6666666666667) internal successors, (1352), 3 states have internal predecessors, (1352), 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-17 11:12:43,899 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:43,899 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] [2025-03-17 11:12:43,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 11:12:43,899 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-17 11:12:43,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:43,901 INFO L85 PathProgramCache]: Analyzing trace with hash 411516665, now seen corresponding path program 1 times [2025-03-17 11:12:43,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:43,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407745485] [2025-03-17 11:12:43,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:43,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:43,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-17 11:12:43,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-17 11:12:43,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:43,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:44,073 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-17 11:12:44,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:44,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407745485] [2025-03-17 11:12:44,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407745485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:44,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:44,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 11:12:44,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773086162] [2025-03-17 11:12:44,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:44,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 11:12:44,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:44,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 11:12:44,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:12:44,413 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 473 [2025-03-17 11:12:44,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 419 transitions, 989 flow. Second operand has 8 states, 8 states have (on average 431.25) internal successors, (3450), 8 states have internal predecessors, (3450), 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-17 11:12:44,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:44,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 473 [2025-03-17 11:12:44,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:44,627 INFO L124 PetriNetUnfolderBase]: 126/1437 cut-off events. [2025-03-17 11:12:44,627 INFO L125 PetriNetUnfolderBase]: For 85/90 co-relation queries the response was YES. [2025-03-17 11:12:44,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1917 conditions, 1437 events. 126/1437 cut-off events. For 85/90 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 8463 event pairs, 22 based on Foata normal form. 0/1314 useless extension candidates. Maximal degree in co-relation 1844. Up to 161 conditions per place. [2025-03-17 11:12:44,632 INFO L140 encePairwiseOnDemand]: 457/473 looper letters, 48 selfloop transitions, 17 changer transitions 0/443 dead transitions. [2025-03-17 11:12:44,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 435 places, 443 transitions, 1181 flow [2025-03-17 11:12:44,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 11:12:44,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-17 11:12:44,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 4772 transitions. [2025-03-17 11:12:44,639 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9171631750912935 [2025-03-17 11:12:44,639 INFO L175 Difference]: Start difference. First operand has 425 places, 419 transitions, 989 flow. Second operand 11 states and 4772 transitions. [2025-03-17 11:12:44,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 435 places, 443 transitions, 1181 flow [2025-03-17 11:12:44,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 433 places, 443 transitions, 1177 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:44,645 INFO L231 Difference]: Finished difference. Result has 436 places, 424 transitions, 1058 flow [2025-03-17 11:12:44,646 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=985, PETRI_DIFFERENCE_MINUEND_PLACES=423, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=402, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1058, PETRI_PLACES=436, PETRI_TRANSITIONS=424} [2025-03-17 11:12:44,646 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, 0 predicate places. [2025-03-17 11:12:44,646 INFO L471 AbstractCegarLoop]: Abstraction has has 436 places, 424 transitions, 1058 flow [2025-03-17 11:12:44,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 431.25) internal successors, (3450), 8 states have internal predecessors, (3450), 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-17 11:12:44,652 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:44,652 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] [2025-03-17 11:12:44,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 11:12:44,652 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-17 11:12:44,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:44,653 INFO L85 PathProgramCache]: Analyzing trace with hash -729080954, now seen corresponding path program 1 times [2025-03-17 11:12:44,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:44,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401886311] [2025-03-17 11:12:44,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:44,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:44,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-17 11:12:44,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-17 11:12:44,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:44,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:44,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:12:44,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:44,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401886311] [2025-03-17 11:12:44,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401886311] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:44,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:44,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 11:12:44,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559927142] [2025-03-17 11:12:44,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:44,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 11:12:44,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:44,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 11:12:44,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:12:45,133 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 473 [2025-03-17 11:12:45,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 436 places, 424 transitions, 1058 flow. Second operand has 8 states, 8 states have (on average 431.25) internal successors, (3450), 8 states have internal predecessors, (3450), 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-17 11:12:45,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:45,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 473 [2025-03-17 11:12:45,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:45,437 INFO L124 PetriNetUnfolderBase]: 189/2781 cut-off events. [2025-03-17 11:12:45,437 INFO L125 PetriNetUnfolderBase]: For 206/235 co-relation queries the response was YES. [2025-03-17 11:12:45,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3686 conditions, 2781 events. 189/2781 cut-off events. For 206/235 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 20612 event pairs, 28 based on Foata normal form. 8/2596 useless extension candidates. Maximal degree in co-relation 3607. Up to 129 conditions per place. [2025-03-17 11:12:45,452 INFO L140 encePairwiseOnDemand]: 457/473 looper letters, 50 selfloop transitions, 21 changer transitions 0/449 dead transitions. [2025-03-17 11:12:45,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 449 transitions, 1303 flow [2025-03-17 11:12:45,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 11:12:45,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-17 11:12:45,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 4763 transitions. [2025-03-17 11:12:45,459 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9154334038054969 [2025-03-17 11:12:45,459 INFO L175 Difference]: Start difference. First operand has 436 places, 424 transitions, 1058 flow. Second operand 11 states and 4763 transitions. [2025-03-17 11:12:45,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 449 transitions, 1303 flow [2025-03-17 11:12:45,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 449 transitions, 1282 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-17 11:12:45,466 INFO L231 Difference]: Finished difference. Result has 444 places, 438 transitions, 1191 flow [2025-03-17 11:12:45,467 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=1037, PETRI_DIFFERENCE_MINUEND_PLACES=429, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=424, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1191, PETRI_PLACES=444, PETRI_TRANSITIONS=438} [2025-03-17 11:12:45,467 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, 8 predicate places. [2025-03-17 11:12:45,467 INFO L471 AbstractCegarLoop]: Abstraction has has 444 places, 438 transitions, 1191 flow [2025-03-17 11:12:45,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 431.25) internal successors, (3450), 8 states have internal predecessors, (3450), 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-17 11:12:45,468 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:45,468 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] [2025-03-17 11:12:45,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 11:12:45,468 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-17 11:12:45,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:45,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1542308597, now seen corresponding path program 1 times [2025-03-17 11:12:45,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:45,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765821654] [2025-03-17 11:12:45,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:45,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:45,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-17 11:12:45,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-17 11:12:45,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:45,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:45,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:12:45,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:45,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765821654] [2025-03-17 11:12:45,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765821654] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:45,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:45,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 11:12:45,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222992533] [2025-03-17 11:12:45,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:45,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 11:12:45,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:45,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 11:12:45,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:12:45,798 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 473 [2025-03-17 11:12:45,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 444 places, 438 transitions, 1191 flow. Second operand has 8 states, 8 states have (on average 431.375) internal successors, (3451), 8 states have internal predecessors, (3451), 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-17 11:12:45,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:45,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 473 [2025-03-17 11:12:45,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:46,024 INFO L124 PetriNetUnfolderBase]: 167/1956 cut-off events. [2025-03-17 11:12:46,024 INFO L125 PetriNetUnfolderBase]: For 298/307 co-relation queries the response was YES. [2025-03-17 11:12:46,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2791 conditions, 1956 events. 167/1956 cut-off events. For 298/307 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 12940 event pairs, 25 based on Foata normal form. 8/1820 useless extension candidates. Maximal degree in co-relation 2705. Up to 167 conditions per place. [2025-03-17 11:12:46,038 INFO L140 encePairwiseOnDemand]: 456/473 looper letters, 44 selfloop transitions, 24 changer transitions 0/455 dead transitions. [2025-03-17 11:12:46,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 455 places, 455 transitions, 1402 flow [2025-03-17 11:12:46,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 11:12:46,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-17 11:12:46,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 5191 transitions. [2025-03-17 11:12:46,044 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9145525017618041 [2025-03-17 11:12:46,044 INFO L175 Difference]: Start difference. First operand has 444 places, 438 transitions, 1191 flow. Second operand 12 states and 5191 transitions. [2025-03-17 11:12:46,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 455 places, 455 transitions, 1402 flow [2025-03-17 11:12:46,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 454 places, 455 transitions, 1398 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:12:46,054 INFO L231 Difference]: Finished difference. Result has 458 places, 447 transitions, 1327 flow [2025-03-17 11:12:46,054 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=1187, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=438, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1327, PETRI_PLACES=458, PETRI_TRANSITIONS=447} [2025-03-17 11:12:46,054 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, 22 predicate places. [2025-03-17 11:12:46,055 INFO L471 AbstractCegarLoop]: Abstraction has has 458 places, 447 transitions, 1327 flow [2025-03-17 11:12:46,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 431.375) internal successors, (3451), 8 states have internal predecessors, (3451), 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-17 11:12:46,056 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:46,056 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] [2025-03-17 11:12:46,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 11:12:46,056 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-17 11:12:46,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:46,057 INFO L85 PathProgramCache]: Analyzing trace with hash 66379468, now seen corresponding path program 1 times [2025-03-17 11:12:46,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:46,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598842203] [2025-03-17 11:12:46,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:46,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:46,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-17 11:12:46,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-17 11:12:46,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:46,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:46,097 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-17 11:12:46,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:46,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598842203] [2025-03-17 11:12:46,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598842203] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:46,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:46,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:46,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848261666] [2025-03-17 11:12:46,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:46,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:46,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:46,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:46,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:46,112 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 447 out of 473 [2025-03-17 11:12:46,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 458 places, 447 transitions, 1327 flow. Second operand has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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-17 11:12:46,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:46,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 447 of 473 [2025-03-17 11:12:46,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:46,380 INFO L124 PetriNetUnfolderBase]: 136/2295 cut-off events. [2025-03-17 11:12:46,380 INFO L125 PetriNetUnfolderBase]: For 478/488 co-relation queries the response was YES. [2025-03-17 11:12:46,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3265 conditions, 2295 events. 136/2295 cut-off events. For 478/488 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 15489 event pairs, 10 based on Foata normal form. 0/2152 useless extension candidates. Maximal degree in co-relation 3175. Up to 76 conditions per place. [2025-03-17 11:12:46,396 INFO L140 encePairwiseOnDemand]: 469/473 looper letters, 12 selfloop transitions, 1 changer transitions 0/444 dead transitions. [2025-03-17 11:12:46,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 457 places, 444 transitions, 1347 flow [2025-03-17 11:12:46,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:46,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:46,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1357 transitions. [2025-03-17 11:12:46,397 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.95630725863284 [2025-03-17 11:12:46,397 INFO L175 Difference]: Start difference. First operand has 458 places, 447 transitions, 1327 flow. Second operand 3 states and 1357 transitions. [2025-03-17 11:12:46,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 457 places, 444 transitions, 1347 flow [2025-03-17 11:12:46,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 451 places, 444 transitions, 1330 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-17 11:12:46,406 INFO L231 Difference]: Finished difference. Result has 451 places, 444 transitions, 1306 flow [2025-03-17 11:12:46,407 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=1304, PETRI_DIFFERENCE_MINUEND_PLACES=449, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=444, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=443, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1306, PETRI_PLACES=451, PETRI_TRANSITIONS=444} [2025-03-17 11:12:46,407 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, 15 predicate places. [2025-03-17 11:12:46,407 INFO L471 AbstractCegarLoop]: Abstraction has has 451 places, 444 transitions, 1306 flow [2025-03-17 11:12:46,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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-17 11:12:46,407 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:46,407 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] [2025-03-17 11:12:46,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 11:12:46,408 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-17 11:12:46,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:46,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1898661781, now seen corresponding path program 1 times [2025-03-17 11:12:46,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:46,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812800790] [2025-03-17 11:12:46,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:46,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:46,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-17 11:12:46,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-17 11:12:46,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:46,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:46,437 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-17 11:12:46,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:46,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812800790] [2025-03-17 11:12:46,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812800790] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:46,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:46,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:12:46,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121280685] [2025-03-17 11:12:46,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:46,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:46,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:46,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:46,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:46,447 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 473 [2025-03-17 11:12:46,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 451 places, 444 transitions, 1306 flow. Second operand has 3 states, 3 states have (on average 454.3333333333333) internal successors, (1363), 3 states have internal predecessors, (1363), 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-17 11:12:46,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:46,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 473 [2025-03-17 11:12:46,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:46,660 INFO L124 PetriNetUnfolderBase]: 145/2626 cut-off events. [2025-03-17 11:12:46,660 INFO L125 PetriNetUnfolderBase]: For 484/491 co-relation queries the response was YES. [2025-03-17 11:12:46,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3615 conditions, 2626 events. 145/2626 cut-off events. For 484/491 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 19165 event pairs, 17 based on Foata normal form. 1/2459 useless extension candidates. Maximal degree in co-relation 3520. Up to 77 conditions per place. [2025-03-17 11:12:46,675 INFO L140 encePairwiseOnDemand]: 469/473 looper letters, 15 selfloop transitions, 2 changer transitions 0/449 dead transitions. [2025-03-17 11:12:46,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 453 places, 449 transitions, 1353 flow [2025-03-17 11:12:46,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:46,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:46,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1372 transitions. [2025-03-17 11:12:46,676 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.966878083157153 [2025-03-17 11:12:46,676 INFO L175 Difference]: Start difference. First operand has 451 places, 444 transitions, 1306 flow. Second operand 3 states and 1372 transitions. [2025-03-17 11:12:46,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 453 places, 449 transitions, 1353 flow [2025-03-17 11:12:46,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 452 places, 449 transitions, 1352 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:12:46,684 INFO L231 Difference]: Finished difference. Result has 454 places, 446 transitions, 1325 flow [2025-03-17 11:12:46,685 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=1305, PETRI_DIFFERENCE_MINUEND_PLACES=450, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=444, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=442, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1325, PETRI_PLACES=454, PETRI_TRANSITIONS=446} [2025-03-17 11:12:46,685 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, 18 predicate places. [2025-03-17 11:12:46,685 INFO L471 AbstractCegarLoop]: Abstraction has has 454 places, 446 transitions, 1325 flow [2025-03-17 11:12:46,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 454.3333333333333) internal successors, (1363), 3 states have internal predecessors, (1363), 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-17 11:12:46,685 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:46,686 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] [2025-03-17 11:12:46,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 11:12:46,686 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-17 11:12:46,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:46,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1767352025, now seen corresponding path program 1 times [2025-03-17 11:12:46,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:46,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316696592] [2025-03-17 11:12:46,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:46,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:46,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-17 11:12:46,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-17 11:12:46,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:46,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:46,735 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-17 11:12:46,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:46,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316696592] [2025-03-17 11:12:46,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316696592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:46,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:46,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:12:46,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748580830] [2025-03-17 11:12:46,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:46,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:46,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:46,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:46,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:46,751 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 473 [2025-03-17 11:12:46,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 454 places, 446 transitions, 1325 flow. Second operand has 3 states, 3 states have (on average 454.3333333333333) internal successors, (1363), 3 states have internal predecessors, (1363), 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-17 11:12:46,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:46,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 473 [2025-03-17 11:12:46,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:46,996 INFO L124 PetriNetUnfolderBase]: 139/2604 cut-off events. [2025-03-17 11:12:46,997 INFO L125 PetriNetUnfolderBase]: For 669/689 co-relation queries the response was YES. [2025-03-17 11:12:47,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3753 conditions, 2604 events. 139/2604 cut-off events. For 669/689 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 18894 event pairs, 13 based on Foata normal form. 13/2470 useless extension candidates. Maximal degree in co-relation 3657. Up to 72 conditions per place. [2025-03-17 11:12:47,008 INFO L140 encePairwiseOnDemand]: 469/473 looper letters, 17 selfloop transitions, 2 changer transitions 0/451 dead transitions. [2025-03-17 11:12:47,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 451 transitions, 1380 flow [2025-03-17 11:12:47,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:47,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:47,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1372 transitions. [2025-03-17 11:12:47,009 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.966878083157153 [2025-03-17 11:12:47,009 INFO L175 Difference]: Start difference. First operand has 454 places, 446 transitions, 1325 flow. Second operand 3 states and 1372 transitions. [2025-03-17 11:12:47,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 456 places, 451 transitions, 1380 flow [2025-03-17 11:12:47,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 455 places, 451 transitions, 1378 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:12:47,017 INFO L231 Difference]: Finished difference. Result has 457 places, 448 transitions, 1347 flow [2025-03-17 11:12:47,018 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=1323, PETRI_DIFFERENCE_MINUEND_PLACES=453, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=446, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=444, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1347, PETRI_PLACES=457, PETRI_TRANSITIONS=448} [2025-03-17 11:12:47,018 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, 21 predicate places. [2025-03-17 11:12:47,018 INFO L471 AbstractCegarLoop]: Abstraction has has 457 places, 448 transitions, 1347 flow [2025-03-17 11:12:47,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 454.3333333333333) internal successors, (1363), 3 states have internal predecessors, (1363), 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-17 11:12:47,018 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:47,018 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] [2025-03-17 11:12:47,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-17 11:12:47,019 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-17 11:12:47,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:47,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1809439521, now seen corresponding path program 1 times [2025-03-17 11:12:47,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:47,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095895992] [2025-03-17 11:12:47,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:47,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:47,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-17 11:12:47,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-17 11:12:47,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:47,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:47,049 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-17 11:12:47,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:47,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095895992] [2025-03-17 11:12:47,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095895992] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:47,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:47,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:47,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795249382] [2025-03-17 11:12:47,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:47,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:47,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:47,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:47,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:47,067 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 447 out of 473 [2025-03-17 11:12:47,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 457 places, 448 transitions, 1347 flow. Second operand has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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-17 11:12:47,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:47,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 447 of 473 [2025-03-17 11:12:47,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:47,256 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1172] thread2EXIT-->L102-11: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][272], [Black: 514#(not |thread2Thread1of1ForFork0_#t~short10|), 491#(= |#race~count1~0| 0), Black: 520#true, 473#(= |#race~n1~0| 0), 260#L102-11true, Black: 582#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 638#true, Black: 587#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 495#(= |#race~count2~0| 0), Black: 581#(<= ~n2~0 0), Black: 595#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 601#true, Black: 589#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 524#true, Black: 537#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 543#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 529#(<= ~n1~0 0), Black: 535#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 485#(= |#race~n2~0| 0), Black: 530#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 522#(= |#race~get2~0| 0), Black: 489#true, Black: 620#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 606#(<= ~n2~0 0), Black: 607#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 493#true, Black: 630#(not (= ~count2~0 ~count1~0)), 507#(= |#race~get1~0| 0), Black: 502#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 633#true, Black: 505#true, Black: 572#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 558#(<= ~n1~0 0), 635#(= ~count2~0 ~count1~0), Black: 559#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0))]) [2025-03-17 11:12:47,257 INFO L294 olderBase$Statistics]: this new event has 238 ancestors and is cut-off event [2025-03-17 11:12:47,257 INFO L297 olderBase$Statistics]: existing Event has 260 ancestors and is cut-off event [2025-03-17 11:12:47,257 INFO L297 olderBase$Statistics]: existing Event has 229 ancestors and is cut-off event [2025-03-17 11:12:47,257 INFO L297 olderBase$Statistics]: existing Event has 229 ancestors and is cut-off event [2025-03-17 11:12:47,261 INFO L124 PetriNetUnfolderBase]: 128/2358 cut-off events. [2025-03-17 11:12:47,261 INFO L125 PetriNetUnfolderBase]: For 473/515 co-relation queries the response was YES. [2025-03-17 11:12:47,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3367 conditions, 2358 events. 128/2358 cut-off events. For 473/515 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 16600 event pairs, 10 based on Foata normal form. 9/2256 useless extension candidates. Maximal degree in co-relation 3274. Up to 99 conditions per place. [2025-03-17 11:12:47,276 INFO L140 encePairwiseOnDemand]: 467/473 looper letters, 6 selfloop transitions, 0 changer transitions 86/447 dead transitions. [2025-03-17 11:12:47,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 447 transitions, 1373 flow [2025-03-17 11:12:47,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:47,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:47,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1358 transitions. [2025-03-17 11:12:47,277 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9570119802677942 [2025-03-17 11:12:47,277 INFO L175 Difference]: Start difference. First operand has 457 places, 448 transitions, 1347 flow. Second operand 3 states and 1358 transitions. [2025-03-17 11:12:47,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 456 places, 447 transitions, 1373 flow [2025-03-17 11:12:47,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 455 places, 447 transitions, 1367 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-17 11:12:47,286 INFO L231 Difference]: Finished difference. Result has 455 places, 361 transitions, 932 flow [2025-03-17 11:12:47,287 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=1335, PETRI_DIFFERENCE_MINUEND_PLACES=453, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=445, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=932, PETRI_PLACES=455, PETRI_TRANSITIONS=361} [2025-03-17 11:12:47,287 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, 19 predicate places. [2025-03-17 11:12:47,287 INFO L471 AbstractCegarLoop]: Abstraction has has 455 places, 361 transitions, 932 flow [2025-03-17 11:12:47,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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-17 11:12:47,288 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:47,288 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:12:47,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 11:12:47,288 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-17 11:12:47,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:47,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1783752035, now seen corresponding path program 1 times [2025-03-17 11:12:47,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:47,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781270923] [2025-03-17 11:12:47,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:47,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:47,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-17 11:12:47,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-17 11:12:47,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:47,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:47,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:12:47,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:47,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781270923] [2025-03-17 11:12:47,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781270923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:47,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:47,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:12:47,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059892511] [2025-03-17 11:12:47,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:47,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:12:47,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:47,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:12:47,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:12:47,912 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 434 out of 473 [2025-03-17 11:12:47,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 455 places, 361 transitions, 932 flow. Second operand has 6 states, 6 states have (on average 436.8333333333333) internal successors, (2621), 6 states have internal predecessors, (2621), 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-17 11:12:47,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:47,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 434 of 473 [2025-03-17 11:12:47,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:48,082 INFO L124 PetriNetUnfolderBase]: 85/1368 cut-off events. [2025-03-17 11:12:48,082 INFO L125 PetriNetUnfolderBase]: For 209/210 co-relation queries the response was YES. [2025-03-17 11:12:48,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1987 conditions, 1368 events. 85/1368 cut-off events. For 209/210 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 8422 event pairs, 4 based on Foata normal form. 0/1284 useless extension candidates. Maximal degree in co-relation 1958. Up to 43 conditions per place. [2025-03-17 11:12:48,091 INFO L140 encePairwiseOnDemand]: 465/473 looper letters, 25 selfloop transitions, 6 changer transitions 0/364 dead transitions. [2025-03-17 11:12:48,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 364 transitions, 1008 flow [2025-03-17 11:12:48,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:12:48,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:12:48,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2637 transitions. [2025-03-17 11:12:48,092 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9291754756871036 [2025-03-17 11:12:48,092 INFO L175 Difference]: Start difference. First operand has 455 places, 361 transitions, 932 flow. Second operand 6 states and 2637 transitions. [2025-03-17 11:12:48,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 364 transitions, 1008 flow [2025-03-17 11:12:48,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 364 transitions, 908 flow, removed 24 selfloop flow, removed 26 redundant places. [2025-03-17 11:12:48,097 INFO L231 Difference]: Finished difference. Result has 374 places, 360 transitions, 851 flow [2025-03-17 11:12:48,097 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=832, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=851, PETRI_PLACES=374, PETRI_TRANSITIONS=360} [2025-03-17 11:12:48,098 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -62 predicate places. [2025-03-17 11:12:48,098 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 360 transitions, 851 flow [2025-03-17 11:12:48,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 436.8333333333333) internal successors, (2621), 6 states have internal predecessors, (2621), 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-17 11:12:48,098 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:48,098 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] [2025-03-17 11:12:48,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-17 11:12:48,099 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-17 11:12:48,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:48,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1721151774, now seen corresponding path program 1 times [2025-03-17 11:12:48,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:48,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868025743] [2025-03-17 11:12:48,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:48,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:48,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-17 11:12:48,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-17 11:12:48,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:48,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:48,396 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:12:48,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:48,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868025743] [2025-03-17 11:12:48,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868025743] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:48,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:48,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:12:48,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109476347] [2025-03-17 11:12:48,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:48,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:12:48,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:48,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:12:48,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:12:48,780 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 434 out of 473 [2025-03-17 11:12:48,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 360 transitions, 851 flow. Second operand has 6 states, 6 states have (on average 437.0) internal successors, (2622), 6 states have internal predecessors, (2622), 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-17 11:12:48,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:48,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 434 of 473 [2025-03-17 11:12:48,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:48,917 INFO L124 PetriNetUnfolderBase]: 89/1146 cut-off events. [2025-03-17 11:12:48,917 INFO L125 PetriNetUnfolderBase]: For 68/71 co-relation queries the response was YES. [2025-03-17 11:12:48,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1533 conditions, 1146 events. 89/1146 cut-off events. For 68/71 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 6482 event pairs, 5 based on Foata normal form. 0/1085 useless extension candidates. Maximal degree in co-relation 1516. Up to 66 conditions per place. [2025-03-17 11:12:48,924 INFO L140 encePairwiseOnDemand]: 465/473 looper letters, 25 selfloop transitions, 6 changer transitions 0/363 dead transitions. [2025-03-17 11:12:48,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 363 transitions, 923 flow [2025-03-17 11:12:48,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:12:48,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:12:48,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2637 transitions. [2025-03-17 11:12:48,926 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9291754756871036 [2025-03-17 11:12:48,926 INFO L175 Difference]: Start difference. First operand has 374 places, 360 transitions, 851 flow. Second operand 6 states and 2637 transitions. [2025-03-17 11:12:48,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 363 transitions, 923 flow [2025-03-17 11:12:48,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 363 transitions, 914 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 11:12:48,931 INFO L231 Difference]: Finished difference. Result has 374 places, 359 transitions, 857 flow [2025-03-17 11:12:48,931 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=838, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=857, PETRI_PLACES=374, PETRI_TRANSITIONS=359} [2025-03-17 11:12:48,932 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -62 predicate places. [2025-03-17 11:12:48,932 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 359 transitions, 857 flow [2025-03-17 11:12:48,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 437.0) internal successors, (2622), 6 states have internal predecessors, (2622), 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-17 11:12:48,932 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:48,932 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:12:48,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-17 11:12:48,933 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-17 11:12:48,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:48,933 INFO L85 PathProgramCache]: Analyzing trace with hash 854681217, now seen corresponding path program 1 times [2025-03-17 11:12:48,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:48,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129233086] [2025-03-17 11:12:48,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:48,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:48,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-17 11:12:48,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-17 11:12:48,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:48,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:49,252 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:12:49,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:49,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129233086] [2025-03-17 11:12:49,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129233086] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:49,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:49,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:12:49,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484146179] [2025-03-17 11:12:49,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:49,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:12:49,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:49,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:12:49,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:12:49,532 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 434 out of 473 [2025-03-17 11:12:49,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 359 transitions, 857 flow. Second operand has 6 states, 6 states have (on average 436.8333333333333) internal successors, (2621), 6 states have internal predecessors, (2621), 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-17 11:12:49,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:49,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 434 of 473 [2025-03-17 11:12:49,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:49,647 INFO L124 PetriNetUnfolderBase]: 79/1333 cut-off events. [2025-03-17 11:12:49,647 INFO L125 PetriNetUnfolderBase]: For 52/53 co-relation queries the response was YES. [2025-03-17 11:12:49,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1758 conditions, 1333 events. 79/1333 cut-off events. For 52/53 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 7995 event pairs, 4 based on Foata normal form. 0/1273 useless extension candidates. Maximal degree in co-relation 1740. Up to 42 conditions per place. [2025-03-17 11:12:49,657 INFO L140 encePairwiseOnDemand]: 465/473 looper letters, 25 selfloop transitions, 6 changer transitions 0/361 dead transitions. [2025-03-17 11:12:49,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 361 transitions, 927 flow [2025-03-17 11:12:49,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:12:49,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:12:49,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2637 transitions. [2025-03-17 11:12:49,659 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9291754756871036 [2025-03-17 11:12:49,659 INFO L175 Difference]: Start difference. First operand has 374 places, 359 transitions, 857 flow. Second operand 6 states and 2637 transitions. [2025-03-17 11:12:49,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 361 transitions, 927 flow [2025-03-17 11:12:49,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 361 transitions, 918 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 11:12:49,663 INFO L231 Difference]: Finished difference. Result has 373 places, 357 transitions, 856 flow [2025-03-17 11:12:49,663 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=844, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=856, PETRI_PLACES=373, PETRI_TRANSITIONS=357} [2025-03-17 11:12:49,663 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -63 predicate places. [2025-03-17 11:12:49,663 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 357 transitions, 856 flow [2025-03-17 11:12:49,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 436.8333333333333) internal successors, (2621), 6 states have internal predecessors, (2621), 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-17 11:12:49,664 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:49,664 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] [2025-03-17 11:12:49,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-17 11:12:49,664 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-17 11:12:49,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:49,665 INFO L85 PathProgramCache]: Analyzing trace with hash 602967622, now seen corresponding path program 1 times [2025-03-17 11:12:49,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:49,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967985371] [2025-03-17 11:12:49,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:49,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:49,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-17 11:12:49,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-17 11:12:49,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:49,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:49,928 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:12:49,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:49,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967985371] [2025-03-17 11:12:49,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967985371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:49,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:49,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:12:49,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450123673] [2025-03-17 11:12:49,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:49,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:12:49,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:49,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:12:49,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:12:50,267 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 434 out of 473 [2025-03-17 11:12:50,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 357 transitions, 856 flow. Second operand has 6 states, 6 states have (on average 437.0) internal successors, (2622), 6 states have internal predecessors, (2622), 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-17 11:12:50,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:50,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 434 of 473 [2025-03-17 11:12:50,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:50,375 INFO L124 PetriNetUnfolderBase]: 84/1120 cut-off events. [2025-03-17 11:12:50,375 INFO L125 PetriNetUnfolderBase]: For 90/93 co-relation queries the response was YES. [2025-03-17 11:12:50,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1514 conditions, 1120 events. 84/1120 cut-off events. For 90/93 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 6149 event pairs, 5 based on Foata normal form. 0/1079 useless extension candidates. Maximal degree in co-relation 1496. Up to 61 conditions per place. [2025-03-17 11:12:50,381 INFO L140 encePairwiseOnDemand]: 465/473 looper letters, 25 selfloop transitions, 6 changer transitions 0/359 dead transitions. [2025-03-17 11:12:50,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 359 transitions, 926 flow [2025-03-17 11:12:50,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:12:50,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:12:50,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2637 transitions. [2025-03-17 11:12:50,383 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9291754756871036 [2025-03-17 11:12:50,383 INFO L175 Difference]: Start difference. First operand has 373 places, 357 transitions, 856 flow. Second operand 6 states and 2637 transitions. [2025-03-17 11:12:50,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 359 transitions, 926 flow [2025-03-17 11:12:50,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 359 transitions, 914 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:12:50,387 INFO L231 Difference]: Finished difference. Result has 371 places, 355 transitions, 852 flow [2025-03-17 11:12:50,388 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=840, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=852, PETRI_PLACES=371, PETRI_TRANSITIONS=355} [2025-03-17 11:12:50,388 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -65 predicate places. [2025-03-17 11:12:50,388 INFO L471 AbstractCegarLoop]: Abstraction has has 371 places, 355 transitions, 852 flow [2025-03-17 11:12:50,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 437.0) internal successors, (2622), 6 states have internal predecessors, (2622), 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-17 11:12:50,389 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:50,389 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] [2025-03-17 11:12:50,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-17 11:12:50,389 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-17 11:12:50,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:50,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1917655128, now seen corresponding path program 1 times [2025-03-17 11:12:50,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:50,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470035545] [2025-03-17 11:12:50,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:50,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:50,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-17 11:12:50,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-17 11:12:50,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:50,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:50,431 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 11:12:50,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:50,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470035545] [2025-03-17 11:12:50,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470035545] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:50,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:50,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:50,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631752891] [2025-03-17 11:12:50,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:50,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:50,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:50,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:50,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:50,453 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 473 [2025-03-17 11:12:50,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 355 transitions, 852 flow. Second operand has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 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-17 11:12:50,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:50,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 473 [2025-03-17 11:12:50,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:50,566 INFO L124 PetriNetUnfolderBase]: 66/1173 cut-off events. [2025-03-17 11:12:50,566 INFO L125 PetriNetUnfolderBase]: For 50/53 co-relation queries the response was YES. [2025-03-17 11:12:50,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1503 conditions, 1173 events. 66/1173 cut-off events. For 50/53 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 6330 event pairs, 4 based on Foata normal form. 0/1135 useless extension candidates. Maximal degree in co-relation 1485. Up to 36 conditions per place. [2025-03-17 11:12:50,571 INFO L140 encePairwiseOnDemand]: 470/473 looper letters, 7 selfloop transitions, 2 changer transitions 0/355 dead transitions. [2025-03-17 11:12:50,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 355 transitions, 871 flow [2025-03-17 11:12:50,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:50,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:50,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1357 transitions. [2025-03-17 11:12:50,573 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.95630725863284 [2025-03-17 11:12:50,573 INFO L175 Difference]: Start difference. First operand has 371 places, 355 transitions, 852 flow. Second operand 3 states and 1357 transitions. [2025-03-17 11:12:50,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 355 transitions, 871 flow [2025-03-17 11:12:50,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 355 transitions, 859 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:12:50,576 INFO L231 Difference]: Finished difference. Result has 367 places, 354 transitions, 842 flow [2025-03-17 11:12:50,577 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=838, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=842, PETRI_PLACES=367, PETRI_TRANSITIONS=354} [2025-03-17 11:12:50,577 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -69 predicate places. [2025-03-17 11:12:50,577 INFO L471 AbstractCegarLoop]: Abstraction has has 367 places, 354 transitions, 842 flow [2025-03-17 11:12:50,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 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-17 11:12:50,578 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:50,578 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] [2025-03-17 11:12:50,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-17 11:12:50,578 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-17 11:12:50,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:50,579 INFO L85 PathProgramCache]: Analyzing trace with hash -998548652, now seen corresponding path program 1 times [2025-03-17 11:12:50,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:50,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677706242] [2025-03-17 11:12:50,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:50,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:50,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-17 11:12:50,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-17 11:12:50,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:50,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:50,620 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:12:50,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:50,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677706242] [2025-03-17 11:12:50,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677706242] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:50,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:50,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:50,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068957621] [2025-03-17 11:12:50,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:50,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:50,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:50,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:50,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:50,643 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 473 [2025-03-17 11:12:50,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 354 transitions, 842 flow. Second operand has 3 states, 3 states have (on average 450.6666666666667) internal successors, (1352), 3 states have internal predecessors, (1352), 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-17 11:12:50,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:50,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 473 [2025-03-17 11:12:50,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:50,719 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1111] L77-2-->L77: Formula: (= |v_thread2Thread1of1ForFork0_#t~nondet17_3| |v_#race~res2~0_3|) InVars {thread2Thread1of1ForFork0_#t~nondet17=|v_thread2Thread1of1ForFork0_#t~nondet17_3|} OutVars{thread2Thread1of1ForFork0_#t~nondet17=|v_thread2Thread1of1ForFork0_#t~nondet17_3|, #race~res2~0=|v_#race~res2~0_3|} AuxVars[] AssignedVars[#race~res2~0][262], [Black: 514#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 646#(and (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1))) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), 491#(= |#race~count1~0| 0), Black: 520#true, Black: 653#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), 473#(= |#race~n1~0| 0), 158#L100true, 638#true, Black: 587#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 495#(= |#race~count2~0| 0), 601#true, 524#true, 485#(= |#race~n2~0| 0), Black: 535#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 522#(= |#race~get2~0| 0), Black: 489#true, 10#L77true, Black: 493#true, 667#true, 670#true, 507#(= |#race~get1~0| 0), Black: 630#(not (= ~count2~0 ~count1~0)), Black: 502#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 633#true, Black: 505#true, 635#(= ~count2~0 ~count1~0)]) [2025-03-17 11:12:50,719 INFO L294 olderBase$Statistics]: this new event has 248 ancestors and is cut-off event [2025-03-17 11:12:50,719 INFO L297 olderBase$Statistics]: existing Event has 233 ancestors and is cut-off event [2025-03-17 11:12:50,719 INFO L297 olderBase$Statistics]: existing Event has 264 ancestors and is cut-off event [2025-03-17 11:12:50,719 INFO L297 olderBase$Statistics]: existing Event has 233 ancestors and is cut-off event [2025-03-17 11:12:50,719 INFO L124 PetriNetUnfolderBase]: 65/1014 cut-off events. [2025-03-17 11:12:50,719 INFO L125 PetriNetUnfolderBase]: For 43/46 co-relation queries the response was YES. [2025-03-17 11:12:50,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1293 conditions, 1014 events. 65/1014 cut-off events. For 43/46 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 4997 event pairs, 4 based on Foata normal form. 0/983 useless extension candidates. Maximal degree in co-relation 1275. Up to 44 conditions per place. [2025-03-17 11:12:50,724 INFO L140 encePairwiseOnDemand]: 470/473 looper letters, 0 selfloop transitions, 0 changer transitions 354/354 dead transitions. [2025-03-17 11:12:50,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 354 transitions, 863 flow [2025-03-17 11:12:50,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:50,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:50,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1358 transitions. [2025-03-17 11:12:50,725 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9570119802677942 [2025-03-17 11:12:50,725 INFO L175 Difference]: Start difference. First operand has 367 places, 354 transitions, 842 flow. Second operand 3 states and 1358 transitions. [2025-03-17 11:12:50,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 354 transitions, 863 flow [2025-03-17 11:12:50,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 354 transitions, 859 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:50,729 INFO L231 Difference]: Finished difference. Result has 366 places, 0 transitions, 0 flow [2025-03-17 11:12:50,729 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=836, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=366, PETRI_TRANSITIONS=0} [2025-03-17 11:12:50,729 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -70 predicate places. [2025-03-17 11:12:50,729 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 0 transitions, 0 flow [2025-03-17 11:12:50,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.6666666666667) internal successors, (1352), 3 states have internal predecessors, (1352), 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-17 11:12:50,732 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (93 of 94 remaining) [2025-03-17 11:12:50,732 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (92 of 94 remaining) [2025-03-17 11:12:50,732 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (91 of 94 remaining) [2025-03-17 11:12:50,732 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (90 of 94 remaining) [2025-03-17 11:12:50,732 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (89 of 94 remaining) [2025-03-17 11:12:50,732 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (88 of 94 remaining) [2025-03-17 11:12:50,732 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (87 of 94 remaining) [2025-03-17 11:12:50,732 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (86 of 94 remaining) [2025-03-17 11:12:50,732 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (85 of 94 remaining) [2025-03-17 11:12:50,732 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (84 of 94 remaining) [2025-03-17 11:12:50,732 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (83 of 94 remaining) [2025-03-17 11:12:50,732 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (82 of 94 remaining) [2025-03-17 11:12:50,732 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (81 of 94 remaining) [2025-03-17 11:12:50,732 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (80 of 94 remaining) [2025-03-17 11:12:50,733 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (79 of 94 remaining) [2025-03-17 11:12:50,733 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (78 of 94 remaining) [2025-03-17 11:12:50,733 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (77 of 94 remaining) [2025-03-17 11:12:50,733 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (76 of 94 remaining) [2025-03-17 11:12:50,733 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (75 of 94 remaining) [2025-03-17 11:12:50,733 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (74 of 94 remaining) [2025-03-17 11:12:50,733 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (73 of 94 remaining) [2025-03-17 11:12:50,733 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (72 of 94 remaining) [2025-03-17 11:12:50,733 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (71 of 94 remaining) [2025-03-17 11:12:50,733 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (70 of 94 remaining) [2025-03-17 11:12:50,733 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (69 of 94 remaining) [2025-03-17 11:12:50,733 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (68 of 94 remaining) [2025-03-17 11:12:50,733 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (67 of 94 remaining) [2025-03-17 11:12:50,733 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (66 of 94 remaining) [2025-03-17 11:12:50,733 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (65 of 94 remaining) [2025-03-17 11:12:50,733 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (64 of 94 remaining) [2025-03-17 11:12:50,733 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (63 of 94 remaining) [2025-03-17 11:12:50,733 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (62 of 94 remaining) [2025-03-17 11:12:50,733 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (61 of 94 remaining) [2025-03-17 11:12:50,733 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (60 of 94 remaining) [2025-03-17 11:12:50,733 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (59 of 94 remaining) [2025-03-17 11:12:50,733 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (58 of 94 remaining) [2025-03-17 11:12:50,733 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (57 of 94 remaining) [2025-03-17 11:12:50,733 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (56 of 94 remaining) [2025-03-17 11:12:50,733 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (55 of 94 remaining) [2025-03-17 11:12:50,733 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (54 of 94 remaining) [2025-03-17 11:12:50,733 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (53 of 94 remaining) [2025-03-17 11:12:50,733 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (52 of 94 remaining) [2025-03-17 11:12:50,733 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (51 of 94 remaining) [2025-03-17 11:12:50,733 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (50 of 94 remaining) [2025-03-17 11:12:50,733 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (49 of 94 remaining) [2025-03-17 11:12:50,734 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (48 of 94 remaining) [2025-03-17 11:12:50,734 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (47 of 94 remaining) [2025-03-17 11:12:50,734 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (46 of 94 remaining) [2025-03-17 11:12:50,734 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (45 of 94 remaining) [2025-03-17 11:12:50,734 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (44 of 94 remaining) [2025-03-17 11:12:50,734 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (43 of 94 remaining) [2025-03-17 11:12:50,734 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (42 of 94 remaining) [2025-03-17 11:12:50,734 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (41 of 94 remaining) [2025-03-17 11:12:50,734 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (40 of 94 remaining) [2025-03-17 11:12:50,734 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (39 of 94 remaining) [2025-03-17 11:12:50,734 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 94 remaining) [2025-03-17 11:12:50,734 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (37 of 94 remaining) [2025-03-17 11:12:50,734 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (36 of 94 remaining) [2025-03-17 11:12:50,734 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (35 of 94 remaining) [2025-03-17 11:12:50,734 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (34 of 94 remaining) [2025-03-17 11:12:50,734 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (33 of 94 remaining) [2025-03-17 11:12:50,734 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (32 of 94 remaining) [2025-03-17 11:12:50,734 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (31 of 94 remaining) [2025-03-17 11:12:50,734 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (30 of 94 remaining) [2025-03-17 11:12:50,734 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (29 of 94 remaining) [2025-03-17 11:12:50,734 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (28 of 94 remaining) [2025-03-17 11:12:50,734 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (27 of 94 remaining) [2025-03-17 11:12:50,734 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (26 of 94 remaining) [2025-03-17 11:12:50,734 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (25 of 94 remaining) [2025-03-17 11:12:50,734 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (24 of 94 remaining) [2025-03-17 11:12:50,734 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (23 of 94 remaining) [2025-03-17 11:12:50,734 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (22 of 94 remaining) [2025-03-17 11:12:50,734 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (21 of 94 remaining) [2025-03-17 11:12:50,734 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (20 of 94 remaining) [2025-03-17 11:12:50,734 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (19 of 94 remaining) [2025-03-17 11:12:50,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (18 of 94 remaining) [2025-03-17 11:12:50,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (17 of 94 remaining) [2025-03-17 11:12:50,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (16 of 94 remaining) [2025-03-17 11:12:50,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (15 of 94 remaining) [2025-03-17 11:12:50,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (14 of 94 remaining) [2025-03-17 11:12:50,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (13 of 94 remaining) [2025-03-17 11:12:50,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (12 of 94 remaining) [2025-03-17 11:12:50,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (11 of 94 remaining) [2025-03-17 11:12:50,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (10 of 94 remaining) [2025-03-17 11:12:50,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (9 of 94 remaining) [2025-03-17 11:12:50,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (8 of 94 remaining) [2025-03-17 11:12:50,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (7 of 94 remaining) [2025-03-17 11:12:50,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (6 of 94 remaining) [2025-03-17 11:12:50,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (5 of 94 remaining) [2025-03-17 11:12:50,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (4 of 94 remaining) [2025-03-17 11:12:50,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (3 of 94 remaining) [2025-03-17 11:12:50,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (2 of 94 remaining) [2025-03-17 11:12:50,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (1 of 94 remaining) [2025-03-17 11:12:50,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (0 of 94 remaining) [2025-03-17 11:12:50,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-17 11:12:50,736 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:12:50,741 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-17 11:12:50,741 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 11:12:50,747 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 11:12:50 BasicIcfg [2025-03-17 11:12:50,747 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 11:12:50,748 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 11:12:50,748 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 11:12:50,748 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 11:12:50,749 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:12:38" (3/4) ... [2025-03-17 11:12:50,751 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 11:12:50,754 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-17 11:12:50,754 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-17 11:12:50,759 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2025-03-17 11:12:50,759 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-17 11:12:50,759 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 11:12:50,759 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 11:12:50,837 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 11:12:50,838 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 11:12:50,838 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 11:12:50,839 INFO L158 Benchmark]: Toolchain (without parser) took 13479.22ms. Allocated memory was 167.8MB in the beginning and 562.0MB in the end (delta: 394.3MB). Free memory was 123.0MB in the beginning and 392.5MB in the end (delta: -269.4MB). Peak memory consumption was 123.9MB. Max. memory is 16.1GB. [2025-03-17 11:12:50,839 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 120.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:12:50,839 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.66ms. Allocated memory is still 167.8MB. Free memory was 123.0MB in the beginning and 109.6MB in the end (delta: 13.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 11:12:50,840 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.06ms. Allocated memory is still 167.8MB. Free memory was 109.6MB in the beginning and 107.8MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 11:12:50,841 INFO L158 Benchmark]: Boogie Preprocessor took 44.93ms. Allocated memory is still 167.8MB. Free memory was 107.8MB in the beginning and 105.8MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:12:50,841 INFO L158 Benchmark]: IcfgBuilder took 674.89ms. Allocated memory is still 167.8MB. Free memory was 105.8MB in the beginning and 70.2MB in the end (delta: 35.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 11:12:50,842 INFO L158 Benchmark]: TraceAbstraction took 12393.09ms. Allocated memory was 167.8MB in the beginning and 562.0MB in the end (delta: 394.3MB). Free memory was 69.4MB in the beginning and 400.8MB in the end (delta: -331.5MB). Peak memory consumption was 65.2MB. Max. memory is 16.1GB. [2025-03-17 11:12:50,842 INFO L158 Benchmark]: Witness Printer took 89.67ms. Allocated memory is still 562.0MB. Free memory was 400.8MB in the beginning and 392.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 11:12:50,843 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.18ms. Allocated memory is still 201.3MB. Free memory is still 120.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 235.66ms. Allocated memory is still 167.8MB. Free memory was 123.0MB in the beginning and 109.6MB in the end (delta: 13.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.06ms. Allocated memory is still 167.8MB. Free memory was 109.6MB in the beginning and 107.8MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.93ms. Allocated memory is still 167.8MB. Free memory was 107.8MB in the beginning and 105.8MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 674.89ms. Allocated memory is still 167.8MB. Free memory was 105.8MB in the beginning and 70.2MB in the end (delta: 35.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 12393.09ms. Allocated memory was 167.8MB in the beginning and 562.0MB in the end (delta: 394.3MB). Free memory was 69.4MB in the beginning and 400.8MB in the end (delta: -331.5MB). Peak memory consumption was 65.2MB. Max. memory is 16.1GB. * Witness Printer took 89.67ms. Allocated memory is still 562.0MB. Free memory was 400.8MB in the beginning and 392.5MB 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: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: 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: 49]: 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: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: 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: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: 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: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: 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: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: 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: 71]: 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: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 668 locations, 703 edges, 94 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: 12.2s, OverallIterations: 33, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3948 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2415 mSDsluCounter, 3845 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3523 mSDsCounter, 634 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5495 IncrementalHoareTripleChecker+Invalid, 6129 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 634 mSolverCounterUnsat, 322 mSDtfsCounter, 5495 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 138 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1347occurred in iteration=26, InterpolantAutomatonStates: 148, 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, 2.7s InterpolantComputationTime, 4444 NumberOfCodeBlocks, 4444 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 4411 ConstructedInterpolants, 0 QuantifiedInterpolants, 5751 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 PerfectInterpolantSequences, 15/15 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 54 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-17 11:12:50,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE