./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-node-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 735b3cc8 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-node-trans.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 c9008ebcceff34245d74f1892a84a552f8268a9318e8a2970f14b3ec6b594daf --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:42:58,715 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:42:58,760 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-14 01:42:58,763 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:42:58,763 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:42:58,779 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:42:58,779 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:42:58,779 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:42:58,779 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:42:58,779 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:42:58,779 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:42:58,780 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:42:58,780 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:42:58,780 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:42:58,780 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:42:58,780 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:42:58,780 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:42:58,780 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:42:58,780 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:42:58,780 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:42:58,780 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:42:58,780 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:42:58,780 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-14 01:42:58,780 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-14 01:42:58,780 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:42:58,780 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:42:58,780 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:42:58,780 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:42:58,781 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:42:58,781 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:42:58,781 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:42:58,781 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:42:58,781 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:42:58,781 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:42:58,781 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:42:58,781 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:42:58,781 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:42:58,781 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:42:58,781 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:42:58,781 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:42:58,781 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:42:58,781 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:42:58,781 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 -> c9008ebcceff34245d74f1892a84a552f8268a9318e8a2970f14b3ec6b594daf [2025-03-14 01:42:58,985 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:42:58,994 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:42:58,995 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:42:58,996 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:42:58,996 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:42:58,998 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-node-trans.wvr.c [2025-03-14 01:43:00,266 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18347052f/3da593383c1c429d8dc5f61c52e423cf/FLAG4cce3d241 [2025-03-14 01:43:00,519 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:43:00,519 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-node-trans.wvr.c [2025-03-14 01:43:00,525 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18347052f/3da593383c1c429d8dc5f61c52e423cf/FLAG4cce3d241 [2025-03-14 01:43:00,869 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18347052f/3da593383c1c429d8dc5f61c52e423cf [2025-03-14 01:43:00,873 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:43:00,874 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:43:00,875 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:43:00,877 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:43:00,879 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:43:00,880 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:43:00" (1/1) ... [2025-03-14 01:43:00,881 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31959a0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:43:00, skipping insertion in model container [2025-03-14 01:43:00,881 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:43:00" (1/1) ... [2025-03-14 01:43:00,896 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:43:01,064 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:43:01,073 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:43:01,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:43:01,139 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:43:01,141 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:43:01 WrapperNode [2025-03-14 01:43:01,141 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:43:01,142 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:43:01,142 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:43:01,142 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:43:01,146 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:43:01" (1/1) ... [2025-03-14 01:43:01,159 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:43:01" (1/1) ... [2025-03-14 01:43:01,196 INFO L138 Inliner]: procedures = 26, calls = 52, calls flagged for inlining = 23, calls inlined = 35, statements flattened = 775 [2025-03-14 01:43:01,197 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:43:01,197 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:43:01,197 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:43:01,198 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:43:01,203 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:43:01" (1/1) ... [2025-03-14 01:43:01,203 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:43:01" (1/1) ... [2025-03-14 01:43:01,211 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:43:01" (1/1) ... [2025-03-14 01:43:01,215 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:43:01" (1/1) ... [2025-03-14 01:43:01,245 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:43:01" (1/1) ... [2025-03-14 01:43:01,251 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:43:01" (1/1) ... [2025-03-14 01:43:01,253 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:43:01" (1/1) ... [2025-03-14 01:43:01,259 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:43:01" (1/1) ... [2025-03-14 01:43:01,262 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:43:01,265 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:43:01,266 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:43:01,266 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:43:01,267 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:43:01" (1/1) ... [2025-03-14 01:43:01,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:43:01,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:43:01,296 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-14 01:43:01,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-14 01:43:01,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:43:01,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-14 01:43:01,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-14 01:43:01,315 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-14 01:43:01,315 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-14 01:43:01,315 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-14 01:43:01,315 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-14 01:43:01,315 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-14 01:43:01,315 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-14 01:43:01,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 01:43:01,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-14 01:43:01,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:43:01,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:43:01,316 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:43:01,434 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:43:01,435 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:43:02,254 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:43:02,255 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:43:02,255 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:43:02,300 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:43:02,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:43:02 BoogieIcfgContainer [2025-03-14 01:43:02,301 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:43:02,302 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:43:02,305 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:43:02,308 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:43:02,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:43:00" (1/3) ... [2025-03-14 01:43:02,309 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53e87207 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:43:02, skipping insertion in model container [2025-03-14 01:43:02,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:43:01" (2/3) ... [2025-03-14 01:43:02,309 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53e87207 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:43:02, skipping insertion in model container [2025-03-14 01:43:02,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:43:02" (3/3) ... [2025-03-14 01:43:02,310 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-node-trans.wvr.c [2025-03-14 01:43:02,321 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:43:02,324 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-node-trans.wvr.c that has 4 procedures, 1001 locations, 1 initial locations, 6 loop locations, and 114 error locations. [2025-03-14 01:43:02,324 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:43:02,462 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-14 01:43:02,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1010 places, 1042 transitions, 2105 flow [2025-03-14 01:43:02,844 INFO L124 PetriNetUnfolderBase]: 42/1039 cut-off events. [2025-03-14 01:43:02,846 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-14 01:43:02,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1052 conditions, 1039 events. 42/1039 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2237 event pairs, 0 based on Foata normal form. 0/883 useless extension candidates. Maximal degree in co-relation 849. Up to 2 conditions per place. [2025-03-14 01:43:02,866 INFO L82 GeneralOperation]: Start removeDead. Operand has 1010 places, 1042 transitions, 2105 flow [2025-03-14 01:43:02,882 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 988 places, 1018 transitions, 2054 flow [2025-03-14 01:43:02,894 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:43:02,907 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;@39749994, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:43:02,907 INFO L334 AbstractCegarLoop]: Starting to check reachability of 192 error locations. [2025-03-14 01:43:02,911 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:43:02,912 INFO L124 PetriNetUnfolderBase]: 0/35 cut-off events. [2025-03-14 01:43:02,912 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:43:02,912 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:02,912 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] [2025-03-14 01:43:02,913 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-14 01:43:02,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:02,917 INFO L85 PathProgramCache]: Analyzing trace with hash -961876022, now seen corresponding path program 1 times [2025-03-14 01:43:02,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:02,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728360096] [2025-03-14 01:43:02,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:02,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:02,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-14 01:43:03,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-14 01:43:03,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:03,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:03,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:43:03,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:03,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728360096] [2025-03-14 01:43:03,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728360096] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:03,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:03,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:03,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60389272] [2025-03-14 01:43:03,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:03,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:03,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:03,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:03,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:03,287 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 995 out of 1042 [2025-03-14 01:43:03,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 988 places, 1018 transitions, 2054 flow. Second operand has 3 states, 3 states have (on average 996.3333333333334) internal successors, (2989), 3 states have internal predecessors, (2989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:03,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:03,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 995 of 1042 [2025-03-14 01:43:03,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:03,801 INFO L124 PetriNetUnfolderBase]: 54/1757 cut-off events. [2025-03-14 01:43:03,802 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-03-14 01:43:03,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1852 conditions, 1757 events. 54/1757 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 8043 event pairs, 21 based on Foata normal form. 53/1509 useless extension candidates. Maximal degree in co-relation 1271. Up to 62 conditions per place. [2025-03-14 01:43:03,844 INFO L140 encePairwiseOnDemand]: 1017/1042 looper letters, 19 selfloop transitions, 2 changer transitions 16/995 dead transitions. [2025-03-14 01:43:03,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 989 places, 995 transitions, 2050 flow [2025-03-14 01:43:03,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:03,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:03,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3029 transitions. [2025-03-14 01:43:03,869 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9689699296225208 [2025-03-14 01:43:03,870 INFO L175 Difference]: Start difference. First operand has 988 places, 1018 transitions, 2054 flow. Second operand 3 states and 3029 transitions. [2025-03-14 01:43:03,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 989 places, 995 transitions, 2050 flow [2025-03-14 01:43:03,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 983 places, 995 transitions, 2038 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-14 01:43:03,892 INFO L231 Difference]: Finished difference. Result has 983 places, 979 transitions, 1968 flow [2025-03-14 01:43:03,895 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1996, PETRI_DIFFERENCE_MINUEND_PLACES=981, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=995, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=993, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1968, PETRI_PLACES=983, PETRI_TRANSITIONS=979} [2025-03-14 01:43:03,897 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -5 predicate places. [2025-03-14 01:43:03,897 INFO L471 AbstractCegarLoop]: Abstraction has has 983 places, 979 transitions, 1968 flow [2025-03-14 01:43:03,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 996.3333333333334) internal successors, (2989), 3 states have internal predecessors, (2989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:03,899 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:03,899 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:43:03,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:43:03,900 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-14 01:43:03,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:03,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1747389207, now seen corresponding path program 1 times [2025-03-14 01:43:03,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:03,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566221583] [2025-03-14 01:43:03,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:03,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:03,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-14 01:43:03,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-14 01:43:03,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:03,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:03,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:43:03,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:03,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566221583] [2025-03-14 01:43:03,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566221583] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:03,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:03,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:03,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172681979] [2025-03-14 01:43:03,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:03,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:03,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:03,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:03,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:04,005 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 981 out of 1042 [2025-03-14 01:43:04,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 983 places, 979 transitions, 1968 flow. Second operand has 3 states, 3 states have (on average 982.0) internal successors, (2946), 3 states have internal predecessors, (2946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:04,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:04,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 981 of 1042 [2025-03-14 01:43:04,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:04,553 INFO L124 PetriNetUnfolderBase]: 114/2523 cut-off events. [2025-03-14 01:43:04,554 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-03-14 01:43:04,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2690 conditions, 2523 events. 114/2523 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 15134 event pairs, 60 based on Foata normal form. 0/2116 useless extension candidates. Maximal degree in co-relation 2647. Up to 146 conditions per place. [2025-03-14 01:43:04,605 INFO L140 encePairwiseOnDemand]: 1031/1042 looper letters, 26 selfloop transitions, 1 changer transitions 0/969 dead transitions. [2025-03-14 01:43:04,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 959 places, 969 transitions, 2002 flow [2025-03-14 01:43:04,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:04,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:04,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2980 transitions. [2025-03-14 01:43:04,610 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9532949456174025 [2025-03-14 01:43:04,610 INFO L175 Difference]: Start difference. First operand has 983 places, 979 transitions, 1968 flow. Second operand 3 states and 2980 transitions. [2025-03-14 01:43:04,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 959 places, 969 transitions, 2002 flow [2025-03-14 01:43:04,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 957 places, 969 transitions, 1998 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:43:04,623 INFO L231 Difference]: Finished difference. Result has 957 places, 969 transitions, 1946 flow [2025-03-14 01:43:04,625 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1944, PETRI_DIFFERENCE_MINUEND_PLACES=955, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=969, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=968, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1946, PETRI_PLACES=957, PETRI_TRANSITIONS=969} [2025-03-14 01:43:04,625 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -31 predicate places. [2025-03-14 01:43:04,625 INFO L471 AbstractCegarLoop]: Abstraction has has 957 places, 969 transitions, 1946 flow [2025-03-14 01:43:04,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 982.0) internal successors, (2946), 3 states have internal predecessors, (2946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:04,627 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:04,627 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] [2025-03-14 01:43:04,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:43:04,628 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-14 01:43:04,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:04,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1873545488, now seen corresponding path program 1 times [2025-03-14 01:43:04,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:04,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803012058] [2025-03-14 01:43:04,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:04,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:04,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-14 01:43:04,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-14 01:43:04,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:04,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:04,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:43:04,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:04,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803012058] [2025-03-14 01:43:04,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803012058] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:04,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:04,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:04,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699783397] [2025-03-14 01:43:04,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:04,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:04,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:04,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:04,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:04,784 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 995 out of 1042 [2025-03-14 01:43:04,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 957 places, 969 transitions, 1946 flow. Second operand has 3 states, 3 states have (on average 996.3333333333334) internal successors, (2989), 3 states have internal predecessors, (2989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:04,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:04,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 995 of 1042 [2025-03-14 01:43:04,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:05,369 INFO L124 PetriNetUnfolderBase]: 90/2666 cut-off events. [2025-03-14 01:43:05,370 INFO L125 PetriNetUnfolderBase]: For 5/9 co-relation queries the response was YES. [2025-03-14 01:43:05,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2781 conditions, 2666 events. 90/2666 cut-off events. For 5/9 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 16495 event pairs, 39 based on Foata normal form. 0/2208 useless extension candidates. Maximal degree in co-relation 2738. Up to 89 conditions per place. [2025-03-14 01:43:05,406 INFO L140 encePairwiseOnDemand]: 1039/1042 looper letters, 19 selfloop transitions, 2 changer transitions 0/968 dead transitions. [2025-03-14 01:43:05,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 958 places, 968 transitions, 1986 flow [2025-03-14 01:43:05,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:05,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:05,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3007 transitions. [2025-03-14 01:43:05,416 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9619321817018555 [2025-03-14 01:43:05,416 INFO L175 Difference]: Start difference. First operand has 957 places, 969 transitions, 1946 flow. Second operand 3 states and 3007 transitions. [2025-03-14 01:43:05,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 958 places, 968 transitions, 1986 flow [2025-03-14 01:43:05,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 957 places, 968 transitions, 1985 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:43:05,433 INFO L231 Difference]: Finished difference. Result has 957 places, 968 transitions, 1947 flow [2025-03-14 01:43:05,435 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1943, PETRI_DIFFERENCE_MINUEND_PLACES=955, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=968, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=966, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1947, PETRI_PLACES=957, PETRI_TRANSITIONS=968} [2025-03-14 01:43:05,436 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -31 predicate places. [2025-03-14 01:43:05,436 INFO L471 AbstractCegarLoop]: Abstraction has has 957 places, 968 transitions, 1947 flow [2025-03-14 01:43:05,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 996.3333333333334) internal successors, (2989), 3 states have internal predecessors, (2989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:05,438 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:05,438 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] [2025-03-14 01:43:05,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:43:05,438 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-14 01:43:05,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:05,439 INFO L85 PathProgramCache]: Analyzing trace with hash 999556984, now seen corresponding path program 1 times [2025-03-14 01:43:05,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:05,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038925052] [2025-03-14 01:43:05,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:05,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:05,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-14 01:43:05,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-14 01:43:05,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:05,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:05,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:43:05,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:05,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038925052] [2025-03-14 01:43:05,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038925052] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:05,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:05,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:05,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501383027] [2025-03-14 01:43:05,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:05,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:05,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:05,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:05,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:05,542 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 981 out of 1042 [2025-03-14 01:43:05,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 957 places, 968 transitions, 1947 flow. Second operand has 3 states, 3 states have (on average 982.0) internal successors, (2946), 3 states have internal predecessors, (2946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:05,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:05,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 981 of 1042 [2025-03-14 01:43:05,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:06,488 INFO L124 PetriNetUnfolderBase]: 225/3970 cut-off events. [2025-03-14 01:43:06,488 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-03-14 01:43:06,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4298 conditions, 3970 events. 225/3970 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 30208 event pairs, 132 based on Foata normal form. 0/3340 useless extension candidates. Maximal degree in co-relation 4256. Up to 264 conditions per place. [2025-03-14 01:43:06,550 INFO L140 encePairwiseOnDemand]: 1031/1042 looper letters, 26 selfloop transitions, 1 changer transitions 0/958 dead transitions. [2025-03-14 01:43:06,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 949 places, 958 transitions, 1981 flow [2025-03-14 01:43:06,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:06,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:06,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2980 transitions. [2025-03-14 01:43:06,555 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9532949456174025 [2025-03-14 01:43:06,555 INFO L175 Difference]: Start difference. First operand has 957 places, 968 transitions, 1947 flow. Second operand 3 states and 2980 transitions. [2025-03-14 01:43:06,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 949 places, 958 transitions, 1981 flow [2025-03-14 01:43:06,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 947 places, 958 transitions, 1977 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:43:06,566 INFO L231 Difference]: Finished difference. Result has 947 places, 958 transitions, 1925 flow [2025-03-14 01:43:06,567 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1923, PETRI_DIFFERENCE_MINUEND_PLACES=945, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=958, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=957, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1925, PETRI_PLACES=947, PETRI_TRANSITIONS=958} [2025-03-14 01:43:06,568 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -41 predicate places. [2025-03-14 01:43:06,568 INFO L471 AbstractCegarLoop]: Abstraction has has 947 places, 958 transitions, 1925 flow [2025-03-14 01:43:06,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 982.0) internal successors, (2946), 3 states have internal predecessors, (2946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:06,570 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:06,570 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] [2025-03-14 01:43:06,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:43:06,570 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-14 01:43:06,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:06,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1484862372, now seen corresponding path program 1 times [2025-03-14 01:43:06,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:06,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577987522] [2025-03-14 01:43:06,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:06,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:06,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-14 01:43:06,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-14 01:43:06,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:06,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:06,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:43:06,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:06,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577987522] [2025-03-14 01:43:06,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577987522] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:06,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:06,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:06,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29930819] [2025-03-14 01:43:06,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:06,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:06,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:06,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:06,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:06,682 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 995 out of 1042 [2025-03-14 01:43:06,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 947 places, 958 transitions, 1925 flow. Second operand has 3 states, 3 states have (on average 996.3333333333334) internal successors, (2989), 3 states have internal predecessors, (2989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:06,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:06,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 995 of 1042 [2025-03-14 01:43:06,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:07,051 INFO L124 PetriNetUnfolderBase]: 75/1833 cut-off events. [2025-03-14 01:43:07,051 INFO L125 PetriNetUnfolderBase]: For 20/47 co-relation queries the response was YES. [2025-03-14 01:43:07,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1934 conditions, 1833 events. 75/1833 cut-off events. For 20/47 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 8420 event pairs, 39 based on Foata normal form. 0/1560 useless extension candidates. Maximal degree in co-relation 1891. Up to 89 conditions per place. [2025-03-14 01:43:07,078 INFO L140 encePairwiseOnDemand]: 1039/1042 looper letters, 19 selfloop transitions, 2 changer transitions 0/957 dead transitions. [2025-03-14 01:43:07,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 948 places, 957 transitions, 1965 flow [2025-03-14 01:43:07,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:07,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:07,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3007 transitions. [2025-03-14 01:43:07,083 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9619321817018555 [2025-03-14 01:43:07,083 INFO L175 Difference]: Start difference. First operand has 947 places, 958 transitions, 1925 flow. Second operand 3 states and 3007 transitions. [2025-03-14 01:43:07,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 948 places, 957 transitions, 1965 flow [2025-03-14 01:43:07,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 947 places, 957 transitions, 1964 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:43:07,094 INFO L231 Difference]: Finished difference. Result has 947 places, 957 transitions, 1926 flow [2025-03-14 01:43:07,096 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1922, PETRI_DIFFERENCE_MINUEND_PLACES=945, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=957, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=955, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1926, PETRI_PLACES=947, PETRI_TRANSITIONS=957} [2025-03-14 01:43:07,096 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -41 predicate places. [2025-03-14 01:43:07,096 INFO L471 AbstractCegarLoop]: Abstraction has has 947 places, 957 transitions, 1926 flow [2025-03-14 01:43:07,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 996.3333333333334) internal successors, (2989), 3 states have internal predecessors, (2989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:07,098 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:07,098 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:43:07,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:43:07,098 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-14 01:43:07,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:07,099 INFO L85 PathProgramCache]: Analyzing trace with hash 176196081, now seen corresponding path program 1 times [2025-03-14 01:43:07,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:07,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777624190] [2025-03-14 01:43:07,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:07,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:07,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-14 01:43:07,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-14 01:43:07,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:07,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:07,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:43:07,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:07,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777624190] [2025-03-14 01:43:07,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777624190] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:07,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:07,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:07,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923616187] [2025-03-14 01:43:07,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:07,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:07,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:07,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:07,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:07,174 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 981 out of 1042 [2025-03-14 01:43:07,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 947 places, 957 transitions, 1926 flow. Second operand has 3 states, 3 states have (on average 982.0) internal successors, (2946), 3 states have internal predecessors, (2946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:07,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:07,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 981 of 1042 [2025-03-14 01:43:07,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:07,806 INFO L124 PetriNetUnfolderBase]: 227/3703 cut-off events. [2025-03-14 01:43:07,806 INFO L125 PetriNetUnfolderBase]: For 65/94 co-relation queries the response was YES. [2025-03-14 01:43:07,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3994 conditions, 3703 events. 227/3703 cut-off events. For 65/94 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 26904 event pairs, 132 based on Foata normal form. 0/3155 useless extension candidates. Maximal degree in co-relation 3952. Up to 274 conditions per place. [2025-03-14 01:43:07,857 INFO L140 encePairwiseOnDemand]: 1031/1042 looper letters, 26 selfloop transitions, 1 changer transitions 0/947 dead transitions. [2025-03-14 01:43:07,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 939 places, 947 transitions, 1960 flow [2025-03-14 01:43:07,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:07,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:07,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2980 transitions. [2025-03-14 01:43:07,940 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9532949456174025 [2025-03-14 01:43:07,940 INFO L175 Difference]: Start difference. First operand has 947 places, 957 transitions, 1926 flow. Second operand 3 states and 2980 transitions. [2025-03-14 01:43:07,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 939 places, 947 transitions, 1960 flow [2025-03-14 01:43:07,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 937 places, 947 transitions, 1956 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:43:07,951 INFO L231 Difference]: Finished difference. Result has 937 places, 947 transitions, 1904 flow [2025-03-14 01:43:07,953 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1902, PETRI_DIFFERENCE_MINUEND_PLACES=935, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=947, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=946, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1904, PETRI_PLACES=937, PETRI_TRANSITIONS=947} [2025-03-14 01:43:07,955 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -51 predicate places. [2025-03-14 01:43:07,955 INFO L471 AbstractCegarLoop]: Abstraction has has 937 places, 947 transitions, 1904 flow [2025-03-14 01:43:07,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 982.0) internal successors, (2946), 3 states have internal predecessors, (2946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:07,956 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:07,957 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:43:07,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:43:07,957 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-14 01:43:07,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:07,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1862522340, now seen corresponding path program 1 times [2025-03-14 01:43:07,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:07,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182833355] [2025-03-14 01:43:07,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:07,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:07,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-14 01:43:07,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-14 01:43:07,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:07,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:08,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:43:08,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:08,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182833355] [2025-03-14 01:43:08,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182833355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:08,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:08,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:08,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766551518] [2025-03-14 01:43:08,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:08,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:08,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:08,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:08,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:08,030 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1003 out of 1042 [2025-03-14 01:43:08,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 937 places, 947 transitions, 1904 flow. Second operand has 3 states, 3 states have (on average 1004.3333333333334) internal successors, (3013), 3 states have internal predecessors, (3013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:08,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:08,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1003 of 1042 [2025-03-14 01:43:08,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:08,248 INFO L124 PetriNetUnfolderBase]: 26/1247 cut-off events. [2025-03-14 01:43:08,249 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-03-14 01:43:08,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1275 conditions, 1247 events. 26/1247 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 3314 event pairs, 2 based on Foata normal form. 0/1094 useless extension candidates. Maximal degree in co-relation 1232. Up to 16 conditions per place. [2025-03-14 01:43:08,265 INFO L140 encePairwiseOnDemand]: 1039/1042 looper letters, 11 selfloop transitions, 2 changer transitions 0/946 dead transitions. [2025-03-14 01:43:08,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 938 places, 946 transitions, 1928 flow [2025-03-14 01:43:08,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:08,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:08,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3023 transitions. [2025-03-14 01:43:08,271 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9670505438259757 [2025-03-14 01:43:08,271 INFO L175 Difference]: Start difference. First operand has 937 places, 947 transitions, 1904 flow. Second operand 3 states and 3023 transitions. [2025-03-14 01:43:08,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 938 places, 946 transitions, 1928 flow [2025-03-14 01:43:08,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 937 places, 946 transitions, 1927 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:43:08,286 INFO L231 Difference]: Finished difference. Result has 937 places, 946 transitions, 1905 flow [2025-03-14 01:43:08,287 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1901, PETRI_DIFFERENCE_MINUEND_PLACES=935, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=946, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=944, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1905, PETRI_PLACES=937, PETRI_TRANSITIONS=946} [2025-03-14 01:43:08,288 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -51 predicate places. [2025-03-14 01:43:08,288 INFO L471 AbstractCegarLoop]: Abstraction has has 937 places, 946 transitions, 1905 flow [2025-03-14 01:43:08,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1004.3333333333334) internal successors, (3013), 3 states have internal predecessors, (3013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:08,290 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:08,290 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:43:08,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:43:08,290 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-14 01:43:08,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:08,291 INFO L85 PathProgramCache]: Analyzing trace with hash 152169937, now seen corresponding path program 1 times [2025-03-14 01:43:08,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:08,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543974715] [2025-03-14 01:43:08,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:08,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:08,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-14 01:43:08,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-14 01:43:08,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:08,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:08,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:43:08,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:08,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543974715] [2025-03-14 01:43:08,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543974715] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:08,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:08,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:08,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281861572] [2025-03-14 01:43:08,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:08,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:08,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:08,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:08,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:08,372 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1002 out of 1042 [2025-03-14 01:43:08,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 937 places, 946 transitions, 1905 flow. Second operand has 3 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:08,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:08,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1002 of 1042 [2025-03-14 01:43:08,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:08,735 INFO L124 PetriNetUnfolderBase]: 42/1848 cut-off events. [2025-03-14 01:43:08,735 INFO L125 PetriNetUnfolderBase]: For 2/6 co-relation queries the response was YES. [2025-03-14 01:43:08,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1891 conditions, 1848 events. 42/1848 cut-off events. For 2/6 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 8323 event pairs, 6 based on Foata normal form. 0/1598 useless extension candidates. Maximal degree in co-relation 1848. Up to 25 conditions per place. [2025-03-14 01:43:08,761 INFO L140 encePairwiseOnDemand]: 1039/1042 looper letters, 12 selfloop transitions, 2 changer transitions 0/945 dead transitions. [2025-03-14 01:43:08,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 938 places, 945 transitions, 1931 flow [2025-03-14 01:43:08,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:08,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:08,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3021 transitions. [2025-03-14 01:43:08,768 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9664107485604606 [2025-03-14 01:43:08,768 INFO L175 Difference]: Start difference. First operand has 937 places, 946 transitions, 1905 flow. Second operand 3 states and 3021 transitions. [2025-03-14 01:43:08,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 938 places, 945 transitions, 1931 flow [2025-03-14 01:43:08,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 936 places, 945 transitions, 1927 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:43:08,782 INFO L231 Difference]: Finished difference. Result has 936 places, 945 transitions, 1903 flow [2025-03-14 01:43:08,784 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1899, PETRI_DIFFERENCE_MINUEND_PLACES=934, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=945, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=943, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1903, PETRI_PLACES=936, PETRI_TRANSITIONS=945} [2025-03-14 01:43:08,785 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -52 predicate places. [2025-03-14 01:43:08,786 INFO L471 AbstractCegarLoop]: Abstraction has has 936 places, 945 transitions, 1903 flow [2025-03-14 01:43:08,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:08,788 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:08,788 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] [2025-03-14 01:43:08,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:43:08,789 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-14 01:43:08,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:08,790 INFO L85 PathProgramCache]: Analyzing trace with hash 2116543638, now seen corresponding path program 1 times [2025-03-14 01:43:08,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:08,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592172368] [2025-03-14 01:43:08,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:08,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:08,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-14 01:43:08,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-14 01:43:08,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:08,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:08,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:43:08,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:08,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592172368] [2025-03-14 01:43:08,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592172368] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:08,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:08,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:08,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849209267] [2025-03-14 01:43:08,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:08,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:08,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:08,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:08,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:08,880 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1002 out of 1042 [2025-03-14 01:43:08,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 936 places, 945 transitions, 1903 flow. Second operand has 3 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:08,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:08,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1002 of 1042 [2025-03-14 01:43:08,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:09,296 INFO L124 PetriNetUnfolderBase]: 42/1847 cut-off events. [2025-03-14 01:43:09,297 INFO L125 PetriNetUnfolderBase]: For 2/6 co-relation queries the response was YES. [2025-03-14 01:43:09,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1890 conditions, 1847 events. 42/1847 cut-off events. For 2/6 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 8294 event pairs, 6 based on Foata normal form. 0/1598 useless extension candidates. Maximal degree in co-relation 1847. Up to 25 conditions per place. [2025-03-14 01:43:09,336 INFO L140 encePairwiseOnDemand]: 1039/1042 looper letters, 12 selfloop transitions, 2 changer transitions 0/944 dead transitions. [2025-03-14 01:43:09,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 937 places, 944 transitions, 1929 flow [2025-03-14 01:43:09,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:09,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:09,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3021 transitions. [2025-03-14 01:43:09,341 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9664107485604606 [2025-03-14 01:43:09,341 INFO L175 Difference]: Start difference. First operand has 936 places, 945 transitions, 1903 flow. Second operand 3 states and 3021 transitions. [2025-03-14 01:43:09,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 937 places, 944 transitions, 1929 flow [2025-03-14 01:43:09,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 935 places, 944 transitions, 1925 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:43:09,355 INFO L231 Difference]: Finished difference. Result has 935 places, 944 transitions, 1901 flow [2025-03-14 01:43:09,357 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1897, PETRI_DIFFERENCE_MINUEND_PLACES=933, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=944, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=942, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1901, PETRI_PLACES=935, PETRI_TRANSITIONS=944} [2025-03-14 01:43:09,357 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -53 predicate places. [2025-03-14 01:43:09,357 INFO L471 AbstractCegarLoop]: Abstraction has has 935 places, 944 transitions, 1901 flow [2025-03-14 01:43:09,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:09,359 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:09,359 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:43:09,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 01:43:09,359 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-14 01:43:09,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:09,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1290096329, now seen corresponding path program 1 times [2025-03-14 01:43:09,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:09,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189370155] [2025-03-14 01:43:09,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:09,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:09,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-14 01:43:09,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-14 01:43:09,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:09,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:09,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-14 01:43:09,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:09,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189370155] [2025-03-14 01:43:09,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189370155] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:09,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:09,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:09,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011282561] [2025-03-14 01:43:09,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:09,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:09,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:09,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:09,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:09,431 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1003 out of 1042 [2025-03-14 01:43:09,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 935 places, 944 transitions, 1901 flow. Second operand has 3 states, 3 states have (on average 1004.3333333333334) internal successors, (3013), 3 states have internal predecessors, (3013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:09,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:09,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1003 of 1042 [2025-03-14 01:43:09,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:09,588 INFO L124 PetriNetUnfolderBase]: 23/1094 cut-off events. [2025-03-14 01:43:09,588 INFO L125 PetriNetUnfolderBase]: For 2/6 co-relation queries the response was YES. [2025-03-14 01:43:09,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1123 conditions, 1094 events. 23/1094 cut-off events. For 2/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2565 event pairs, 2 based on Foata normal form. 0/969 useless extension candidates. Maximal degree in co-relation 1080. Up to 16 conditions per place. [2025-03-14 01:43:09,599 INFO L140 encePairwiseOnDemand]: 1039/1042 looper letters, 11 selfloop transitions, 2 changer transitions 0/943 dead transitions. [2025-03-14 01:43:09,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 936 places, 943 transitions, 1925 flow [2025-03-14 01:43:09,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:09,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:09,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3023 transitions. [2025-03-14 01:43:09,602 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9670505438259757 [2025-03-14 01:43:09,602 INFO L175 Difference]: Start difference. First operand has 935 places, 944 transitions, 1901 flow. Second operand 3 states and 3023 transitions. [2025-03-14 01:43:09,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 936 places, 943 transitions, 1925 flow [2025-03-14 01:43:09,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 934 places, 943 transitions, 1921 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:43:09,612 INFO L231 Difference]: Finished difference. Result has 934 places, 943 transitions, 1899 flow [2025-03-14 01:43:09,613 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1895, PETRI_DIFFERENCE_MINUEND_PLACES=932, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=943, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=941, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1899, PETRI_PLACES=934, PETRI_TRANSITIONS=943} [2025-03-14 01:43:09,613 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -54 predicate places. [2025-03-14 01:43:09,613 INFO L471 AbstractCegarLoop]: Abstraction has has 934 places, 943 transitions, 1899 flow [2025-03-14 01:43:09,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1004.3333333333334) internal successors, (3013), 3 states have internal predecessors, (3013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:09,615 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:09,615 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:43:09,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 01:43:09,615 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-14 01:43:09,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:09,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1040250114, now seen corresponding path program 1 times [2025-03-14 01:43:09,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:09,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652121875] [2025-03-14 01:43:09,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:09,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:09,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-14 01:43:09,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-14 01:43:09,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:09,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:09,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:43:09,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:09,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652121875] [2025-03-14 01:43:09,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652121875] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:09,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:09,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:09,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646068394] [2025-03-14 01:43:09,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:09,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:09,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:09,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:09,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:09,800 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1002 out of 1042 [2025-03-14 01:43:09,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 934 places, 943 transitions, 1899 flow. Second operand has 3 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:09,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:09,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1002 of 1042 [2025-03-14 01:43:09,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:09,979 INFO L124 PetriNetUnfolderBase]: 33/1395 cut-off events. [2025-03-14 01:43:09,979 INFO L125 PetriNetUnfolderBase]: For 4/36 co-relation queries the response was YES. [2025-03-14 01:43:09,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1435 conditions, 1395 events. 33/1395 cut-off events. For 4/36 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 4871 event pairs, 6 based on Foata normal form. 0/1219 useless extension candidates. Maximal degree in co-relation 1392. Up to 25 conditions per place. [2025-03-14 01:43:09,997 INFO L140 encePairwiseOnDemand]: 1039/1042 looper letters, 12 selfloop transitions, 2 changer transitions 0/942 dead transitions. [2025-03-14 01:43:09,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 935 places, 942 transitions, 1925 flow [2025-03-14 01:43:09,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:09,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:10,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3021 transitions. [2025-03-14 01:43:10,001 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9664107485604606 [2025-03-14 01:43:10,001 INFO L175 Difference]: Start difference. First operand has 934 places, 943 transitions, 1899 flow. Second operand 3 states and 3021 transitions. [2025-03-14 01:43:10,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 935 places, 942 transitions, 1925 flow [2025-03-14 01:43:10,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 933 places, 942 transitions, 1921 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:43:10,012 INFO L231 Difference]: Finished difference. Result has 933 places, 942 transitions, 1897 flow [2025-03-14 01:43:10,013 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1893, PETRI_DIFFERENCE_MINUEND_PLACES=931, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=942, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=940, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1897, PETRI_PLACES=933, PETRI_TRANSITIONS=942} [2025-03-14 01:43:10,014 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -55 predicate places. [2025-03-14 01:43:10,014 INFO L471 AbstractCegarLoop]: Abstraction has has 933 places, 942 transitions, 1897 flow [2025-03-14 01:43:10,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:10,016 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:10,016 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] [2025-03-14 01:43:10,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 01:43:10,016 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-14 01:43:10,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:10,016 INFO L85 PathProgramCache]: Analyzing trace with hash 818013396, now seen corresponding path program 1 times [2025-03-14 01:43:10,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:10,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186162503] [2025-03-14 01:43:10,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:10,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:10,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-14 01:43:10,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-14 01:43:10,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:10,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:10,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:43:10,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:10,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186162503] [2025-03-14 01:43:10,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186162503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:10,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:10,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:10,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142672964] [2025-03-14 01:43:10,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:10,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:10,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:10,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:10,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:10,074 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1002 out of 1042 [2025-03-14 01:43:10,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 933 places, 942 transitions, 1897 flow. Second operand has 3 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:10,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:10,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1002 of 1042 [2025-03-14 01:43:10,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:10,264 INFO L124 PetriNetUnfolderBase]: 33/1394 cut-off events. [2025-03-14 01:43:10,264 INFO L125 PetriNetUnfolderBase]: For 4/36 co-relation queries the response was YES. [2025-03-14 01:43:10,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1434 conditions, 1394 events. 33/1394 cut-off events. For 4/36 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 4817 event pairs, 6 based on Foata normal form. 0/1219 useless extension candidates. Maximal degree in co-relation 1391. Up to 25 conditions per place. [2025-03-14 01:43:10,286 INFO L140 encePairwiseOnDemand]: 1039/1042 looper letters, 12 selfloop transitions, 2 changer transitions 0/941 dead transitions. [2025-03-14 01:43:10,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 934 places, 941 transitions, 1923 flow [2025-03-14 01:43:10,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:10,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:10,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3021 transitions. [2025-03-14 01:43:10,289 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9664107485604606 [2025-03-14 01:43:10,289 INFO L175 Difference]: Start difference. First operand has 933 places, 942 transitions, 1897 flow. Second operand 3 states and 3021 transitions. [2025-03-14 01:43:10,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 934 places, 941 transitions, 1923 flow [2025-03-14 01:43:10,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 932 places, 941 transitions, 1919 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:43:10,299 INFO L231 Difference]: Finished difference. Result has 932 places, 941 transitions, 1895 flow [2025-03-14 01:43:10,300 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1891, PETRI_DIFFERENCE_MINUEND_PLACES=930, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=941, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=939, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1895, PETRI_PLACES=932, PETRI_TRANSITIONS=941} [2025-03-14 01:43:10,302 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -56 predicate places. [2025-03-14 01:43:10,302 INFO L471 AbstractCegarLoop]: Abstraction has has 932 places, 941 transitions, 1895 flow [2025-03-14 01:43:10,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:10,303 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:10,303 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] [2025-03-14 01:43:10,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-14 01:43:10,303 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-14 01:43:10,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:10,304 INFO L85 PathProgramCache]: Analyzing trace with hash -58714966, now seen corresponding path program 1 times [2025-03-14 01:43:10,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:10,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005876340] [2025-03-14 01:43:10,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:10,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:10,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-14 01:43:10,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-14 01:43:10,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:10,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:10,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:43:10,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:10,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005876340] [2025-03-14 01:43:10,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005876340] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:10,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:10,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:10,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626043436] [2025-03-14 01:43:10,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:10,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:10,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:10,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:10,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:10,365 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1003 out of 1042 [2025-03-14 01:43:10,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 932 places, 941 transitions, 1895 flow. Second operand has 3 states, 3 states have (on average 1004.3333333333334) internal successors, (3013), 3 states have internal predecessors, (3013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:10,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:10,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1003 of 1042 [2025-03-14 01:43:10,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:10,472 INFO L124 PetriNetUnfolderBase]: 20/970 cut-off events. [2025-03-14 01:43:10,472 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-03-14 01:43:10,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 998 conditions, 970 events. 20/970 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2071 event pairs, 2 based on Foata normal form. 0/870 useless extension candidates. Maximal degree in co-relation 955. Up to 16 conditions per place. [2025-03-14 01:43:10,484 INFO L140 encePairwiseOnDemand]: 1039/1042 looper letters, 11 selfloop transitions, 2 changer transitions 0/940 dead transitions. [2025-03-14 01:43:10,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 933 places, 940 transitions, 1919 flow [2025-03-14 01:43:10,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:10,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:10,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3023 transitions. [2025-03-14 01:43:10,487 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9670505438259757 [2025-03-14 01:43:10,487 INFO L175 Difference]: Start difference. First operand has 932 places, 941 transitions, 1895 flow. Second operand 3 states and 3023 transitions. [2025-03-14 01:43:10,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 933 places, 940 transitions, 1919 flow [2025-03-14 01:43:10,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 931 places, 940 transitions, 1915 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:43:10,497 INFO L231 Difference]: Finished difference. Result has 931 places, 940 transitions, 1893 flow [2025-03-14 01:43:10,499 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1889, PETRI_DIFFERENCE_MINUEND_PLACES=929, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=940, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=938, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1893, PETRI_PLACES=931, PETRI_TRANSITIONS=940} [2025-03-14 01:43:10,500 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -57 predicate places. [2025-03-14 01:43:10,500 INFO L471 AbstractCegarLoop]: Abstraction has has 931 places, 940 transitions, 1893 flow [2025-03-14 01:43:10,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1004.3333333333334) internal successors, (3013), 3 states have internal predecessors, (3013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:10,501 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:10,501 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] [2025-03-14 01:43:10,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-14 01:43:10,501 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-14 01:43:10,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:10,501 INFO L85 PathProgramCache]: Analyzing trace with hash -192962854, now seen corresponding path program 1 times [2025-03-14 01:43:10,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:10,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594174217] [2025-03-14 01:43:10,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:10,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:10,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-14 01:43:10,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-14 01:43:10,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:10,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:10,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:43:10,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:10,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594174217] [2025-03-14 01:43:10,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594174217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:10,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:10,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:10,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76092725] [2025-03-14 01:43:10,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:10,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:10,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:10,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:10,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:10,561 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1002 out of 1042 [2025-03-14 01:43:10,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 931 places, 940 transitions, 1893 flow. Second operand has 3 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:10,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:10,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1002 of 1042 [2025-03-14 01:43:10,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:10,718 INFO L124 PetriNetUnfolderBase]: 30/1205 cut-off events. [2025-03-14 01:43:10,718 INFO L125 PetriNetUnfolderBase]: For 8/10 co-relation queries the response was YES. [2025-03-14 01:43:10,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1242 conditions, 1205 events. 30/1205 cut-off events. For 8/10 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 3075 event pairs, 6 based on Foata normal form. 0/1062 useless extension candidates. Maximal degree in co-relation 1199. Up to 25 conditions per place. [2025-03-14 01:43:10,728 INFO L140 encePairwiseOnDemand]: 1039/1042 looper letters, 12 selfloop transitions, 2 changer transitions 0/939 dead transitions. [2025-03-14 01:43:10,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 932 places, 939 transitions, 1919 flow [2025-03-14 01:43:10,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:10,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:10,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3021 transitions. [2025-03-14 01:43:10,732 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9664107485604606 [2025-03-14 01:43:10,732 INFO L175 Difference]: Start difference. First operand has 931 places, 940 transitions, 1893 flow. Second operand 3 states and 3021 transitions. [2025-03-14 01:43:10,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 932 places, 939 transitions, 1919 flow [2025-03-14 01:43:10,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 930 places, 939 transitions, 1915 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:43:10,740 INFO L231 Difference]: Finished difference. Result has 930 places, 939 transitions, 1891 flow [2025-03-14 01:43:10,741 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1887, PETRI_DIFFERENCE_MINUEND_PLACES=928, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=939, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=937, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1891, PETRI_PLACES=930, PETRI_TRANSITIONS=939} [2025-03-14 01:43:10,743 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -58 predicate places. [2025-03-14 01:43:10,743 INFO L471 AbstractCegarLoop]: Abstraction has has 930 places, 939 transitions, 1891 flow [2025-03-14 01:43:10,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:10,744 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:10,744 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:43:10,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-14 01:43:10,744 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-14 01:43:10,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:10,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1323011254, now seen corresponding path program 1 times [2025-03-14 01:43:10,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:10,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16179781] [2025-03-14 01:43:10,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:10,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:10,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-14 01:43:10,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-14 01:43:10,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:10,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:10,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:43:10,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:10,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16179781] [2025-03-14 01:43:10,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16179781] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:10,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:10,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:10,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199278121] [2025-03-14 01:43:10,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:10,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:10,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:10,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:10,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:10,812 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1002 out of 1042 [2025-03-14 01:43:10,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 930 places, 939 transitions, 1891 flow. Second operand has 3 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:10,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:10,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1002 of 1042 [2025-03-14 01:43:10,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:10,947 INFO L124 PetriNetUnfolderBase]: 30/1166 cut-off events. [2025-03-14 01:43:10,947 INFO L125 PetriNetUnfolderBase]: For 8/10 co-relation queries the response was YES. [2025-03-14 01:43:10,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1203 conditions, 1166 events. 30/1166 cut-off events. For 8/10 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2951 event pairs, 6 based on Foata normal form. 0/1030 useless extension candidates. Maximal degree in co-relation 1160. Up to 25 conditions per place. [2025-03-14 01:43:10,960 INFO L140 encePairwiseOnDemand]: 1039/1042 looper letters, 12 selfloop transitions, 2 changer transitions 0/938 dead transitions. [2025-03-14 01:43:10,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 931 places, 938 transitions, 1917 flow [2025-03-14 01:43:10,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:10,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:10,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3021 transitions. [2025-03-14 01:43:10,963 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9664107485604606 [2025-03-14 01:43:10,963 INFO L175 Difference]: Start difference. First operand has 930 places, 939 transitions, 1891 flow. Second operand 3 states and 3021 transitions. [2025-03-14 01:43:10,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 931 places, 938 transitions, 1917 flow [2025-03-14 01:43:10,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 929 places, 938 transitions, 1913 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:43:10,973 INFO L231 Difference]: Finished difference. Result has 929 places, 938 transitions, 1889 flow [2025-03-14 01:43:10,974 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1885, PETRI_DIFFERENCE_MINUEND_PLACES=927, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=938, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=936, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1889, PETRI_PLACES=929, PETRI_TRANSITIONS=938} [2025-03-14 01:43:10,975 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -59 predicate places. [2025-03-14 01:43:10,975 INFO L471 AbstractCegarLoop]: Abstraction has has 929 places, 938 transitions, 1889 flow [2025-03-14 01:43:10,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:10,976 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:10,976 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] [2025-03-14 01:43:10,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-14 01:43:10,976 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-14 01:43:10,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:10,976 INFO L85 PathProgramCache]: Analyzing trace with hash 561863228, now seen corresponding path program 1 times [2025-03-14 01:43:10,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:10,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648733962] [2025-03-14 01:43:10,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:10,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:10,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-14 01:43:10,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-14 01:43:10,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:10,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:11,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:43:11,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:11,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648733962] [2025-03-14 01:43:11,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648733962] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:11,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:11,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:11,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192490846] [2025-03-14 01:43:11,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:11,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:11,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:11,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:11,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:11,044 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1042 [2025-03-14 01:43:11,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 929 places, 938 transitions, 1889 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:11,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:11,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1042 [2025-03-14 01:43:11,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:11,262 INFO L124 PetriNetUnfolderBase]: 42/1529 cut-off events. [2025-03-14 01:43:11,262 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-14 01:43:11,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1583 conditions, 1529 events. 42/1529 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 6379 event pairs, 12 based on Foata normal form. 0/1336 useless extension candidates. Maximal degree in co-relation 1540. Up to 38 conditions per place. [2025-03-14 01:43:11,285 INFO L140 encePairwiseOnDemand]: 1039/1042 looper letters, 13 selfloop transitions, 2 changer transitions 0/937 dead transitions. [2025-03-14 01:43:11,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 930 places, 937 transitions, 1917 flow [2025-03-14 01:43:11,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:11,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:11,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3019 transitions. [2025-03-14 01:43:11,289 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9657709532949457 [2025-03-14 01:43:11,289 INFO L175 Difference]: Start difference. First operand has 929 places, 938 transitions, 1889 flow. Second operand 3 states and 3019 transitions. [2025-03-14 01:43:11,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 930 places, 937 transitions, 1917 flow [2025-03-14 01:43:11,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 928 places, 937 transitions, 1913 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:43:11,299 INFO L231 Difference]: Finished difference. Result has 928 places, 937 transitions, 1887 flow [2025-03-14 01:43:11,300 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1883, PETRI_DIFFERENCE_MINUEND_PLACES=926, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=937, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=935, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1887, PETRI_PLACES=928, PETRI_TRANSITIONS=937} [2025-03-14 01:43:11,301 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -60 predicate places. [2025-03-14 01:43:11,301 INFO L471 AbstractCegarLoop]: Abstraction has has 928 places, 937 transitions, 1887 flow [2025-03-14 01:43:11,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:11,302 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:11,302 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] [2025-03-14 01:43:11,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-14 01:43:11,302 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-14 01:43:11,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:11,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1880845007, now seen corresponding path program 1 times [2025-03-14 01:43:11,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:11,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290219076] [2025-03-14 01:43:11,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:11,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:11,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-14 01:43:11,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-14 01:43:11,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:11,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:11,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:43:11,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:11,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290219076] [2025-03-14 01:43:11,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290219076] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:11,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:11,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:43:11,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270025788] [2025-03-14 01:43:11,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:11,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:43:11,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:12,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:43:12,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:43:12,466 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 913 out of 1042 [2025-03-14 01:43:12,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 928 places, 937 transitions, 1887 flow. Second operand has 6 states, 6 states have (on average 914.5) internal successors, (5487), 6 states have internal predecessors, (5487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:12,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:12,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 913 of 1042 [2025-03-14 01:43:12,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:26,983 INFO L124 PetriNetUnfolderBase]: 15257/85351 cut-off events. [2025-03-14 01:43:26,983 INFO L125 PetriNetUnfolderBase]: For 719/719 co-relation queries the response was YES. [2025-03-14 01:43:27,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107780 conditions, 85351 events. 15257/85351 cut-off events. For 719/719 co-relation queries the response was YES. Maximal size of possible extension queue 1174. Compared 1264358 event pairs, 14040 based on Foata normal form. 0/74614 useless extension candidates. Maximal degree in co-relation 107738. Up to 22026 conditions per place. [2025-03-14 01:43:27,542 INFO L140 encePairwiseOnDemand]: 1024/1042 looper letters, 87 selfloop transitions, 15 changer transitions 0/934 dead transitions. [2025-03-14 01:43:27,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 930 places, 934 transitions, 2085 flow [2025-03-14 01:43:27,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:43:27,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:43:27,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 5583 transitions. [2025-03-14 01:43:27,552 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8929942418426103 [2025-03-14 01:43:27,553 INFO L175 Difference]: Start difference. First operand has 928 places, 937 transitions, 1887 flow. Second operand 6 states and 5583 transitions. [2025-03-14 01:43:27,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 930 places, 934 transitions, 2085 flow [2025-03-14 01:43:27,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 928 places, 934 transitions, 2081 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:43:27,568 INFO L231 Difference]: Finished difference. Result has 928 places, 934 transitions, 1907 flow [2025-03-14 01:43:27,569 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1877, PETRI_DIFFERENCE_MINUEND_PLACES=923, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=934, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=919, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1907, PETRI_PLACES=928, PETRI_TRANSITIONS=934} [2025-03-14 01:43:27,570 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -60 predicate places. [2025-03-14 01:43:27,570 INFO L471 AbstractCegarLoop]: Abstraction has has 928 places, 934 transitions, 1907 flow [2025-03-14 01:43:27,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 914.5) internal successors, (5487), 6 states have internal predecessors, (5487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:27,571 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:27,571 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] [2025-03-14 01:43:27,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-14 01:43:27,572 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-14 01:43:27,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:27,573 INFO L85 PathProgramCache]: Analyzing trace with hash 325120538, now seen corresponding path program 1 times [2025-03-14 01:43:27,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:27,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741903823] [2025-03-14 01:43:27,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:27,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:27,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-14 01:43:27,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-14 01:43:27,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:27,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:27,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:43:27,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:27,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741903823] [2025-03-14 01:43:27,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741903823] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:27,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:27,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:27,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754024655] [2025-03-14 01:43:27,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:27,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:27,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:27,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:27,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:27,683 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1042 [2025-03-14 01:43:27,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 928 places, 934 transitions, 1907 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:27,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:27,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1042 [2025-03-14 01:43:27,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:28,167 INFO L124 PetriNetUnfolderBase]: 62/2127 cut-off events. [2025-03-14 01:43:28,167 INFO L125 PetriNetUnfolderBase]: For 4/7 co-relation queries the response was YES. [2025-03-14 01:43:28,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2212 conditions, 2127 events. 62/2127 cut-off events. For 4/7 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 10841 event pairs, 20 based on Foata normal form. 0/1833 useless extension candidates. Maximal degree in co-relation 2169. Up to 50 conditions per place. [2025-03-14 01:43:28,197 INFO L140 encePairwiseOnDemand]: 1039/1042 looper letters, 13 selfloop transitions, 2 changer transitions 0/933 dead transitions. [2025-03-14 01:43:28,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 929 places, 933 transitions, 1935 flow [2025-03-14 01:43:28,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:28,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:28,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3019 transitions. [2025-03-14 01:43:28,201 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9657709532949457 [2025-03-14 01:43:28,201 INFO L175 Difference]: Start difference. First operand has 928 places, 934 transitions, 1907 flow. Second operand 3 states and 3019 transitions. [2025-03-14 01:43:28,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 929 places, 933 transitions, 1935 flow [2025-03-14 01:43:28,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 924 places, 933 transitions, 1905 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:43:28,214 INFO L231 Difference]: Finished difference. Result has 924 places, 933 transitions, 1879 flow [2025-03-14 01:43:28,215 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1875, PETRI_DIFFERENCE_MINUEND_PLACES=922, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=933, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=931, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1879, PETRI_PLACES=924, PETRI_TRANSITIONS=933} [2025-03-14 01:43:28,215 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -64 predicate places. [2025-03-14 01:43:28,215 INFO L471 AbstractCegarLoop]: Abstraction has has 924 places, 933 transitions, 1879 flow [2025-03-14 01:43:28,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:28,216 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:28,217 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:43:28,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-14 01:43:28,217 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-14 01:43:28,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:28,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1865059174, now seen corresponding path program 1 times [2025-03-14 01:43:28,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:28,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230751791] [2025-03-14 01:43:28,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:28,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:28,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-03-14 01:43:28,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-03-14 01:43:28,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:28,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:28,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:43:28,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:28,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230751791] [2025-03-14 01:43:28,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230751791] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:28,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:28,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:28,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504648752] [2025-03-14 01:43:28,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:28,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:28,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:28,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:28,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:28,331 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1042 [2025-03-14 01:43:28,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 924 places, 933 transitions, 1879 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:28,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:28,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1042 [2025-03-14 01:43:28,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:28,632 INFO L124 PetriNetUnfolderBase]: 53/1627 cut-off events. [2025-03-14 01:43:28,632 INFO L125 PetriNetUnfolderBase]: For 12/24 co-relation queries the response was YES. [2025-03-14 01:43:28,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1691 conditions, 1627 events. 53/1627 cut-off events. For 12/24 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 6135 event pairs, 20 based on Foata normal form. 0/1421 useless extension candidates. Maximal degree in co-relation 1648. Up to 50 conditions per place. [2025-03-14 01:43:28,654 INFO L140 encePairwiseOnDemand]: 1039/1042 looper letters, 13 selfloop transitions, 2 changer transitions 0/932 dead transitions. [2025-03-14 01:43:28,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 925 places, 932 transitions, 1907 flow [2025-03-14 01:43:28,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:28,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:28,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3019 transitions. [2025-03-14 01:43:28,660 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9657709532949457 [2025-03-14 01:43:28,660 INFO L175 Difference]: Start difference. First operand has 924 places, 933 transitions, 1879 flow. Second operand 3 states and 3019 transitions. [2025-03-14 01:43:28,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 925 places, 932 transitions, 1907 flow [2025-03-14 01:43:28,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 923 places, 932 transitions, 1903 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:43:28,671 INFO L231 Difference]: Finished difference. Result has 923 places, 932 transitions, 1877 flow [2025-03-14 01:43:28,673 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1873, PETRI_DIFFERENCE_MINUEND_PLACES=921, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=932, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=930, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1877, PETRI_PLACES=923, PETRI_TRANSITIONS=932} [2025-03-14 01:43:28,673 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -65 predicate places. [2025-03-14 01:43:28,673 INFO L471 AbstractCegarLoop]: Abstraction has has 923 places, 932 transitions, 1877 flow [2025-03-14 01:43:28,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:28,674 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:28,674 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:43:28,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-14 01:43:28,675 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-14 01:43:28,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:28,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1637194302, now seen corresponding path program 1 times [2025-03-14 01:43:28,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:28,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194786598] [2025-03-14 01:43:28,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:28,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:28,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-03-14 01:43:28,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-03-14 01:43:28,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:28,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:28,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:43:28,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:28,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194786598] [2025-03-14 01:43:28,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194786598] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:28,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:28,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:28,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432717393] [2025-03-14 01:43:28,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:28,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:28,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:28,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:28,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:29,045 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 913 out of 1042 [2025-03-14 01:43:29,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 923 places, 932 transitions, 1877 flow. Second operand has 3 states, 3 states have (on average 915.0) internal successors, (2745), 3 states have internal predecessors, (2745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:29,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:29,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 913 of 1042 [2025-03-14 01:43:29,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:42,780 INFO L124 PetriNetUnfolderBase]: 15257/85346 cut-off events. [2025-03-14 01:43:42,780 INFO L125 PetriNetUnfolderBase]: For 719/719 co-relation queries the response was YES. [2025-03-14 01:43:43,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107775 conditions, 85346 events. 15257/85346 cut-off events. For 719/719 co-relation queries the response was YES. Maximal size of possible extension queue 1174. Compared 1263460 event pairs, 14040 based on Foata normal form. 0/74614 useless extension candidates. Maximal degree in co-relation 107733. Up to 22035 conditions per place. [2025-03-14 01:43:43,484 INFO L140 encePairwiseOnDemand]: 1033/1042 looper letters, 96 selfloop transitions, 6 changer transitions 0/929 dead transitions. [2025-03-14 01:43:43,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 922 places, 929 transitions, 2075 flow [2025-03-14 01:43:43,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:43,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:43,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2844 transitions. [2025-03-14 01:43:43,487 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9097888675623801 [2025-03-14 01:43:43,488 INFO L175 Difference]: Start difference. First operand has 923 places, 932 transitions, 1877 flow. Second operand 3 states and 2844 transitions. [2025-03-14 01:43:43,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 922 places, 929 transitions, 2075 flow [2025-03-14 01:43:43,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 920 places, 929 transitions, 2071 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:43:43,495 INFO L231 Difference]: Finished difference. Result has 920 places, 929 transitions, 1879 flow [2025-03-14 01:43:43,496 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1867, PETRI_DIFFERENCE_MINUEND_PLACES=918, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=929, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=923, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1879, PETRI_PLACES=920, PETRI_TRANSITIONS=929} [2025-03-14 01:43:43,496 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -68 predicate places. [2025-03-14 01:43:43,496 INFO L471 AbstractCegarLoop]: Abstraction has has 920 places, 929 transitions, 1879 flow [2025-03-14 01:43:43,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 915.0) internal successors, (2745), 3 states have internal predecessors, (2745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:43,497 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:43,497 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:43:43,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-14 01:43:43,497 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-14 01:43:43,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:43,498 INFO L85 PathProgramCache]: Analyzing trace with hash -284491298, now seen corresponding path program 1 times [2025-03-14 01:43:43,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:43,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510872501] [2025-03-14 01:43:43,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:43,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:43,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-03-14 01:43:43,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-03-14 01:43:43,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:43,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:43,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:43:43,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:43,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510872501] [2025-03-14 01:43:43,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510872501] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:43,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:43,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:43,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641485455] [2025-03-14 01:43:43,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:43,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:43,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:43,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:43,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:43,574 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1003 out of 1042 [2025-03-14 01:43:43,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 920 places, 929 transitions, 1879 flow. Second operand has 3 states, 3 states have (on average 1004.3333333333334) internal successors, (3013), 3 states have internal predecessors, (3013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:43,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:43,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1003 of 1042 [2025-03-14 01:43:43,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:43,725 INFO L124 PetriNetUnfolderBase]: 29/1234 cut-off events. [2025-03-14 01:43:43,726 INFO L125 PetriNetUnfolderBase]: For 3/8 co-relation queries the response was YES. [2025-03-14 01:43:43,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1274 conditions, 1234 events. 29/1234 cut-off events. For 3/8 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3908 event pairs, 5 based on Foata normal form. 0/1099 useless extension candidates. Maximal degree in co-relation 1244. Up to 22 conditions per place. [2025-03-14 01:43:43,738 INFO L140 encePairwiseOnDemand]: 1039/1042 looper letters, 11 selfloop transitions, 2 changer transitions 0/928 dead transitions. [2025-03-14 01:43:43,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 921 places, 928 transitions, 1903 flow [2025-03-14 01:43:43,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:43,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:43,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3023 transitions. [2025-03-14 01:43:43,741 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9670505438259757 [2025-03-14 01:43:43,741 INFO L175 Difference]: Start difference. First operand has 920 places, 929 transitions, 1879 flow. Second operand 3 states and 3023 transitions. [2025-03-14 01:43:43,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 921 places, 928 transitions, 1903 flow [2025-03-14 01:43:43,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 919 places, 928 transitions, 1891 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:43:43,749 INFO L231 Difference]: Finished difference. Result has 919 places, 928 transitions, 1869 flow [2025-03-14 01:43:43,750 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1865, PETRI_DIFFERENCE_MINUEND_PLACES=917, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=928, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=926, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1869, PETRI_PLACES=919, PETRI_TRANSITIONS=928} [2025-03-14 01:43:43,750 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -69 predicate places. [2025-03-14 01:43:43,750 INFO L471 AbstractCegarLoop]: Abstraction has has 919 places, 928 transitions, 1869 flow [2025-03-14 01:43:43,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1004.3333333333334) internal successors, (3013), 3 states have internal predecessors, (3013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:43,751 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:43,751 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:43:43,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-14 01:43:43,751 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-14 01:43:43,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:43,752 INFO L85 PathProgramCache]: Analyzing trace with hash 493868067, now seen corresponding path program 1 times [2025-03-14 01:43:43,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:43,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112176791] [2025-03-14 01:43:43,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:43,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:43,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 331 statements into 1 equivalence classes. [2025-03-14 01:43:43,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 331 of 331 statements. [2025-03-14 01:43:43,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:43,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:43,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:43:43,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:43,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112176791] [2025-03-14 01:43:43,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112176791] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:43,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:43,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:43,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457994667] [2025-03-14 01:43:43,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:43,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:43,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:43,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:43,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:43,834 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1003 out of 1042 [2025-03-14 01:43:43,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 919 places, 928 transitions, 1869 flow. Second operand has 3 states, 3 states have (on average 1004.3333333333334) internal successors, (3013), 3 states have internal predecessors, (3013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:43,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:43,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1003 of 1042 [2025-03-14 01:43:43,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:44,013 INFO L124 PetriNetUnfolderBase]: 37/1530 cut-off events. [2025-03-14 01:43:44,013 INFO L125 PetriNetUnfolderBase]: For 2/10 co-relation queries the response was YES. [2025-03-14 01:43:44,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1571 conditions, 1530 events. 37/1530 cut-off events. For 2/10 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 5648 event pairs, 7 based on Foata normal form. 0/1344 useless extension candidates. Maximal degree in co-relation 1528. Up to 25 conditions per place. [2025-03-14 01:43:44,030 INFO L140 encePairwiseOnDemand]: 1039/1042 looper letters, 11 selfloop transitions, 2 changer transitions 0/927 dead transitions. [2025-03-14 01:43:44,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 920 places, 927 transitions, 1893 flow [2025-03-14 01:43:44,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:44,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:44,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3023 transitions. [2025-03-14 01:43:44,032 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9670505438259757 [2025-03-14 01:43:44,033 INFO L175 Difference]: Start difference. First operand has 919 places, 928 transitions, 1869 flow. Second operand 3 states and 3023 transitions. [2025-03-14 01:43:44,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 920 places, 927 transitions, 1893 flow [2025-03-14 01:43:44,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 918 places, 927 transitions, 1889 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:43:44,040 INFO L231 Difference]: Finished difference. Result has 918 places, 927 transitions, 1867 flow [2025-03-14 01:43:44,041 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1863, PETRI_DIFFERENCE_MINUEND_PLACES=916, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=927, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=925, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1867, PETRI_PLACES=918, PETRI_TRANSITIONS=927} [2025-03-14 01:43:44,041 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -70 predicate places. [2025-03-14 01:43:44,041 INFO L471 AbstractCegarLoop]: Abstraction has has 918 places, 927 transitions, 1867 flow [2025-03-14 01:43:44,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1004.3333333333334) internal successors, (3013), 3 states have internal predecessors, (3013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:44,042 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:44,042 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:43:44,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-14 01:43:44,042 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-14 01:43:44,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:44,043 INFO L85 PathProgramCache]: Analyzing trace with hash 348330791, now seen corresponding path program 1 times [2025-03-14 01:43:44,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:44,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883315572] [2025-03-14 01:43:44,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:44,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:44,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes. [2025-03-14 01:43:44,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements. [2025-03-14 01:43:44,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:44,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:44,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:43:44,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:44,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883315572] [2025-03-14 01:43:44,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883315572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:44,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:44,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:44,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265504521] [2025-03-14 01:43:44,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:44,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:44,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:44,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:44,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:44,109 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1003 out of 1042 [2025-03-14 01:43:44,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 918 places, 927 transitions, 1867 flow. Second operand has 3 states, 3 states have (on average 1004.3333333333334) internal successors, (3013), 3 states have internal predecessors, (3013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:44,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:44,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1003 of 1042 [2025-03-14 01:43:44,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:44,255 INFO L124 PetriNetUnfolderBase]: 33/1272 cut-off events. [2025-03-14 01:43:44,255 INFO L125 PetriNetUnfolderBase]: For 6/15 co-relation queries the response was YES. [2025-03-14 01:43:44,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1311 conditions, 1272 events. 33/1272 cut-off events. For 6/15 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3657 event pairs, 7 based on Foata normal form. 0/1132 useless extension candidates. Maximal degree in co-relation 1268. Up to 26 conditions per place. [2025-03-14 01:43:44,269 INFO L140 encePairwiseOnDemand]: 1039/1042 looper letters, 11 selfloop transitions, 2 changer transitions 0/926 dead transitions. [2025-03-14 01:43:44,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 919 places, 926 transitions, 1891 flow [2025-03-14 01:43:44,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:44,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:44,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3023 transitions. [2025-03-14 01:43:44,270 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9670505438259757 [2025-03-14 01:43:44,270 INFO L175 Difference]: Start difference. First operand has 918 places, 927 transitions, 1867 flow. Second operand 3 states and 3023 transitions. [2025-03-14 01:43:44,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 919 places, 926 transitions, 1891 flow [2025-03-14 01:43:44,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 917 places, 926 transitions, 1887 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:43:44,278 INFO L231 Difference]: Finished difference. Result has 917 places, 926 transitions, 1865 flow [2025-03-14 01:43:44,279 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1861, PETRI_DIFFERENCE_MINUEND_PLACES=915, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=926, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=924, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1865, PETRI_PLACES=917, PETRI_TRANSITIONS=926} [2025-03-14 01:43:44,279 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -71 predicate places. [2025-03-14 01:43:44,279 INFO L471 AbstractCegarLoop]: Abstraction has has 917 places, 926 transitions, 1865 flow [2025-03-14 01:43:44,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1004.3333333333334) internal successors, (3013), 3 states have internal predecessors, (3013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:44,280 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:44,280 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:43:44,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-14 01:43:44,280 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err24ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-14 01:43:44,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:44,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1774236917, now seen corresponding path program 1 times [2025-03-14 01:43:44,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:44,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684365813] [2025-03-14 01:43:44,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:44,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:44,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes. [2025-03-14 01:43:44,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements. [2025-03-14 01:43:44,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:44,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:44,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:43:44,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:44,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684365813] [2025-03-14 01:43:44,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684365813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:44,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:44,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:44,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014185267] [2025-03-14 01:43:44,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:44,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:44,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:44,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:44,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:44,345 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 999 out of 1042 [2025-03-14 01:43:44,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 917 places, 926 transitions, 1865 flow. Second operand has 3 states, 3 states have (on average 1000.3333333333334) internal successors, (3001), 3 states have internal predecessors, (3001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:44,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:44,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 999 of 1042 [2025-03-14 01:43:44,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:44,719 INFO L124 PetriNetUnfolderBase]: 72/2066 cut-off events. [2025-03-14 01:43:44,719 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-03-14 01:43:44,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2168 conditions, 2066 events. 72/2066 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 10628 event pairs, 20 based on Foata normal form. 0/1821 useless extension candidates. Maximal degree in co-relation 2126. Up to 79 conditions per place. [2025-03-14 01:43:44,741 INFO L140 encePairwiseOnDemand]: 1036/1042 looper letters, 17 selfloop transitions, 2 changer transitions 0/926 dead transitions. [2025-03-14 01:43:44,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 915 places, 926 transitions, 1905 flow [2025-03-14 01:43:44,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:44,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:44,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3020 transitions. [2025-03-14 01:43:44,742 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9660908509277031 [2025-03-14 01:43:44,742 INFO L175 Difference]: Start difference. First operand has 917 places, 926 transitions, 1865 flow. Second operand 3 states and 3020 transitions. [2025-03-14 01:43:44,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 915 places, 926 transitions, 1905 flow [2025-03-14 01:43:44,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 913 places, 926 transitions, 1901 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:43:44,753 INFO L231 Difference]: Finished difference. Result has 914 places, 924 transitions, 1867 flow [2025-03-14 01:43:44,754 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1853, PETRI_DIFFERENCE_MINUEND_PLACES=911, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=922, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=920, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1867, PETRI_PLACES=914, PETRI_TRANSITIONS=924} [2025-03-14 01:43:44,754 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -74 predicate places. [2025-03-14 01:43:44,754 INFO L471 AbstractCegarLoop]: Abstraction has has 914 places, 924 transitions, 1867 flow [2025-03-14 01:43:44,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1000.3333333333334) internal successors, (3001), 3 states have internal predecessors, (3001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:44,755 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:44,756 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:43:44,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-14 01:43:44,756 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err24ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-14 01:43:44,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:44,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1205127108, now seen corresponding path program 1 times [2025-03-14 01:43:44,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:44,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182300449] [2025-03-14 01:43:44,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:44,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:44,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 380 statements into 1 equivalence classes. [2025-03-14 01:43:44,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 380 of 380 statements. [2025-03-14 01:43:44,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:44,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:44,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:43:44,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:44,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182300449] [2025-03-14 01:43:44,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182300449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:44,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:44,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:44,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947720376] [2025-03-14 01:43:44,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:44,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:44,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:44,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:44,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:44,830 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 999 out of 1042 [2025-03-14 01:43:44,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 914 places, 924 transitions, 1867 flow. Second operand has 3 states, 3 states have (on average 1000.6666666666666) internal successors, (3002), 3 states have internal predecessors, (3002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:44,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:44,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 999 of 1042 [2025-03-14 01:43:44,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:45,425 INFO L124 PetriNetUnfolderBase]: 137/3735 cut-off events. [2025-03-14 01:43:45,426 INFO L125 PetriNetUnfolderBase]: For 8/16 co-relation queries the response was YES. [2025-03-14 01:43:45,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3915 conditions, 3735 events. 137/3735 cut-off events. For 8/16 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 27642 event pairs, 49 based on Foata normal form. 0/3260 useless extension candidates. Maximal degree in co-relation 3873. Up to 125 conditions per place. [2025-03-14 01:43:45,481 INFO L140 encePairwiseOnDemand]: 1036/1042 looper letters, 17 selfloop transitions, 2 changer transitions 0/924 dead transitions. [2025-03-14 01:43:45,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 912 places, 924 transitions, 1907 flow [2025-03-14 01:43:45,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:45,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:45,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3020 transitions. [2025-03-14 01:43:45,484 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9660908509277031 [2025-03-14 01:43:45,484 INFO L175 Difference]: Start difference. First operand has 914 places, 924 transitions, 1867 flow. Second operand 3 states and 3020 transitions. [2025-03-14 01:43:45,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 912 places, 924 transitions, 1907 flow [2025-03-14 01:43:45,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 912 places, 924 transitions, 1907 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:43:45,503 INFO L231 Difference]: Finished difference. Result has 913 places, 922 transitions, 1873 flow [2025-03-14 01:43:45,504 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1859, PETRI_DIFFERENCE_MINUEND_PLACES=910, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=920, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=918, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1873, PETRI_PLACES=913, PETRI_TRANSITIONS=922} [2025-03-14 01:43:45,505 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -75 predicate places. [2025-03-14 01:43:45,505 INFO L471 AbstractCegarLoop]: Abstraction has has 913 places, 922 transitions, 1873 flow [2025-03-14 01:43:45,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1000.6666666666666) internal successors, (3002), 3 states have internal predecessors, (3002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:45,506 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:45,506 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:43:45,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-14 01:43:45,506 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err22ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-14 01:43:45,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:45,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1894779025, now seen corresponding path program 1 times [2025-03-14 01:43:45,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:45,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337376600] [2025-03-14 01:43:45,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:45,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:45,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 382 statements into 1 equivalence classes. [2025-03-14 01:43:45,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 382 of 382 statements. [2025-03-14 01:43:45,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:45,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:45,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:43:45,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:45,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337376600] [2025-03-14 01:43:45,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337376600] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:45,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:45,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-14 01:43:45,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092730107] [2025-03-14 01:43:45,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:45,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 01:43:45,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:45,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 01:43:45,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-14 01:43:46,284 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 976 out of 1042 [2025-03-14 01:43:46,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 913 places, 922 transitions, 1873 flow. Second operand has 7 states, 7 states have (on average 980.4285714285714) internal successors, (6863), 7 states have internal predecessors, (6863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:46,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:46,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 976 of 1042 [2025-03-14 01:43:46,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:46,729 INFO L124 PetriNetUnfolderBase]: 50/2227 cut-off events. [2025-03-14 01:43:46,729 INFO L125 PetriNetUnfolderBase]: For 4/10 co-relation queries the response was YES. [2025-03-14 01:43:46,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2342 conditions, 2227 events. 50/2227 cut-off events. For 4/10 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 11231 event pairs, 0 based on Foata normal form. 1/2005 useless extension candidates. Maximal degree in co-relation 2296. Up to 40 conditions per place. [2025-03-14 01:43:46,761 INFO L140 encePairwiseOnDemand]: 1032/1042 looper letters, 67 selfloop transitions, 9 changer transitions 0/957 dead transitions. [2025-03-14 01:43:46,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 919 places, 957 transitions, 2101 flow [2025-03-14 01:43:46,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-14 01:43:46,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-14 01:43:46,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 6909 transitions. [2025-03-14 01:43:46,764 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9472168905950096 [2025-03-14 01:43:46,764 INFO L175 Difference]: Start difference. First operand has 913 places, 922 transitions, 1873 flow. Second operand 7 states and 6909 transitions. [2025-03-14 01:43:46,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 919 places, 957 transitions, 2101 flow [2025-03-14 01:43:46,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 919 places, 957 transitions, 2101 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:43:46,774 INFO L231 Difference]: Finished difference. Result has 923 places, 928 transitions, 1930 flow [2025-03-14 01:43:46,775 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1873, PETRI_DIFFERENCE_MINUEND_PLACES=913, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=922, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=913, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1930, PETRI_PLACES=923, PETRI_TRANSITIONS=928} [2025-03-14 01:43:46,775 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -65 predicate places. [2025-03-14 01:43:46,775 INFO L471 AbstractCegarLoop]: Abstraction has has 923 places, 928 transitions, 1930 flow [2025-03-14 01:43:46,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 980.4285714285714) internal successors, (6863), 7 states have internal predecessors, (6863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:46,776 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:46,776 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:43:46,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-14 01:43:46,776 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread1Err22ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-14 01:43:46,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:46,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1029164713, now seen corresponding path program 1 times [2025-03-14 01:43:46,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:46,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538427216] [2025-03-14 01:43:46,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:46,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:46,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 385 statements into 1 equivalence classes. [2025-03-14 01:43:46,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 385 of 385 statements. [2025-03-14 01:43:46,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:46,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:46,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:43:46,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:46,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538427216] [2025-03-14 01:43:46,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538427216] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:46,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:46,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-14 01:43:46,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149868561] [2025-03-14 01:43:46,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:46,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 01:43:46,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:46,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 01:43:46,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-14 01:43:47,449 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 971 out of 1042 [2025-03-14 01:43:47,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 923 places, 928 transitions, 1930 flow. Second operand has 8 states, 8 states have (on average 975.375) internal successors, (7803), 8 states have internal predecessors, (7803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:47,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:47,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 971 of 1042 [2025-03-14 01:43:47,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:48,032 INFO L124 PetriNetUnfolderBase]: 73/3263 cut-off events. [2025-03-14 01:43:48,032 INFO L125 PetriNetUnfolderBase]: For 31/40 co-relation queries the response was YES. [2025-03-14 01:43:48,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3476 conditions, 3263 events. 73/3263 cut-off events. For 31/40 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 20504 event pairs, 0 based on Foata normal form. 1/2932 useless extension candidates. Maximal degree in co-relation 3426. Up to 82 conditions per place. [2025-03-14 01:43:48,078 INFO L140 encePairwiseOnDemand]: 1029/1042 looper letters, 80 selfloop transitions, 13 changer transitions 0/969 dead transitions. [2025-03-14 01:43:48,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 931 places, 969 transitions, 2218 flow [2025-03-14 01:43:48,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 01:43:48,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 01:43:48,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 8827 transitions. [2025-03-14 01:43:48,084 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9412454681168693 [2025-03-14 01:43:48,084 INFO L175 Difference]: Start difference. First operand has 923 places, 928 transitions, 1930 flow. Second operand 9 states and 8827 transitions. [2025-03-14 01:43:48,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 931 places, 969 transitions, 2218 flow [2025-03-14 01:43:48,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 929 places, 969 transitions, 2213 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:43:48,093 INFO L231 Difference]: Finished difference. Result has 936 places, 939 transitions, 2019 flow [2025-03-14 01:43:48,093 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1925, PETRI_DIFFERENCE_MINUEND_PLACES=921, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=928, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=916, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2019, PETRI_PLACES=936, PETRI_TRANSITIONS=939} [2025-03-14 01:43:48,094 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -52 predicate places. [2025-03-14 01:43:48,094 INFO L471 AbstractCegarLoop]: Abstraction has has 936 places, 939 transitions, 2019 flow [2025-03-14 01:43:48,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 975.375) internal successors, (7803), 8 states have internal predecessors, (7803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:48,095 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:48,095 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:43:48,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-14 01:43:48,095 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err22ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-14 01:43:48,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:48,096 INFO L85 PathProgramCache]: Analyzing trace with hash 522158197, now seen corresponding path program 1 times [2025-03-14 01:43:48,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:48,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889899497] [2025-03-14 01:43:48,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:48,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:48,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 388 statements into 1 equivalence classes. [2025-03-14 01:43:48,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 388 of 388 statements. [2025-03-14 01:43:48,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:48,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:48,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:43:48,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:48,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889899497] [2025-03-14 01:43:48,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889899497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:48,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:48,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:43:48,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76243215] [2025-03-14 01:43:48,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:48,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:43:48,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:48,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:43:48,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:43:49,207 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 969 out of 1042 [2025-03-14 01:43:49,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 936 places, 939 transitions, 2019 flow. Second operand has 6 states, 6 states have (on average 970.6666666666666) internal successors, (5824), 6 states have internal predecessors, (5824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:43:49,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:49,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 969 of 1042 [2025-03-14 01:43:49,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand