./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-deagle/reorder_c11_good-20.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 798a7b37 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/pthread-deagle/reorder_c11_good-20.i -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 2f66f1b2f8bc96c1cbd24e122a1b904932cb7f0e98e43f950b8a0288b2af2871 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:57:17,908 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:57:17,955 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:57:17,959 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:57:17,960 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:57:17,974 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:57:17,975 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:57:17,975 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:57:17,975 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:57:17,976 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:57:17,976 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:57:17,976 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:57:17,977 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:57:17,977 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:57:17,977 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:57:17,977 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:57:17,977 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:57:17,977 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:57:17,977 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:57:17,977 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:57:17,977 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:57:17,977 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:57:17,978 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:57:17,978 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:57:17,978 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:57:17,978 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:57:17,978 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:57:17,978 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:57:17,978 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:57:17,978 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:57:17,978 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:57:17,978 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:57:17,978 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:57:17,978 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:57:17,978 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:57:17,978 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:57:17,978 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:57:17,978 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:57:17,979 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:57:17,979 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:57:17,979 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:57:17,979 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:57:17,979 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 -> 2f66f1b2f8bc96c1cbd24e122a1b904932cb7f0e98e43f950b8a0288b2af2871 [2025-03-04 06:57:18,203 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:57:18,211 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:57:18,213 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:57:18,213 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:57:18,214 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:57:18,215 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-deagle/reorder_c11_good-20.i [2025-03-04 06:57:19,376 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3307e2f9e/194ffff280ce46308794d4d61cff6956/FLAG7b2e9323c [2025-03-04 06:57:19,643 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:57:19,645 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/reorder_c11_good-20.i [2025-03-04 06:57:19,657 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3307e2f9e/194ffff280ce46308794d4d61cff6956/FLAG7b2e9323c [2025-03-04 06:57:19,948 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3307e2f9e/194ffff280ce46308794d4d61cff6956 [2025-03-04 06:57:19,950 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:57:19,950 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:57:19,951 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:57:19,951 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:57:19,955 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:57:19,955 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:57:19" (1/1) ... [2025-03-04 06:57:19,957 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46ea42ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:19, skipping insertion in model container [2025-03-04 06:57:19,957 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:57:19" (1/1) ... [2025-03-04 06:57:19,985 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:57:20,234 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:57:20,240 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:57:20,288 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:57:20,316 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:57:20,317 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:20 WrapperNode [2025-03-04 06:57:20,317 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:57:20,318 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:57:20,318 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:57:20,319 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:57:20,324 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:20" (1/1) ... [2025-03-04 06:57:20,335 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:20" (1/1) ... [2025-03-04 06:57:20,351 INFO L138 Inliner]: procedures = 163, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 169 [2025-03-04 06:57:20,352 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:57:20,352 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:57:20,352 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:57:20,352 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:57:20,357 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:20" (1/1) ... [2025-03-04 06:57:20,357 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:20" (1/1) ... [2025-03-04 06:57:20,360 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:20" (1/1) ... [2025-03-04 06:57:20,360 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:20" (1/1) ... [2025-03-04 06:57:20,367 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:20" (1/1) ... [2025-03-04 06:57:20,368 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:20" (1/1) ... [2025-03-04 06:57:20,370 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:20" (1/1) ... [2025-03-04 06:57:20,370 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:20" (1/1) ... [2025-03-04 06:57:20,372 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:57:20,372 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:57:20,372 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:57:20,373 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:57:20,373 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:20" (1/1) ... [2025-03-04 06:57:20,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:57:20,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:57:20,401 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-04 06:57:20,403 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-04 06:57:20,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 06:57:20,420 INFO L130 BoogieDeclarations]: Found specification of procedure setThread [2025-03-04 06:57:20,420 INFO L138 BoogieDeclarations]: Found implementation of procedure setThread [2025-03-04 06:57:20,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 06:57:20,420 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 06:57:20,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:57:20,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 06:57:20,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 06:57:20,421 INFO L130 BoogieDeclarations]: Found specification of procedure checkThread [2025-03-04 06:57:20,421 INFO L138 BoogieDeclarations]: Found implementation of procedure checkThread [2025-03-04 06:57:20,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:57:20,421 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 06:57:20,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:57:20,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:57:20,422 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 06:57:20,505 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:57:20,506 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:57:20,801 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:57:20,802 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:57:20,841 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:57:20,842 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:57:20,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:57:20 BoogieIcfgContainer [2025-03-04 06:57:20,843 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:57:20,845 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:57:20,845 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:57:20,848 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:57:20,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:57:19" (1/3) ... [2025-03-04 06:57:20,849 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f9e446c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:57:20, skipping insertion in model container [2025-03-04 06:57:20,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:20" (2/3) ... [2025-03-04 06:57:20,849 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f9e446c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:57:20, skipping insertion in model container [2025-03-04 06:57:20,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:57:20" (3/3) ... [2025-03-04 06:57:20,850 INFO L128 eAbstractionObserver]: Analyzing ICFG reorder_c11_good-20.i [2025-03-04 06:57:20,860 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:57:20,861 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG reorder_c11_good-20.i that has 3 procedures, 203 locations, 1 initial locations, 4 loop locations, and 30 error locations. [2025-03-04 06:57:20,861 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:57:20,913 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-04 06:57:20,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 209 places, 217 transitions, 454 flow [2025-03-04 06:57:21,064 INFO L124 PetriNetUnfolderBase]: 32/556 cut-off events. [2025-03-04 06:57:21,068 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-04 06:57:21,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 573 conditions, 556 events. 32/556 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2267 event pairs, 0 based on Foata normal form. 0/437 useless extension candidates. Maximal degree in co-relation 266. Up to 8 conditions per place. [2025-03-04 06:57:21,076 INFO L82 GeneralOperation]: Start removeDead. Operand has 209 places, 217 transitions, 454 flow [2025-03-04 06:57:21,084 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 209 places, 217 transitions, 454 flow [2025-03-04 06:57:21,089 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:57:21,097 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@69f82375, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:57:21,097 INFO L334 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2025-03-04 06:57:21,103 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:57:21,103 INFO L124 PetriNetUnfolderBase]: 0/20 cut-off events. [2025-03-04 06:57:21,103 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:57:21,104 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:21,104 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:57:21,104 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr3ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-03-04 06:57:21,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:21,108 INFO L85 PathProgramCache]: Analyzing trace with hash 952124489, now seen corresponding path program 1 times [2025-03-04 06:57:21,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:21,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590416054] [2025-03-04 06:57:21,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:21,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:21,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 06:57:21,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 06:57:21,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:21,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:21,254 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-04 06:57:21,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:21,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590416054] [2025-03-04 06:57:21,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590416054] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:21,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:21,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:57:21,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013644860] [2025-03-04 06:57:21,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:21,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:57:21,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:21,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:57:21,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:57:21,380 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 217 [2025-03-04 06:57:21,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 217 transitions, 454 flow. Second operand has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:21,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:21,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 217 [2025-03-04 06:57:21,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:21,531 INFO L124 PetriNetUnfolderBase]: 85/973 cut-off events. [2025-03-04 06:57:21,532 INFO L125 PetriNetUnfolderBase]: For 42/44 co-relation queries the response was YES. [2025-03-04 06:57:21,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1207 conditions, 973 events. 85/973 cut-off events. For 42/44 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 5341 event pairs, 64 based on Foata normal form. 45/837 useless extension candidates. Maximal degree in co-relation 872. Up to 207 conditions per place. [2025-03-04 06:57:21,561 INFO L140 encePairwiseOnDemand]: 207/217 looper letters, 31 selfloop transitions, 2 changer transitions 0/200 dead transitions. [2025-03-04 06:57:21,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 200 transitions, 486 flow [2025-03-04 06:57:21,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:57:21,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:57:21,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 560 transitions. [2025-03-04 06:57:21,572 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8602150537634409 [2025-03-04 06:57:21,574 INFO L175 Difference]: Start difference. First operand has 209 places, 217 transitions, 454 flow. Second operand 3 states and 560 transitions. [2025-03-04 06:57:21,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 200 transitions, 486 flow [2025-03-04 06:57:21,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 200 transitions, 486 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:57:21,583 INFO L231 Difference]: Finished difference. Result has 200 places, 200 transitions, 424 flow [2025-03-04 06:57:21,585 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=424, PETRI_PLACES=200, PETRI_TRANSITIONS=200} [2025-03-04 06:57:21,588 INFO L279 CegarLoopForPetriNet]: 209 programPoint places, -9 predicate places. [2025-03-04 06:57:21,588 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 200 transitions, 424 flow [2025-03-04 06:57:21,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:21,589 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:21,589 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:57:21,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:57:21,589 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr3ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-03-04 06:57:21,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:21,590 INFO L85 PathProgramCache]: Analyzing trace with hash 776962255, now seen corresponding path program 1 times [2025-03-04 06:57:21,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:21,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161366505] [2025-03-04 06:57:21,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:21,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:21,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 06:57:21,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 06:57:21,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:21,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:21,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:57:21,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:21,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161366505] [2025-03-04 06:57:21,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161366505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:21,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:21,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:57:21,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247074946] [2025-03-04 06:57:21,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:21,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:57:21,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:21,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:57:21,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:57:21,720 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 217 [2025-03-04 06:57:21,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 200 transitions, 424 flow. Second operand has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:21,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:21,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 217 [2025-03-04 06:57:21,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:21,811 INFO L124 PetriNetUnfolderBase]: 117/982 cut-off events. [2025-03-04 06:57:21,811 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2025-03-04 06:57:21,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1310 conditions, 982 events. 117/982 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 5250 event pairs, 78 based on Foata normal form. 0/865 useless extension candidates. Maximal degree in co-relation 1281. Up to 243 conditions per place. [2025-03-04 06:57:21,816 INFO L140 encePairwiseOnDemand]: 194/217 looper letters, 31 selfloop transitions, 11 changer transitions 0/190 dead transitions. [2025-03-04 06:57:21,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 190 transitions, 488 flow [2025-03-04 06:57:21,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:57:21,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:57:21,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 519 transitions. [2025-03-04 06:57:21,818 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7972350230414746 [2025-03-04 06:57:21,818 INFO L175 Difference]: Start difference. First operand has 200 places, 200 transitions, 424 flow. Second operand 3 states and 519 transitions. [2025-03-04 06:57:21,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 190 transitions, 488 flow [2025-03-04 06:57:21,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 190 transitions, 484 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:57:21,821 INFO L231 Difference]: Finished difference. Result has 188 places, 188 transitions, 418 flow [2025-03-04 06:57:21,822 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=418, PETRI_PLACES=188, PETRI_TRANSITIONS=188} [2025-03-04 06:57:21,822 INFO L279 CegarLoopForPetriNet]: 209 programPoint places, -21 predicate places. [2025-03-04 06:57:21,822 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 188 transitions, 418 flow [2025-03-04 06:57:21,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:21,823 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:21,823 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:57:21,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:57:21,823 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr3ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-03-04 06:57:21,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:21,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1245964000, now seen corresponding path program 1 times [2025-03-04 06:57:21,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:21,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710479243] [2025-03-04 06:57:21,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:21,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:21,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 06:57:21,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 06:57:21,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:21,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:21,899 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-04 06:57:21,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:21,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710479243] [2025-03-04 06:57:21,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710479243] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:21,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:21,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:57:21,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355402250] [2025-03-04 06:57:21,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:21,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:57:21,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:21,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:57:21,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:57:21,962 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 217 [2025-03-04 06:57:21,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 188 transitions, 418 flow. Second operand has 3 states, 3 states have (on average 187.33333333333334) internal successors, (562), 3 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:21,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:21,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 217 [2025-03-04 06:57:21,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:22,015 INFO L124 PetriNetUnfolderBase]: 27/504 cut-off events. [2025-03-04 06:57:22,015 INFO L125 PetriNetUnfolderBase]: For 32/36 co-relation queries the response was YES. [2025-03-04 06:57:22,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 633 conditions, 504 events. 27/504 cut-off events. For 32/36 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1554 event pairs, 10 based on Foata normal form. 6/459 useless extension candidates. Maximal degree in co-relation 436. Up to 39 conditions per place. [2025-03-04 06:57:22,018 INFO L140 encePairwiseOnDemand]: 205/217 looper letters, 17 selfloop transitions, 8 changer transitions 9/193 dead transitions. [2025-03-04 06:57:22,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 193 transitions, 486 flow [2025-03-04 06:57:22,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:57:22,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:57:22,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 588 transitions. [2025-03-04 06:57:22,019 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9032258064516129 [2025-03-04 06:57:22,019 INFO L175 Difference]: Start difference. First operand has 188 places, 188 transitions, 418 flow. Second operand 3 states and 588 transitions. [2025-03-04 06:57:22,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 193 transitions, 486 flow [2025-03-04 06:57:22,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 193 transitions, 464 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:57:22,023 INFO L231 Difference]: Finished difference. Result has 189 places, 180 transitions, 412 flow [2025-03-04 06:57:22,023 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=412, PETRI_PLACES=189, PETRI_TRANSITIONS=180} [2025-03-04 06:57:22,024 INFO L279 CegarLoopForPetriNet]: 209 programPoint places, -20 predicate places. [2025-03-04 06:57:22,024 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 180 transitions, 412 flow [2025-03-04 06:57:22,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 187.33333333333334) internal successors, (562), 3 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:22,024 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:22,024 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-04 06:57:22,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:57:22,025 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr3ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-03-04 06:57:22,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:22,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1828300772, now seen corresponding path program 1 times [2025-03-04 06:57:22,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:22,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016830407] [2025-03-04 06:57:22,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:22,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:22,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 06:57:22,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 06:57:22,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:22,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:22,398 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-04 06:57:22,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:22,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016830407] [2025-03-04 06:57:22,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016830407] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:22,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:22,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:57:22,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736084595] [2025-03-04 06:57:22,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:22,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:57:22,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:22,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:57:22,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:57:22,561 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 217 [2025-03-04 06:57:22,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 180 transitions, 412 flow. Second operand has 6 states, 6 states have (on average 167.66666666666666) internal successors, (1006), 6 states have internal predecessors, (1006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:22,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:22,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 217 [2025-03-04 06:57:22,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:22,683 INFO L124 PetriNetUnfolderBase]: 83/713 cut-off events. [2025-03-04 06:57:22,684 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2025-03-04 06:57:22,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1006 conditions, 713 events. 83/713 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2703 event pairs, 5 based on Foata normal form. 0/656 useless extension candidates. Maximal degree in co-relation 794. Up to 193 conditions per place. [2025-03-04 06:57:22,687 INFO L140 encePairwiseOnDemand]: 211/217 looper letters, 42 selfloop transitions, 5 changer transitions 0/187 dead transitions. [2025-03-04 06:57:22,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 187 transitions, 520 flow [2025-03-04 06:57:22,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:57:22,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:57:22,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1043 transitions. [2025-03-04 06:57:22,689 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8010752688172043 [2025-03-04 06:57:22,689 INFO L175 Difference]: Start difference. First operand has 189 places, 180 transitions, 412 flow. Second operand 6 states and 1043 transitions. [2025-03-04 06:57:22,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 187 transitions, 520 flow [2025-03-04 06:57:22,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 187 transitions, 512 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:57:22,692 INFO L231 Difference]: Finished difference. Result has 183 places, 179 transitions, 412 flow [2025-03-04 06:57:22,692 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=412, PETRI_PLACES=183, PETRI_TRANSITIONS=179} [2025-03-04 06:57:22,693 INFO L279 CegarLoopForPetriNet]: 209 programPoint places, -26 predicate places. [2025-03-04 06:57:22,693 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 179 transitions, 412 flow [2025-03-04 06:57:22,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 167.66666666666666) internal successors, (1006), 6 states have internal predecessors, (1006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:22,694 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:22,694 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] [2025-03-04 06:57:22,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:57:22,694 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr3ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-03-04 06:57:22,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:22,695 INFO L85 PathProgramCache]: Analyzing trace with hash 68137568, now seen corresponding path program 1 times [2025-03-04 06:57:22,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:22,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45739541] [2025-03-04 06:57:22,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:22,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:22,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 06:57:22,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 06:57:22,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:22,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:22,721 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-04 06:57:22,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:22,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45739541] [2025-03-04 06:57:22,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45739541] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:22,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:22,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:57:22,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598746296] [2025-03-04 06:57:22,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:22,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:57:22,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:22,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:57:22,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:57:22,787 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 217 [2025-03-04 06:57:22,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 179 transitions, 412 flow. Second operand has 3 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:22,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:22,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 217 [2025-03-04 06:57:22,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:22,844 INFO L124 PetriNetUnfolderBase]: 63/695 cut-off events. [2025-03-04 06:57:22,844 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-04 06:57:22,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 929 conditions, 695 events. 63/695 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2656 event pairs, 49 based on Foata normal form. 0/632 useless extension candidates. Maximal degree in co-relation 728. Up to 151 conditions per place. [2025-03-04 06:57:22,848 INFO L140 encePairwiseOnDemand]: 214/217 looper letters, 32 selfloop transitions, 2 changer transitions 0/180 dead transitions. [2025-03-04 06:57:22,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 180 transitions, 482 flow [2025-03-04 06:57:22,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:57:22,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:57:22,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 554 transitions. [2025-03-04 06:57:22,849 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8509984639016898 [2025-03-04 06:57:22,849 INFO L175 Difference]: Start difference. First operand has 183 places, 179 transitions, 412 flow. Second operand 3 states and 554 transitions. [2025-03-04 06:57:22,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 180 transitions, 482 flow [2025-03-04 06:57:22,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 180 transitions, 472 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:57:22,854 INFO L231 Difference]: Finished difference. Result has 179 places, 178 transitions, 404 flow [2025-03-04 06:57:22,854 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=404, PETRI_PLACES=179, PETRI_TRANSITIONS=178} [2025-03-04 06:57:22,855 INFO L279 CegarLoopForPetriNet]: 209 programPoint places, -30 predicate places. [2025-03-04 06:57:22,855 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 178 transitions, 404 flow [2025-03-04 06:57:22,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:22,856 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:22,856 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 06:57:22,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:57:22,858 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr3ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-03-04 06:57:22,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:22,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1237272241, now seen corresponding path program 1 times [2025-03-04 06:57:22,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:22,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114573937] [2025-03-04 06:57:22,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:22,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:22,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 06:57:22,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 06:57:22,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:22,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:22,987 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-04 06:57:22,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:22,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114573937] [2025-03-04 06:57:22,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114573937] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:22,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:22,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:57:22,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627922626] [2025-03-04 06:57:22,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:22,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 06:57:22,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:22,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 06:57:22,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:57:23,111 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 217 [2025-03-04 06:57:23,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 178 transitions, 404 flow. Second operand has 5 states, 5 states have (on average 181.8) internal successors, (909), 5 states have internal predecessors, (909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:23,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:23,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 217 [2025-03-04 06:57:23,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:23,154 INFO L124 PetriNetUnfolderBase]: 6/115 cut-off events. [2025-03-04 06:57:23,155 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-04 06:57:23,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 115 events. 6/115 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 153 event pairs, 0 based on Foata normal form. 3/118 useless extension candidates. Maximal degree in co-relation 148. Up to 6 conditions per place. [2025-03-04 06:57:23,155 INFO L140 encePairwiseOnDemand]: 212/217 looper letters, 11 selfloop transitions, 4 changer transitions 0/57 dead transitions. [2025-03-04 06:57:23,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 57 transitions, 156 flow [2025-03-04 06:57:23,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:57:23,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:57:23,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1096 transitions. [2025-03-04 06:57:23,159 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8417818740399385 [2025-03-04 06:57:23,159 INFO L175 Difference]: Start difference. First operand has 179 places, 178 transitions, 404 flow. Second operand 6 states and 1096 transitions. [2025-03-04 06:57:23,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 57 transitions, 156 flow [2025-03-04 06:57:23,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 57 transitions, 148 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 06:57:23,161 INFO L231 Difference]: Finished difference. Result has 60 places, 51 transitions, 114 flow [2025-03-04 06:57:23,161 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=114, PETRI_PLACES=60, PETRI_TRANSITIONS=51} [2025-03-04 06:57:23,162 INFO L279 CegarLoopForPetriNet]: 209 programPoint places, -149 predicate places. [2025-03-04 06:57:23,162 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 51 transitions, 114 flow [2025-03-04 06:57:23,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 181.8) internal successors, (909), 5 states have internal predecessors, (909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:23,163 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:23,163 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 06:57:23,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:57:23,164 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr3ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-03-04 06:57:23,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:23,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1324501467, now seen corresponding path program 1 times [2025-03-04 06:57:23,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:23,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18244214] [2025-03-04 06:57:23,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:23,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:23,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 06:57:23,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 06:57:23,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:23,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:57:23,186 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:57:23,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 06:57:23,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 06:57:23,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:23,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:57:23,220 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:57:23,220 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:57:23,221 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 38 remaining) [2025-03-04 06:57:23,222 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr1ASSERT_VIOLATIONDATA_RACE (36 of 38 remaining) [2025-03-04 06:57:23,222 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr0ASSERT_VIOLATIONDATA_RACE (35 of 38 remaining) [2025-03-04 06:57:23,222 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr3ASSERT_VIOLATIONDATA_RACE (34 of 38 remaining) [2025-03-04 06:57:23,222 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr2ASSERT_VIOLATIONDATA_RACE (33 of 38 remaining) [2025-03-04 06:57:23,222 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr1ASSERT_VIOLATIONDATA_RACE (32 of 38 remaining) [2025-03-04 06:57:23,222 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONDATA_RACE (31 of 38 remaining) [2025-03-04 06:57:23,223 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (30 of 38 remaining) [2025-03-04 06:57:23,223 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (29 of 38 remaining) [2025-03-04 06:57:23,223 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (28 of 38 remaining) [2025-03-04 06:57:23,223 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (27 of 38 remaining) [2025-03-04 06:57:23,223 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (26 of 38 remaining) [2025-03-04 06:57:23,223 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (25 of 38 remaining) [2025-03-04 06:57:23,223 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (24 of 38 remaining) [2025-03-04 06:57:23,223 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (23 of 38 remaining) [2025-03-04 06:57:23,223 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (22 of 38 remaining) [2025-03-04 06:57:23,223 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (21 of 38 remaining) [2025-03-04 06:57:23,223 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (20 of 38 remaining) [2025-03-04 06:57:23,224 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (19 of 38 remaining) [2025-03-04 06:57:23,224 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (18 of 38 remaining) [2025-03-04 06:57:23,224 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (17 of 38 remaining) [2025-03-04 06:57:23,224 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (16 of 38 remaining) [2025-03-04 06:57:23,224 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (15 of 38 remaining) [2025-03-04 06:57:23,225 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (14 of 38 remaining) [2025-03-04 06:57:23,225 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (13 of 38 remaining) [2025-03-04 06:57:23,225 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (12 of 38 remaining) [2025-03-04 06:57:23,225 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (11 of 38 remaining) [2025-03-04 06:57:23,225 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (10 of 38 remaining) [2025-03-04 06:57:23,225 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (9 of 38 remaining) [2025-03-04 06:57:23,225 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 38 remaining) [2025-03-04 06:57:23,225 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 38 remaining) [2025-03-04 06:57:23,225 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 38 remaining) [2025-03-04 06:57:23,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr1ASSERT_VIOLATIONDATA_RACE (5 of 38 remaining) [2025-03-04 06:57:23,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr0ASSERT_VIOLATIONDATA_RACE (4 of 38 remaining) [2025-03-04 06:57:23,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr3ASSERT_VIOLATIONDATA_RACE (3 of 38 remaining) [2025-03-04 06:57:23,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr2ASSERT_VIOLATIONDATA_RACE (2 of 38 remaining) [2025-03-04 06:57:23,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr1ASSERT_VIOLATIONDATA_RACE (1 of 38 remaining) [2025-03-04 06:57:23,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONDATA_RACE (0 of 38 remaining) [2025-03-04 06:57:23,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:57:23,227 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:57:23,231 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 06:57:23,231 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 06:57:23,263 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2025-03-04 06:57:23,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 257 places, 270 transitions, 584 flow [2025-03-04 06:57:23,434 INFO L124 PetriNetUnfolderBase]: 131/1806 cut-off events. [2025-03-04 06:57:23,435 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2025-03-04 06:57:23,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1895 conditions, 1806 events. 131/1806 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 10508 event pairs, 2 based on Foata normal form. 0/1423 useless extension candidates. Maximal degree in co-relation 1024. Up to 32 conditions per place. [2025-03-04 06:57:23,446 INFO L82 GeneralOperation]: Start removeDead. Operand has 257 places, 270 transitions, 584 flow [2025-03-04 06:57:23,459 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 257 places, 270 transitions, 584 flow [2025-03-04 06:57:23,460 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:57:23,462 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;@69f82375, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:57:23,462 INFO L334 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2025-03-04 06:57:23,463 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:57:23,464 INFO L124 PetriNetUnfolderBase]: 0/20 cut-off events. [2025-03-04 06:57:23,464 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:57:23,464 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:23,464 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:57:23,464 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr3ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-03-04 06:57:23,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:23,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1981199177, now seen corresponding path program 1 times [2025-03-04 06:57:23,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:23,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086665191] [2025-03-04 06:57:23,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:23,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:23,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 06:57:23,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 06:57:23,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:23,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:23,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:57:23,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:23,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086665191] [2025-03-04 06:57:23,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086665191] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:23,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:23,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:57:23,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731843913] [2025-03-04 06:57:23,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:23,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:57:23,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:23,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:57:23,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:57:23,565 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 270 [2025-03-04 06:57:23,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 270 transitions, 584 flow. Second operand has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:23,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:23,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 270 [2025-03-04 06:57:23,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:24,320 INFO L124 PetriNetUnfolderBase]: 1200/6906 cut-off events. [2025-03-04 06:57:24,320 INFO L125 PetriNetUnfolderBase]: For 660/694 co-relation queries the response was YES. [2025-03-04 06:57:24,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9251 conditions, 6906 events. 1200/6906 cut-off events. For 660/694 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 60475 event pairs, 985 based on Foata normal form. 836/6537 useless extension candidates. Maximal degree in co-relation 4715. Up to 2070 conditions per place. [2025-03-04 06:57:24,382 INFO L140 encePairwiseOnDemand]: 257/270 looper letters, 39 selfloop transitions, 2 changer transitions 0/241 dead transitions. [2025-03-04 06:57:24,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 241 transitions, 608 flow [2025-03-04 06:57:24,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:57:24,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:57:24,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 688 transitions. [2025-03-04 06:57:24,384 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8493827160493828 [2025-03-04 06:57:24,384 INFO L175 Difference]: Start difference. First operand has 257 places, 270 transitions, 584 flow. Second operand 3 states and 688 transitions. [2025-03-04 06:57:24,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 241 transitions, 608 flow [2025-03-04 06:57:24,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 241 transitions, 608 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:57:24,389 INFO L231 Difference]: Finished difference. Result has 238 places, 241 transitions, 530 flow [2025-03-04 06:57:24,389 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=530, PETRI_PLACES=238, PETRI_TRANSITIONS=241} [2025-03-04 06:57:24,390 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -19 predicate places. [2025-03-04 06:57:24,390 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 241 transitions, 530 flow [2025-03-04 06:57:24,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:24,390 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:24,390 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] [2025-03-04 06:57:24,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:57:24,391 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr3ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-03-04 06:57:24,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:24,391 INFO L85 PathProgramCache]: Analyzing trace with hash 464699739, now seen corresponding path program 1 times [2025-03-04 06:57:24,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:24,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143944265] [2025-03-04 06:57:24,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:24,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:24,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 06:57:24,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 06:57:24,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:24,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:24,413 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-04 06:57:24,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:24,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143944265] [2025-03-04 06:57:24,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143944265] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:24,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:24,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:57:24,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203723658] [2025-03-04 06:57:24,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:24,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:57:24,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:24,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:57:24,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:57:24,469 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 270 [2025-03-04 06:57:24,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 241 transitions, 530 flow. Second operand has 3 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:24,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:24,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 270 [2025-03-04 06:57:24,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:25,268 INFO L124 PetriNetUnfolderBase]: 1650/7274 cut-off events. [2025-03-04 06:57:25,269 INFO L125 PetriNetUnfolderBase]: For 671/689 co-relation queries the response was YES. [2025-03-04 06:57:25,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10494 conditions, 7274 events. 1650/7274 cut-off events. For 671/689 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 60591 event pairs, 1169 based on Foata normal form. 0/6508 useless extension candidates. Maximal degree in co-relation 10463. Up to 2412 conditions per place. [2025-03-04 06:57:25,353 INFO L140 encePairwiseOnDemand]: 247/270 looper letters, 41 selfloop transitions, 11 changer transitions 0/233 dead transitions. [2025-03-04 06:57:25,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 233 transitions, 618 flow [2025-03-04 06:57:25,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:57:25,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:57:25,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 646 transitions. [2025-03-04 06:57:25,355 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7975308641975308 [2025-03-04 06:57:25,356 INFO L175 Difference]: Start difference. First operand has 238 places, 241 transitions, 530 flow. Second operand 3 states and 646 transitions. [2025-03-04 06:57:25,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 233 transitions, 618 flow [2025-03-04 06:57:25,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 233 transitions, 614 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:57:25,424 INFO L231 Difference]: Finished difference. Result has 226 places, 229 transitions, 524 flow [2025-03-04 06:57:25,425 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=524, PETRI_PLACES=226, PETRI_TRANSITIONS=229} [2025-03-04 06:57:25,426 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -31 predicate places. [2025-03-04 06:57:25,426 INFO L471 AbstractCegarLoop]: Abstraction has has 226 places, 229 transitions, 524 flow [2025-03-04 06:57:25,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:25,427 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:25,428 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:57:25,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:57:25,428 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr3ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-03-04 06:57:25,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:25,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1997380576, now seen corresponding path program 1 times [2025-03-04 06:57:25,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:25,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731900998] [2025-03-04 06:57:25,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:25,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:25,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 06:57:25,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 06:57:25,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:25,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:25,470 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-04 06:57:25,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:25,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731900998] [2025-03-04 06:57:25,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731900998] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:25,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:25,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:57:25,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58858854] [2025-03-04 06:57:25,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:25,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:57:25,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:25,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:57:25,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:57:25,528 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 270 [2025-03-04 06:57:25,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 229 transitions, 524 flow. Second operand has 3 states, 3 states have (on average 226.33333333333334) internal successors, (679), 3 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:25,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:25,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 270 [2025-03-04 06:57:25,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:25,982 INFO L124 PetriNetUnfolderBase]: 630/4749 cut-off events. [2025-03-04 06:57:25,982 INFO L125 PetriNetUnfolderBase]: For 775/817 co-relation queries the response was YES. [2025-03-04 06:57:25,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6431 conditions, 4749 events. 630/4749 cut-off events. For 775/817 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 39508 event pairs, 228 based on Foata normal form. 42/4288 useless extension candidates. Maximal degree in co-relation 4117. Up to 682 conditions per place. [2025-03-04 06:57:26,008 INFO L140 encePairwiseOnDemand]: 258/270 looper letters, 37 selfloop transitions, 8 changer transitions 0/245 dead transitions. [2025-03-04 06:57:26,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 245 transitions, 670 flow [2025-03-04 06:57:26,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:57:26,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:57:26,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 724 transitions. [2025-03-04 06:57:26,012 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8938271604938272 [2025-03-04 06:57:26,012 INFO L175 Difference]: Start difference. First operand has 226 places, 229 transitions, 524 flow. Second operand 3 states and 724 transitions. [2025-03-04 06:57:26,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 245 transitions, 670 flow [2025-03-04 06:57:26,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 245 transitions, 648 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:57:26,018 INFO L231 Difference]: Finished difference. Result has 227 places, 233 transitions, 550 flow [2025-03-04 06:57:26,018 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=550, PETRI_PLACES=227, PETRI_TRANSITIONS=233} [2025-03-04 06:57:26,019 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -30 predicate places. [2025-03-04 06:57:26,019 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 233 transitions, 550 flow [2025-03-04 06:57:26,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 226.33333333333334) internal successors, (679), 3 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:26,020 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:26,020 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-04 06:57:26,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:57:26,020 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr3ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-03-04 06:57:26,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:26,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1784782704, now seen corresponding path program 1 times [2025-03-04 06:57:26,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:26,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008611806] [2025-03-04 06:57:26,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:26,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:26,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 06:57:26,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 06:57:26,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:26,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:26,193 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-04 06:57:26,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:26,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008611806] [2025-03-04 06:57:26,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008611806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:26,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:26,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:57:26,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442802451] [2025-03-04 06:57:26,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:26,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:57:26,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:26,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:57:26,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:57:26,335 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 270 [2025-03-04 06:57:26,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 233 transitions, 550 flow. Second operand has 6 states, 6 states have (on average 206.66666666666666) internal successors, (1240), 6 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:26,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:26,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 270 [2025-03-04 06:57:26,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:27,081 INFO L124 PetriNetUnfolderBase]: 1558/7334 cut-off events. [2025-03-04 06:57:27,081 INFO L125 PetriNetUnfolderBase]: For 740/740 co-relation queries the response was YES. [2025-03-04 06:57:27,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10976 conditions, 7334 events. 1558/7334 cut-off events. For 740/740 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 61173 event pairs, 74 based on Foata normal form. 0/6827 useless extension candidates. Maximal degree in co-relation 4981. Up to 2728 conditions per place. [2025-03-04 06:57:27,139 INFO L140 encePairwiseOnDemand]: 264/270 looper letters, 62 selfloop transitions, 6 changer transitions 0/248 dead transitions. [2025-03-04 06:57:27,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 248 transitions, 716 flow [2025-03-04 06:57:27,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:57:27,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:57:27,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1295 transitions. [2025-03-04 06:57:27,145 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7993827160493827 [2025-03-04 06:57:27,145 INFO L175 Difference]: Start difference. First operand has 227 places, 233 transitions, 550 flow. Second operand 6 states and 1295 transitions. [2025-03-04 06:57:27,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 248 transitions, 716 flow [2025-03-04 06:57:27,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 248 transitions, 708 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:57:27,150 INFO L231 Difference]: Finished difference. Result has 230 places, 232 transitions, 552 flow [2025-03-04 06:57:27,151 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=552, PETRI_PLACES=230, PETRI_TRANSITIONS=232} [2025-03-04 06:57:27,151 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -27 predicate places. [2025-03-04 06:57:27,151 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 232 transitions, 552 flow [2025-03-04 06:57:27,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 206.66666666666666) internal successors, (1240), 6 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:27,152 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:27,152 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] [2025-03-04 06:57:27,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 06:57:27,152 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr3ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-03-04 06:57:27,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:27,153 INFO L85 PathProgramCache]: Analyzing trace with hash -760815395, now seen corresponding path program 1 times [2025-03-04 06:57:27,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:27,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596209167] [2025-03-04 06:57:27,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:27,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:27,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 06:57:27,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 06:57:27,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:27,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:27,185 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-04 06:57:27,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:27,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596209167] [2025-03-04 06:57:27,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596209167] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:27,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:27,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:57:27,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198864837] [2025-03-04 06:57:27,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:27,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:57:27,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:27,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:57:27,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:57:27,248 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 270 [2025-03-04 06:57:27,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 232 transitions, 552 flow. Second operand has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:27,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:27,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 270 [2025-03-04 06:57:27,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:28,010 INFO L124 PetriNetUnfolderBase]: 1177/6824 cut-off events. [2025-03-04 06:57:28,010 INFO L125 PetriNetUnfolderBase]: For 750/750 co-relation queries the response was YES. [2025-03-04 06:57:28,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9631 conditions, 6824 events. 1177/6824 cut-off events. For 750/750 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 58412 event pairs, 990 based on Foata normal form. 0/6258 useless extension candidates. Maximal degree in co-relation 4313. Up to 2049 conditions per place. [2025-03-04 06:57:28,078 INFO L140 encePairwiseOnDemand]: 267/270 looper letters, 43 selfloop transitions, 2 changer transitions 0/235 dead transitions. [2025-03-04 06:57:28,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 235 transitions, 648 flow [2025-03-04 06:57:28,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:57:28,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:57:28,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 682 transitions. [2025-03-04 06:57:28,080 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8419753086419753 [2025-03-04 06:57:28,080 INFO L175 Difference]: Start difference. First operand has 230 places, 232 transitions, 552 flow. Second operand 3 states and 682 transitions. [2025-03-04 06:57:28,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 235 transitions, 648 flow [2025-03-04 06:57:28,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 235 transitions, 636 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:57:28,084 INFO L231 Difference]: Finished difference. Result has 226 places, 231 transitions, 542 flow [2025-03-04 06:57:28,084 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=542, PETRI_PLACES=226, PETRI_TRANSITIONS=231} [2025-03-04 06:57:28,085 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -31 predicate places. [2025-03-04 06:57:28,085 INFO L471 AbstractCegarLoop]: Abstraction has has 226 places, 231 transitions, 542 flow [2025-03-04 06:57:28,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:28,085 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:28,085 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 06:57:28,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:57:28,086 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr3ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-03-04 06:57:28,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:28,086 INFO L85 PathProgramCache]: Analyzing trace with hash 212861566, now seen corresponding path program 1 times [2025-03-04 06:57:28,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:28,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650701283] [2025-03-04 06:57:28,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:28,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:28,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 06:57:28,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 06:57:28,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:28,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:28,142 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-04 06:57:28,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:28,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650701283] [2025-03-04 06:57:28,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650701283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:28,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:28,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:57:28,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825452022] [2025-03-04 06:57:28,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:28,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 06:57:28,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:28,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 06:57:28,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:57:28,231 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 270 [2025-03-04 06:57:28,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 231 transitions, 542 flow. Second operand has 5 states, 5 states have (on average 220.8) internal successors, (1104), 5 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:28,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:28,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 270 [2025-03-04 06:57:28,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:28,727 INFO L124 PetriNetUnfolderBase]: 765/5100 cut-off events. [2025-03-04 06:57:28,727 INFO L125 PetriNetUnfolderBase]: For 986/1024 co-relation queries the response was YES. [2025-03-04 06:57:28,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7086 conditions, 5100 events. 765/5100 cut-off events. For 986/1024 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 42278 event pairs, 156 based on Foata normal form. 3/4609 useless extension candidates. Maximal degree in co-relation 5036. Up to 647 conditions per place. [2025-03-04 06:57:28,759 INFO L140 encePairwiseOnDemand]: 257/270 looper letters, 48 selfloop transitions, 15 changer transitions 0/255 dead transitions. [2025-03-04 06:57:28,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 255 transitions, 740 flow [2025-03-04 06:57:28,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:57:28,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:57:28,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1378 transitions. [2025-03-04 06:57:28,762 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8506172839506173 [2025-03-04 06:57:28,762 INFO L175 Difference]: Start difference. First operand has 226 places, 231 transitions, 542 flow. Second operand 6 states and 1378 transitions. [2025-03-04 06:57:28,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 255 transitions, 740 flow [2025-03-04 06:57:28,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 255 transitions, 736 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:57:28,766 INFO L231 Difference]: Finished difference. Result has 233 places, 235 transitions, 614 flow [2025-03-04 06:57:28,766 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=614, PETRI_PLACES=233, PETRI_TRANSITIONS=235} [2025-03-04 06:57:28,767 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -24 predicate places. [2025-03-04 06:57:28,767 INFO L471 AbstractCegarLoop]: Abstraction has has 233 places, 235 transitions, 614 flow [2025-03-04 06:57:28,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 220.8) internal successors, (1104), 5 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:28,767 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:28,768 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 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-04 06:57:28,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 06:57:28,768 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr3ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-03-04 06:57:28,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:28,768 INFO L85 PathProgramCache]: Analyzing trace with hash -2122724067, now seen corresponding path program 1 times [2025-03-04 06:57:28,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:28,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434020401] [2025-03-04 06:57:28,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:28,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:28,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-04 06:57:28,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-04 06:57:28,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:28,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:28,796 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-04 06:57:28,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:28,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434020401] [2025-03-04 06:57:28,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434020401] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:28,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:28,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:57:28,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539578777] [2025-03-04 06:57:28,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:28,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:57:28,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:28,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:57:28,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:57:28,862 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 270 [2025-03-04 06:57:28,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 235 transitions, 614 flow. Second operand has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:28,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:28,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 270 [2025-03-04 06:57:28,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:29,465 INFO L124 PetriNetUnfolderBase]: 1105/6273 cut-off events. [2025-03-04 06:57:29,465 INFO L125 PetriNetUnfolderBase]: For 1132/1132 co-relation queries the response was YES. [2025-03-04 06:57:29,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9376 conditions, 6273 events. 1105/6273 cut-off events. For 1132/1132 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 52764 event pairs, 944 based on Foata normal form. 0/5756 useless extension candidates. Maximal degree in co-relation 5170. Up to 1922 conditions per place. [2025-03-04 06:57:29,497 INFO L140 encePairwiseOnDemand]: 267/270 looper letters, 43 selfloop transitions, 2 changer transitions 0/238 dead transitions. [2025-03-04 06:57:29,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 238 transitions, 710 flow [2025-03-04 06:57:29,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:57:29,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:57:29,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 682 transitions. [2025-03-04 06:57:29,498 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8419753086419753 [2025-03-04 06:57:29,498 INFO L175 Difference]: Start difference. First operand has 233 places, 235 transitions, 614 flow. Second operand 3 states and 682 transitions. [2025-03-04 06:57:29,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 238 transitions, 710 flow [2025-03-04 06:57:29,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 238 transitions, 696 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-04 06:57:29,503 INFO L231 Difference]: Finished difference. Result has 233 places, 234 transitions, 602 flow [2025-03-04 06:57:29,504 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=602, PETRI_PLACES=233, PETRI_TRANSITIONS=234} [2025-03-04 06:57:29,504 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -24 predicate places. [2025-03-04 06:57:29,504 INFO L471 AbstractCegarLoop]: Abstraction has has 233 places, 234 transitions, 602 flow [2025-03-04 06:57:29,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:29,505 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:29,505 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-04 06:57:29,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 06:57:29,505 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr3ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-03-04 06:57:29,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:29,505 INFO L85 PathProgramCache]: Analyzing trace with hash 768341464, now seen corresponding path program 1 times [2025-03-04 06:57:29,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:29,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886431741] [2025-03-04 06:57:29,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:29,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:29,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 06:57:29,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 06:57:29,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:29,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:57:29,520 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:57:29,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 06:57:29,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 06:57:29,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:29,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:57:29,539 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:57:29,539 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:57:29,539 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (43 of 44 remaining) [2025-03-04 06:57:29,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr1ASSERT_VIOLATIONDATA_RACE (42 of 44 remaining) [2025-03-04 06:57:29,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr0ASSERT_VIOLATIONDATA_RACE (41 of 44 remaining) [2025-03-04 06:57:29,540 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr3ASSERT_VIOLATIONDATA_RACE (40 of 44 remaining) [2025-03-04 06:57:29,540 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr2ASSERT_VIOLATIONDATA_RACE (39 of 44 remaining) [2025-03-04 06:57:29,540 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr1ASSERT_VIOLATIONDATA_RACE (38 of 44 remaining) [2025-03-04 06:57:29,540 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONDATA_RACE (37 of 44 remaining) [2025-03-04 06:57:29,540 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (36 of 44 remaining) [2025-03-04 06:57:29,540 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (35 of 44 remaining) [2025-03-04 06:57:29,540 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (34 of 44 remaining) [2025-03-04 06:57:29,540 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (33 of 44 remaining) [2025-03-04 06:57:29,540 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (32 of 44 remaining) [2025-03-04 06:57:29,540 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (31 of 44 remaining) [2025-03-04 06:57:29,540 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (30 of 44 remaining) [2025-03-04 06:57:29,540 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (29 of 44 remaining) [2025-03-04 06:57:29,540 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (28 of 44 remaining) [2025-03-04 06:57:29,540 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (27 of 44 remaining) [2025-03-04 06:57:29,540 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (26 of 44 remaining) [2025-03-04 06:57:29,540 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (25 of 44 remaining) [2025-03-04 06:57:29,541 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (24 of 44 remaining) [2025-03-04 06:57:29,541 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (23 of 44 remaining) [2025-03-04 06:57:29,541 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (22 of 44 remaining) [2025-03-04 06:57:29,541 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (21 of 44 remaining) [2025-03-04 06:57:29,541 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (20 of 44 remaining) [2025-03-04 06:57:29,541 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (19 of 44 remaining) [2025-03-04 06:57:29,541 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (18 of 44 remaining) [2025-03-04 06:57:29,541 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (17 of 44 remaining) [2025-03-04 06:57:29,541 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (16 of 44 remaining) [2025-03-04 06:57:29,541 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (15 of 44 remaining) [2025-03-04 06:57:29,541 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (14 of 44 remaining) [2025-03-04 06:57:29,541 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 44 remaining) [2025-03-04 06:57:29,541 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 44 remaining) [2025-03-04 06:57:29,541 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr1ASSERT_VIOLATIONDATA_RACE (11 of 44 remaining) [2025-03-04 06:57:29,541 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr0ASSERT_VIOLATIONDATA_RACE (10 of 44 remaining) [2025-03-04 06:57:29,541 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr1ASSERT_VIOLATIONDATA_RACE (9 of 44 remaining) [2025-03-04 06:57:29,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr0ASSERT_VIOLATIONDATA_RACE (8 of 44 remaining) [2025-03-04 06:57:29,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr3ASSERT_VIOLATIONDATA_RACE (7 of 44 remaining) [2025-03-04 06:57:29,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr2ASSERT_VIOLATIONDATA_RACE (6 of 44 remaining) [2025-03-04 06:57:29,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr1ASSERT_VIOLATIONDATA_RACE (5 of 44 remaining) [2025-03-04 06:57:29,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONDATA_RACE (4 of 44 remaining) [2025-03-04 06:57:29,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr3ASSERT_VIOLATIONDATA_RACE (3 of 44 remaining) [2025-03-04 06:57:29,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr2ASSERT_VIOLATIONDATA_RACE (2 of 44 remaining) [2025-03-04 06:57:29,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr1ASSERT_VIOLATIONDATA_RACE (1 of 44 remaining) [2025-03-04 06:57:29,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONDATA_RACE (0 of 44 remaining) [2025-03-04 06:57:29,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 06:57:29,543 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:57:29,543 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 06:57:29,543 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-04 06:57:29,570 INFO L143 ThreadInstanceAdder]: Constructed 12 joinOtherThreadTransitions. [2025-03-04 06:57:29,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 305 places, 323 transitions, 718 flow [2025-03-04 06:57:30,085 INFO L124 PetriNetUnfolderBase]: 544/5922 cut-off events. [2025-03-04 06:57:30,085 INFO L125 PetriNetUnfolderBase]: For 419/419 co-relation queries the response was YES. [2025-03-04 06:57:30,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6358 conditions, 5922 events. 544/5922 cut-off events. For 419/419 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 46453 event pairs, 64 based on Foata normal form. 0/4701 useless extension candidates. Maximal degree in co-relation 3404. Up to 192 conditions per place. [2025-03-04 06:57:30,146 INFO L82 GeneralOperation]: Start removeDead. Operand has 305 places, 323 transitions, 718 flow [2025-03-04 06:57:30,184 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 305 places, 323 transitions, 718 flow [2025-03-04 06:57:30,185 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:57:30,185 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;@69f82375, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:57:30,185 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2025-03-04 06:57:30,186 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:57:30,186 INFO L124 PetriNetUnfolderBase]: 0/20 cut-off events. [2025-03-04 06:57:30,186 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:57:30,186 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:30,186 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:57:30,186 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-04 06:57:30,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:30,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1770300279, now seen corresponding path program 1 times [2025-03-04 06:57:30,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:30,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483467794] [2025-03-04 06:57:30,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:30,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:30,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 06:57:30,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 06:57:30,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:30,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:30,204 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-04 06:57:30,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:30,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483467794] [2025-03-04 06:57:30,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483467794] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:30,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:30,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:57:30,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163749504] [2025-03-04 06:57:30,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:30,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:57:30,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:30,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:57:30,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:57:30,260 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 323 [2025-03-04 06:57:30,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 323 transitions, 718 flow. Second operand has 3 states, 3 states have (on average 252.33333333333334) internal successors, (757), 3 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:30,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:30,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 323 [2025-03-04 06:57:30,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:36,927 INFO L124 PetriNetUnfolderBase]: 12815/48824 cut-off events. [2025-03-04 06:57:36,927 INFO L125 PetriNetUnfolderBase]: For 7479/8025 co-relation queries the response was YES. [2025-03-04 06:57:37,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70847 conditions, 48824 events. 12815/48824 cut-off events. For 7479/8025 co-relation queries the response was YES. Maximal size of possible extension queue 471. Compared 564068 event pairs, 10886 based on Foata normal form. 9883/50640 useless extension candidates. Maximal degree in co-relation 36613. Up to 19303 conditions per place. [2025-03-04 06:57:37,584 INFO L140 encePairwiseOnDemand]: 307/323 looper letters, 47 selfloop transitions, 2 changer transitions 0/282 dead transitions. [2025-03-04 06:57:37,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 282 transitions, 734 flow [2025-03-04 06:57:37,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:57:37,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:57:37,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 816 transitions. [2025-03-04 06:57:37,586 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8421052631578947 [2025-03-04 06:57:37,586 INFO L175 Difference]: Start difference. First operand has 305 places, 323 transitions, 718 flow. Second operand 3 states and 816 transitions. [2025-03-04 06:57:37,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 282 transitions, 734 flow [2025-03-04 06:57:37,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 282 transitions, 734 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:57:37,593 INFO L231 Difference]: Finished difference. Result has 276 places, 282 transitions, 640 flow [2025-03-04 06:57:37,593 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=640, PETRI_PLACES=276, PETRI_TRANSITIONS=282} [2025-03-04 06:57:37,594 INFO L279 CegarLoopForPetriNet]: 305 programPoint places, -29 predicate places. [2025-03-04 06:57:37,594 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 282 transitions, 640 flow [2025-03-04 06:57:37,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 252.33333333333334) internal successors, (757), 3 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:37,594 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:37,595 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] [2025-03-04 06:57:37,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 06:57:37,595 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-04 06:57:37,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:37,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1111265988, now seen corresponding path program 1 times [2025-03-04 06:57:37,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:37,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668667853] [2025-03-04 06:57:37,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:37,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:37,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 06:57:37,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 06:57:37,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:37,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:37,608 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-04 06:57:37,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:37,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668667853] [2025-03-04 06:57:37,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668667853] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:37,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:37,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:57:37,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886066646] [2025-03-04 06:57:37,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:37,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:57:37,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:37,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:57:37,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:57:37,670 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 323 [2025-03-04 06:57:37,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 282 transitions, 640 flow. Second operand has 3 states, 3 states have (on average 234.0) internal successors, (702), 3 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:37,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:37,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 323 [2025-03-04 06:57:37,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:45,190 INFO L124 PetriNetUnfolderBase]: 17515/54343 cut-off events. [2025-03-04 06:57:45,190 INFO L125 PetriNetUnfolderBase]: For 7819/8267 co-relation queries the response was YES. [2025-03-04 06:57:45,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83910 conditions, 54343 events. 17515/54343 cut-off events. For 7819/8267 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 587120 event pairs, 12762 based on Foata normal form. 0/49193 useless extension candidates. Maximal degree in co-relation 83877. Up to 22195 conditions per place. [2025-03-04 06:57:46,121 INFO L140 encePairwiseOnDemand]: 300/323 looper letters, 51 selfloop transitions, 11 changer transitions 0/276 dead transitions. [2025-03-04 06:57:46,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 276 transitions, 752 flow [2025-03-04 06:57:46,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:57:46,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:57:46,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 773 transitions. [2025-03-04 06:57:46,129 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7977296181630547 [2025-03-04 06:57:46,129 INFO L175 Difference]: Start difference. First operand has 276 places, 282 transitions, 640 flow. Second operand 3 states and 773 transitions. [2025-03-04 06:57:46,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 276 transitions, 752 flow [2025-03-04 06:57:46,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 276 transitions, 748 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:57:46,161 INFO L231 Difference]: Finished difference. Result has 264 places, 270 transitions, 634 flow [2025-03-04 06:57:46,162 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=634, PETRI_PLACES=264, PETRI_TRANSITIONS=270} [2025-03-04 06:57:46,162 INFO L279 CegarLoopForPetriNet]: 305 programPoint places, -41 predicate places. [2025-03-04 06:57:46,162 INFO L471 AbstractCegarLoop]: Abstraction has has 264 places, 270 transitions, 634 flow [2025-03-04 06:57:46,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.0) internal successors, (702), 3 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:46,163 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:46,163 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:57:46,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 06:57:46,163 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-04 06:57:46,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:46,163 INFO L85 PathProgramCache]: Analyzing trace with hash -35359328, now seen corresponding path program 1 times [2025-03-04 06:57:46,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:46,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371318100] [2025-03-04 06:57:46,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:46,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:46,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 06:57:46,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 06:57:46,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:46,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:46,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:57:46,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:46,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371318100] [2025-03-04 06:57:46,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371318100] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:46,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:46,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:57:46,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626245793] [2025-03-04 06:57:46,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:46,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:57:46,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:46,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:57:46,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:57:46,256 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 323 [2025-03-04 06:57:46,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 270 transitions, 634 flow. Second operand has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:46,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:46,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 323 [2025-03-04 06:57:46,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:51,076 INFO L124 PetriNetUnfolderBase]: 8365/37548 cut-off events. [2025-03-04 06:57:51,076 INFO L125 PetriNetUnfolderBase]: For 10422/10976 co-relation queries the response was YES. [2025-03-04 06:57:51,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55379 conditions, 37548 events. 8365/37548 cut-off events. For 10422/10976 co-relation queries the response was YES. Maximal size of possible extension queue 566. Compared 455032 event pairs, 3344 based on Foata normal form. 300/33580 useless extension candidates. Maximal degree in co-relation 37016. Up to 8245 conditions per place. [2025-03-04 06:57:51,556 INFO L140 encePairwiseOnDemand]: 311/323 looper letters, 51 selfloop transitions, 8 changer transitions 0/292 dead transitions. [2025-03-04 06:57:51,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 292 transitions, 832 flow [2025-03-04 06:57:51,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:57:51,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:57:51,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 855 transitions. [2025-03-04 06:57:51,558 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8823529411764706 [2025-03-04 06:57:51,558 INFO L175 Difference]: Start difference. First operand has 264 places, 270 transitions, 634 flow. Second operand 3 states and 855 transitions. [2025-03-04 06:57:51,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 292 transitions, 832 flow [2025-03-04 06:57:51,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 292 transitions, 810 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:57:51,574 INFO L231 Difference]: Finished difference. Result has 265 places, 274 transitions, 660 flow [2025-03-04 06:57:51,574 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=660, PETRI_PLACES=265, PETRI_TRANSITIONS=274} [2025-03-04 06:57:51,575 INFO L279 CegarLoopForPetriNet]: 305 programPoint places, -40 predicate places. [2025-03-04 06:57:51,575 INFO L471 AbstractCegarLoop]: Abstraction has has 265 places, 274 transitions, 660 flow [2025-03-04 06:57:51,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:51,575 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:51,575 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-04 06:57:51,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 06:57:51,576 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-04 06:57:51,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:51,576 INFO L85 PathProgramCache]: Analyzing trace with hash -110331247, now seen corresponding path program 1 times [2025-03-04 06:57:51,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:51,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575039363] [2025-03-04 06:57:51,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:51,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:51,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 06:57:51,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 06:57:51,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:51,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:51,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:57:51,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:51,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575039363] [2025-03-04 06:57:51,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575039363] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:51,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:51,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:57:51,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045186019] [2025-03-04 06:57:51,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:51,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:57:51,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:51,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:57:51,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:57:52,059 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 323 [2025-03-04 06:57:52,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 274 transitions, 660 flow. Second operand has 6 states, 6 states have (on average 245.66666666666666) internal successors, (1474), 6 states have internal predecessors, (1474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:52,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:52,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 323 [2025-03-04 06:57:52,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:58:01,552 INFO L124 PetriNetUnfolderBase]: 19159/63586 cut-off events. [2025-03-04 06:58:01,552 INFO L125 PetriNetUnfolderBase]: For 9276/9276 co-relation queries the response was YES. [2025-03-04 06:58:02,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100914 conditions, 63586 events. 19159/63586 cut-off events. For 9276/9276 co-relation queries the response was YES. Maximal size of possible extension queue 711. Compared 733955 event pairs, 801 based on Foata normal form. 0/60077 useless extension candidates. Maximal degree in co-relation 49119. Up to 29355 conditions per place. [2025-03-04 06:58:02,778 INFO L140 encePairwiseOnDemand]: 317/323 looper letters, 78 selfloop transitions, 6 changer transitions 0/297 dead transitions. [2025-03-04 06:58:02,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 297 transitions, 874 flow [2025-03-04 06:58:02,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:58:02,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:58:02,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1545 transitions. [2025-03-04 06:58:02,780 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7972136222910217 [2025-03-04 06:58:02,780 INFO L175 Difference]: Start difference. First operand has 265 places, 274 transitions, 660 flow. Second operand 6 states and 1545 transitions. [2025-03-04 06:58:02,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 297 transitions, 874 flow [2025-03-04 06:58:02,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 297 transitions, 866 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:58:02,787 INFO L231 Difference]: Finished difference. Result has 268 places, 273 transitions, 662 flow [2025-03-04 06:58:02,787 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=650, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=662, PETRI_PLACES=268, PETRI_TRANSITIONS=273} [2025-03-04 06:58:02,787 INFO L279 CegarLoopForPetriNet]: 305 programPoint places, -37 predicate places. [2025-03-04 06:58:02,788 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 273 transitions, 662 flow [2025-03-04 06:58:02,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 245.66666666666666) internal successors, (1474), 6 states have internal predecessors, (1474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:58:02,788 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:02,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] [2025-03-04 06:58:02,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 06:58:02,788 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-04 06:58:02,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:02,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1038071919, now seen corresponding path program 1 times [2025-03-04 06:58:02,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:02,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357666463] [2025-03-04 06:58:02,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:02,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:02,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 06:58:02,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 06:58:02,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:02,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:02,807 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-04 06:58:02,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:02,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357666463] [2025-03-04 06:58:02,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357666463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:58:02,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:58:02,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:58:02,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510129576] [2025-03-04 06:58:02,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:58:02,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:58:02,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:02,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:58:02,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:58:02,861 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 323 [2025-03-04 06:58:02,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 273 transitions, 662 flow. Second operand has 3 states, 3 states have (on average 254.0) internal successors, (762), 3 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:58:02,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:02,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 323 [2025-03-04 06:58:02,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand