./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-name-comparator-subst.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-name-comparator-subst.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3855d6da0b439f4c6a497e897f140f408df8c7fd65e3042f0fafae1979048a3d --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:11:41,057 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:11:41,107 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 11:11:41,110 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:11:41,111 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:11:41,130 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:11:41,131 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:11:41,131 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:11:41,131 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:11:41,131 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:11:41,131 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:11:41,131 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:11:41,131 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:11:41,131 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:11:41,132 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 11:11:41,132 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:11:41,132 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:11:41,132 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:11:41,133 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:11:41,133 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 11:11:41,133 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:11:41,133 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 11:11:41,133 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 11:11:41,133 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:11:41,133 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:11:41,134 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 11:11:41,134 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:11:41,134 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:11:41,134 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:11:41,134 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:11:41,134 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:11:41,134 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:11:41,134 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:11:41,134 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:11:41,134 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 11:11:41,134 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 11:11:41,135 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:11:41,135 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:11:41,135 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:11:41,135 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:11:41,135 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:11:41,135 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:11:41,135 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 -> 3855d6da0b439f4c6a497e897f140f408df8c7fd65e3042f0fafae1979048a3d [2025-03-17 11:11:41,345 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:11:41,355 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:11:41,356 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:11:41,357 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:11:41,357 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:11:41,358 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-name-comparator-subst.wvr.c [2025-03-17 11:11:42,472 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31d5ef2fd/a2799ede1c4e4641944031dbb6640e6f/FLAG6f73b0851 [2025-03-17 11:11:42,719 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:11:42,721 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-name-comparator-subst.wvr.c [2025-03-17 11:11:42,740 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31d5ef2fd/a2799ede1c4e4641944031dbb6640e6f/FLAG6f73b0851 [2025-03-17 11:11:43,042 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31d5ef2fd/a2799ede1c4e4641944031dbb6640e6f [2025-03-17 11:11:43,044 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:11:43,046 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:11:43,046 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:11:43,046 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:11:43,050 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:11:43,050 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:11:43" (1/1) ... [2025-03-17 11:11:43,051 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2da7f044 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:43, skipping insertion in model container [2025-03-17 11:11:43,051 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:11:43" (1/1) ... [2025-03-17 11:11:43,069 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:11:43,255 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:11:43,274 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:11:43,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:11:43,330 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:11:43,331 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:43 WrapperNode [2025-03-17 11:11:43,331 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:11:43,332 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:11:43,332 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:11:43,332 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:11:43,337 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:11:43" (1/1) ... [2025-03-17 11:11:43,355 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:11:43" (1/1) ... [2025-03-17 11:11:43,401 INFO L138 Inliner]: procedures = 25, calls = 30, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 842 [2025-03-17 11:11:43,401 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:11:43,401 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:11:43,401 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:11:43,402 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:11:43,411 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:43" (1/1) ... [2025-03-17 11:11:43,411 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:43" (1/1) ... [2025-03-17 11:11:43,418 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:43" (1/1) ... [2025-03-17 11:11:43,419 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:43" (1/1) ... [2025-03-17 11:11:43,438 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:43" (1/1) ... [2025-03-17 11:11:43,440 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:43" (1/1) ... [2025-03-17 11:11:43,441 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:43" (1/1) ... [2025-03-17 11:11:43,442 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:43" (1/1) ... [2025-03-17 11:11:43,445 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:11:43,451 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:11:43,451 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:11:43,451 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:11:43,452 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:43" (1/1) ... [2025-03-17 11:11:43,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:11:43,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:11:43,476 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:11:43,481 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:11:43,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:11:43,501 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-17 11:11:43,501 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-17 11:11:43,501 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-17 11:11:43,501 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-17 11:11:43,502 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-17 11:11:43,502 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-17 11:11:43,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 11:11:43,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 11:11:43,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 11:11:43,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:11:43,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:11:43,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 11:11:43,504 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:11:43,624 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:11:43,626 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:11:44,444 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 11:11:44,444 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:11:44,466 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:11:44,466 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:11:44,467 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:11:44 BoogieIcfgContainer [2025-03-17 11:11:44,467 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:11:44,468 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:11:44,469 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:11:44,472 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:11:44,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:11:43" (1/3) ... [2025-03-17 11:11:44,473 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1004883b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:11:44, skipping insertion in model container [2025-03-17 11:11:44,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:43" (2/3) ... [2025-03-17 11:11:44,473 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1004883b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:11:44, skipping insertion in model container [2025-03-17 11:11:44,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:11:44" (3/3) ... [2025-03-17 11:11:44,474 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-name-comparator-subst.wvr.c [2025-03-17 11:11:44,487 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:11:44,488 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-name-comparator-subst.wvr.c that has 4 procedures, 1055 locations, 1 initial locations, 4 loop locations, and 151 error locations. [2025-03-17 11:11:44,489 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 11:11:44,616 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-17 11:11:44,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1064 places, 1111 transitions, 2243 flow [2025-03-17 11:11:45,047 INFO L124 PetriNetUnfolderBase]: 57/1108 cut-off events. [2025-03-17 11:11:45,049 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-17 11:11:45,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1121 conditions, 1108 events. 57/1108 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3915 event pairs, 0 based on Foata normal form. 0/900 useless extension candidates. Maximal degree in co-relation 849. Up to 2 conditions per place. [2025-03-17 11:11:45,084 INFO L82 GeneralOperation]: Start removeDead. Operand has 1064 places, 1111 transitions, 2243 flow [2025-03-17 11:11:45,113 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1041 places, 1085 transitions, 2188 flow [2025-03-17 11:11:45,122 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:11:45,134 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;@2c1b0e16, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:11:45,135 INFO L334 AbstractCegarLoop]: Starting to check reachability of 283 error locations. [2025-03-17 11:11:45,139 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:11:45,140 INFO L124 PetriNetUnfolderBase]: 0/33 cut-off events. [2025-03-17 11:11:45,140 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:11:45,140 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:45,141 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] [2025-03-17 11:11:45,141 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-17 11:11:45,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:45,145 INFO L85 PathProgramCache]: Analyzing trace with hash -840992973, now seen corresponding path program 1 times [2025-03-17 11:11:45,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:45,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083277155] [2025-03-17 11:11:45,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:45,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:45,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 11:11:45,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 11:11:45,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:45,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:45,275 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:11:45,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:45,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083277155] [2025-03-17 11:11:45,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083277155] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:45,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:45,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:45,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206928633] [2025-03-17 11:11:45,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:45,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:45,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:45,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:45,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:45,381 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1069 out of 1111 [2025-03-17 11:11:45,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1041 places, 1085 transitions, 2188 flow. Second operand has 3 states, 3 states have (on average 1070.3333333333333) internal successors, (3211), 3 states have internal predecessors, (3211), 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:11:45,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:45,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1069 of 1111 [2025-03-17 11:11:45,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:47,806 INFO L124 PetriNetUnfolderBase]: 612/12182 cut-off events. [2025-03-17 11:11:47,806 INFO L125 PetriNetUnfolderBase]: For 67/85 co-relation queries the response was YES. [2025-03-17 11:11:47,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12467 conditions, 12182 events. 612/12182 cut-off events. For 67/85 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 123107 event pairs, 95 based on Foata normal form. 281/9858 useless extension candidates. Maximal degree in co-relation 12186. Up to 185 conditions per place. [2025-03-17 11:11:48,074 INFO L140 encePairwiseOnDemand]: 1091/1111 looper letters, 19 selfloop transitions, 2 changer transitions 2/1067 dead transitions. [2025-03-17 11:11:48,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1042 places, 1067 transitions, 2194 flow [2025-03-17 11:11:48,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:48,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:48,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3246 transitions. [2025-03-17 11:11:48,094 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9738973897389739 [2025-03-17 11:11:48,097 INFO L175 Difference]: Start difference. First operand has 1041 places, 1085 transitions, 2188 flow. Second operand 3 states and 3246 transitions. [2025-03-17 11:11:48,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1042 places, 1067 transitions, 2194 flow [2025-03-17 11:11:48,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1036 places, 1067 transitions, 2182 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-17 11:11:48,121 INFO L231 Difference]: Finished difference. Result has 1036 places, 1065 transitions, 2140 flow [2025-03-17 11:11:48,126 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2140, PETRI_DIFFERENCE_MINUEND_PLACES=1034, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1067, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1065, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2140, PETRI_PLACES=1036, PETRI_TRANSITIONS=1065} [2025-03-17 11:11:48,131 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -5 predicate places. [2025-03-17 11:11:48,131 INFO L471 AbstractCegarLoop]: Abstraction has has 1036 places, 1065 transitions, 2140 flow [2025-03-17 11:11:48,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1070.3333333333333) internal successors, (3211), 3 states have internal predecessors, (3211), 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:11:48,133 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:48,134 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] [2025-03-17 11:11:48,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:11:48,134 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-17 11:11:48,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:48,135 INFO L85 PathProgramCache]: Analyzing trace with hash 361844345, now seen corresponding path program 1 times [2025-03-17 11:11:48,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:48,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019383502] [2025-03-17 11:11:48,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:48,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:48,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 11:11:48,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 11:11:48,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:48,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:48,198 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:11:48,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:48,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019383502] [2025-03-17 11:11:48,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019383502] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:48,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:48,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:48,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590852085] [2025-03-17 11:11:48,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:48,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:48,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:48,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:48,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:48,249 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1069 out of 1111 [2025-03-17 11:11:48,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1036 places, 1065 transitions, 2140 flow. Second operand has 3 states, 3 states have (on average 1070.3333333333333) internal successors, (3211), 3 states have internal predecessors, (3211), 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:11:48,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:48,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1069 of 1111 [2025-03-17 11:11:48,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:49,268 INFO L124 PetriNetUnfolderBase]: 226/4392 cut-off events. [2025-03-17 11:11:49,268 INFO L125 PetriNetUnfolderBase]: For 13/20 co-relation queries the response was YES. [2025-03-17 11:11:49,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4521 conditions, 4392 events. 226/4392 cut-off events. For 13/20 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 33072 event pairs, 45 based on Foata normal form. 0/3471 useless extension candidates. Maximal degree in co-relation 4480. Up to 110 conditions per place. [2025-03-17 11:11:49,367 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 19 selfloop transitions, 2 changer transitions 0/1064 dead transitions. [2025-03-17 11:11:49,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1035 places, 1064 transitions, 2180 flow [2025-03-17 11:11:49,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:49,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:49,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3229 transitions. [2025-03-17 11:11:49,373 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9687968796879688 [2025-03-17 11:11:49,373 INFO L175 Difference]: Start difference. First operand has 1036 places, 1065 transitions, 2140 flow. Second operand 3 states and 3229 transitions. [2025-03-17 11:11:49,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1035 places, 1064 transitions, 2180 flow [2025-03-17 11:11:49,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1033 places, 1064 transitions, 2176 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:49,387 INFO L231 Difference]: Finished difference. Result has 1033 places, 1064 transitions, 2138 flow [2025-03-17 11:11:49,389 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2134, PETRI_DIFFERENCE_MINUEND_PLACES=1031, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1064, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1062, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2138, PETRI_PLACES=1033, PETRI_TRANSITIONS=1064} [2025-03-17 11:11:49,389 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -8 predicate places. [2025-03-17 11:11:49,389 INFO L471 AbstractCegarLoop]: Abstraction has has 1033 places, 1064 transitions, 2138 flow [2025-03-17 11:11:49,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1070.3333333333333) internal successors, (3211), 3 states have internal predecessors, (3211), 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:11:49,391 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:49,391 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] [2025-03-17 11:11:49,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:11:49,392 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-17 11:11:49,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:49,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1554658716, now seen corresponding path program 1 times [2025-03-17 11:11:49,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:49,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325907290] [2025-03-17 11:11:49,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:49,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:49,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 11:11:49,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 11:11:49,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:49,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:49,449 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:11:49,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:49,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325907290] [2025-03-17 11:11:49,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325907290] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:49,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:49,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:49,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419911353] [2025-03-17 11:11:49,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:49,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:49,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:49,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:49,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:49,502 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1069 out of 1111 [2025-03-17 11:11:49,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1033 places, 1064 transitions, 2138 flow. Second operand has 3 states, 3 states have (on average 1070.3333333333333) internal successors, (3211), 3 states have internal predecessors, (3211), 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:11:49,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:49,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1069 of 1111 [2025-03-17 11:11:49,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:50,555 INFO L124 PetriNetUnfolderBase]: 240/3577 cut-off events. [2025-03-17 11:11:50,556 INFO L125 PetriNetUnfolderBase]: For 42/75 co-relation queries the response was YES. [2025-03-17 11:11:50,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3776 conditions, 3577 events. 240/3577 cut-off events. For 42/75 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 27287 event pairs, 95 based on Foata normal form. 0/2835 useless extension candidates. Maximal degree in co-relation 3727. Up to 185 conditions per place. [2025-03-17 11:11:50,698 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 19 selfloop transitions, 2 changer transitions 0/1063 dead transitions. [2025-03-17 11:11:50,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1034 places, 1063 transitions, 2178 flow [2025-03-17 11:11:50,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:50,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:50,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3229 transitions. [2025-03-17 11:11:50,704 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9687968796879688 [2025-03-17 11:11:50,704 INFO L175 Difference]: Start difference. First operand has 1033 places, 1064 transitions, 2138 flow. Second operand 3 states and 3229 transitions. [2025-03-17 11:11:50,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1034 places, 1063 transitions, 2178 flow [2025-03-17 11:11:50,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1032 places, 1063 transitions, 2174 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:50,717 INFO L231 Difference]: Finished difference. Result has 1032 places, 1063 transitions, 2136 flow [2025-03-17 11:11:50,719 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2132, PETRI_DIFFERENCE_MINUEND_PLACES=1030, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1063, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1061, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2136, PETRI_PLACES=1032, PETRI_TRANSITIONS=1063} [2025-03-17 11:11:50,719 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -9 predicate places. [2025-03-17 11:11:50,720 INFO L471 AbstractCegarLoop]: Abstraction has has 1032 places, 1063 transitions, 2136 flow [2025-03-17 11:11:50,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1070.3333333333333) internal successors, (3211), 3 states have internal predecessors, (3211), 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:11:50,722 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:50,722 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] [2025-03-17 11:11:50,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:11:50,722 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-17 11:11:50,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:50,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1739502371, now seen corresponding path program 1 times [2025-03-17 11:11:50,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:50,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727210271] [2025-03-17 11:11:50,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:50,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:50,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 11:11:50,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 11:11:50,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:50,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:50,784 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:11:50,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:50,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727210271] [2025-03-17 11:11:50,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727210271] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:50,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:50,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:50,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363502192] [2025-03-17 11:11:50,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:50,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:50,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:50,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:50,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:50,833 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1070 out of 1111 [2025-03-17 11:11:50,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1032 places, 1063 transitions, 2136 flow. Second operand has 3 states, 3 states have (on average 1071.3333333333333) internal successors, (3214), 3 states have internal predecessors, (3214), 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:11:50,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:50,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1070 of 1111 [2025-03-17 11:11:50,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:51,951 INFO L124 PetriNetUnfolderBase]: 245/5502 cut-off events. [2025-03-17 11:11:51,951 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-03-17 11:11:52,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5578 conditions, 5502 events. 245/5502 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 43739 event pairs, 16 based on Foata normal form. 0/4349 useless extension candidates. Maximal degree in co-relation 5521. Up to 51 conditions per place. [2025-03-17 11:11:52,243 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 18 selfloop transitions, 2 changer transitions 0/1062 dead transitions. [2025-03-17 11:11:52,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1033 places, 1062 transitions, 2174 flow [2025-03-17 11:11:52,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:52,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:52,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3231 transitions. [2025-03-17 11:11:52,249 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9693969396939695 [2025-03-17 11:11:52,249 INFO L175 Difference]: Start difference. First operand has 1032 places, 1063 transitions, 2136 flow. Second operand 3 states and 3231 transitions. [2025-03-17 11:11:52,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1033 places, 1062 transitions, 2174 flow [2025-03-17 11:11:52,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1031 places, 1062 transitions, 2170 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:52,260 INFO L231 Difference]: Finished difference. Result has 1031 places, 1062 transitions, 2134 flow [2025-03-17 11:11:52,261 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2130, PETRI_DIFFERENCE_MINUEND_PLACES=1029, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1062, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1060, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2134, PETRI_PLACES=1031, PETRI_TRANSITIONS=1062} [2025-03-17 11:11:52,262 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -10 predicate places. [2025-03-17 11:11:52,262 INFO L471 AbstractCegarLoop]: Abstraction has has 1031 places, 1062 transitions, 2134 flow [2025-03-17 11:11:52,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1071.3333333333333) internal successors, (3214), 3 states have internal predecessors, (3214), 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:11:52,264 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:52,264 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] [2025-03-17 11:11:52,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:11:52,264 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-17 11:11:52,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:52,264 INFO L85 PathProgramCache]: Analyzing trace with hash 2062401716, now seen corresponding path program 1 times [2025-03-17 11:11:52,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:52,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2719808] [2025-03-17 11:11:52,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:52,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:52,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-17 11:11:52,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-17 11:11:52,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:52,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:52,328 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:11:52,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:52,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2719808] [2025-03-17 11:11:52,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2719808] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:52,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:52,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:52,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140486362] [2025-03-17 11:11:52,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:52,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:52,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:52,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:52,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:52,364 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1073 out of 1111 [2025-03-17 11:11:52,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1031 places, 1062 transitions, 2134 flow. Second operand has 3 states, 3 states have (on average 1074.3333333333333) internal successors, (3223), 3 states have internal predecessors, (3223), 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:11:52,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:52,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1073 of 1111 [2025-03-17 11:11:52,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:52,687 INFO L124 PetriNetUnfolderBase]: 73/1611 cut-off events. [2025-03-17 11:11:52,687 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 11:11:52,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1672 conditions, 1611 events. 73/1611 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 8223 event pairs, 12 based on Foata normal form. 0/1297 useless extension candidates. Maximal degree in co-relation 1607. Up to 40 conditions per place. [2025-03-17 11:11:52,744 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 15 selfloop transitions, 2 changer transitions 0/1061 dead transitions. [2025-03-17 11:11:52,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1032 places, 1061 transitions, 2166 flow [2025-03-17 11:11:52,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:52,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:52,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3237 transitions. [2025-03-17 11:11:52,749 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9711971197119712 [2025-03-17 11:11:52,749 INFO L175 Difference]: Start difference. First operand has 1031 places, 1062 transitions, 2134 flow. Second operand 3 states and 3237 transitions. [2025-03-17 11:11:52,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1032 places, 1061 transitions, 2166 flow [2025-03-17 11:11:52,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1030 places, 1061 transitions, 2162 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:52,761 INFO L231 Difference]: Finished difference. Result has 1030 places, 1061 transitions, 2132 flow [2025-03-17 11:11:52,763 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2128, PETRI_DIFFERENCE_MINUEND_PLACES=1028, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1061, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1059, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2132, PETRI_PLACES=1030, PETRI_TRANSITIONS=1061} [2025-03-17 11:11:52,763 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -11 predicate places. [2025-03-17 11:11:52,763 INFO L471 AbstractCegarLoop]: Abstraction has has 1030 places, 1061 transitions, 2132 flow [2025-03-17 11:11:52,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1074.3333333333333) internal successors, (3223), 3 states have internal predecessors, (3223), 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:11:52,765 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:52,765 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] [2025-03-17 11:11:52,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:11:52,765 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-17 11:11:52,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:52,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1989644281, now seen corresponding path program 1 times [2025-03-17 11:11:52,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:52,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557854994] [2025-03-17 11:11:52,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:52,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:52,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-17 11:11:52,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-17 11:11:52,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:52,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:52,818 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:11:52,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:52,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557854994] [2025-03-17 11:11:52,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557854994] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:52,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:52,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:52,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509560826] [2025-03-17 11:11:52,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:52,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:52,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:52,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:52,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:52,844 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1074 out of 1111 [2025-03-17 11:11:52,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1030 places, 1061 transitions, 2132 flow. Second operand has 3 states, 3 states have (on average 1075.3333333333333) internal successors, (3226), 3 states have internal predecessors, (3226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:52,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:52,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1074 of 1111 [2025-03-17 11:11:52,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:53,627 INFO L124 PetriNetUnfolderBase]: 167/3835 cut-off events. [2025-03-17 11:11:53,627 INFO L125 PetriNetUnfolderBase]: For 1/3 co-relation queries the response was YES. [2025-03-17 11:11:53,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3889 conditions, 3835 events. 167/3835 cut-off events. For 1/3 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 26016 event pairs, 10 based on Foata normal form. 0/3045 useless extension candidates. Maximal degree in co-relation 3816. Up to 35 conditions per place. [2025-03-17 11:11:53,715 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 14 selfloop transitions, 2 changer transitions 0/1060 dead transitions. [2025-03-17 11:11:53,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1031 places, 1060 transitions, 2162 flow [2025-03-17 11:11:53,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:53,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:53,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3239 transitions. [2025-03-17 11:11:53,720 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9717971797179717 [2025-03-17 11:11:53,720 INFO L175 Difference]: Start difference. First operand has 1030 places, 1061 transitions, 2132 flow. Second operand 3 states and 3239 transitions. [2025-03-17 11:11:53,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1031 places, 1060 transitions, 2162 flow [2025-03-17 11:11:53,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1029 places, 1060 transitions, 2158 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:53,730 INFO L231 Difference]: Finished difference. Result has 1029 places, 1060 transitions, 2130 flow [2025-03-17 11:11:53,732 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2126, PETRI_DIFFERENCE_MINUEND_PLACES=1027, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1060, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1058, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2130, PETRI_PLACES=1029, PETRI_TRANSITIONS=1060} [2025-03-17 11:11:53,732 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -12 predicate places. [2025-03-17 11:11:53,733 INFO L471 AbstractCegarLoop]: Abstraction has has 1029 places, 1060 transitions, 2130 flow [2025-03-17 11:11:53,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1075.3333333333333) internal successors, (3226), 3 states have internal predecessors, (3226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:53,734 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:53,734 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:11:53,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:11:53,735 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-17 11:11:53,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:53,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1703453848, now seen corresponding path program 1 times [2025-03-17 11:11:53,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:53,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420029931] [2025-03-17 11:11:53,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:53,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:53,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-17 11:11:53,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-17 11:11:53,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:53,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:53,778 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:11:53,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:53,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420029931] [2025-03-17 11:11:53,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420029931] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:53,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:53,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:53,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468319434] [2025-03-17 11:11:53,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:53,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:53,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:53,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:53,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:53,828 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1067 out of 1111 [2025-03-17 11:11:53,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1029 places, 1060 transitions, 2130 flow. Second operand has 3 states, 3 states have (on average 1068.3333333333333) internal successors, (3205), 3 states have internal predecessors, (3205), 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:11:53,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:53,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1067 of 1111 [2025-03-17 11:11:53,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:55,832 INFO L124 PetriNetUnfolderBase]: 349/7719 cut-off events. [2025-03-17 11:11:55,833 INFO L125 PetriNetUnfolderBase]: For 2/6 co-relation queries the response was YES. [2025-03-17 11:11:55,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7822 conditions, 7719 events. 349/7719 cut-off events. For 2/6 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 68308 event pairs, 24 based on Foata normal form. 0/6095 useless extension candidates. Maximal degree in co-relation 7741. Up to 70 conditions per place. [2025-03-17 11:11:56,064 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 21 selfloop transitions, 2 changer transitions 0/1059 dead transitions. [2025-03-17 11:11:56,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1030 places, 1059 transitions, 2174 flow [2025-03-17 11:11:56,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:56,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:56,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3225 transitions. [2025-03-17 11:11:56,069 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9675967596759676 [2025-03-17 11:11:56,069 INFO L175 Difference]: Start difference. First operand has 1029 places, 1060 transitions, 2130 flow. Second operand 3 states and 3225 transitions. [2025-03-17 11:11:56,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1030 places, 1059 transitions, 2174 flow [2025-03-17 11:11:56,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1028 places, 1059 transitions, 2170 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:56,082 INFO L231 Difference]: Finished difference. Result has 1028 places, 1059 transitions, 2128 flow [2025-03-17 11:11:56,084 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2124, PETRI_DIFFERENCE_MINUEND_PLACES=1026, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1059, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1057, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2128, PETRI_PLACES=1028, PETRI_TRANSITIONS=1059} [2025-03-17 11:11:56,084 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -13 predicate places. [2025-03-17 11:11:56,084 INFO L471 AbstractCegarLoop]: Abstraction has has 1028 places, 1059 transitions, 2128 flow [2025-03-17 11:11:56,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1068.3333333333333) internal successors, (3205), 3 states have internal predecessors, (3205), 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:11:56,086 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:56,086 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:11:56,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:11:56,086 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-17 11:11:56,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:56,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1011536136, now seen corresponding path program 1 times [2025-03-17 11:11:56,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:56,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826159219] [2025-03-17 11:11:56,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:56,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:56,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-17 11:11:56,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 11:11:56,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:56,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:56,129 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:11:56,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:56,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826159219] [2025-03-17 11:11:56,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826159219] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:56,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:56,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:56,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642748579] [2025-03-17 11:11:56,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:56,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:56,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:56,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:56,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:56,174 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1069 out of 1111 [2025-03-17 11:11:56,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1028 places, 1059 transitions, 2128 flow. Second operand has 3 states, 3 states have (on average 1070.3333333333333) internal successors, (3211), 3 states have internal predecessors, (3211), 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:11:56,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:56,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1069 of 1111 [2025-03-17 11:11:56,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:57,280 INFO L124 PetriNetUnfolderBase]: 149/3282 cut-off events. [2025-03-17 11:11:57,280 INFO L125 PetriNetUnfolderBase]: For 9/30 co-relation queries the response was YES. [2025-03-17 11:11:57,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3351 conditions, 3282 events. 149/3282 cut-off events. For 9/30 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 21621 event pairs, 16 based on Foata normal form. 0/2610 useless extension candidates. Maximal degree in co-relation 3262. Up to 52 conditions per place. [2025-03-17 11:11:57,428 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 19 selfloop transitions, 2 changer transitions 0/1058 dead transitions. [2025-03-17 11:11:57,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1029 places, 1058 transitions, 2168 flow [2025-03-17 11:11:57,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:57,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:57,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3229 transitions. [2025-03-17 11:11:57,432 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9687968796879688 [2025-03-17 11:11:57,432 INFO L175 Difference]: Start difference. First operand has 1028 places, 1059 transitions, 2128 flow. Second operand 3 states and 3229 transitions. [2025-03-17 11:11:57,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1029 places, 1058 transitions, 2168 flow [2025-03-17 11:11:57,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1027 places, 1058 transitions, 2164 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:57,443 INFO L231 Difference]: Finished difference. Result has 1027 places, 1058 transitions, 2126 flow [2025-03-17 11:11:57,445 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2122, PETRI_DIFFERENCE_MINUEND_PLACES=1025, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1058, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1056, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2126, PETRI_PLACES=1027, PETRI_TRANSITIONS=1058} [2025-03-17 11:11:57,445 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -14 predicate places. [2025-03-17 11:11:57,445 INFO L471 AbstractCegarLoop]: Abstraction has has 1027 places, 1058 transitions, 2126 flow [2025-03-17 11:11:57,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1070.3333333333333) internal successors, (3211), 3 states have internal predecessors, (3211), 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:11:57,447 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:57,447 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:11:57,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:11:57,448 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-17 11:11:57,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:57,448 INFO L85 PathProgramCache]: Analyzing trace with hash 2017207088, now seen corresponding path program 1 times [2025-03-17 11:11:57,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:57,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494527175] [2025-03-17 11:11:57,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:57,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:57,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-17 11:11:57,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-17 11:11:57,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:57,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:57,487 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:11:57,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:57,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494527175] [2025-03-17 11:11:57,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494527175] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:57,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:57,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:57,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418331140] [2025-03-17 11:11:57,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:57,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:57,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:57,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:57,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:57,519 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1073 out of 1111 [2025-03-17 11:11:57,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1027 places, 1058 transitions, 2126 flow. Second operand has 3 states, 3 states have (on average 1074.3333333333333) internal successors, (3223), 3 states have internal predecessors, (3223), 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:11:57,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:57,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1073 of 1111 [2025-03-17 11:11:57,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:57,854 INFO L124 PetriNetUnfolderBase]: 73/1607 cut-off events. [2025-03-17 11:11:57,854 INFO L125 PetriNetUnfolderBase]: For 8/14 co-relation queries the response was YES. [2025-03-17 11:11:57,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1662 conditions, 1607 events. 73/1607 cut-off events. For 8/14 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 7807 event pairs, 12 based on Foata normal form. 0/1295 useless extension candidates. Maximal degree in co-relation 1565. Up to 40 conditions per place. [2025-03-17 11:11:57,903 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 15 selfloop transitions, 2 changer transitions 0/1057 dead transitions. [2025-03-17 11:11:57,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1028 places, 1057 transitions, 2158 flow [2025-03-17 11:11:57,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:57,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:57,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3237 transitions. [2025-03-17 11:11:57,907 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9711971197119712 [2025-03-17 11:11:57,907 INFO L175 Difference]: Start difference. First operand has 1027 places, 1058 transitions, 2126 flow. Second operand 3 states and 3237 transitions. [2025-03-17 11:11:57,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1028 places, 1057 transitions, 2158 flow [2025-03-17 11:11:57,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1026 places, 1057 transitions, 2154 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:57,916 INFO L231 Difference]: Finished difference. Result has 1026 places, 1057 transitions, 2124 flow [2025-03-17 11:11:57,917 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2120, PETRI_DIFFERENCE_MINUEND_PLACES=1024, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1057, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1055, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2124, PETRI_PLACES=1026, PETRI_TRANSITIONS=1057} [2025-03-17 11:11:57,917 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -15 predicate places. [2025-03-17 11:11:57,918 INFO L471 AbstractCegarLoop]: Abstraction has has 1026 places, 1057 transitions, 2124 flow [2025-03-17 11:11:57,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1074.3333333333333) internal successors, (3223), 3 states have internal predecessors, (3223), 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:11:57,919 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:57,919 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] [2025-03-17 11:11:57,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 11:11:57,919 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-17 11:11:57,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:57,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1959323165, now seen corresponding path program 1 times [2025-03-17 11:11:57,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:57,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716340764] [2025-03-17 11:11:57,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:57,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:57,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 11:11:57,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 11:11:57,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:57,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:57,971 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:11:57,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:57,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716340764] [2025-03-17 11:11:57,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716340764] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:57,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:57,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:57,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041913304] [2025-03-17 11:11:57,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:57,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:57,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:57,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:57,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:57,996 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1074 out of 1111 [2025-03-17 11:11:57,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1026 places, 1057 transitions, 2124 flow. Second operand has 3 states, 3 states have (on average 1075.3333333333333) internal successors, (3226), 3 states have internal predecessors, (3226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:57,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:57,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1074 of 1111 [2025-03-17 11:11:57,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:58,532 INFO L124 PetriNetUnfolderBase]: 107/2446 cut-off events. [2025-03-17 11:11:58,532 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2025-03-17 11:11:58,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2495 conditions, 2446 events. 107/2446 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 13607 event pairs, 10 based on Foata normal form. 0/1958 useless extension candidates. Maximal degree in co-relation 2390. Up to 35 conditions per place. [2025-03-17 11:11:58,642 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 14 selfloop transitions, 2 changer transitions 0/1056 dead transitions. [2025-03-17 11:11:58,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1027 places, 1056 transitions, 2154 flow [2025-03-17 11:11:58,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:58,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:58,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3239 transitions. [2025-03-17 11:11:58,646 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9717971797179717 [2025-03-17 11:11:58,646 INFO L175 Difference]: Start difference. First operand has 1026 places, 1057 transitions, 2124 flow. Second operand 3 states and 3239 transitions. [2025-03-17 11:11:58,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1027 places, 1056 transitions, 2154 flow [2025-03-17 11:11:58,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1025 places, 1056 transitions, 2150 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:58,656 INFO L231 Difference]: Finished difference. Result has 1025 places, 1056 transitions, 2122 flow [2025-03-17 11:11:58,657 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2118, PETRI_DIFFERENCE_MINUEND_PLACES=1023, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1056, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1054, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2122, PETRI_PLACES=1025, PETRI_TRANSITIONS=1056} [2025-03-17 11:11:58,657 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -16 predicate places. [2025-03-17 11:11:58,657 INFO L471 AbstractCegarLoop]: Abstraction has has 1025 places, 1056 transitions, 2122 flow [2025-03-17 11:11:58,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1075.3333333333333) internal successors, (3226), 3 states have internal predecessors, (3226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:58,659 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:58,659 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:11:58,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 11:11:58,659 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-17 11:11:58,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:58,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1178418024, now seen corresponding path program 1 times [2025-03-17 11:11:58,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:58,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512552865] [2025-03-17 11:11:58,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:58,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:58,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-17 11:11:58,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-17 11:11:58,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:58,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:58,708 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:11:58,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:58,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512552865] [2025-03-17 11:11:58,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512552865] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:58,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:58,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:58,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93089944] [2025-03-17 11:11:58,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:58,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:58,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:58,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:58,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:58,749 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1067 out of 1111 [2025-03-17 11:11:58,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1025 places, 1056 transitions, 2122 flow. Second operand has 3 states, 3 states have (on average 1068.3333333333333) internal successors, (3205), 3 states have internal predecessors, (3205), 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:11:58,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:58,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1067 of 1111 [2025-03-17 11:11:58,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:59,822 INFO L124 PetriNetUnfolderBase]: 205/4391 cut-off events. [2025-03-17 11:11:59,822 INFO L125 PetriNetUnfolderBase]: For 13/97 co-relation queries the response was YES. [2025-03-17 11:11:59,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4482 conditions, 4391 events. 205/4391 cut-off events. For 13/97 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 32444 event pairs, 24 based on Foata normal form. 0/3480 useless extension candidates. Maximal degree in co-relation 4369. Up to 70 conditions per place. [2025-03-17 11:11:59,934 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 21 selfloop transitions, 2 changer transitions 0/1055 dead transitions. [2025-03-17 11:11:59,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1026 places, 1055 transitions, 2166 flow [2025-03-17 11:11:59,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:59,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:59,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3225 transitions. [2025-03-17 11:11:59,938 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9675967596759676 [2025-03-17 11:11:59,938 INFO L175 Difference]: Start difference. First operand has 1025 places, 1056 transitions, 2122 flow. Second operand 3 states and 3225 transitions. [2025-03-17 11:11:59,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1026 places, 1055 transitions, 2166 flow [2025-03-17 11:11:59,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1024 places, 1055 transitions, 2162 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:59,947 INFO L231 Difference]: Finished difference. Result has 1024 places, 1055 transitions, 2120 flow [2025-03-17 11:11:59,948 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2116, PETRI_DIFFERENCE_MINUEND_PLACES=1022, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1055, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1053, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2120, PETRI_PLACES=1024, PETRI_TRANSITIONS=1055} [2025-03-17 11:11:59,948 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -17 predicate places. [2025-03-17 11:11:59,948 INFO L471 AbstractCegarLoop]: Abstraction has has 1024 places, 1055 transitions, 2120 flow [2025-03-17 11:11:59,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1068.3333333333333) internal successors, (3205), 3 states have internal predecessors, (3205), 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:11:59,949 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:59,949 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:11:59,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 11:11:59,949 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-17 11:11:59,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:59,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1583953371, now seen corresponding path program 1 times [2025-03-17 11:11:59,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:59,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557663084] [2025-03-17 11:11:59,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:59,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:59,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-17 11:11:59,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-17 11:11:59,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:59,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:59,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:11:59,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:59,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557663084] [2025-03-17 11:11:59,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557663084] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:59,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:59,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:59,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119233621] [2025-03-17 11:11:59,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:59,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:59,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:59,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:59,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:00,031 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1069 out of 1111 [2025-03-17 11:12:00,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1024 places, 1055 transitions, 2120 flow. Second operand has 3 states, 3 states have (on average 1070.3333333333333) internal successors, (3211), 3 states have internal predecessors, (3211), 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:00,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:00,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1069 of 1111 [2025-03-17 11:12:00,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:00,302 INFO L124 PetriNetUnfolderBase]: 77/1572 cut-off events. [2025-03-17 11:12:00,302 INFO L125 PetriNetUnfolderBase]: For 18/20 co-relation queries the response was YES. [2025-03-17 11:12:00,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1635 conditions, 1572 events. 77/1572 cut-off events. For 18/20 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 7405 event pairs, 16 based on Foata normal form. 0/1275 useless extension candidates. Maximal degree in co-relation 1514. Up to 54 conditions per place. [2025-03-17 11:12:00,352 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 19 selfloop transitions, 2 changer transitions 0/1054 dead transitions. [2025-03-17 11:12:00,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1025 places, 1054 transitions, 2160 flow [2025-03-17 11:12:00,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:00,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:00,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3229 transitions. [2025-03-17 11:12:00,355 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9687968796879688 [2025-03-17 11:12:00,355 INFO L175 Difference]: Start difference. First operand has 1024 places, 1055 transitions, 2120 flow. Second operand 3 states and 3229 transitions. [2025-03-17 11:12:00,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1025 places, 1054 transitions, 2160 flow [2025-03-17 11:12:00,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1023 places, 1054 transitions, 2156 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:00,365 INFO L231 Difference]: Finished difference. Result has 1023 places, 1054 transitions, 2118 flow [2025-03-17 11:12:00,366 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2114, PETRI_DIFFERENCE_MINUEND_PLACES=1021, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1054, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1052, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2118, PETRI_PLACES=1023, PETRI_TRANSITIONS=1054} [2025-03-17 11:12:00,366 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -18 predicate places. [2025-03-17 11:12:00,366 INFO L471 AbstractCegarLoop]: Abstraction has has 1023 places, 1054 transitions, 2118 flow [2025-03-17 11:12:00,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1070.3333333333333) internal successors, (3211), 3 states have internal predecessors, (3211), 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:00,367 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:00,367 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] [2025-03-17 11:12:00,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 11:12:00,367 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-17 11:12:00,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:00,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1586077702, now seen corresponding path program 1 times [2025-03-17 11:12:00,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:00,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937460619] [2025-03-17 11:12:00,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:00,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:00,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-17 11:12:00,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-17 11:12:00,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:00,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:00,399 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:00,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:00,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937460619] [2025-03-17 11:12:00,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937460619] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:00,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:00,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:00,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009304891] [2025-03-17 11:12:00,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:00,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:00,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:00,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:00,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:00,426 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1073 out of 1111 [2025-03-17 11:12:00,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1023 places, 1054 transitions, 2118 flow. Second operand has 3 states, 3 states have (on average 1074.3333333333333) internal successors, (3223), 3 states have internal predecessors, (3223), 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:00,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:00,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1073 of 1111 [2025-03-17 11:12:00,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:00,712 INFO L124 PetriNetUnfolderBase]: 73/1603 cut-off events. [2025-03-17 11:12:00,712 INFO L125 PetriNetUnfolderBase]: For 14/16 co-relation queries the response was YES. [2025-03-17 11:12:00,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1652 conditions, 1603 events. 73/1603 cut-off events. For 14/16 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 7315 event pairs, 12 based on Foata normal form. 0/1296 useless extension candidates. Maximal degree in co-relation 1523. Up to 40 conditions per place. [2025-03-17 11:12:00,764 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 15 selfloop transitions, 2 changer transitions 0/1053 dead transitions. [2025-03-17 11:12:00,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1024 places, 1053 transitions, 2150 flow [2025-03-17 11:12:00,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:00,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:00,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3237 transitions. [2025-03-17 11:12:00,768 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9711971197119712 [2025-03-17 11:12:00,768 INFO L175 Difference]: Start difference. First operand has 1023 places, 1054 transitions, 2118 flow. Second operand 3 states and 3237 transitions. [2025-03-17 11:12:00,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1024 places, 1053 transitions, 2150 flow [2025-03-17 11:12:00,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1022 places, 1053 transitions, 2146 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:00,781 INFO L231 Difference]: Finished difference. Result has 1022 places, 1053 transitions, 2116 flow [2025-03-17 11:12:00,782 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2112, PETRI_DIFFERENCE_MINUEND_PLACES=1020, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1053, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1051, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2116, PETRI_PLACES=1022, PETRI_TRANSITIONS=1053} [2025-03-17 11:12:00,784 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -19 predicate places. [2025-03-17 11:12:00,784 INFO L471 AbstractCegarLoop]: Abstraction has has 1022 places, 1053 transitions, 2116 flow [2025-03-17 11:12:00,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1074.3333333333333) internal successors, (3223), 3 states have internal predecessors, (3223), 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:00,785 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:00,785 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 11:12:00,785 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-17 11:12:00,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:00,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1970805991, now seen corresponding path program 1 times [2025-03-17 11:12:00,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:00,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436470370] [2025-03-17 11:12:00,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:00,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:00,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-17 11:12:00,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-17 11:12:00,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:00,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:00,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:00,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:00,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436470370] [2025-03-17 11:12:00,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436470370] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:00,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:00,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:00,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320522988] [2025-03-17 11:12:00,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:00,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:00,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:00,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:00,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:00,853 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1074 out of 1111 [2025-03-17 11:12:00,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1022 places, 1053 transitions, 2116 flow. Second operand has 3 states, 3 states have (on average 1075.3333333333333) internal successors, (3226), 3 states have internal predecessors, (3226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:00,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:00,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1074 of 1111 [2025-03-17 11:12:00,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:01,061 INFO L124 PetriNetUnfolderBase]: 47/1072 cut-off events. [2025-03-17 11:12:01,061 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2025-03-17 11:12:01,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1116 conditions, 1072 events. 47/1072 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 4400 event pairs, 10 based on Foata normal form. 0/887 useless extension candidates. Maximal degree in co-relation 979. Up to 35 conditions per place. [2025-03-17 11:12:01,096 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 14 selfloop transitions, 2 changer transitions 0/1052 dead transitions. [2025-03-17 11:12:01,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1023 places, 1052 transitions, 2146 flow [2025-03-17 11:12:01,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:01,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:01,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3239 transitions. [2025-03-17 11:12:01,100 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9717971797179717 [2025-03-17 11:12:01,101 INFO L175 Difference]: Start difference. First operand has 1022 places, 1053 transitions, 2116 flow. Second operand 3 states and 3239 transitions. [2025-03-17 11:12:01,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1023 places, 1052 transitions, 2146 flow [2025-03-17 11:12:01,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1021 places, 1052 transitions, 2142 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:01,114 INFO L231 Difference]: Finished difference. Result has 1021 places, 1052 transitions, 2114 flow [2025-03-17 11:12:01,115 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2110, PETRI_DIFFERENCE_MINUEND_PLACES=1019, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1052, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1050, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2114, PETRI_PLACES=1021, PETRI_TRANSITIONS=1052} [2025-03-17 11:12:01,117 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -20 predicate places. [2025-03-17 11:12:01,117 INFO L471 AbstractCegarLoop]: Abstraction has has 1021 places, 1052 transitions, 2114 flow [2025-03-17 11:12:01,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1075.3333333333333) internal successors, (3226), 3 states have internal predecessors, (3226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:01,118 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:01,118 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 11:12:01,119 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-17 11:12:01,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:01,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1701121407, now seen corresponding path program 1 times [2025-03-17 11:12:01,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:01,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133446364] [2025-03-17 11:12:01,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:01,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:01,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-17 11:12:01,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 11:12:01,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:01,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:01,161 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:01,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:01,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133446364] [2025-03-17 11:12:01,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133446364] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:01,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:01,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:01,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100842594] [2025-03-17 11:12:01,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:01,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:01,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:01,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:01,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:01,202 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1067 out of 1111 [2025-03-17 11:12:01,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1021 places, 1052 transitions, 2114 flow. Second operand has 3 states, 3 states have (on average 1068.3333333333333) internal successors, (3205), 3 states have internal predecessors, (3205), 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:01,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:01,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1067 of 1111 [2025-03-17 11:12:01,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:01,495 INFO L124 PetriNetUnfolderBase]: 85/1601 cut-off events. [2025-03-17 11:12:01,496 INFO L125 PetriNetUnfolderBase]: For 26/28 co-relation queries the response was YES. [2025-03-17 11:12:01,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1680 conditions, 1601 events. 85/1601 cut-off events. For 26/28 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 8321 event pairs, 24 based on Foata normal form. 0/1295 useless extension candidates. Maximal degree in co-relation 1535. Up to 70 conditions per place. [2025-03-17 11:12:01,555 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 21 selfloop transitions, 2 changer transitions 0/1051 dead transitions. [2025-03-17 11:12:01,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1022 places, 1051 transitions, 2158 flow [2025-03-17 11:12:01,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:01,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:01,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3225 transitions. [2025-03-17 11:12:01,559 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9675967596759676 [2025-03-17 11:12:01,559 INFO L175 Difference]: Start difference. First operand has 1021 places, 1052 transitions, 2114 flow. Second operand 3 states and 3225 transitions. [2025-03-17 11:12:01,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1022 places, 1051 transitions, 2158 flow [2025-03-17 11:12:01,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1020 places, 1051 transitions, 2154 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:01,573 INFO L231 Difference]: Finished difference. Result has 1020 places, 1051 transitions, 2112 flow [2025-03-17 11:12:01,574 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2108, PETRI_DIFFERENCE_MINUEND_PLACES=1018, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1051, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1049, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2112, PETRI_PLACES=1020, PETRI_TRANSITIONS=1051} [2025-03-17 11:12:01,575 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -21 predicate places. [2025-03-17 11:12:01,575 INFO L471 AbstractCegarLoop]: Abstraction has has 1020 places, 1051 transitions, 2112 flow [2025-03-17 11:12:01,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1068.3333333333333) internal successors, (3205), 3 states have internal predecessors, (3205), 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:01,575 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:01,576 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:01,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 11:12:01,576 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-17 11:12:01,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:01,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1841169292, now seen corresponding path program 1 times [2025-03-17 11:12:01,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:01,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751418244] [2025-03-17 11:12:01,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:01,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:01,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-17 11:12:01,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-17 11:12:01,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:01,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:01,628 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:01,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:01,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751418244] [2025-03-17 11:12:01,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751418244] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:01,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:01,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:01,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593481175] [2025-03-17 11:12:01,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:01,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:01,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:01,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:01,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:01,649 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1076 out of 1111 [2025-03-17 11:12:01,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1020 places, 1051 transitions, 2112 flow. Second operand has 3 states, 3 states have (on average 1077.3333333333333) internal successors, (3232), 3 states have internal predecessors, (3232), 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:01,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:01,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1076 of 1111 [2025-03-17 11:12:01,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:02,098 INFO L124 PetriNetUnfolderBase]: 121/2611 cut-off events. [2025-03-17 11:12:02,099 INFO L125 PetriNetUnfolderBase]: For 6/10 co-relation queries the response was YES. [2025-03-17 11:12:02,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2667 conditions, 2611 events. 121/2611 cut-off events. For 6/10 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 14342 event pairs, 15 based on Foata normal form. 0/2093 useless extension candidates. Maximal degree in co-relation 2514. Up to 43 conditions per place. [2025-03-17 11:12:02,172 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 12 selfloop transitions, 2 changer transitions 0/1050 dead transitions. [2025-03-17 11:12:02,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1021 places, 1050 transitions, 2138 flow [2025-03-17 11:12:02,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:02,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:02,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3243 transitions. [2025-03-17 11:12:02,175 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.972997299729973 [2025-03-17 11:12:02,176 INFO L175 Difference]: Start difference. First operand has 1020 places, 1051 transitions, 2112 flow. Second operand 3 states and 3243 transitions. [2025-03-17 11:12:02,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1021 places, 1050 transitions, 2138 flow [2025-03-17 11:12:02,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1019 places, 1050 transitions, 2134 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:02,184 INFO L231 Difference]: Finished difference. Result has 1019 places, 1050 transitions, 2110 flow [2025-03-17 11:12:02,185 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2106, PETRI_DIFFERENCE_MINUEND_PLACES=1017, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1050, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1048, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2110, PETRI_PLACES=1019, PETRI_TRANSITIONS=1050} [2025-03-17 11:12:02,185 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -22 predicate places. [2025-03-17 11:12:02,185 INFO L471 AbstractCegarLoop]: Abstraction has has 1019 places, 1050 transitions, 2110 flow [2025-03-17 11:12:02,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1077.3333333333333) internal successors, (3232), 3 states have internal predecessors, (3232), 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:02,186 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:02,186 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:02,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 11:12:02,186 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-17 11:12:02,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:02,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1863792275, now seen corresponding path program 1 times [2025-03-17 11:12:02,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:02,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942379837] [2025-03-17 11:12:02,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:02,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:02,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-17 11:12:02,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-17 11:12:02,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:02,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:02,637 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:02,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:02,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942379837] [2025-03-17 11:12:02,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942379837] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:02,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:02,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:12:02,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378139043] [2025-03-17 11:12:02,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:02,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:12:02,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:02,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:12:02,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:12:02,739 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1060 out of 1111 [2025-03-17 11:12:02,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1019 places, 1050 transitions, 2110 flow. Second operand has 6 states, 6 states have (on average 1061.5) internal successors, (6369), 6 states have internal predecessors, (6369), 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:02,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:02,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1060 of 1111 [2025-03-17 11:12:02,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:05,275 INFO L124 PetriNetUnfolderBase]: 893/12790 cut-off events. [2025-03-17 11:12:05,275 INFO L125 PetriNetUnfolderBase]: For 59/68 co-relation queries the response was YES. [2025-03-17 11:12:05,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13410 conditions, 12790 events. 893/12790 cut-off events. For 59/68 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 132300 event pairs, 264 based on Foata normal form. 0/10061 useless extension candidates. Maximal degree in co-relation 13198. Up to 580 conditions per place. [2025-03-17 11:12:05,558 INFO L140 encePairwiseOnDemand]: 1105/1111 looper letters, 26 selfloop transitions, 5 changer transitions 0/1049 dead transitions. [2025-03-17 11:12:05,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1023 places, 1049 transitions, 2170 flow [2025-03-17 11:12:05,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:12:05,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:12:05,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6392 transitions. [2025-03-17 11:12:05,564 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9588958895889589 [2025-03-17 11:12:05,564 INFO L175 Difference]: Start difference. First operand has 1019 places, 1050 transitions, 2110 flow. Second operand 6 states and 6392 transitions. [2025-03-17 11:12:05,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1023 places, 1049 transitions, 2170 flow [2025-03-17 11:12:05,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1021 places, 1049 transitions, 2166 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:05,574 INFO L231 Difference]: Finished difference. Result has 1021 places, 1049 transitions, 2114 flow [2025-03-17 11:12:05,575 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2104, PETRI_DIFFERENCE_MINUEND_PLACES=1016, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1049, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1044, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2114, PETRI_PLACES=1021, PETRI_TRANSITIONS=1049} [2025-03-17 11:12:05,575 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -20 predicate places. [2025-03-17 11:12:05,575 INFO L471 AbstractCegarLoop]: Abstraction has has 1021 places, 1049 transitions, 2114 flow [2025-03-17 11:12:05,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1061.5) internal successors, (6369), 6 states have internal predecessors, (6369), 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:05,577 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:05,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 11:12:05,577 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err42ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-17 11:12:05,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:05,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1983152897, now seen corresponding path program 1 times [2025-03-17 11:12:05,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:05,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285157107] [2025-03-17 11:12:05,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:05,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:05,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-17 11:12:05,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-17 11:12:05,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:05,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:05,616 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:05,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:05,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285157107] [2025-03-17 11:12:05,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285157107] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:05,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:05,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:05,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251526292] [2025-03-17 11:12:05,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:05,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:05,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:05,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:05,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:05,640 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1075 out of 1111 [2025-03-17 11:12:05,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1021 places, 1049 transitions, 2114 flow. Second operand has 3 states, 3 states have (on average 1076.6666666666667) internal successors, (3230), 3 states have internal predecessors, (3230), 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:05,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:05,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1075 of 1111 [2025-03-17 11:12:05,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:06,412 INFO L124 PetriNetUnfolderBase]: 163/3539 cut-off events. [2025-03-17 11:12:06,413 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2025-03-17 11:12:06,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3620 conditions, 3539 events. 163/3539 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 22891 event pairs, 9 based on Foata normal form. 0/2820 useless extension candidates. Maximal degree in co-relation 3602. Up to 43 conditions per place. [2025-03-17 11:12:06,561 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 16 selfloop transitions, 2 changer transitions 0/1050 dead transitions. [2025-03-17 11:12:06,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1022 places, 1050 transitions, 2154 flow [2025-03-17 11:12:06,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:06,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:06,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3244 transitions. [2025-03-17 11:12:06,565 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9732973297329733 [2025-03-17 11:12:06,565 INFO L175 Difference]: Start difference. First operand has 1021 places, 1049 transitions, 2114 flow. Second operand 3 states and 3244 transitions. [2025-03-17 11:12:06,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1022 places, 1050 transitions, 2154 flow [2025-03-17 11:12:06,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1017 places, 1050 transitions, 2144 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:12:06,575 INFO L231 Difference]: Finished difference. Result has 1017 places, 1048 transitions, 2106 flow [2025-03-17 11:12:06,576 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2102, PETRI_DIFFERENCE_MINUEND_PLACES=1015, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1048, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1046, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2106, PETRI_PLACES=1017, PETRI_TRANSITIONS=1048} [2025-03-17 11:12:06,576 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -24 predicate places. [2025-03-17 11:12:06,576 INFO L471 AbstractCegarLoop]: Abstraction has has 1017 places, 1048 transitions, 2106 flow [2025-03-17 11:12:06,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1076.6666666666667) internal successors, (3230), 3 states have internal predecessors, (3230), 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:06,577 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:06,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 11:12:06,577 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err41ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-17 11:12:06,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:06,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1512756429, now seen corresponding path program 1 times [2025-03-17 11:12:06,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:06,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471533650] [2025-03-17 11:12:06,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:06,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:06,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-17 11:12:06,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-17 11:12:06,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:06,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:06,609 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:06,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:06,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471533650] [2025-03-17 11:12:06,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471533650] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:06,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:06,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:06,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346402389] [2025-03-17 11:12:06,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:06,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:06,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:06,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:06,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:06,657 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1069 out of 1111 [2025-03-17 11:12:06,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1017 places, 1048 transitions, 2106 flow. Second operand has 3 states, 3 states have (on average 1070.6666666666667) internal successors, (3212), 3 states have internal predecessors, (3212), 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:06,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:06,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1069 of 1111 [2025-03-17 11:12:06,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:07,041 INFO L124 PetriNetUnfolderBase]: 115/2154 cut-off events. [2025-03-17 11:12:07,041 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 11:12:07,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2274 conditions, 2154 events. 115/2154 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 13238 event pairs, 26 based on Foata normal form. 0/1739 useless extension candidates. Maximal degree in co-relation 2062. Up to 73 conditions per place. [2025-03-17 11:12:07,114 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 22 selfloop transitions, 2 changer transitions 0/1049 dead transitions. [2025-03-17 11:12:07,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1018 places, 1049 transitions, 2158 flow [2025-03-17 11:12:07,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:07,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:07,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3232 transitions. [2025-03-17 11:12:07,117 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9696969696969697 [2025-03-17 11:12:07,117 INFO L175 Difference]: Start difference. First operand has 1017 places, 1048 transitions, 2106 flow. Second operand 3 states and 3232 transitions. [2025-03-17 11:12:07,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1018 places, 1049 transitions, 2158 flow [2025-03-17 11:12:07,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1016 places, 1049 transitions, 2154 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:07,127 INFO L231 Difference]: Finished difference. Result has 1016 places, 1047 transitions, 2104 flow [2025-03-17 11:12:07,128 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2100, PETRI_DIFFERENCE_MINUEND_PLACES=1014, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1047, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1045, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2104, PETRI_PLACES=1016, PETRI_TRANSITIONS=1047} [2025-03-17 11:12:07,128 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -25 predicate places. [2025-03-17 11:12:07,129 INFO L471 AbstractCegarLoop]: Abstraction has has 1016 places, 1047 transitions, 2104 flow [2025-03-17 11:12:07,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1070.6666666666667) internal successors, (3212), 3 states have internal predecessors, (3212), 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:07,129 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:07,130 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] [2025-03-17 11:12:07,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 11:12:07,130 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err42ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-17 11:12:07,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:07,131 INFO L85 PathProgramCache]: Analyzing trace with hash -643314306, now seen corresponding path program 1 times [2025-03-17 11:12:07,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:07,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311333644] [2025-03-17 11:12:07,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:07,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:07,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-17 11:12:07,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-17 11:12:07,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:07,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:07,161 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:07,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:07,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311333644] [2025-03-17 11:12:07,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311333644] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:07,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:07,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:07,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110328312] [2025-03-17 11:12:07,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:07,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:07,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:07,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:07,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:07,188 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1075 out of 1111 [2025-03-17 11:12:07,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1016 places, 1047 transitions, 2104 flow. Second operand has 3 states, 3 states have (on average 1077.0) internal successors, (3231), 3 states have internal predecessors, (3231), 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:07,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:07,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1075 of 1111 [2025-03-17 11:12:07,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:07,531 INFO L124 PetriNetUnfolderBase]: 79/1602 cut-off events. [2025-03-17 11:12:07,532 INFO L125 PetriNetUnfolderBase]: For 11/20 co-relation queries the response was YES. [2025-03-17 11:12:07,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1671 conditions, 1602 events. 79/1602 cut-off events. For 11/20 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 7901 event pairs, 14 based on Foata normal form. 0/1300 useless extension candidates. Maximal degree in co-relation 1454. Up to 43 conditions per place. [2025-03-17 11:12:07,599 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 16 selfloop transitions, 2 changer transitions 0/1048 dead transitions. [2025-03-17 11:12:07,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1017 places, 1048 transitions, 2144 flow [2025-03-17 11:12:07,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:07,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:07,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3244 transitions. [2025-03-17 11:12:07,602 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9732973297329733 [2025-03-17 11:12:07,602 INFO L175 Difference]: Start difference. First operand has 1016 places, 1047 transitions, 2104 flow. Second operand 3 states and 3244 transitions. [2025-03-17 11:12:07,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1017 places, 1048 transitions, 2144 flow [2025-03-17 11:12:07,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1015 places, 1048 transitions, 2140 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:07,611 INFO L231 Difference]: Finished difference. Result has 1015 places, 1046 transitions, 2102 flow [2025-03-17 11:12:07,612 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2098, PETRI_DIFFERENCE_MINUEND_PLACES=1013, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1046, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1044, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2102, PETRI_PLACES=1015, PETRI_TRANSITIONS=1046} [2025-03-17 11:12:07,612 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -26 predicate places. [2025-03-17 11:12:07,612 INFO L471 AbstractCegarLoop]: Abstraction has has 1015 places, 1046 transitions, 2102 flow [2025-03-17 11:12:07,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1077.0) internal successors, (3231), 3 states have internal predecessors, (3231), 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:07,613 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:07,613 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] [2025-03-17 11:12:07,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 11:12:07,614 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err40ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-17 11:12:07,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:07,614 INFO L85 PathProgramCache]: Analyzing trace with hash 567243236, now seen corresponding path program 1 times [2025-03-17 11:12:07,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:07,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124424877] [2025-03-17 11:12:07,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:07,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:07,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-17 11:12:07,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-17 11:12:07,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:07,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:07,644 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:07,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:07,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124424877] [2025-03-17 11:12:07,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124424877] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:07,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:07,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:07,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142824130] [2025-03-17 11:12:07,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:07,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:07,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:07,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:07,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:07,671 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1055 out of 1111 [2025-03-17 11:12:07,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1015 places, 1046 transitions, 2102 flow. Second operand has 3 states, 3 states have (on average 1056.3333333333333) internal successors, (3169), 3 states have internal predecessors, (3169), 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:07,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:07,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1055 of 1111 [2025-03-17 11:12:07,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:09,682 INFO L124 PetriNetUnfolderBase]: 847/10614 cut-off events. [2025-03-17 11:12:09,683 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-03-17 11:12:09,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11414 conditions, 10614 events. 847/10614 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 103578 event pairs, 190 based on Foata normal form. 0/8479 useless extension candidates. Maximal degree in co-relation 10900. Up to 658 conditions per place. [2025-03-17 11:12:09,966 INFO L140 encePairwiseOnDemand]: 1099/1111 looper letters, 29 selfloop transitions, 2 changer transitions 0/1040 dead transitions. [2025-03-17 11:12:09,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1007 places, 1040 transitions, 2154 flow [2025-03-17 11:12:09,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:09,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:09,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3206 transitions. [2025-03-17 11:12:09,968 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.961896189618962 [2025-03-17 11:12:09,968 INFO L175 Difference]: Start difference. First operand has 1015 places, 1046 transitions, 2102 flow. Second operand 3 states and 3206 transitions. [2025-03-17 11:12:09,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1007 places, 1040 transitions, 2154 flow [2025-03-17 11:12:09,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1005 places, 1040 transitions, 2150 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:09,978 INFO L231 Difference]: Finished difference. Result has 1006 places, 1038 transitions, 2092 flow [2025-03-17 11:12:09,979 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2078, PETRI_DIFFERENCE_MINUEND_PLACES=1003, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1036, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1034, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2092, PETRI_PLACES=1006, PETRI_TRANSITIONS=1038} [2025-03-17 11:12:09,979 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -35 predicate places. [2025-03-17 11:12:09,979 INFO L471 AbstractCegarLoop]: Abstraction has has 1006 places, 1038 transitions, 2092 flow [2025-03-17 11:12:09,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1056.3333333333333) internal successors, (3169), 3 states have internal predecessors, (3169), 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:09,980 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:09,980 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] [2025-03-17 11:12:09,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 11:12:09,980 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err39ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-17 11:12:09,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:09,981 INFO L85 PathProgramCache]: Analyzing trace with hash -340026331, now seen corresponding path program 1 times [2025-03-17 11:12:09,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:09,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251554900] [2025-03-17 11:12:09,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:09,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:09,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-17 11:12:09,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-17 11:12:09,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:09,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:10,017 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:10,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:10,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251554900] [2025-03-17 11:12:10,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251554900] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:10,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:10,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:10,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520557136] [2025-03-17 11:12:10,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:10,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:10,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:10,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:10,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:10,045 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1055 out of 1111 [2025-03-17 11:12:10,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1006 places, 1038 transitions, 2092 flow. Second operand has 3 states, 3 states have (on average 1056.3333333333333) internal successors, (3169), 3 states have internal predecessors, (3169), 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:10,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:10,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1055 of 1111 [2025-03-17 11:12:10,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:11,867 INFO L124 PetriNetUnfolderBase]: 451/6342 cut-off events. [2025-03-17 11:12:11,867 INFO L125 PetriNetUnfolderBase]: For 31/77 co-relation queries the response was YES. [2025-03-17 11:12:12,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6718 conditions, 6342 events. 451/6342 cut-off events. For 31/77 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 51779 event pairs, 110 based on Foata normal form. 1/5113 useless extension candidates. Maximal degree in co-relation 6242. Up to 340 conditions per place. [2025-03-17 11:12:12,112 INFO L140 encePairwiseOnDemand]: 1099/1111 looper letters, 29 selfloop transitions, 2 changer transitions 0/1032 dead transitions. [2025-03-17 11:12:12,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 998 places, 1032 transitions, 2144 flow [2025-03-17 11:12:12,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:12,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:12,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3206 transitions. [2025-03-17 11:12:12,114 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.961896189618962 [2025-03-17 11:12:12,114 INFO L175 Difference]: Start difference. First operand has 1006 places, 1038 transitions, 2092 flow. Second operand 3 states and 3206 transitions. [2025-03-17 11:12:12,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 998 places, 1032 transitions, 2144 flow [2025-03-17 11:12:12,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 998 places, 1032 transitions, 2144 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:12:12,125 INFO L231 Difference]: Finished difference. Result has 999 places, 1030 transitions, 2086 flow [2025-03-17 11:12:12,126 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2072, PETRI_DIFFERENCE_MINUEND_PLACES=996, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1028, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1026, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2086, PETRI_PLACES=999, PETRI_TRANSITIONS=1030} [2025-03-17 11:12:12,127 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -42 predicate places. [2025-03-17 11:12:12,127 INFO L471 AbstractCegarLoop]: Abstraction has has 999 places, 1030 transitions, 2086 flow [2025-03-17 11:12:12,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1056.3333333333333) internal successors, (3169), 3 states have internal predecessors, (3169), 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:12,128 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:12,128 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] [2025-03-17 11:12:12,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 11:12:12,128 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err41ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-17 11:12:12,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:12,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1269030377, now seen corresponding path program 1 times [2025-03-17 11:12:12,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:12,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547731868] [2025-03-17 11:12:12,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:12,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:12,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-03-17 11:12:12,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-03-17 11:12:12,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:12,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:12,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:12,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:12,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547731868] [2025-03-17 11:12:12,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547731868] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:12,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:12,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:12,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564787469] [2025-03-17 11:12:12,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:12,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:12,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:12,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:12,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:12,218 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1069 out of 1111 [2025-03-17 11:12:12,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 999 places, 1030 transitions, 2086 flow. Second operand has 3 states, 3 states have (on average 1071.0) internal successors, (3213), 3 states have internal predecessors, (3213), 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:12,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:12,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1069 of 1111 [2025-03-17 11:12:12,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:12,872 INFO L124 PetriNetUnfolderBase]: 166/2871 cut-off events. [2025-03-17 11:12:12,872 INFO L125 PetriNetUnfolderBase]: For 17/44 co-relation queries the response was YES. [2025-03-17 11:12:12,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3040 conditions, 2871 events. 166/2871 cut-off events. For 17/44 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 20401 event pairs, 37 based on Foata normal form. 0/2341 useless extension candidates. Maximal degree in co-relation 2250. Up to 106 conditions per place. [2025-03-17 11:12:12,984 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 22 selfloop transitions, 2 changer transitions 0/1031 dead transitions. [2025-03-17 11:12:12,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1000 places, 1031 transitions, 2138 flow [2025-03-17 11:12:12,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:12,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:12,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3232 transitions. [2025-03-17 11:12:12,986 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9696969696969697 [2025-03-17 11:12:12,986 INFO L175 Difference]: Start difference. First operand has 999 places, 1030 transitions, 2086 flow. Second operand 3 states and 3232 transitions. [2025-03-17 11:12:12,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1000 places, 1031 transitions, 2138 flow [2025-03-17 11:12:12,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1000 places, 1031 transitions, 2138 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:12:12,995 INFO L231 Difference]: Finished difference. Result has 1000 places, 1029 transitions, 2088 flow [2025-03-17 11:12:12,996 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2084, PETRI_DIFFERENCE_MINUEND_PLACES=998, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1029, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1027, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2088, PETRI_PLACES=1000, PETRI_TRANSITIONS=1029} [2025-03-17 11:12:12,996 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -41 predicate places. [2025-03-17 11:12:12,996 INFO L471 AbstractCegarLoop]: Abstraction has has 1000 places, 1029 transitions, 2088 flow [2025-03-17 11:12:12,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1071.0) internal successors, (3213), 3 states have internal predecessors, (3213), 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:12,997 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:12,997 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 11:12:12,997 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread3Err42ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-17 11:12:12,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:12,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1808698074, now seen corresponding path program 1 times [2025-03-17 11:12:12,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:12,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9205517] [2025-03-17 11:12:12,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:12,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:13,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-17 11:12:13,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-17 11:12:13,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:13,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:13,027 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:13,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:13,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9205517] [2025-03-17 11:12:13,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9205517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:13,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:13,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:13,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771449993] [2025-03-17 11:12:13,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:13,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:13,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:13,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:13,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:13,054 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1075 out of 1111 [2025-03-17 11:12:13,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1000 places, 1029 transitions, 2088 flow. Second operand has 3 states, 3 states have (on average 1077.3333333333333) internal successors, (3232), 3 states have internal predecessors, (3232), 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:13,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:13,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1075 of 1111 [2025-03-17 11:12:13,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:13,445 INFO L124 PetriNetUnfolderBase]: 105/2080 cut-off events. [2025-03-17 11:12:13,445 INFO L125 PetriNetUnfolderBase]: For 21/35 co-relation queries the response was YES. [2025-03-17 11:12:13,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2161 conditions, 2080 events. 105/2080 cut-off events. For 21/35 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 11829 event pairs, 14 based on Foata normal form. 1/1711 useless extension candidates. Maximal degree in co-relation 1934. Up to 48 conditions per place. [2025-03-17 11:12:13,518 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 16 selfloop transitions, 2 changer transitions 0/1030 dead transitions. [2025-03-17 11:12:13,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1001 places, 1030 transitions, 2128 flow [2025-03-17 11:12:13,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:13,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:13,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3244 transitions. [2025-03-17 11:12:13,520 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9732973297329733 [2025-03-17 11:12:13,520 INFO L175 Difference]: Start difference. First operand has 1000 places, 1029 transitions, 2088 flow. Second operand 3 states and 3244 transitions. [2025-03-17 11:12:13,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1001 places, 1030 transitions, 2128 flow [2025-03-17 11:12:13,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 999 places, 1030 transitions, 2124 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:13,529 INFO L231 Difference]: Finished difference. Result has 999 places, 1028 transitions, 2086 flow [2025-03-17 11:12:13,529 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2082, PETRI_DIFFERENCE_MINUEND_PLACES=997, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1028, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1026, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2086, PETRI_PLACES=999, PETRI_TRANSITIONS=1028} [2025-03-17 11:12:13,530 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -42 predicate places. [2025-03-17 11:12:13,530 INFO L471 AbstractCegarLoop]: Abstraction has has 999 places, 1028 transitions, 2086 flow [2025-03-17 11:12:13,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1077.3333333333333) internal successors, (3232), 3 states have internal predecessors, (3232), 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:13,530 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:13,530 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] [2025-03-17 11:12:13,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 11:12:13,531 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err38ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-17 11:12:13,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:13,531 INFO L85 PathProgramCache]: Analyzing trace with hash 2105615067, now seen corresponding path program 1 times [2025-03-17 11:12:13,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:13,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177915408] [2025-03-17 11:12:13,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:13,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:13,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-17 11:12:13,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-17 11:12:13,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:13,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:13,566 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:13,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:13,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177915408] [2025-03-17 11:12:13,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177915408] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:13,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:13,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:13,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093434936] [2025-03-17 11:12:13,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:13,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:13,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:13,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:13,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:13,593 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1066 out of 1111 [2025-03-17 11:12:13,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 999 places, 1028 transitions, 2086 flow. Second operand has 3 states, 3 states have (on average 1067.3333333333333) internal successors, (3202), 3 states have internal predecessors, (3202), 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:13,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:13,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1066 of 1111 [2025-03-17 11:12:13,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:14,324 INFO L124 PetriNetUnfolderBase]: 191/3773 cut-off events. [2025-03-17 11:12:14,324 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-03-17 11:12:14,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3916 conditions, 3773 events. 191/3773 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 25719 event pairs, 8 based on Foata normal form. 0/3081 useless extension candidates. Maximal degree in co-relation 3438. Up to 42 conditions per place. [2025-03-17 11:12:14,423 INFO L140 encePairwiseOnDemand]: 1097/1111 looper letters, 18 selfloop transitions, 9 changer transitions 0/1029 dead transitions. [2025-03-17 11:12:14,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 996 places, 1029 transitions, 2144 flow [2025-03-17 11:12:14,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:14,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:14,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3230 transitions. [2025-03-17 11:12:14,425 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9690969096909691 [2025-03-17 11:12:14,425 INFO L175 Difference]: Start difference. First operand has 999 places, 1028 transitions, 2086 flow. Second operand 3 states and 3230 transitions. [2025-03-17 11:12:14,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 996 places, 1029 transitions, 2144 flow [2025-03-17 11:12:14,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 994 places, 1029 transitions, 2140 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:14,434 INFO L231 Difference]: Finished difference. Result has 995 places, 1027 transitions, 2115 flow [2025-03-17 11:12:14,435 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2072, PETRI_DIFFERENCE_MINUEND_PLACES=992, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1023, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1014, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2115, PETRI_PLACES=995, PETRI_TRANSITIONS=1027} [2025-03-17 11:12:14,436 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -46 predicate places. [2025-03-17 11:12:14,436 INFO L471 AbstractCegarLoop]: Abstraction has has 995 places, 1027 transitions, 2115 flow [2025-03-17 11:12:14,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1067.3333333333333) internal successors, (3202), 3 states have internal predecessors, (3202), 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:14,436 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:14,436 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] [2025-03-17 11:12:14,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 11:12:14,437 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err37ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-17 11:12:14,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:14,437 INFO L85 PathProgramCache]: Analyzing trace with hash 353717035, now seen corresponding path program 1 times [2025-03-17 11:12:14,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:14,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570868921] [2025-03-17 11:12:14,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:14,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:14,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-17 11:12:14,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-17 11:12:14,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:14,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:14,471 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:14,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:14,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570868921] [2025-03-17 11:12:14,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570868921] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:14,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:14,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:14,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715860293] [2025-03-17 11:12:14,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:14,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:14,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:14,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:14,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:14,506 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1072 out of 1111 [2025-03-17 11:12:14,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 995 places, 1027 transitions, 2115 flow. Second operand has 3 states, 3 states have (on average 1073.6666666666667) internal successors, (3221), 3 states have internal predecessors, (3221), 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:14,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:14,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1072 of 1111 [2025-03-17 11:12:14,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:15,195 INFO L124 PetriNetUnfolderBase]: 183/3668 cut-off events. [2025-03-17 11:12:15,195 INFO L125 PetriNetUnfolderBase]: For 61/77 co-relation queries the response was YES. [2025-03-17 11:12:15,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3848 conditions, 3668 events. 183/3668 cut-off events. For 61/77 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 28355 event pairs, 20 based on Foata normal form. 1/3011 useless extension candidates. Maximal degree in co-relation 3369. Up to 68 conditions per place. [2025-03-17 11:12:15,333 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 22 selfloop transitions, 3 changer transitions 0/1028 dead transitions. [2025-03-17 11:12:15,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 996 places, 1028 transitions, 2169 flow [2025-03-17 11:12:15,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:15,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:15,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3238 transitions. [2025-03-17 11:12:15,335 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9714971497149715 [2025-03-17 11:12:15,335 INFO L175 Difference]: Start difference. First operand has 995 places, 1027 transitions, 2115 flow. Second operand 3 states and 3238 transitions. [2025-03-17 11:12:15,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 996 places, 1028 transitions, 2169 flow [2025-03-17 11:12:15,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 995 places, 1028 transitions, 2160 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:12:15,344 INFO L231 Difference]: Finished difference. Result has 995 places, 1026 transitions, 2110 flow [2025-03-17 11:12:15,344 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2104, PETRI_DIFFERENCE_MINUEND_PLACES=993, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1026, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1023, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2110, PETRI_PLACES=995, PETRI_TRANSITIONS=1026} [2025-03-17 11:12:15,345 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -46 predicate places. [2025-03-17 11:12:15,345 INFO L471 AbstractCegarLoop]: Abstraction has has 995 places, 1026 transitions, 2110 flow [2025-03-17 11:12:15,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1073.6666666666667) internal successors, (3221), 3 states have internal predecessors, (3221), 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:15,345 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:15,345 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] [2025-03-17 11:12:15,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-17 11:12:15,345 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err39ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-17 11:12:15,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:15,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1147160828, now seen corresponding path program 1 times [2025-03-17 11:12:15,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:15,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990971804] [2025-03-17 11:12:15,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:15,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:15,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-17 11:12:15,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-17 11:12:15,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:15,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:15,374 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:15,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:15,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990971804] [2025-03-17 11:12:15,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990971804] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:15,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:15,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:15,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043331612] [2025-03-17 11:12:15,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:15,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:15,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:15,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:15,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:15,404 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1055 out of 1111 [2025-03-17 11:12:15,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 995 places, 1026 transitions, 2110 flow. Second operand has 3 states, 3 states have (on average 1056.6666666666667) internal successors, (3170), 3 states have internal predecessors, (3170), 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:15,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:15,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1055 of 1111 [2025-03-17 11:12:15,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:18,792 INFO L124 PetriNetUnfolderBase]: 1560/19946 cut-off events. [2025-03-17 11:12:18,793 INFO L125 PetriNetUnfolderBase]: For 144/150 co-relation queries the response was YES. [2025-03-17 11:12:19,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21183 conditions, 19946 events. 1560/19946 cut-off events. For 144/150 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 223239 event pairs, 370 based on Foata normal form. 0/16098 useless extension candidates. Maximal degree in co-relation 15915. Up to 1175 conditions per place. [2025-03-17 11:12:19,158 INFO L140 encePairwiseOnDemand]: 1099/1111 looper letters, 29 selfloop transitions, 2 changer transitions 0/1020 dead transitions. [2025-03-17 11:12:19,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 987 places, 1020 transitions, 2162 flow [2025-03-17 11:12:19,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:19,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:19,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3206 transitions. [2025-03-17 11:12:19,160 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.961896189618962 [2025-03-17 11:12:19,160 INFO L175 Difference]: Start difference. First operand has 995 places, 1026 transitions, 2110 flow. Second operand 3 states and 3206 transitions. [2025-03-17 11:12:19,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 987 places, 1020 transitions, 2162 flow [2025-03-17 11:12:19,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 985 places, 1020 transitions, 2156 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:19,169 INFO L231 Difference]: Finished difference. Result has 986 places, 1018 transitions, 2098 flow [2025-03-17 11:12:19,170 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2084, PETRI_DIFFERENCE_MINUEND_PLACES=983, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1016, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1014, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2098, PETRI_PLACES=986, PETRI_TRANSITIONS=1018} [2025-03-17 11:12:19,170 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -55 predicate places. [2025-03-17 11:12:19,170 INFO L471 AbstractCegarLoop]: Abstraction has has 986 places, 1018 transitions, 2098 flow [2025-03-17 11:12:19,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1056.6666666666667) internal successors, (3170), 3 states have internal predecessors, (3170), 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:19,171 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:19,171 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] [2025-03-17 11:12:19,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 11:12:19,171 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread3Err41ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-17 11:12:19,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:19,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1374332386, now seen corresponding path program 1 times [2025-03-17 11:12:19,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:19,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803919168] [2025-03-17 11:12:19,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:19,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:19,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-17 11:12:19,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-17 11:12:19,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:19,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:19,202 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:19,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:19,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803919168] [2025-03-17 11:12:19,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803919168] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:19,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:19,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:19,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619528171] [2025-03-17 11:12:19,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:19,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:19,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:19,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:19,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:19,246 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1069 out of 1111 [2025-03-17 11:12:19,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 986 places, 1018 transitions, 2098 flow. Second operand has 3 states, 3 states have (on average 1071.3333333333333) internal successors, (3214), 3 states have internal predecessors, (3214), 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:19,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:19,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1069 of 1111 [2025-03-17 11:12:19,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:19,788 INFO L124 PetriNetUnfolderBase]: 180/3058 cut-off events. [2025-03-17 11:12:19,788 INFO L125 PetriNetUnfolderBase]: For 44/58 co-relation queries the response was YES. [2025-03-17 11:12:19,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3261 conditions, 3058 events. 180/3058 cut-off events. For 44/58 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 22282 event pairs, 37 based on Foata normal form. 1/2538 useless extension candidates. Maximal degree in co-relation 2524. Up to 139 conditions per place. [2025-03-17 11:12:19,881 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 22 selfloop transitions, 2 changer transitions 0/1019 dead transitions. [2025-03-17 11:12:19,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 987 places, 1019 transitions, 2150 flow [2025-03-17 11:12:19,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:19,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:19,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3232 transitions. [2025-03-17 11:12:19,883 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9696969696969697 [2025-03-17 11:12:19,883 INFO L175 Difference]: Start difference. First operand has 986 places, 1018 transitions, 2098 flow. Second operand 3 states and 3232 transitions. [2025-03-17 11:12:19,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 987 places, 1019 transitions, 2150 flow [2025-03-17 11:12:19,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 987 places, 1019 transitions, 2150 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:12:19,893 INFO L231 Difference]: Finished difference. Result has 987 places, 1017 transitions, 2100 flow [2025-03-17 11:12:19,894 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2096, PETRI_DIFFERENCE_MINUEND_PLACES=985, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1017, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1015, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2100, PETRI_PLACES=987, PETRI_TRANSITIONS=1017} [2025-03-17 11:12:19,895 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -54 predicate places. [2025-03-17 11:12:19,895 INFO L471 AbstractCegarLoop]: Abstraction has has 987 places, 1017 transitions, 2100 flow [2025-03-17 11:12:19,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1071.3333333333333) internal successors, (3214), 3 states have internal predecessors, (3214), 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:19,895 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:19,896 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:12:19,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-17 11:12:19,896 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err38ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-17 11:12:19,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:19,896 INFO L85 PathProgramCache]: Analyzing trace with hash -10986991, now seen corresponding path program 1 times [2025-03-17 11:12:19,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:19,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821229724] [2025-03-17 11:12:19,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:19,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:19,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-17 11:12:19,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-17 11:12:19,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:19,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:19,923 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:19,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:19,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821229724] [2025-03-17 11:12:19,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821229724] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:19,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:19,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:19,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537030199] [2025-03-17 11:12:19,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:19,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:19,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:19,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:19,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:19,952 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1063 out of 1111 [2025-03-17 11:12:19,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 987 places, 1017 transitions, 2100 flow. Second operand has 3 states, 3 states have (on average 1064.6666666666667) internal successors, (3194), 3 states have internal predecessors, (3194), 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:19,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:19,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1063 of 1111 [2025-03-17 11:12:19,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:20,834 INFO L124 PetriNetUnfolderBase]: 298/5500 cut-off events. [2025-03-17 11:12:20,834 INFO L125 PetriNetUnfolderBase]: For 14/28 co-relation queries the response was YES. [2025-03-17 11:12:20,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5754 conditions, 5500 events. 298/5500 cut-off events. For 14/28 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 44992 event pairs, 15 based on Foata normal form. 0/4551 useless extension candidates. Maximal degree in co-relation 5387. Up to 68 conditions per place. [2025-03-17 11:12:20,978 INFO L140 encePairwiseOnDemand]: 1096/1111 looper letters, 20 selfloop transitions, 9 changer transitions 0/1017 dead transitions. [2025-03-17 11:12:20,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 983 places, 1017 transitions, 2160 flow [2025-03-17 11:12:20,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:20,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:20,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3224 transitions. [2025-03-17 11:12:20,980 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9672967296729673 [2025-03-17 11:12:20,980 INFO L175 Difference]: Start difference. First operand has 987 places, 1017 transitions, 2100 flow. Second operand 3 states and 3224 transitions. [2025-03-17 11:12:20,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 983 places, 1017 transitions, 2160 flow [2025-03-17 11:12:20,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 981 places, 1017 transitions, 2156 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:20,991 INFO L231 Difference]: Finished difference. Result has 982 places, 1015 transitions, 2127 flow [2025-03-17 11:12:20,991 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2084, PETRI_DIFFERENCE_MINUEND_PLACES=979, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1011, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1002, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2127, PETRI_PLACES=982, PETRI_TRANSITIONS=1015} [2025-03-17 11:12:20,992 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -59 predicate places. [2025-03-17 11:12:20,992 INFO L471 AbstractCegarLoop]: Abstraction has has 982 places, 1015 transitions, 2127 flow [2025-03-17 11:12:20,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1064.6666666666667) internal successors, (3194), 3 states have internal predecessors, (3194), 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:20,993 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:20,993 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] [2025-03-17 11:12:20,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-17 11:12:20,993 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err37ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-17 11:12:20,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:20,993 INFO L85 PathProgramCache]: Analyzing trace with hash -923045206, now seen corresponding path program 1 times [2025-03-17 11:12:20,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:20,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653234233] [2025-03-17 11:12:20,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:20,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:21,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-17 11:12:21,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-17 11:12:21,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:21,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:21,022 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:21,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:21,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653234233] [2025-03-17 11:12:21,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653234233] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:21,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:21,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:21,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951564386] [2025-03-17 11:12:21,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:21,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:21,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:21,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:21,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:21,059 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1071 out of 1111 [2025-03-17 11:12:21,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 982 places, 1015 transitions, 2127 flow. Second operand has 3 states, 3 states have (on average 1073.0) internal successors, (3219), 3 states have internal predecessors, (3219), 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:21,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:21,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1071 of 1111 [2025-03-17 11:12:21,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:22,029 INFO L124 PetriNetUnfolderBase]: 285/5368 cut-off events. [2025-03-17 11:12:22,029 INFO L125 PetriNetUnfolderBase]: For 113/166 co-relation queries the response was YES. [2025-03-17 11:12:22,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5675 conditions, 5368 events. 285/5368 cut-off events. For 113/166 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 47574 event pairs, 30 based on Foata normal form. 0/4450 useless extension candidates. Maximal degree in co-relation 5082. Up to 105 conditions per place. [2025-03-17 11:12:22,183 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 23 selfloop transitions, 3 changer transitions 0/1016 dead transitions. [2025-03-17 11:12:22,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 983 places, 1016 transitions, 2183 flow [2025-03-17 11:12:22,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:22,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:22,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3236 transitions. [2025-03-17 11:12:22,185 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9708970897089709 [2025-03-17 11:12:22,185 INFO L175 Difference]: Start difference. First operand has 982 places, 1015 transitions, 2127 flow. Second operand 3 states and 3236 transitions. [2025-03-17 11:12:22,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 983 places, 1016 transitions, 2183 flow [2025-03-17 11:12:22,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 982 places, 1016 transitions, 2174 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:12:22,195 INFO L231 Difference]: Finished difference. Result has 982 places, 1014 transitions, 2122 flow [2025-03-17 11:12:22,196 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2116, PETRI_DIFFERENCE_MINUEND_PLACES=980, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1014, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1011, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2122, PETRI_PLACES=982, PETRI_TRANSITIONS=1014} [2025-03-17 11:12:22,196 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -59 predicate places. [2025-03-17 11:12:22,196 INFO L471 AbstractCegarLoop]: Abstraction has has 982 places, 1014 transitions, 2122 flow [2025-03-17 11:12:22,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1073.0) internal successors, (3219), 3 states have internal predecessors, (3219), 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:22,197 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:22,197 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] [2025-03-17 11:12:22,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-17 11:12:22,197 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread1Err34ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-17 11:12:22,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:22,198 INFO L85 PathProgramCache]: Analyzing trace with hash 988252550, now seen corresponding path program 1 times [2025-03-17 11:12:22,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:22,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469749714] [2025-03-17 11:12:22,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:22,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:22,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-17 11:12:22,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-17 11:12:22,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:22,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:22,250 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:22,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:22,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469749714] [2025-03-17 11:12:22,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469749714] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:22,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:22,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:12:22,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113574675] [2025-03-17 11:12:22,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:22,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:22,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:22,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:22,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:22,285 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1078 out of 1111 [2025-03-17 11:12:22,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 982 places, 1014 transitions, 2122 flow. Second operand has 3 states, 3 states have (on average 1080.3333333333333) internal successors, (3241), 3 states have internal predecessors, (3241), 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:22,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:22,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1078 of 1111 [2025-03-17 11:12:22,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:23,241 INFO L124 PetriNetUnfolderBase]: 215/4585 cut-off events. [2025-03-17 11:12:23,242 INFO L125 PetriNetUnfolderBase]: For 12/22 co-relation queries the response was YES. [2025-03-17 11:12:23,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4787 conditions, 4585 events. 215/4585 cut-off events. For 12/22 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 38459 event pairs, 4 based on Foata normal form. 1/3825 useless extension candidates. Maximal degree in co-relation 4034. Up to 33 conditions per place. [2025-03-17 11:12:23,353 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 18 selfloop transitions, 2 changer transitions 0/1020 dead transitions. [2025-03-17 11:12:23,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 984 places, 1020 transitions, 2179 flow [2025-03-17 11:12:23,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:23,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:23,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3255 transitions. [2025-03-17 11:12:23,355 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9765976597659766 [2025-03-17 11:12:23,355 INFO L175 Difference]: Start difference. First operand has 982 places, 1014 transitions, 2122 flow. Second operand 3 states and 3255 transitions. [2025-03-17 11:12:23,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 984 places, 1020 transitions, 2179 flow [2025-03-17 11:12:23,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 982 places, 1020 transitions, 2173 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:23,363 INFO L231 Difference]: Finished difference. Result has 984 places, 1015 transitions, 2130 flow [2025-03-17 11:12:23,364 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2116, PETRI_DIFFERENCE_MINUEND_PLACES=980, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1014, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1012, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2130, PETRI_PLACES=984, PETRI_TRANSITIONS=1015} [2025-03-17 11:12:23,364 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -57 predicate places. [2025-03-17 11:12:23,364 INFO L471 AbstractCegarLoop]: Abstraction has has 984 places, 1015 transitions, 2130 flow [2025-03-17 11:12:23,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1080.3333333333333) internal successors, (3241), 3 states have internal predecessors, (3241), 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:23,365 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:23,365 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] [2025-03-17 11:12:23,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-17 11:12:23,365 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread3Err38ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-17 11:12:23,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:23,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1420538762, now seen corresponding path program 1 times [2025-03-17 11:12:23,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:23,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554176510] [2025-03-17 11:12:23,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:23,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:23,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-17 11:12:23,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-17 11:12:23,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:23,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:23,394 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:23,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:23,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554176510] [2025-03-17 11:12:23,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554176510] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:23,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:23,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:23,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806641215] [2025-03-17 11:12:23,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:23,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:23,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:23,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:23,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:23,423 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1063 out of 1111 [2025-03-17 11:12:23,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 984 places, 1015 transitions, 2130 flow. Second operand has 3 states, 3 states have (on average 1065.0) internal successors, (3195), 3 states have internal predecessors, (3195), 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:23,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:23,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1063 of 1111 [2025-03-17 11:12:23,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:24,230 INFO L124 PetriNetUnfolderBase]: 255/4097 cut-off events. [2025-03-17 11:12:24,231 INFO L125 PetriNetUnfolderBase]: For 69/81 co-relation queries the response was YES. [2025-03-17 11:12:24,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4454 conditions, 4097 events. 255/4097 cut-off events. For 69/81 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 32892 event pairs, 42 based on Foata normal form. 3/3439 useless extension candidates. Maximal degree in co-relation 3682. Up to 142 conditions per place. [2025-03-17 11:12:24,373 INFO L140 encePairwiseOnDemand]: 1096/1111 looper letters, 16 selfloop transitions, 8 changer transitions 14/1015 dead transitions. [2025-03-17 11:12:24,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 980 places, 1015 transitions, 2188 flow [2025-03-17 11:12:24,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:24,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:24,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3223 transitions. [2025-03-17 11:12:24,376 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.966996699669967 [2025-03-17 11:12:24,376 INFO L175 Difference]: Start difference. First operand has 984 places, 1015 transitions, 2130 flow. Second operand 3 states and 3223 transitions. [2025-03-17 11:12:24,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 980 places, 1015 transitions, 2188 flow [2025-03-17 11:12:24,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 979 places, 1015 transitions, 2186 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:12:24,384 INFO L231 Difference]: Finished difference. Result has 980 places, 999 transitions, 2123 flow [2025-03-17 11:12:24,385 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2116, PETRI_DIFFERENCE_MINUEND_PLACES=977, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1009, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1001, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2123, PETRI_PLACES=980, PETRI_TRANSITIONS=999} [2025-03-17 11:12:24,385 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -61 predicate places. [2025-03-17 11:12:24,385 INFO L471 AbstractCegarLoop]: Abstraction has has 980 places, 999 transitions, 2123 flow [2025-03-17 11:12:24,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1065.0) internal successors, (3195), 3 states have internal predecessors, (3195), 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:24,386 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:24,386 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:12:24,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-17 11:12:24,386 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread1Err34ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-17 11:12:24,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:24,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1784962109, now seen corresponding path program 1 times [2025-03-17 11:12:24,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:24,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325767663] [2025-03-17 11:12:24,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:24,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:24,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-17 11:12:24,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-17 11:12:24,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:24,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:24,415 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:24,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:24,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325767663] [2025-03-17 11:12:24,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325767663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:24,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:24,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:24,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467412028] [2025-03-17 11:12:24,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:24,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:24,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:24,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:24,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:24,450 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1057 out of 1111 [2025-03-17 11:12:24,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 980 places, 999 transitions, 2123 flow. Second operand has 3 states, 3 states have (on average 1058.6666666666667) internal successors, (3176), 3 states have internal predecessors, (3176), 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:24,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:24,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1057 of 1111 [2025-03-17 11:12:24,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:26,346 INFO L124 PetriNetUnfolderBase]: 488/9044 cut-off events. [2025-03-17 11:12:26,347 INFO L125 PetriNetUnfolderBase]: For 80/116 co-relation queries the response was YES. [2025-03-17 11:12:26,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9907 conditions, 9044 events. 488/9044 cut-off events. For 80/116 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 83321 event pairs, 14 based on Foata normal form. 2/7652 useless extension candidates. Maximal degree in co-relation 9080. Up to 166 conditions per place. [2025-03-17 11:12:26,540 INFO L140 encePairwiseOnDemand]: 1094/1111 looper letters, 23 selfloop transitions, 9 changer transitions 0/997 dead transitions. [2025-03-17 11:12:26,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 960 places, 997 transitions, 2185 flow [2025-03-17 11:12:26,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:26,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:26,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3211 transitions. [2025-03-17 11:12:26,542 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9633963396339634 [2025-03-17 11:12:26,542 INFO L175 Difference]: Start difference. First operand has 980 places, 999 transitions, 2123 flow. Second operand 3 states and 3211 transitions. [2025-03-17 11:12:26,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 960 places, 997 transitions, 2185 flow [2025-03-17 11:12:26,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 959 places, 997 transitions, 2177 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:12:26,552 INFO L231 Difference]: Finished difference. Result has 961 places, 995 transitions, 2151 flow [2025-03-17 11:12:26,553 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2099, PETRI_DIFFERENCE_MINUEND_PLACES=957, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=991, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=982, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2151, PETRI_PLACES=961, PETRI_TRANSITIONS=995} [2025-03-17 11:12:26,553 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -80 predicate places. [2025-03-17 11:12:26,553 INFO L471 AbstractCegarLoop]: Abstraction has has 961 places, 995 transitions, 2151 flow [2025-03-17 11:12:26,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1058.6666666666667) internal successors, (3176), 3 states have internal predecessors, (3176), 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:26,554 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:26,554 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:12:26,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-17 11:12:26,554 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread1Err33ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-17 11:12:26,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:26,555 INFO L85 PathProgramCache]: Analyzing trace with hash -996463052, now seen corresponding path program 1 times [2025-03-17 11:12:26,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:26,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157307555] [2025-03-17 11:12:26,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:26,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:26,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-17 11:12:26,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-17 11:12:26,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:26,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:26,582 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:26,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:26,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157307555] [2025-03-17 11:12:26,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157307555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:26,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:26,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:26,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324567481] [2025-03-17 11:12:26,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:26,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:26,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:26,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:26,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:26,619 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1069 out of 1111 [2025-03-17 11:12:26,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 961 places, 995 transitions, 2151 flow. Second operand has 3 states, 3 states have (on average 1071.0) internal successors, (3213), 3 states have internal predecessors, (3213), 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:26,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:26,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1069 of 1111 [2025-03-17 11:12:26,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:28,119 INFO L124 PetriNetUnfolderBase]: 367/7058 cut-off events. [2025-03-17 11:12:28,119 INFO L125 PetriNetUnfolderBase]: For 166/204 co-relation queries the response was YES. [2025-03-17 11:12:28,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7780 conditions, 7058 events. 367/7058 cut-off events. For 166/204 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 68218 event pairs, 48 based on Foata normal form. 2/5984 useless extension candidates. Maximal degree in co-relation 6211. Up to 147 conditions per place. [2025-03-17 11:12:28,357 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 24 selfloop transitions, 3 changer transitions 0/996 dead transitions. [2025-03-17 11:12:28,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 962 places, 996 transitions, 2209 flow [2025-03-17 11:12:28,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:28,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:28,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3231 transitions. [2025-03-17 11:12:28,359 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9693969396939695 [2025-03-17 11:12:28,359 INFO L175 Difference]: Start difference. First operand has 961 places, 995 transitions, 2151 flow. Second operand 3 states and 3231 transitions. [2025-03-17 11:12:28,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 962 places, 996 transitions, 2209 flow [2025-03-17 11:12:28,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 960 places, 996 transitions, 2191 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:28,369 INFO L231 Difference]: Finished difference. Result has 960 places, 994 transitions, 2137 flow [2025-03-17 11:12:28,369 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2131, PETRI_DIFFERENCE_MINUEND_PLACES=958, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=994, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=991, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2137, PETRI_PLACES=960, PETRI_TRANSITIONS=994} [2025-03-17 11:12:28,370 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -81 predicate places. [2025-03-17 11:12:28,370 INFO L471 AbstractCegarLoop]: Abstraction has has 960 places, 994 transitions, 2137 flow [2025-03-17 11:12:28,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1071.0) internal successors, (3213), 3 states have internal predecessors, (3213), 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:28,370 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:28,371 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:12:28,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-17 11:12:28,371 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread3Err37ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-17 11:12:28,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:28,371 INFO L85 PathProgramCache]: Analyzing trace with hash 930655494, now seen corresponding path program 1 times [2025-03-17 11:12:28,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:28,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917775104] [2025-03-17 11:12:28,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:28,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:28,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-17 11:12:28,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-17 11:12:28,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:28,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:28,397 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:28,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:28,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917775104] [2025-03-17 11:12:28,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917775104] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:28,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:28,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:28,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018439135] [2025-03-17 11:12:28,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:28,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:28,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:28,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:28,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:28,434 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1071 out of 1111 [2025-03-17 11:12:28,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 960 places, 994 transitions, 2137 flow. Second operand has 3 states, 3 states have (on average 1073.3333333333333) internal successors, (3220), 3 states have internal predecessors, (3220), 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:28,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:28,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1071 of 1111 [2025-03-17 11:12:28,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:29,297 INFO L124 PetriNetUnfolderBase]: 259/4213 cut-off events. [2025-03-17 11:12:29,297 INFO L125 PetriNetUnfolderBase]: For 187/205 co-relation queries the response was YES. [2025-03-17 11:12:29,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4725 conditions, 4213 events. 259/4213 cut-off events. For 187/205 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 33854 event pairs, 60 based on Foata normal form. 1/3550 useless extension candidates. Maximal degree in co-relation 3940. Up to 212 conditions per place. [2025-03-17 11:12:29,410 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 20 selfloop transitions, 3 changer transitions 0/995 dead transitions. [2025-03-17 11:12:29,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 961 places, 995 transitions, 2187 flow [2025-03-17 11:12:29,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:29,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:29,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3233 transitions. [2025-03-17 11:12:29,412 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.96999699969997 [2025-03-17 11:12:29,412 INFO L175 Difference]: Start difference. First operand has 960 places, 994 transitions, 2137 flow. Second operand 3 states and 3233 transitions. [2025-03-17 11:12:29,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 961 places, 995 transitions, 2187 flow [2025-03-17 11:12:29,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 959 places, 995 transitions, 2181 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:29,419 INFO L231 Difference]: Finished difference. Result has 959 places, 993 transitions, 2135 flow [2025-03-17 11:12:29,420 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2129, PETRI_DIFFERENCE_MINUEND_PLACES=957, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=993, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=990, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2135, PETRI_PLACES=959, PETRI_TRANSITIONS=993} [2025-03-17 11:12:29,420 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -82 predicate places. [2025-03-17 11:12:29,420 INFO L471 AbstractCegarLoop]: Abstraction has has 959 places, 993 transitions, 2135 flow [2025-03-17 11:12:29,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1073.3333333333333) internal successors, (3220), 3 states have internal predecessors, (3220), 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:29,420 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:29,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-17 11:12:29,420 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread2Err34ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-17 11:12:29,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:29,421 INFO L85 PathProgramCache]: Analyzing trace with hash -458483844, now seen corresponding path program 1 times [2025-03-17 11:12:29,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:29,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614898035] [2025-03-17 11:12:29,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:29,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:29,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-17 11:12:29,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-17 11:12:29,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:29,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:29,456 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:29,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:29,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614898035] [2025-03-17 11:12:29,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614898035] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:29,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:29,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:12:29,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166115949] [2025-03-17 11:12:29,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:29,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:29,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:29,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:29,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:29,486 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1078 out of 1111 [2025-03-17 11:12:29,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 959 places, 993 transitions, 2135 flow. Second operand has 3 states, 3 states have (on average 1080.6666666666667) internal successors, (3242), 3 states have internal predecessors, (3242), 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:29,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:29,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1078 of 1111 [2025-03-17 11:12:29,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:31,036 INFO L124 PetriNetUnfolderBase]: 267/5701 cut-off events. [2025-03-17 11:12:31,036 INFO L125 PetriNetUnfolderBase]: For 34/90 co-relation queries the response was YES. [2025-03-17 11:12:31,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6129 conditions, 5701 events. 267/5701 cut-off events. For 34/90 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 50728 event pairs, 8 based on Foata normal form. 0/4817 useless extension candidates. Maximal degree in co-relation 4950. Up to 89 conditions per place. [2025-03-17 11:12:31,352 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 15 selfloop transitions, 2 changer transitions 0/997 dead transitions. [2025-03-17 11:12:31,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 961 places, 997 transitions, 2180 flow [2025-03-17 11:12:31,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:31,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:31,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3252 transitions. [2025-03-17 11:12:31,354 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9756975697569757 [2025-03-17 11:12:31,354 INFO L175 Difference]: Start difference. First operand has 959 places, 993 transitions, 2135 flow. Second operand 3 states and 3252 transitions. [2025-03-17 11:12:31,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 961 places, 997 transitions, 2180 flow [2025-03-17 11:12:31,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 959 places, 997 transitions, 2174 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:31,364 INFO L231 Difference]: Finished difference. Result has 961 places, 994 transitions, 2143 flow [2025-03-17 11:12:31,364 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2129, PETRI_DIFFERENCE_MINUEND_PLACES=957, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=993, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=991, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2143, PETRI_PLACES=961, PETRI_TRANSITIONS=994} [2025-03-17 11:12:31,365 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -80 predicate places. [2025-03-17 11:12:31,365 INFO L471 AbstractCegarLoop]: Abstraction has has 961 places, 994 transitions, 2143 flow [2025-03-17 11:12:31,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1080.6666666666667) internal successors, (3242), 3 states have internal predecessors, (3242), 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:31,365 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:31,365 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:12:31,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-17 11:12:31,366 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread2Err34ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-17 11:12:31,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:31,366 INFO L85 PathProgramCache]: Analyzing trace with hash -529223975, now seen corresponding path program 1 times [2025-03-17 11:12:31,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:31,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230196316] [2025-03-17 11:12:31,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:31,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:31,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-03-17 11:12:31,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-03-17 11:12:31,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:31,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:31,393 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:31,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:31,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230196316] [2025-03-17 11:12:31,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230196316] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:31,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:31,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:31,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775170037] [2025-03-17 11:12:31,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:31,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:31,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:31,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:31,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:31,427 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1057 out of 1111 [2025-03-17 11:12:31,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 961 places, 994 transitions, 2143 flow. Second operand has 3 states, 3 states have (on average 1059.0) internal successors, (3177), 3 states have internal predecessors, (3177), 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:31,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:31,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1057 of 1111 [2025-03-17 11:12:31,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:34,327 INFO L124 PetriNetUnfolderBase]: 631/10693 cut-off events. [2025-03-17 11:12:34,327 INFO L125 PetriNetUnfolderBase]: For 84/240 co-relation queries the response was YES. [2025-03-17 11:12:34,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11798 conditions, 10693 events. 631/10693 cut-off events. For 84/240 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 110489 event pairs, 67 based on Foata normal form. 0/9062 useless extension candidates. Maximal degree in co-relation 9704. Up to 336 conditions per place. [2025-03-17 11:12:34,915 INFO L140 encePairwiseOnDemand]: 1094/1111 looper letters, 23 selfloop transitions, 9 changer transitions 0/992 dead transitions. [2025-03-17 11:12:34,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 955 places, 992 transitions, 2205 flow [2025-03-17 11:12:34,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:34,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:34,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3211 transitions. [2025-03-17 11:12:34,917 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9633963396339634 [2025-03-17 11:12:34,917 INFO L175 Difference]: Start difference. First operand has 961 places, 994 transitions, 2143 flow. Second operand 3 states and 3211 transitions. [2025-03-17 11:12:34,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 955 places, 992 transitions, 2205 flow [2025-03-17 11:12:34,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 954 places, 992 transitions, 2203 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:12:34,926 INFO L231 Difference]: Finished difference. Result has 956 places, 990 transitions, 2177 flow [2025-03-17 11:12:34,927 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2125, PETRI_DIFFERENCE_MINUEND_PLACES=952, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=986, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=977, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2177, PETRI_PLACES=956, PETRI_TRANSITIONS=990} [2025-03-17 11:12:34,927 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -85 predicate places. [2025-03-17 11:12:34,927 INFO L471 AbstractCegarLoop]: Abstraction has has 956 places, 990 transitions, 2177 flow [2025-03-17 11:12:34,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1059.0) internal successors, (3177), 3 states have internal predecessors, (3177), 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:34,927 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:34,927 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:12:34,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-17 11:12:34,927 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting thread2Err33ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-17 11:12:34,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:34,928 INFO L85 PathProgramCache]: Analyzing trace with hash -723286285, now seen corresponding path program 1 times [2025-03-17 11:12:34,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:34,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667015827] [2025-03-17 11:12:34,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:34,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:34,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-03-17 11:12:34,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-03-17 11:12:34,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:34,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:34,952 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:34,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:34,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667015827] [2025-03-17 11:12:34,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667015827] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:34,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:34,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:34,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190000344] [2025-03-17 11:12:34,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:34,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:34,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:34,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:34,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:34,990 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1069 out of 1111 [2025-03-17 11:12:34,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 956 places, 990 transitions, 2177 flow. Second operand has 3 states, 3 states have (on average 1071.3333333333333) internal successors, (3214), 3 states have internal predecessors, (3214), 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:34,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:34,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1069 of 1111 [2025-03-17 11:12:34,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:37,503 INFO L124 PetriNetUnfolderBase]: 484/8694 cut-off events. [2025-03-17 11:12:37,503 INFO L125 PetriNetUnfolderBase]: For 386/637 co-relation queries the response was YES. [2025-03-17 11:12:37,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9793 conditions, 8694 events. 484/8694 cut-off events. For 386/637 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 92310 event pairs, 59 based on Foata normal form. 0/7387 useless extension candidates. Maximal degree in co-relation 7686. Up to 284 conditions per place. [2025-03-17 11:12:38,000 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 24 selfloop transitions, 3 changer transitions 0/991 dead transitions. [2025-03-17 11:12:38,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 957 places, 991 transitions, 2235 flow [2025-03-17 11:12:38,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:38,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:38,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3231 transitions. [2025-03-17 11:12:38,001 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9693969396939695 [2025-03-17 11:12:38,001 INFO L175 Difference]: Start difference. First operand has 956 places, 990 transitions, 2177 flow. Second operand 3 states and 3231 transitions. [2025-03-17 11:12:38,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 957 places, 991 transitions, 2235 flow [2025-03-17 11:12:38,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 955 places, 991 transitions, 2217 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:38,011 INFO L231 Difference]: Finished difference. Result has 955 places, 989 transitions, 2163 flow [2025-03-17 11:12:38,011 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2157, PETRI_DIFFERENCE_MINUEND_PLACES=953, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=989, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=986, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2163, PETRI_PLACES=955, PETRI_TRANSITIONS=989} [2025-03-17 11:12:38,012 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -86 predicate places. [2025-03-17 11:12:38,012 INFO L471 AbstractCegarLoop]: Abstraction has has 955 places, 989 transitions, 2163 flow [2025-03-17 11:12:38,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1071.3333333333333) internal successors, (3214), 3 states have internal predecessors, (3214), 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,012 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:38,012 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:12:38,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-17 11:12:38,012 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting thread1Err32ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-17 11:12:38,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:38,013 INFO L85 PathProgramCache]: Analyzing trace with hash -16853858, now seen corresponding path program 1 times [2025-03-17 11:12:38,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:38,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338363409] [2025-03-17 11:12:38,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:38,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:38,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-17 11:12:38,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-17 11:12:38,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:38,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:38,039 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,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:38,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338363409] [2025-03-17 11:12:38,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338363409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:38,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:38,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:38,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677931340] [2025-03-17 11:12:38,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:38,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:38,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:38,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:38,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:38,068 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1071 out of 1111 [2025-03-17 11:12:38,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 955 places, 989 transitions, 2163 flow. Second operand has 3 states, 3 states have (on average 1072.6666666666667) internal successors, (3218), 3 states have internal predecessors, (3218), 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,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:38,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1071 of 1111 [2025-03-17 11:12:38,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:39,538 INFO L124 PetriNetUnfolderBase]: 263/5241 cut-off events. [2025-03-17 11:12:39,538 INFO L125 PetriNetUnfolderBase]: For 12/84 co-relation queries the response was YES. [2025-03-17 11:12:39,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5874 conditions, 5241 events. 263/5241 cut-off events. For 12/84 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 48400 event pairs, 6 based on Foata normal form. 2/4548 useless extension candidates. Maximal degree in co-relation 4566. Up to 106 conditions per place. [2025-03-17 11:12:39,797 INFO L140 encePairwiseOnDemand]: 1104/1111 looper letters, 15 selfloop transitions, 3 changer transitions 0/987 dead transitions. [2025-03-17 11:12:39,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 953 places, 987 transitions, 2197 flow [2025-03-17 11:12:39,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:39,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:39,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3235 transitions. [2025-03-17 11:12:39,799 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9705970597059705 [2025-03-17 11:12:39,799 INFO L175 Difference]: Start difference. First operand has 955 places, 989 transitions, 2163 flow. Second operand 3 states and 3235 transitions. [2025-03-17 11:12:39,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 953 places, 987 transitions, 2197 flow [2025-03-17 11:12:39,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 951 places, 987 transitions, 2191 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:39,807 INFO L231 Difference]: Finished difference. Result has 951 places, 985 transitions, 2155 flow [2025-03-17 11:12:39,807 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2149, PETRI_DIFFERENCE_MINUEND_PLACES=949, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=985, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=982, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2155, PETRI_PLACES=951, PETRI_TRANSITIONS=985} [2025-03-17 11:12:39,808 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -90 predicate places. [2025-03-17 11:12:39,808 INFO L471 AbstractCegarLoop]: Abstraction has has 951 places, 985 transitions, 2155 flow [2025-03-17 11:12:39,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1072.6666666666667) internal successors, (3218), 3 states have internal predecessors, (3218), 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,808 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:39,808 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-17 11:12:39,808 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting thread3Err34ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-17 11:12:39,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:39,809 INFO L85 PathProgramCache]: Analyzing trace with hash -619414731, now seen corresponding path program 1 times [2025-03-17 11:12:39,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:39,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922825875] [2025-03-17 11:12:39,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:39,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:39,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-17 11:12:39,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-17 11:12:39,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:39,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:39,834 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,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:39,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922825875] [2025-03-17 11:12:39,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922825875] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:39,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:39,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:12:39,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011638063] [2025-03-17 11:12:39,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:39,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:39,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:39,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:39,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:39,865 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1078 out of 1111 [2025-03-17 11:12:39,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 951 places, 985 transitions, 2155 flow. Second operand has 3 states, 3 states have (on average 1081.0) internal successors, (3243), 3 states have internal predecessors, (3243), 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,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:39,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1078 of 1111 [2025-03-17 11:12:39,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:42,192 INFO L124 PetriNetUnfolderBase]: 386/8449 cut-off events. [2025-03-17 11:12:42,193 INFO L125 PetriNetUnfolderBase]: For 37/73 co-relation queries the response was YES. [2025-03-17 11:12:42,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9048 conditions, 8449 events. 386/8449 cut-off events. For 37/73 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 77415 event pairs, 16 based on Foata normal form. 2/7129 useless extension candidates. Maximal degree in co-relation 7625. Up to 183 conditions per place. [2025-03-17 11:12:42,500 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 14 selfloop transitions, 2 changer transitions 0/988 dead transitions. [2025-03-17 11:12:42,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 953 places, 988 transitions, 2195 flow [2025-03-17 11:12:42,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:42,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:42,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3251 transitions. [2025-03-17 11:12:42,501 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9753975397539754 [2025-03-17 11:12:42,501 INFO L175 Difference]: Start difference. First operand has 951 places, 985 transitions, 2155 flow. Second operand 3 states and 3251 transitions. [2025-03-17 11:12:42,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 953 places, 988 transitions, 2195 flow [2025-03-17 11:12:42,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 951 places, 988 transitions, 2189 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:42,510 INFO L231 Difference]: Finished difference. Result has 953 places, 986 transitions, 2163 flow [2025-03-17 11:12:42,511 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2149, PETRI_DIFFERENCE_MINUEND_PLACES=949, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=985, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=983, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2163, PETRI_PLACES=953, PETRI_TRANSITIONS=986} [2025-03-17 11:12:42,511 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -88 predicate places. [2025-03-17 11:12:42,511 INFO L471 AbstractCegarLoop]: Abstraction has has 953 places, 986 transitions, 2163 flow [2025-03-17 11:12:42,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1081.0) internal successors, (3243), 3 states have internal predecessors, (3243), 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,511 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:42,512 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:12:42,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-17 11:12:42,512 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting thread3Err34ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-17 11:12:42,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:42,512 INFO L85 PathProgramCache]: Analyzing trace with hash -564974862, now seen corresponding path program 1 times [2025-03-17 11:12:42,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:42,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122443061] [2025-03-17 11:12:42,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:42,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:42,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-17 11:12:42,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-17 11:12:42,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:42,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:42,538 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,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:42,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122443061] [2025-03-17 11:12:42,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122443061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:42,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:42,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:42,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825967796] [2025-03-17 11:12:42,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:42,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:42,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:42,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:42,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:42,574 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1057 out of 1111 [2025-03-17 11:12:42,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 953 places, 986 transitions, 2163 flow. Second operand has 3 states, 3 states have (on average 1059.3333333333333) internal successors, (3178), 3 states have internal predecessors, (3178), 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,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:42,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1057 of 1111 [2025-03-17 11:12:42,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:45,769 INFO L124 PetriNetUnfolderBase]: 674/9720 cut-off events. [2025-03-17 11:12:45,769 INFO L125 PetriNetUnfolderBase]: For 301/368 co-relation queries the response was YES. [2025-03-17 11:12:46,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11215 conditions, 9720 events. 674/9720 cut-off events. For 301/368 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 108238 event pairs, 166 based on Foata normal form. 2/8329 useless extension candidates. Maximal degree in co-relation 9620. Up to 682 conditions per place. [2025-03-17 11:12:46,192 INFO L140 encePairwiseOnDemand]: 1094/1111 looper letters, 23 selfloop transitions, 9 changer transitions 0/984 dead transitions. [2025-03-17 11:12:46,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 947 places, 984 transitions, 2225 flow [2025-03-17 11:12:46,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:46,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:46,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3211 transitions. [2025-03-17 11:12:46,193 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9633963396339634 [2025-03-17 11:12:46,193 INFO L175 Difference]: Start difference. First operand has 953 places, 986 transitions, 2163 flow. Second operand 3 states and 3211 transitions. [2025-03-17 11:12:46,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 947 places, 984 transitions, 2225 flow [2025-03-17 11:12:46,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 946 places, 984 transitions, 2223 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:12:46,202 INFO L231 Difference]: Finished difference. Result has 948 places, 982 transitions, 2197 flow [2025-03-17 11:12:46,202 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2145, PETRI_DIFFERENCE_MINUEND_PLACES=944, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=978, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=969, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2197, PETRI_PLACES=948, PETRI_TRANSITIONS=982} [2025-03-17 11:12:46,203 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -93 predicate places. [2025-03-17 11:12:46,203 INFO L471 AbstractCegarLoop]: Abstraction has has 948 places, 982 transitions, 2197 flow [2025-03-17 11:12:46,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1059.3333333333333) internal successors, (3178), 3 states have internal predecessors, (3178), 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,203 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:46,203 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:12:46,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-17 11:12:46,203 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting thread3Err33ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-17 11:12:46,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:46,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1831563505, now seen corresponding path program 1 times [2025-03-17 11:12:46,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:46,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817061164] [2025-03-17 11:12:46,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:46,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:46,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-17 11:12:46,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-17 11:12:46,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:46,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:46,228 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,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:46,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817061164] [2025-03-17 11:12:46,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817061164] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:46,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:46,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:46,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898850331] [2025-03-17 11:12:46,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:46,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:46,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:46,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:46,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:46,271 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1069 out of 1111 [2025-03-17 11:12:46,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 948 places, 982 transitions, 2197 flow. Second operand has 3 states, 3 states have (on average 1071.6666666666667) internal successors, (3215), 3 states have internal predecessors, (3215), 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,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:46,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1069 of 1111 [2025-03-17 11:12:46,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:49,190 INFO L124 PetriNetUnfolderBase]: 630/10286 cut-off events. [2025-03-17 11:12:49,190 INFO L125 PetriNetUnfolderBase]: For 903/986 co-relation queries the response was YES. [2025-03-17 11:12:49,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12120 conditions, 10286 events. 630/10286 cut-off events. For 903/986 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 112866 event pairs, 190 based on Foata normal form. 2/8817 useless extension candidates. Maximal degree in co-relation 10496. Up to 585 conditions per place. [2025-03-17 11:12:49,655 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 24 selfloop transitions, 3 changer transitions 0/983 dead transitions. [2025-03-17 11:12:49,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 949 places, 983 transitions, 2255 flow [2025-03-17 11:12:49,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:49,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:49,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3231 transitions. [2025-03-17 11:12:49,657 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9693969396939695 [2025-03-17 11:12:49,657 INFO L175 Difference]: Start difference. First operand has 948 places, 982 transitions, 2197 flow. Second operand 3 states and 3231 transitions. [2025-03-17 11:12:49,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 949 places, 983 transitions, 2255 flow [2025-03-17 11:12:49,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 947 places, 983 transitions, 2237 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:49,667 INFO L231 Difference]: Finished difference. Result has 947 places, 981 transitions, 2183 flow [2025-03-17 11:12:49,668 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2177, PETRI_DIFFERENCE_MINUEND_PLACES=945, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=981, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=978, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2183, PETRI_PLACES=947, PETRI_TRANSITIONS=981} [2025-03-17 11:12:49,668 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -94 predicate places. [2025-03-17 11:12:49,668 INFO L471 AbstractCegarLoop]: Abstraction has has 947 places, 981 transitions, 2183 flow [2025-03-17 11:12:49,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1071.6666666666667) internal successors, (3215), 3 states have internal predecessors, (3215), 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,669 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:49,669 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:12:49,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-17 11:12:49,669 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting thread2Err32ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-17 11:12:49,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:49,669 INFO L85 PathProgramCache]: Analyzing trace with hash -122578723, now seen corresponding path program 1 times [2025-03-17 11:12:49,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:49,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879812768] [2025-03-17 11:12:49,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:49,670 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 230 statements into 1 equivalence classes. [2025-03-17 11:12:49,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-17 11:12:49,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:49,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:49,693 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:49,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:49,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879812768] [2025-03-17 11:12:49,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879812768] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:49,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:49,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:49,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093323974] [2025-03-17 11:12:49,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:49,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:49,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:49,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:49,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:49,721 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1071 out of 1111 [2025-03-17 11:12:49,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 947 places, 981 transitions, 2183 flow. Second operand has 3 states, 3 states have (on average 1073.0) internal successors, (3219), 3 states have internal predecessors, (3219), 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,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:49,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1071 of 1111 [2025-03-17 11:12:49,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:52,786 INFO L124 PetriNetUnfolderBase]: 450/8876 cut-off events. [2025-03-17 11:12:52,786 INFO L125 PetriNetUnfolderBase]: For 66/88 co-relation queries the response was YES. [2025-03-17 11:12:53,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10032 conditions, 8876 events. 450/8876 cut-off events. For 66/88 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 92209 event pairs, 11 based on Foata normal form. 0/7728 useless extension candidates. Maximal degree in co-relation 7688. Up to 204 conditions per place. [2025-03-17 11:12:53,277 INFO L140 encePairwiseOnDemand]: 1104/1111 looper letters, 15 selfloop transitions, 3 changer transitions 0/979 dead transitions. [2025-03-17 11:12:53,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 945 places, 979 transitions, 2217 flow [2025-03-17 11:12:53,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:53,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:53,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3235 transitions. [2025-03-17 11:12:53,279 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9705970597059705 [2025-03-17 11:12:53,279 INFO L175 Difference]: Start difference. First operand has 947 places, 981 transitions, 2183 flow. Second operand 3 states and 3235 transitions. [2025-03-17 11:12:53,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 945 places, 979 transitions, 2217 flow [2025-03-17 11:12:53,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 943 places, 979 transitions, 2211 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:53,288 INFO L231 Difference]: Finished difference. Result has 943 places, 977 transitions, 2175 flow [2025-03-17 11:12:53,288 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2169, PETRI_DIFFERENCE_MINUEND_PLACES=941, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=977, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=974, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2175, PETRI_PLACES=943, PETRI_TRANSITIONS=977} [2025-03-17 11:12:53,289 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -98 predicate places. [2025-03-17 11:12:53,289 INFO L471 AbstractCegarLoop]: Abstraction has has 943 places, 977 transitions, 2175 flow [2025-03-17 11:12:53,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1073.0) internal successors, (3219), 3 states have internal predecessors, (3219), 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:53,289 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:53,289 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:12:53,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-17 11:12:53,289 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting thread1Err30ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-17 11:12:53,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:53,290 INFO L85 PathProgramCache]: Analyzing trace with hash 526245348, now seen corresponding path program 1 times [2025-03-17 11:12:53,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:53,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137069165] [2025-03-17 11:12:53,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:53,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:53,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-03-17 11:12:53,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-03-17 11:12:53,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:53,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:53,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:53,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:53,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137069165] [2025-03-17 11:12:53,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137069165] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:53,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:53,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:53,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618092450] [2025-03-17 11:12:53,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:53,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:53,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:53,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:53,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:53,328 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1076 out of 1111 [2025-03-17 11:12:53,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 943 places, 977 transitions, 2175 flow. Second operand has 3 states, 3 states have (on average 1077.3333333333333) internal successors, (3232), 3 states have internal predecessors, (3232), 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:53,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:53,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1076 of 1111 [2025-03-17 11:12:53,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand