./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-match-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-match-subst.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2c931aeff3bd4feb775048ea000220a43a3b08d8a3667f51cb57a0babc9201aa --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:28:42,305 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:28:42,374 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-06 09:28:42,383 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:28:42,384 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:28:42,416 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:28:42,417 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:28:42,417 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:28:42,418 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:28:42,419 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:28:42,420 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:28:42,420 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:28:42,420 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:28:42,420 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:28:42,421 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:28:42,421 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:28:42,421 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:28:42,421 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:28:42,421 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:28:42,421 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:28:42,421 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:28:42,422 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:28:42,422 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 09:28:42,422 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:28:42,422 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:28:42,422 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:28:42,422 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:28:42,422 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:28:42,422 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:28:42,422 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:28:42,423 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:28:42,423 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:28:42,423 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:28:42,423 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:28:42,423 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 09:28:42,424 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 09:28:42,424 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:28:42,424 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:28:42,424 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:28:42,425 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:28:42,425 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:28:42,425 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:28:42,425 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-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2c931aeff3bd4feb775048ea000220a43a3b08d8a3667f51cb57a0babc9201aa [2025-02-06 09:28:42,734 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:28:42,746 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:28:42,749 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:28:42,752 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:28:42,752 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:28:42,754 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-match-subst.wvr.c [2025-02-06 09:28:44,079 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/95a936a22/105235a363814f55a79b7c738438ffeb/FLAGb1f6fd5e8 [2025-02-06 09:28:44,390 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:28:44,390 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-match-subst.wvr.c [2025-02-06 09:28:44,398 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/95a936a22/105235a363814f55a79b7c738438ffeb/FLAGb1f6fd5e8 [2025-02-06 09:28:44,413 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/95a936a22/105235a363814f55a79b7c738438ffeb [2025-02-06 09:28:44,416 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:28:44,418 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:28:44,419 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:28:44,419 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:28:44,422 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:28:44,423 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:28:44" (1/1) ... [2025-02-06 09:28:44,424 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47b5fcf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:28:44, skipping insertion in model container [2025-02-06 09:28:44,424 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:28:44" (1/1) ... [2025-02-06 09:28:44,442 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:28:44,638 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:28:44,654 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:28:44,687 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:28:44,705 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:28:44,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:28:44 WrapperNode [2025-02-06 09:28:44,706 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:28:44,707 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:28:44,707 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:28:44,708 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:28:44,713 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:28:44" (1/1) ... [2025-02-06 09:28:44,719 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:28:44" (1/1) ... [2025-02-06 09:28:44,744 INFO L138 Inliner]: procedures = 22, calls = 20, calls flagged for inlining = 13, calls inlined = 23, statements flattened = 323 [2025-02-06 09:28:44,745 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:28:44,745 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:28:44,745 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:28:44,746 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:28:44,751 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:28:44" (1/1) ... [2025-02-06 09:28:44,752 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:28:44" (1/1) ... [2025-02-06 09:28:44,754 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:28:44" (1/1) ... [2025-02-06 09:28:44,755 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:28:44" (1/1) ... [2025-02-06 09:28:44,762 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:28:44" (1/1) ... [2025-02-06 09:28:44,768 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:28:44" (1/1) ... [2025-02-06 09:28:44,774 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:28:44" (1/1) ... [2025-02-06 09:28:44,776 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:28:44" (1/1) ... [2025-02-06 09:28:44,779 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:28:44,780 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:28:44,780 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:28:44,780 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:28:44,781 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:28:44" (1/1) ... [2025-02-06 09:28:44,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:28:44,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:28:44,812 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 09:28:44,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 09:28:44,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:28:44,838 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 09:28:44,839 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 09:28:44,839 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 09:28:44,839 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 09:28:44,839 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-06 09:28:44,840 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-06 09:28:44,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 09:28:44,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:28:44,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:28:44,842 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 09:28:44,953 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:28:44,955 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:28:45,428 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 09:28:45,428 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:28:45,456 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:28:45,457 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:28:45,457 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:28:45 BoogieIcfgContainer [2025-02-06 09:28:45,457 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:28:45,460 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:28:45,460 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:28:45,464 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:28:45,464 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:28:44" (1/3) ... [2025-02-06 09:28:45,465 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73c61278 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:28:45, skipping insertion in model container [2025-02-06 09:28:45,466 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:28:44" (2/3) ... [2025-02-06 09:28:45,466 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73c61278 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:28:45, skipping insertion in model container [2025-02-06 09:28:45,466 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:28:45" (3/3) ... [2025-02-06 09:28:45,467 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-match-subst.wvr.c [2025-02-06 09:28:45,484 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:28:45,486 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-match-subst.wvr.c that has 4 procedures, 437 locations, 1 initial locations, 0 loop locations, and 41 error locations. [2025-02-06 09:28:45,486 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 09:28:45,632 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-06 09:28:45,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 446 places, 454 transitions, 929 flow [2025-02-06 09:28:45,893 INFO L124 PetriNetUnfolderBase]: 18/451 cut-off events. [2025-02-06 09:28:45,895 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 09:28:45,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 464 conditions, 451 events. 18/451 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 817 event pairs, 0 based on Foata normal form. 0/392 useless extension candidates. Maximal degree in co-relation 311. Up to 2 conditions per place. [2025-02-06 09:28:45,913 INFO L82 GeneralOperation]: Start removeDead. Operand has 446 places, 454 transitions, 929 flow [2025-02-06 09:28:45,927 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 425 places, 431 transitions, 880 flow [2025-02-06 09:28:45,939 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:28:45,955 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;@4358459c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:28:45,956 INFO L334 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2025-02-06 09:28:45,965 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:28:45,965 INFO L124 PetriNetUnfolderBase]: 0/29 cut-off events. [2025-02-06 09:28:45,965 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:28:45,966 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:45,966 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:28:45,967 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-06 09:28:45,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:45,971 INFO L85 PathProgramCache]: Analyzing trace with hash -656263710, now seen corresponding path program 1 times [2025-02-06 09:28:45,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:45,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074942056] [2025-02-06 09:28:45,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:45,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:46,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 09:28:46,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 09:28:46,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:46,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:46,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:28:46,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:46,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074942056] [2025-02-06 09:28:46,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074942056] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:46,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:46,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:46,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399878963] [2025-02-06 09:28:46,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:46,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:46,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:46,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:46,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:46,249 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 422 out of 454 [2025-02-06 09:28:46,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 431 transitions, 880 flow. Second operand has 3 states, 3 states have (on average 423.3333333333333) internal successors, (1270), 3 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:28:46,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:46,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 422 of 454 [2025-02-06 09:28:46,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:46,692 INFO L124 PetriNetUnfolderBase]: 33/1375 cut-off events. [2025-02-06 09:28:46,692 INFO L125 PetriNetUnfolderBase]: For 26/28 co-relation queries the response was YES. [2025-02-06 09:28:46,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1462 conditions, 1375 events. 33/1375 cut-off events. For 26/28 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 6189 event pairs, 20 based on Foata normal form. 76/1250 useless extension candidates. Maximal degree in co-relation 1300. Up to 50 conditions per place. [2025-02-06 09:28:46,712 INFO L140 encePairwiseOnDemand]: 438/454 looper letters, 13 selfloop transitions, 2 changer transitions 1/417 dead transitions. [2025-02-06 09:28:46,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 417 transitions, 882 flow [2025-02-06 09:28:46,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:46,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:46,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1295 transitions. [2025-02-06 09:28:46,737 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9508076358296622 [2025-02-06 09:28:46,740 INFO L175 Difference]: Start difference. First operand has 425 places, 431 transitions, 880 flow. Second operand 3 states and 1295 transitions. [2025-02-06 09:28:46,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 426 places, 417 transitions, 882 flow [2025-02-06 09:28:46,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 420 places, 417 transitions, 870 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-06 09:28:46,760 INFO L231 Difference]: Finished difference. Result has 420 places, 416 transitions, 842 flow [2025-02-06 09:28:46,767 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=840, PETRI_DIFFERENCE_MINUEND_PLACES=418, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=417, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=415, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=842, PETRI_PLACES=420, PETRI_TRANSITIONS=416} [2025-02-06 09:28:46,770 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -5 predicate places. [2025-02-06 09:28:46,771 INFO L471 AbstractCegarLoop]: Abstraction has has 420 places, 416 transitions, 842 flow [2025-02-06 09:28:46,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 423.3333333333333) internal successors, (1270), 3 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:28:46,773 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:46,773 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:28:46,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:28:46,774 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-06 09:28:46,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:46,775 INFO L85 PathProgramCache]: Analyzing trace with hash 948622931, now seen corresponding path program 1 times [2025-02-06 09:28:46,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:46,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807032106] [2025-02-06 09:28:46,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:46,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:46,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-06 09:28:46,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 09:28:46,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:46,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:46,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:28:46,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:46,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807032106] [2025-02-06 09:28:46,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807032106] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:46,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:46,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:46,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011927379] [2025-02-06 09:28:46,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:46,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:46,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:46,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:46,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:46,891 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 454 [2025-02-06 09:28:46,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 420 places, 416 transitions, 842 flow. Second operand has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:28:46,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:46,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 454 [2025-02-06 09:28:46,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:47,094 INFO L124 PetriNetUnfolderBase]: 16/956 cut-off events. [2025-02-06 09:28:47,094 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 09:28:47,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 994 conditions, 956 events. 16/956 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 4050 event pairs, 7 based on Foata normal form. 0/814 useless extension candidates. Maximal degree in co-relation 957. Up to 25 conditions per place. [2025-02-06 09:28:47,113 INFO L140 encePairwiseOnDemand]: 451/454 looper letters, 11 selfloop transitions, 2 changer transitions 0/415 dead transitions. [2025-02-06 09:28:47,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 420 places, 415 transitions, 866 flow [2025-02-06 09:28:47,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:47,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:47,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1286 transitions. [2025-02-06 09:28:47,117 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9441997063142438 [2025-02-06 09:28:47,118 INFO L175 Difference]: Start difference. First operand has 420 places, 416 transitions, 842 flow. Second operand 3 states and 1286 transitions. [2025-02-06 09:28:47,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 420 places, 415 transitions, 866 flow [2025-02-06 09:28:47,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 418 places, 415 transitions, 862 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:28:47,128 INFO L231 Difference]: Finished difference. Result has 418 places, 415 transitions, 840 flow [2025-02-06 09:28:47,129 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=836, PETRI_DIFFERENCE_MINUEND_PLACES=416, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=415, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=840, PETRI_PLACES=418, PETRI_TRANSITIONS=415} [2025-02-06 09:28:47,130 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -7 predicate places. [2025-02-06 09:28:47,130 INFO L471 AbstractCegarLoop]: Abstraction has has 418 places, 415 transitions, 840 flow [2025-02-06 09:28:47,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:28:47,132 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:47,132 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:28:47,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 09:28:47,132 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-06 09:28:47,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:47,133 INFO L85 PathProgramCache]: Analyzing trace with hash 42244856, now seen corresponding path program 1 times [2025-02-06 09:28:47,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:47,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486502551] [2025-02-06 09:28:47,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:47,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:47,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-06 09:28:47,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-06 09:28:47,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:47,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:47,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:28:47,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:47,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486502551] [2025-02-06 09:28:47,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486502551] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:47,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:47,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:47,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215496738] [2025-02-06 09:28:47,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:47,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:47,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:47,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:47,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:47,252 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 454 [2025-02-06 09:28:47,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 418 places, 415 transitions, 840 flow. Second operand has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:28:47,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:47,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 454 [2025-02-06 09:28:47,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:47,415 INFO L124 PetriNetUnfolderBase]: 16/937 cut-off events. [2025-02-06 09:28:47,416 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 09:28:47,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 975 conditions, 937 events. 16/937 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3958 event pairs, 7 based on Foata normal form. 0/803 useless extension candidates. Maximal degree in co-relation 930. Up to 25 conditions per place. [2025-02-06 09:28:47,430 INFO L140 encePairwiseOnDemand]: 451/454 looper letters, 11 selfloop transitions, 2 changer transitions 0/414 dead transitions. [2025-02-06 09:28:47,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 419 places, 414 transitions, 864 flow [2025-02-06 09:28:47,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:47,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:47,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1286 transitions. [2025-02-06 09:28:47,435 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9441997063142438 [2025-02-06 09:28:47,435 INFO L175 Difference]: Start difference. First operand has 418 places, 415 transitions, 840 flow. Second operand 3 states and 1286 transitions. [2025-02-06 09:28:47,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 419 places, 414 transitions, 864 flow [2025-02-06 09:28:47,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 417 places, 414 transitions, 860 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:28:47,442 INFO L231 Difference]: Finished difference. Result has 417 places, 414 transitions, 838 flow [2025-02-06 09:28:47,443 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=834, PETRI_DIFFERENCE_MINUEND_PLACES=415, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=414, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=412, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=838, PETRI_PLACES=417, PETRI_TRANSITIONS=414} [2025-02-06 09:28:47,444 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -8 predicate places. [2025-02-06 09:28:47,444 INFO L471 AbstractCegarLoop]: Abstraction has has 417 places, 414 transitions, 838 flow [2025-02-06 09:28:47,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:28:47,445 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:47,445 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:28:47,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:28:47,445 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-06 09:28:47,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:47,446 INFO L85 PathProgramCache]: Analyzing trace with hash -946362878, now seen corresponding path program 1 times [2025-02-06 09:28:47,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:47,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001300950] [2025-02-06 09:28:47,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:47,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:47,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-06 09:28:47,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-06 09:28:47,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:47,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:47,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:28:47,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:47,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001300950] [2025-02-06 09:28:47,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001300950] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:47,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:47,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:47,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342644659] [2025-02-06 09:28:47,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:47,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:47,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:47,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:47,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:47,545 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 422 out of 454 [2025-02-06 09:28:47,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 417 places, 414 transitions, 838 flow. Second operand has 3 states, 3 states have (on average 423.3333333333333) internal successors, (1270), 3 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:28:47,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:47,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 422 of 454 [2025-02-06 09:28:47,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:47,710 INFO L124 PetriNetUnfolderBase]: 19/807 cut-off events. [2025-02-06 09:28:47,711 INFO L125 PetriNetUnfolderBase]: For 4/8 co-relation queries the response was YES. [2025-02-06 09:28:47,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 858 conditions, 807 events. 19/807 cut-off events. For 4/8 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2838 event pairs, 12 based on Foata normal form. 0/697 useless extension candidates. Maximal degree in co-relation 805. Up to 38 conditions per place. [2025-02-06 09:28:47,723 INFO L140 encePairwiseOnDemand]: 451/454 looper letters, 13 selfloop transitions, 2 changer transitions 0/413 dead transitions. [2025-02-06 09:28:47,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 418 places, 413 transitions, 866 flow [2025-02-06 09:28:47,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:47,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:47,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1282 transitions. [2025-02-06 09:28:47,728 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9412628487518355 [2025-02-06 09:28:47,728 INFO L175 Difference]: Start difference. First operand has 417 places, 414 transitions, 838 flow. Second operand 3 states and 1282 transitions. [2025-02-06 09:28:47,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 418 places, 413 transitions, 866 flow [2025-02-06 09:28:47,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 416 places, 413 transitions, 862 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:28:47,736 INFO L231 Difference]: Finished difference. Result has 416 places, 413 transitions, 836 flow [2025-02-06 09:28:47,737 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=832, PETRI_DIFFERENCE_MINUEND_PLACES=414, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=836, PETRI_PLACES=416, PETRI_TRANSITIONS=413} [2025-02-06 09:28:47,738 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -9 predicate places. [2025-02-06 09:28:47,738 INFO L471 AbstractCegarLoop]: Abstraction has has 416 places, 413 transitions, 836 flow [2025-02-06 09:28:47,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 423.3333333333333) internal successors, (1270), 3 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:28:47,739 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:47,739 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:28:47,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:28:47,739 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-06 09:28:47,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:47,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1446485017, now seen corresponding path program 1 times [2025-02-06 09:28:47,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:47,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646033005] [2025-02-06 09:28:47,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:47,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:47,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-06 09:28:47,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-06 09:28:47,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:47,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:47,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:28:47,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:47,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646033005] [2025-02-06 09:28:47,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646033005] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:47,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:47,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:47,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062076935] [2025-02-06 09:28:47,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:47,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:47,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:47,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:47,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:47,843 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 454 [2025-02-06 09:28:47,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 416 places, 413 transitions, 836 flow. Second operand has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:28:47,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:47,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 454 [2025-02-06 09:28:47,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:48,004 INFO L124 PetriNetUnfolderBase]: 12/784 cut-off events. [2025-02-06 09:28:48,004 INFO L125 PetriNetUnfolderBase]: For 5/10 co-relation queries the response was YES. [2025-02-06 09:28:48,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 817 conditions, 784 events. 12/784 cut-off events. For 5/10 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2145 event pairs, 5 based on Foata normal form. 0/673 useless extension candidates. Maximal degree in co-relation 756. Up to 22 conditions per place. [2025-02-06 09:28:48,017 INFO L140 encePairwiseOnDemand]: 451/454 looper letters, 11 selfloop transitions, 2 changer transitions 0/412 dead transitions. [2025-02-06 09:28:48,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 417 places, 412 transitions, 860 flow [2025-02-06 09:28:48,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:48,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:48,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1286 transitions. [2025-02-06 09:28:48,022 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9441997063142438 [2025-02-06 09:28:48,022 INFO L175 Difference]: Start difference. First operand has 416 places, 413 transitions, 836 flow. Second operand 3 states and 1286 transitions. [2025-02-06 09:28:48,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 417 places, 412 transitions, 860 flow [2025-02-06 09:28:48,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 415 places, 412 transitions, 856 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:28:48,031 INFO L231 Difference]: Finished difference. Result has 415 places, 412 transitions, 834 flow [2025-02-06 09:28:48,032 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=830, PETRI_DIFFERENCE_MINUEND_PLACES=413, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=410, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=834, PETRI_PLACES=415, PETRI_TRANSITIONS=412} [2025-02-06 09:28:48,033 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -10 predicate places. [2025-02-06 09:28:48,035 INFO L471 AbstractCegarLoop]: Abstraction has has 415 places, 412 transitions, 834 flow [2025-02-06 09:28:48,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:28:48,036 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:48,036 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:28:48,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:28:48,037 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-06 09:28:48,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:48,037 INFO L85 PathProgramCache]: Analyzing trace with hash 921770405, now seen corresponding path program 1 times [2025-02-06 09:28:48,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:48,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948882827] [2025-02-06 09:28:48,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:48,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:48,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-06 09:28:48,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-06 09:28:48,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:48,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:48,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:28:48,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:48,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948882827] [2025-02-06 09:28:48,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948882827] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:48,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:48,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:48,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363811996] [2025-02-06 09:28:48,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:48,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:48,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:48,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:48,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:48,135 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 454 [2025-02-06 09:28:48,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 412 transitions, 834 flow. Second operand has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:28:48,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:48,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 454 [2025-02-06 09:28:48,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:48,271 INFO L124 PetriNetUnfolderBase]: 12/777 cut-off events. [2025-02-06 09:28:48,271 INFO L125 PetriNetUnfolderBase]: For 5/10 co-relation queries the response was YES. [2025-02-06 09:28:48,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 810 conditions, 777 events. 12/777 cut-off events. For 5/10 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2107 event pairs, 5 based on Foata normal form. 0/669 useless extension candidates. Maximal degree in co-relation 741. Up to 22 conditions per place. [2025-02-06 09:28:48,282 INFO L140 encePairwiseOnDemand]: 451/454 looper letters, 11 selfloop transitions, 2 changer transitions 0/411 dead transitions. [2025-02-06 09:28:48,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 411 transitions, 858 flow [2025-02-06 09:28:48,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:48,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:48,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1286 transitions. [2025-02-06 09:28:48,285 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9441997063142438 [2025-02-06 09:28:48,285 INFO L175 Difference]: Start difference. First operand has 415 places, 412 transitions, 834 flow. Second operand 3 states and 1286 transitions. [2025-02-06 09:28:48,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 411 transitions, 858 flow [2025-02-06 09:28:48,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 414 places, 411 transitions, 854 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:28:48,293 INFO L231 Difference]: Finished difference. Result has 414 places, 411 transitions, 832 flow [2025-02-06 09:28:48,294 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=828, PETRI_DIFFERENCE_MINUEND_PLACES=412, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=411, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=409, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=832, PETRI_PLACES=414, PETRI_TRANSITIONS=411} [2025-02-06 09:28:48,296 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -11 predicate places. [2025-02-06 09:28:48,296 INFO L471 AbstractCegarLoop]: Abstraction has has 414 places, 411 transitions, 832 flow [2025-02-06 09:28:48,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:28:48,297 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:48,297 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:28:48,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 09:28:48,297 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-06 09:28:48,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:48,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1226321235, now seen corresponding path program 1 times [2025-02-06 09:28:48,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:48,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30189171] [2025-02-06 09:28:48,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:48,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:48,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-06 09:28:48,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-06 09:28:48,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:48,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:48,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:28:48,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:48,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30189171] [2025-02-06 09:28:48,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30189171] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:48,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:48,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:48,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329699193] [2025-02-06 09:28:48,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:48,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:48,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:48,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:48,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:48,394 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 422 out of 454 [2025-02-06 09:28:48,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 414 places, 411 transitions, 832 flow. Second operand has 3 states, 3 states have (on average 423.3333333333333) internal successors, (1270), 3 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:28:48,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:48,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 422 of 454 [2025-02-06 09:28:48,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:48,509 INFO L124 PetriNetUnfolderBase]: 25/626 cut-off events. [2025-02-06 09:28:48,509 INFO L125 PetriNetUnfolderBase]: For 9/13 co-relation queries the response was YES. [2025-02-06 09:28:48,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 687 conditions, 626 events. 25/626 cut-off events. For 9/13 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2197 event pairs, 20 based on Foata normal form. 0/549 useless extension candidates. Maximal degree in co-relation 610. Up to 50 conditions per place. [2025-02-06 09:28:48,515 INFO L140 encePairwiseOnDemand]: 451/454 looper letters, 13 selfloop transitions, 2 changer transitions 0/410 dead transitions. [2025-02-06 09:28:48,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 415 places, 410 transitions, 860 flow [2025-02-06 09:28:48,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:48,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:48,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1282 transitions. [2025-02-06 09:28:48,518 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9412628487518355 [2025-02-06 09:28:48,518 INFO L175 Difference]: Start difference. First operand has 414 places, 411 transitions, 832 flow. Second operand 3 states and 1282 transitions. [2025-02-06 09:28:48,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 415 places, 410 transitions, 860 flow [2025-02-06 09:28:48,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 413 places, 410 transitions, 856 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:28:48,524 INFO L231 Difference]: Finished difference. Result has 413 places, 410 transitions, 830 flow [2025-02-06 09:28:48,524 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=826, PETRI_DIFFERENCE_MINUEND_PLACES=411, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=410, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=830, PETRI_PLACES=413, PETRI_TRANSITIONS=410} [2025-02-06 09:28:48,525 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -12 predicate places. [2025-02-06 09:28:48,525 INFO L471 AbstractCegarLoop]: Abstraction has has 413 places, 410 transitions, 830 flow [2025-02-06 09:28:48,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 423.3333333333333) internal successors, (1270), 3 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:28:48,526 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:48,526 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:28:48,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 09:28:48,526 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-06 09:28:48,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:48,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1866351931, now seen corresponding path program 1 times [2025-02-06 09:28:48,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:48,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406560860] [2025-02-06 09:28:48,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:48,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:48,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-06 09:28:48,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-06 09:28:48,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:48,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:48,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:28:48,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:48,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406560860] [2025-02-06 09:28:48,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406560860] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:48,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:48,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:48,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751825254] [2025-02-06 09:28:48,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:48,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:48,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:48,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:48,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:48,608 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 454 [2025-02-06 09:28:48,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 413 places, 410 transitions, 830 flow. Second operand has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:28:48,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:48,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 454 [2025-02-06 09:28:48,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:48,708 INFO L124 PetriNetUnfolderBase]: 14/681 cut-off events. [2025-02-06 09:28:48,709 INFO L125 PetriNetUnfolderBase]: For 6/15 co-relation queries the response was YES. [2025-02-06 09:28:48,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 716 conditions, 681 events. 14/681 cut-off events. For 6/15 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1754 event pairs, 7 based on Foata normal form. 0/587 useless extension candidates. Maximal degree in co-relation 631. Up to 25 conditions per place. [2025-02-06 09:28:48,717 INFO L140 encePairwiseOnDemand]: 451/454 looper letters, 11 selfloop transitions, 2 changer transitions 0/409 dead transitions. [2025-02-06 09:28:48,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 409 transitions, 854 flow [2025-02-06 09:28:48,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:48,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:48,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1286 transitions. [2025-02-06 09:28:48,720 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9441997063142438 [2025-02-06 09:28:48,720 INFO L175 Difference]: Start difference. First operand has 413 places, 410 transitions, 830 flow. Second operand 3 states and 1286 transitions. [2025-02-06 09:28:48,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 414 places, 409 transitions, 854 flow [2025-02-06 09:28:48,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 409 transitions, 850 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:28:48,727 INFO L231 Difference]: Finished difference. Result has 412 places, 409 transitions, 828 flow [2025-02-06 09:28:48,727 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=410, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=409, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=407, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=828, PETRI_PLACES=412, PETRI_TRANSITIONS=409} [2025-02-06 09:28:48,728 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -13 predicate places. [2025-02-06 09:28:48,728 INFO L471 AbstractCegarLoop]: Abstraction has has 412 places, 409 transitions, 828 flow [2025-02-06 09:28:48,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:28:48,729 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:48,729 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:28:48,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 09:28:48,729 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-06 09:28:48,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:48,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1382391037, now seen corresponding path program 1 times [2025-02-06 09:28:48,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:48,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124233364] [2025-02-06 09:28:48,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:48,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:48,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-06 09:28:48,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-06 09:28:48,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:48,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:48,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:28:48,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:48,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124233364] [2025-02-06 09:28:48,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124233364] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:48,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:48,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:48,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069955635] [2025-02-06 09:28:48,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:48,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:48,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:48,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:48,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:48,802 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 454 [2025-02-06 09:28:48,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 409 transitions, 828 flow. Second operand has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:28:48,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:48,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 454 [2025-02-06 09:28:48,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:48,908 INFO L124 PetriNetUnfolderBase]: 14/671 cut-off events. [2025-02-06 09:28:48,909 INFO L125 PetriNetUnfolderBase]: For 6/15 co-relation queries the response was YES. [2025-02-06 09:28:48,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 706 conditions, 671 events. 14/671 cut-off events. For 6/15 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1697 event pairs, 7 based on Foata normal form. 0/581 useless extension candidates. Maximal degree in co-relation 613. Up to 25 conditions per place. [2025-02-06 09:28:48,915 INFO L140 encePairwiseOnDemand]: 451/454 looper letters, 11 selfloop transitions, 2 changer transitions 0/408 dead transitions. [2025-02-06 09:28:48,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 408 transitions, 852 flow [2025-02-06 09:28:48,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:48,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:48,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1286 transitions. [2025-02-06 09:28:48,918 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9441997063142438 [2025-02-06 09:28:48,918 INFO L175 Difference]: Start difference. First operand has 412 places, 409 transitions, 828 flow. Second operand 3 states and 1286 transitions. [2025-02-06 09:28:48,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 408 transitions, 852 flow [2025-02-06 09:28:48,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 411 places, 408 transitions, 848 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:28:48,924 INFO L231 Difference]: Finished difference. Result has 411 places, 408 transitions, 826 flow [2025-02-06 09:28:48,925 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=822, PETRI_DIFFERENCE_MINUEND_PLACES=409, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=826, PETRI_PLACES=411, PETRI_TRANSITIONS=408} [2025-02-06 09:28:48,925 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -14 predicate places. [2025-02-06 09:28:48,925 INFO L471 AbstractCegarLoop]: Abstraction has has 411 places, 408 transitions, 826 flow [2025-02-06 09:28:48,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:28:48,926 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:48,926 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:28:48,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 09:28:48,927 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-06 09:28:48,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:48,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1488648862, now seen corresponding path program 1 times [2025-02-06 09:28:48,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:48,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729027045] [2025-02-06 09:28:48,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:48,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:48,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-06 09:28:48,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-06 09:28:48,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:48,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:48,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:28:48,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:48,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729027045] [2025-02-06 09:28:48,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729027045] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:48,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:48,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:48,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510398535] [2025-02-06 09:28:48,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:48,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:48,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:48,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:48,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:49,004 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 454 [2025-02-06 09:28:49,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 408 transitions, 826 flow. Second operand has 3 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:28:49,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:49,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 454 [2025-02-06 09:28:49,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:49,207 INFO L124 PetriNetUnfolderBase]: 34/1406 cut-off events. [2025-02-06 09:28:49,207 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-06 09:28:49,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1471 conditions, 1406 events. 34/1406 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 8123 event pairs, 13 based on Foata normal form. 0/1207 useless extension candidates. Maximal degree in co-relation 1370. Up to 43 conditions per place. [2025-02-06 09:28:49,217 INFO L140 encePairwiseOnDemand]: 450/454 looper letters, 13 selfloop transitions, 2 changer transitions 0/410 dead transitions. [2025-02-06 09:28:49,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 410 transitions, 862 flow [2025-02-06 09:28:49,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:49,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:49,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1295 transitions. [2025-02-06 09:28:49,220 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9508076358296622 [2025-02-06 09:28:49,220 INFO L175 Difference]: Start difference. First operand has 411 places, 408 transitions, 826 flow. Second operand 3 states and 1295 transitions. [2025-02-06 09:28:49,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 410 transitions, 862 flow [2025-02-06 09:28:49,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 410 transitions, 858 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:28:49,228 INFO L231 Difference]: Finished difference. Result has 410 places, 408 transitions, 832 flow [2025-02-06 09:28:49,229 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=818, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=832, PETRI_PLACES=410, PETRI_TRANSITIONS=408} [2025-02-06 09:28:49,229 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -15 predicate places. [2025-02-06 09:28:49,229 INFO L471 AbstractCegarLoop]: Abstraction has has 410 places, 408 transitions, 832 flow [2025-02-06 09:28:49,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:28:49,230 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:49,230 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:28:49,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 09:28:49,231 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-06 09:28:49,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:49,231 INFO L85 PathProgramCache]: Analyzing trace with hash -367418557, now seen corresponding path program 1 times [2025-02-06 09:28:49,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:49,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836830577] [2025-02-06 09:28:49,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:49,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:49,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-06 09:28:49,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-06 09:28:49,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:49,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:49,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:28:49,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:49,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836830577] [2025-02-06 09:28:49,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836830577] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:49,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:49,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:49,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294941690] [2025-02-06 09:28:49,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:49,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:49,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:49,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:49,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:49,306 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 454 [2025-02-06 09:28:49,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 410 places, 408 transitions, 832 flow. Second operand has 3 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:28:49,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:49,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 454 [2025-02-06 09:28:49,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:49,549 INFO L124 PetriNetUnfolderBase]: 40/1646 cut-off events. [2025-02-06 09:28:49,549 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-06 09:28:49,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1724 conditions, 1646 events. 40/1646 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 10635 event pairs, 14 based on Foata normal form. 0/1421 useless extension candidates. Maximal degree in co-relation 1337. Up to 49 conditions per place. [2025-02-06 09:28:49,570 INFO L140 encePairwiseOnDemand]: 450/454 looper letters, 13 selfloop transitions, 2 changer transitions 0/410 dead transitions. [2025-02-06 09:28:49,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 410 transitions, 868 flow [2025-02-06 09:28:49,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:49,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:49,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1295 transitions. [2025-02-06 09:28:49,574 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9508076358296622 [2025-02-06 09:28:49,574 INFO L175 Difference]: Start difference. First operand has 410 places, 408 transitions, 832 flow. Second operand 3 states and 1295 transitions. [2025-02-06 09:28:49,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 410 transitions, 868 flow [2025-02-06 09:28:49,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 410 places, 410 transitions, 868 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:28:49,580 INFO L231 Difference]: Finished difference. Result has 411 places, 408 transitions, 842 flow [2025-02-06 09:28:49,580 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=828, PETRI_DIFFERENCE_MINUEND_PLACES=408, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=842, PETRI_PLACES=411, PETRI_TRANSITIONS=408} [2025-02-06 09:28:49,581 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -14 predicate places. [2025-02-06 09:28:49,581 INFO L471 AbstractCegarLoop]: Abstraction has has 411 places, 408 transitions, 842 flow [2025-02-06 09:28:49,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:28:49,582 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:49,582 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:28:49,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 09:28:49,582 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread3Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-06 09:28:49,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:49,583 INFO L85 PathProgramCache]: Analyzing trace with hash -2097842577, now seen corresponding path program 1 times [2025-02-06 09:28:49,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:49,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305954978] [2025-02-06 09:28:49,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:49,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:49,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-06 09:28:49,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-06 09:28:49,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:49,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:49,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:28:49,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:49,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305954978] [2025-02-06 09:28:49,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305954978] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:49,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:49,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:49,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423663824] [2025-02-06 09:28:49,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:49,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:49,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:49,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:49,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:49,670 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 454 [2025-02-06 09:28:49,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 408 transitions, 842 flow. Second operand has 3 states, 3 states have (on average 428.0) internal successors, (1284), 3 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:28:49,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:49,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 454 [2025-02-06 09:28:49,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:49,805 INFO L124 PetriNetUnfolderBase]: 24/902 cut-off events. [2025-02-06 09:28:49,805 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 09:28:49,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 962 conditions, 902 events. 24/902 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4361 event pairs, 4 based on Foata normal form. 0/786 useless extension candidates. Maximal degree in co-relation 759. Up to 31 conditions per place. [2025-02-06 09:28:49,822 INFO L140 encePairwiseOnDemand]: 450/454 looper letters, 13 selfloop transitions, 2 changer transitions 0/410 dead transitions. [2025-02-06 09:28:49,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 410 transitions, 878 flow [2025-02-06 09:28:49,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:49,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:49,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1295 transitions. [2025-02-06 09:28:49,826 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9508076358296622 [2025-02-06 09:28:49,826 INFO L175 Difference]: Start difference. First operand has 411 places, 408 transitions, 842 flow. Second operand 3 states and 1295 transitions. [2025-02-06 09:28:49,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 410 transitions, 878 flow [2025-02-06 09:28:49,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 411 places, 410 transitions, 878 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:28:49,832 INFO L231 Difference]: Finished difference. Result has 412 places, 408 transitions, 852 flow [2025-02-06 09:28:49,832 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=838, PETRI_DIFFERENCE_MINUEND_PLACES=409, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=852, PETRI_PLACES=412, PETRI_TRANSITIONS=408} [2025-02-06 09:28:49,833 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -13 predicate places. [2025-02-06 09:28:49,833 INFO L471 AbstractCegarLoop]: Abstraction has has 412 places, 408 transitions, 852 flow [2025-02-06 09:28:49,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 428.0) internal successors, (1284), 3 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:28:49,834 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:49,834 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 09:28:49,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 09:28:49,834 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-06 09:28:49,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:49,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1687020400, now seen corresponding path program 1 times [2025-02-06 09:28:49,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:49,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627315461] [2025-02-06 09:28:49,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:49,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:49,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-06 09:28:49,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 09:28:49,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:49,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:49,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:28:49,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:49,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627315461] [2025-02-06 09:28:49,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627315461] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:49,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:49,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:49,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854020151] [2025-02-06 09:28:49,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:49,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:49,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:49,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:49,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:49,887 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 454 [2025-02-06 09:28:49,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 408 transitions, 852 flow. Second operand has 3 states, 3 states have (on average 428.0) internal successors, (1284), 3 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:28:49,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:49,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 454 [2025-02-06 09:28:49,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:50,057 INFO L124 PetriNetUnfolderBase]: 26/943 cut-off events. [2025-02-06 09:28:50,058 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-06 09:28:50,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1014 conditions, 943 events. 26/943 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4675 event pairs, 4 based on Foata normal form. 0/826 useless extension candidates. Maximal degree in co-relation 810. Up to 35 conditions per place. [2025-02-06 09:28:50,071 INFO L140 encePairwiseOnDemand]: 450/454 looper letters, 13 selfloop transitions, 2 changer transitions 0/410 dead transitions. [2025-02-06 09:28:50,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 412 places, 410 transitions, 888 flow [2025-02-06 09:28:50,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:50,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:50,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1295 transitions. [2025-02-06 09:28:50,074 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9508076358296622 [2025-02-06 09:28:50,075 INFO L175 Difference]: Start difference. First operand has 412 places, 408 transitions, 852 flow. Second operand 3 states and 1295 transitions. [2025-02-06 09:28:50,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 412 places, 410 transitions, 888 flow [2025-02-06 09:28:50,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 410 transitions, 888 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:28:50,082 INFO L231 Difference]: Finished difference. Result has 413 places, 408 transitions, 862 flow [2025-02-06 09:28:50,082 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=848, PETRI_DIFFERENCE_MINUEND_PLACES=410, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=862, PETRI_PLACES=413, PETRI_TRANSITIONS=408} [2025-02-06 09:28:50,084 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -12 predicate places. [2025-02-06 09:28:50,084 INFO L471 AbstractCegarLoop]: Abstraction has has 413 places, 408 transitions, 862 flow [2025-02-06 09:28:50,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 428.0) internal successors, (1284), 3 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:28:50,085 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:50,085 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:28:50,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 09:28:50,085 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-06 09:28:50,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:50,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1954762881, now seen corresponding path program 1 times [2025-02-06 09:28:50,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:50,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608876748] [2025-02-06 09:28:50,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:50,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:50,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-06 09:28:50,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-06 09:28:50,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:50,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:50,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:28:50,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:50,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608876748] [2025-02-06 09:28:50,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608876748] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:50,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:50,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:50,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119023267] [2025-02-06 09:28:50,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:50,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:50,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:50,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:50,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:50,170 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 454 [2025-02-06 09:28:50,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 413 places, 408 transitions, 862 flow. Second operand has 3 states, 3 states have (on average 427.6666666666667) internal successors, (1283), 3 states have internal predecessors, (1283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:28:50,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:50,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 454 [2025-02-06 09:28:50,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:50,438 INFO L124 PetriNetUnfolderBase]: 66/1778 cut-off events. [2025-02-06 09:28:50,438 INFO L125 PetriNetUnfolderBase]: For 21/25 co-relation queries the response was YES. [2025-02-06 09:28:50,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1908 conditions, 1778 events. 66/1778 cut-off events. For 21/25 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 10927 event pairs, 10 based on Foata normal form. 0/1515 useless extension candidates. Maximal degree in co-relation 1461. Up to 80 conditions per place. [2025-02-06 09:28:50,453 INFO L140 encePairwiseOnDemand]: 450/454 looper letters, 13 selfloop transitions, 2 changer transitions 0/410 dead transitions. [2025-02-06 09:28:50,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 410 transitions, 898 flow [2025-02-06 09:28:50,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:50,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:50,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1295 transitions. [2025-02-06 09:28:50,457 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9508076358296622 [2025-02-06 09:28:50,457 INFO L175 Difference]: Start difference. First operand has 413 places, 408 transitions, 862 flow. Second operand 3 states and 1295 transitions. [2025-02-06 09:28:50,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 410 transitions, 898 flow [2025-02-06 09:28:50,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 413 places, 410 transitions, 898 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:28:50,463 INFO L231 Difference]: Finished difference. Result has 414 places, 408 transitions, 872 flow [2025-02-06 09:28:50,463 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=411, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=872, PETRI_PLACES=414, PETRI_TRANSITIONS=408} [2025-02-06 09:28:50,464 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -11 predicate places. [2025-02-06 09:28:50,464 INFO L471 AbstractCegarLoop]: Abstraction has has 414 places, 408 transitions, 872 flow [2025-02-06 09:28:50,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 427.6666666666667) internal successors, (1283), 3 states have internal predecessors, (1283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:28:50,465 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:50,465 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:28:50,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 09:28:50,465 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-06 09:28:50,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:50,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1626387936, now seen corresponding path program 1 times [2025-02-06 09:28:50,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:50,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248313885] [2025-02-06 09:28:50,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:50,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:50,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-06 09:28:50,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-06 09:28:50,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:50,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:50,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:28:50,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:50,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248313885] [2025-02-06 09:28:50,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248313885] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:50,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:50,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:50,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096282750] [2025-02-06 09:28:50,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:50,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:50,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:50,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:50,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:50,536 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 454 [2025-02-06 09:28:50,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 414 places, 408 transitions, 872 flow. Second operand has 3 states, 3 states have (on average 427.6666666666667) internal successors, (1283), 3 states have internal predecessors, (1283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:28:50,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:50,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 454 [2025-02-06 09:28:50,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:50,823 INFO L124 PetriNetUnfolderBase]: 75/1940 cut-off events. [2025-02-06 09:28:50,823 INFO L125 PetriNetUnfolderBase]: For 23/27 co-relation queries the response was YES. [2025-02-06 09:28:50,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2095 conditions, 1940 events. 75/1940 cut-off events. For 23/27 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 12016 event pairs, 19 based on Foata normal form. 0/1662 useless extension candidates. Maximal degree in co-relation 1659. Up to 90 conditions per place. [2025-02-06 09:28:50,839 INFO L140 encePairwiseOnDemand]: 450/454 looper letters, 13 selfloop transitions, 2 changer transitions 0/410 dead transitions. [2025-02-06 09:28:50,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 410 transitions, 908 flow [2025-02-06 09:28:50,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:50,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:50,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1295 transitions. [2025-02-06 09:28:50,843 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9508076358296622 [2025-02-06 09:28:50,843 INFO L175 Difference]: Start difference. First operand has 414 places, 408 transitions, 872 flow. Second operand 3 states and 1295 transitions. [2025-02-06 09:28:50,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 414 places, 410 transitions, 908 flow [2025-02-06 09:28:50,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 414 places, 410 transitions, 908 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:28:50,849 INFO L231 Difference]: Finished difference. Result has 415 places, 408 transitions, 882 flow [2025-02-06 09:28:50,850 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=868, PETRI_DIFFERENCE_MINUEND_PLACES=412, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=882, PETRI_PLACES=415, PETRI_TRANSITIONS=408} [2025-02-06 09:28:50,851 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -10 predicate places. [2025-02-06 09:28:50,851 INFO L471 AbstractCegarLoop]: Abstraction has has 415 places, 408 transitions, 882 flow [2025-02-06 09:28:50,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 427.6666666666667) internal successors, (1283), 3 states have internal predecessors, (1283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:28:50,852 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:50,853 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:28:50,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 09:28:50,853 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-06 09:28:50,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:50,854 INFO L85 PathProgramCache]: Analyzing trace with hash 713552194, now seen corresponding path program 1 times [2025-02-06 09:28:50,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:50,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105886697] [2025-02-06 09:28:50,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:50,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:50,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-06 09:28:50,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-06 09:28:50,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:50,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:50,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-02-06 09:28:50,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:50,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105886697] [2025-02-06 09:28:50,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105886697] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:50,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:50,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:50,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657802514] [2025-02-06 09:28:50,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:50,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:50,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:50,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:50,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:50,937 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 420 out of 454 [2025-02-06 09:28:50,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 408 transitions, 882 flow. Second operand has 3 states, 3 states have (on average 421.3333333333333) internal successors, (1264), 3 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:28:50,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:50,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 420 of 454 [2025-02-06 09:28:50,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:51,256 INFO L124 PetriNetUnfolderBase]: 163/1738 cut-off events. [2025-02-06 09:28:51,256 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-02-06 09:28:51,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2090 conditions, 1738 events. 163/1738 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 12360 event pairs, 60 based on Foata normal form. 0/1489 useless extension candidates. Maximal degree in co-relation 1724. Up to 239 conditions per place. [2025-02-06 09:28:51,276 INFO L140 encePairwiseOnDemand]: 448/454 looper letters, 17 selfloop transitions, 2 changer transitions 0/408 dead transitions. [2025-02-06 09:28:51,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 408 transitions, 922 flow [2025-02-06 09:28:51,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:51,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:51,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1283 transitions. [2025-02-06 09:28:51,280 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9419970631424376 [2025-02-06 09:28:51,281 INFO L175 Difference]: Start difference. First operand has 415 places, 408 transitions, 882 flow. Second operand 3 states and 1283 transitions. [2025-02-06 09:28:51,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 408 transitions, 922 flow [2025-02-06 09:28:51,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 413 places, 408 transitions, 922 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:28:51,289 INFO L231 Difference]: Finished difference. Result has 414 places, 406 transitions, 888 flow [2025-02-06 09:28:51,290 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=874, PETRI_DIFFERENCE_MINUEND_PLACES=411, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=402, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=888, PETRI_PLACES=414, PETRI_TRANSITIONS=406} [2025-02-06 09:28:51,291 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -11 predicate places. [2025-02-06 09:28:51,291 INFO L471 AbstractCegarLoop]: Abstraction has has 414 places, 406 transitions, 888 flow [2025-02-06 09:28:51,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 421.3333333333333) internal successors, (1264), 3 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:28:51,292 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:51,292 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:28:51,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 09:28:51,293 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-06 09:28:51,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:51,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1471078493, now seen corresponding path program 1 times [2025-02-06 09:28:51,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:51,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820915570] [2025-02-06 09:28:51,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:51,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:51,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-06 09:28:51,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-06 09:28:51,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:51,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:51,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:28:51,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:51,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820915570] [2025-02-06 09:28:51,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820915570] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:51,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:51,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:51,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487449905] [2025-02-06 09:28:51,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:51,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:51,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:51,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:51,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:51,390 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 420 out of 454 [2025-02-06 09:28:51,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 414 places, 406 transitions, 888 flow. Second operand has 3 states, 3 states have (on average 421.3333333333333) internal successors, (1264), 3 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:28:51,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:51,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 420 of 454 [2025-02-06 09:28:51,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:51,718 INFO L124 PetriNetUnfolderBase]: 121/1554 cut-off events. [2025-02-06 09:28:51,718 INFO L125 PetriNetUnfolderBase]: For 21/45 co-relation queries the response was YES. [2025-02-06 09:28:51,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1849 conditions, 1554 events. 121/1554 cut-off events. For 21/45 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 9847 event pairs, 52 based on Foata normal form. 3/1362 useless extension candidates. Maximal degree in co-relation 1555. Up to 191 conditions per place. [2025-02-06 09:28:51,744 INFO L140 encePairwiseOnDemand]: 448/454 looper letters, 17 selfloop transitions, 2 changer transitions 0/406 dead transitions. [2025-02-06 09:28:51,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 412 places, 406 transitions, 928 flow [2025-02-06 09:28:51,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:51,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:51,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1283 transitions. [2025-02-06 09:28:51,748 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9419970631424376 [2025-02-06 09:28:51,748 INFO L175 Difference]: Start difference. First operand has 414 places, 406 transitions, 888 flow. Second operand 3 states and 1283 transitions. [2025-02-06 09:28:51,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 412 places, 406 transitions, 928 flow [2025-02-06 09:28:51,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 406 transitions, 928 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:28:51,755 INFO L231 Difference]: Finished difference. Result has 413 places, 404 transitions, 894 flow [2025-02-06 09:28:51,756 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=880, PETRI_DIFFERENCE_MINUEND_PLACES=410, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=402, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=400, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=894, PETRI_PLACES=413, PETRI_TRANSITIONS=404} [2025-02-06 09:28:51,756 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -12 predicate places. [2025-02-06 09:28:51,757 INFO L471 AbstractCegarLoop]: Abstraction has has 413 places, 404 transitions, 894 flow [2025-02-06 09:28:51,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 421.3333333333333) internal successors, (1264), 3 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:28:51,758 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:51,758 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:28:51,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 09:28:51,758 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-06 09:28:51,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:51,759 INFO L85 PathProgramCache]: Analyzing trace with hash -429594352, now seen corresponding path program 1 times [2025-02-06 09:28:51,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:51,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470950665] [2025-02-06 09:28:51,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:51,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:51,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-06 09:28:51,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-06 09:28:51,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:51,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:51,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:28:51,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:51,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470950665] [2025-02-06 09:28:51,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470950665] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:51,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:51,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:51,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411652019] [2025-02-06 09:28:51,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:51,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:51,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:51,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:51,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:51,827 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 420 out of 454 [2025-02-06 09:28:51,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 413 places, 404 transitions, 894 flow. Second operand has 3 states, 3 states have (on average 421.6666666666667) internal successors, (1265), 3 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:28:51,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:51,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 420 of 454 [2025-02-06 09:28:51,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:52,136 INFO L124 PetriNetUnfolderBase]: 231/1986 cut-off events. [2025-02-06 09:28:52,136 INFO L125 PetriNetUnfolderBase]: For 51/53 co-relation queries the response was YES. [2025-02-06 09:28:52,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2492 conditions, 1986 events. 231/1986 cut-off events. For 51/53 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 13038 event pairs, 76 based on Foata normal form. 0/1789 useless extension candidates. Maximal degree in co-relation 2096. Up to 364 conditions per place. [2025-02-06 09:28:52,165 INFO L140 encePairwiseOnDemand]: 448/454 looper letters, 17 selfloop transitions, 2 changer transitions 0/404 dead transitions. [2025-02-06 09:28:52,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 404 transitions, 934 flow [2025-02-06 09:28:52,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:52,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:52,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1283 transitions. [2025-02-06 09:28:52,169 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9419970631424376 [2025-02-06 09:28:52,169 INFO L175 Difference]: Start difference. First operand has 413 places, 404 transitions, 894 flow. Second operand 3 states and 1283 transitions. [2025-02-06 09:28:52,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 404 transitions, 934 flow [2025-02-06 09:28:52,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 411 places, 404 transitions, 934 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:28:52,177 INFO L231 Difference]: Finished difference. Result has 412 places, 402 transitions, 900 flow [2025-02-06 09:28:52,178 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=886, PETRI_DIFFERENCE_MINUEND_PLACES=409, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=398, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=900, PETRI_PLACES=412, PETRI_TRANSITIONS=402} [2025-02-06 09:28:52,178 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -13 predicate places. [2025-02-06 09:28:52,178 INFO L471 AbstractCegarLoop]: Abstraction has has 412 places, 402 transitions, 900 flow [2025-02-06 09:28:52,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 421.6666666666667) internal successors, (1265), 3 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:28:52,179 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:52,179 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:28:52,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 09:28:52,180 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-06 09:28:52,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:52,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1985565941, now seen corresponding path program 1 times [2025-02-06 09:28:52,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:52,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403700891] [2025-02-06 09:28:52,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:52,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:52,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-06 09:28:52,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-06 09:28:52,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:52,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:52,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:28:52,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:52,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403700891] [2025-02-06 09:28:52,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403700891] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:52,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:52,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:52,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053704491] [2025-02-06 09:28:52,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:52,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:52,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:52,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:52,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:52,252 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 427 out of 454 [2025-02-06 09:28:52,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 402 transitions, 900 flow. Second operand has 3 states, 3 states have (on average 428.3333333333333) internal successors, (1285), 3 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:28:52,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:52,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 427 of 454 [2025-02-06 09:28:52,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:52,470 INFO L124 PetriNetUnfolderBase]: 55/1300 cut-off events. [2025-02-06 09:28:52,471 INFO L125 PetriNetUnfolderBase]: For 7/31 co-relation queries the response was YES. [2025-02-06 09:28:52,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1519 conditions, 1300 events. 55/1300 cut-off events. For 7/31 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 6940 event pairs, 4 based on Foata normal form. 4/1205 useless extension candidates. Maximal degree in co-relation 1196. Up to 30 conditions per place. [2025-02-06 09:28:52,483 INFO L140 encePairwiseOnDemand]: 451/454 looper letters, 11 selfloop transitions, 2 changer transitions 0/403 dead transitions. [2025-02-06 09:28:52,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 403 transitions, 930 flow [2025-02-06 09:28:52,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:52,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:52,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1295 transitions. [2025-02-06 09:28:52,486 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9508076358296622 [2025-02-06 09:28:52,487 INFO L175 Difference]: Start difference. First operand has 412 places, 402 transitions, 900 flow. Second operand 3 states and 1295 transitions. [2025-02-06 09:28:52,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 403 transitions, 930 flow [2025-02-06 09:28:52,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 413 places, 403 transitions, 930 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:28:52,493 INFO L231 Difference]: Finished difference. Result has 413 places, 401 transitions, 902 flow [2025-02-06 09:28:52,494 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=898, PETRI_DIFFERENCE_MINUEND_PLACES=411, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=902, PETRI_PLACES=413, PETRI_TRANSITIONS=401} [2025-02-06 09:28:52,494 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -12 predicate places. [2025-02-06 09:28:52,494 INFO L471 AbstractCegarLoop]: Abstraction has has 413 places, 401 transitions, 902 flow [2025-02-06 09:28:52,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 428.3333333333333) internal successors, (1285), 3 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:28:52,495 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:52,495 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:28:52,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 09:28:52,496 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-06 09:28:52,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:52,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1647885832, now seen corresponding path program 1 times [2025-02-06 09:28:52,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:52,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564993150] [2025-02-06 09:28:52,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:52,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:52,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-02-06 09:28:52,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-02-06 09:28:52,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:52,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:52,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:28:52,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:52,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564993150] [2025-02-06 09:28:52,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564993150] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:52,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:52,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:52,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572024897] [2025-02-06 09:28:52,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:52,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:52,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:52,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:52,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:52,578 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 454 [2025-02-06 09:28:52,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 413 places, 401 transitions, 902 flow. Second operand has 3 states, 3 states have (on average 427.6666666666667) internal successors, (1283), 3 states have internal predecessors, (1283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:28:52,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:52,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 454 [2025-02-06 09:28:52,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:52,802 INFO L124 PetriNetUnfolderBase]: 81/1576 cut-off events. [2025-02-06 09:28:52,802 INFO L125 PetriNetUnfolderBase]: For 19/31 co-relation queries the response was YES. [2025-02-06 09:28:52,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1889 conditions, 1576 events. 81/1576 cut-off events. For 19/31 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 9355 event pairs, 14 based on Foata normal form. 1/1465 useless extension candidates. Maximal degree in co-relation 1758. Up to 53 conditions per place. [2025-02-06 09:28:52,825 INFO L140 encePairwiseOnDemand]: 451/454 looper letters, 12 selfloop transitions, 2 changer transitions 0/402 dead transitions. [2025-02-06 09:28:52,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 402 transitions, 934 flow [2025-02-06 09:28:52,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:52,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:52,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1293 transitions. [2025-02-06 09:28:52,828 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9493392070484582 [2025-02-06 09:28:52,828 INFO L175 Difference]: Start difference. First operand has 413 places, 401 transitions, 902 flow. Second operand 3 states and 1293 transitions. [2025-02-06 09:28:52,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 414 places, 402 transitions, 934 flow [2025-02-06 09:28:52,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 402 transitions, 930 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:28:52,835 INFO L231 Difference]: Finished difference. Result has 412 places, 400 transitions, 900 flow [2025-02-06 09:28:52,835 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=896, PETRI_DIFFERENCE_MINUEND_PLACES=410, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=398, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=900, PETRI_PLACES=412, PETRI_TRANSITIONS=400} [2025-02-06 09:28:52,836 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -13 predicate places. [2025-02-06 09:28:52,836 INFO L471 AbstractCegarLoop]: Abstraction has has 412 places, 400 transitions, 900 flow [2025-02-06 09:28:52,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 427.6666666666667) internal successors, (1283), 3 states have internal predecessors, (1283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:28:52,837 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:52,837 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:28:52,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 09:28:52,837 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-06 09:28:52,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:52,838 INFO L85 PathProgramCache]: Analyzing trace with hash -876010472, now seen corresponding path program 1 times [2025-02-06 09:28:52,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:52,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288398124] [2025-02-06 09:28:52,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:52,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:52,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-02-06 09:28:52,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-02-06 09:28:52,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:52,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:52,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:28:52,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:52,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288398124] [2025-02-06 09:28:52,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288398124] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:52,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:52,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:52,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419465313] [2025-02-06 09:28:52,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:52,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:52,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:52,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:52,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:52,916 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 454 [2025-02-06 09:28:52,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 400 transitions, 900 flow. Second operand has 3 states, 3 states have (on average 428.0) internal successors, (1284), 3 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:28:52,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:52,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 454 [2025-02-06 09:28:52,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:53,115 INFO L124 PetriNetUnfolderBase]: 65/1219 cut-off events. [2025-02-06 09:28:53,115 INFO L125 PetriNetUnfolderBase]: For 25/31 co-relation queries the response was YES. [2025-02-06 09:28:53,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1506 conditions, 1219 events. 65/1219 cut-off events. For 25/31 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 6108 event pairs, 10 based on Foata normal form. 0/1146 useless extension candidates. Maximal degree in co-relation 1397. Up to 63 conditions per place. [2025-02-06 09:28:53,130 INFO L140 encePairwiseOnDemand]: 451/454 looper letters, 12 selfloop transitions, 2 changer transitions 0/401 dead transitions. [2025-02-06 09:28:53,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 401 transitions, 932 flow [2025-02-06 09:28:53,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:53,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:53,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1293 transitions. [2025-02-06 09:28:53,133 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9493392070484582 [2025-02-06 09:28:53,133 INFO L175 Difference]: Start difference. First operand has 412 places, 400 transitions, 900 flow. Second operand 3 states and 1293 transitions. [2025-02-06 09:28:53,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 401 transitions, 932 flow [2025-02-06 09:28:53,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 411 places, 401 transitions, 928 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:28:53,140 INFO L231 Difference]: Finished difference. Result has 411 places, 399 transitions, 898 flow [2025-02-06 09:28:53,140 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=894, PETRI_DIFFERENCE_MINUEND_PLACES=409, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=397, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=898, PETRI_PLACES=411, PETRI_TRANSITIONS=399} [2025-02-06 09:28:53,141 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -14 predicate places. [2025-02-06 09:28:53,141 INFO L471 AbstractCegarLoop]: Abstraction has has 411 places, 399 transitions, 898 flow [2025-02-06 09:28:53,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 428.0) internal successors, (1284), 3 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:28:53,141 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:53,142 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:28:53,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 09:28:53,142 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-06 09:28:53,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:53,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1527442181, now seen corresponding path program 1 times [2025-02-06 09:28:53,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:53,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561370982] [2025-02-06 09:28:53,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:53,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:53,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 331 statements into 1 equivalence classes. [2025-02-06 09:28:53,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 331 of 331 statements. [2025-02-06 09:28:53,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:53,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:53,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:28:53,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:53,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561370982] [2025-02-06 09:28:53,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561370982] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:53,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:53,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:53,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280709694] [2025-02-06 09:28:53,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:53,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:53,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:53,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:53,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:53,259 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 429 out of 454 [2025-02-06 09:28:53,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 399 transitions, 898 flow. Second operand has 3 states, 3 states have (on average 432.0) internal successors, (1296), 3 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:28:53,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:53,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 429 of 454 [2025-02-06 09:28:53,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:53,436 INFO L124 PetriNetUnfolderBase]: 49/1259 cut-off events. [2025-02-06 09:28:53,436 INFO L125 PetriNetUnfolderBase]: For 7/16 co-relation queries the response was YES. [2025-02-06 09:28:53,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1483 conditions, 1259 events. 49/1259 cut-off events. For 7/16 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 6536 event pairs, 2 based on Foata normal form. 0/1185 useless extension candidates. Maximal degree in co-relation 1326. Up to 30 conditions per place. [2025-02-06 09:28:53,450 INFO L140 encePairwiseOnDemand]: 452/454 looper letters, 8 selfloop transitions, 1 changer transitions 0/398 dead transitions. [2025-02-06 09:28:53,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 412 places, 398 transitions, 914 flow [2025-02-06 09:28:53,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:53,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:53,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1297 transitions. [2025-02-06 09:28:53,454 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9522760646108663 [2025-02-06 09:28:53,454 INFO L175 Difference]: Start difference. First operand has 411 places, 399 transitions, 898 flow. Second operand 3 states and 1297 transitions. [2025-02-06 09:28:53,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 412 places, 398 transitions, 914 flow [2025-02-06 09:28:53,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 410 places, 398 transitions, 910 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:28:53,460 INFO L231 Difference]: Finished difference. Result has 410 places, 398 transitions, 894 flow [2025-02-06 09:28:53,460 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=892, PETRI_DIFFERENCE_MINUEND_PLACES=408, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=397, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=894, PETRI_PLACES=410, PETRI_TRANSITIONS=398} [2025-02-06 09:28:53,460 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -15 predicate places. [2025-02-06 09:28:53,461 INFO L471 AbstractCegarLoop]: Abstraction has has 410 places, 398 transitions, 894 flow [2025-02-06 09:28:53,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 432.0) internal successors, (1296), 3 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:28:53,461 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:53,461 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:28:53,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 09:28:53,462 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-06 09:28:53,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:53,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1008284728, now seen corresponding path program 1 times [2025-02-06 09:28:53,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:53,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347691737] [2025-02-06 09:28:53,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:53,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:53,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes. [2025-02-06 09:28:53,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements. [2025-02-06 09:28:53,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:53,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:53,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:28:53,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:53,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347691737] [2025-02-06 09:28:53,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347691737] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:53,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:53,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:53,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551563904] [2025-02-06 09:28:53,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:53,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:53,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:53,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:53,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:53,575 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 454 [2025-02-06 09:28:53,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 410 places, 398 transitions, 894 flow. Second operand has 3 states, 3 states have (on average 429.0) internal successors, (1287), 3 states have internal predecessors, (1287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:28:53,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:53,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 454 [2025-02-06 09:28:53,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:53,869 INFO L124 PetriNetUnfolderBase]: 60/1492 cut-off events. [2025-02-06 09:28:53,869 INFO L125 PetriNetUnfolderBase]: For 7/13 co-relation queries the response was YES. [2025-02-06 09:28:53,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1730 conditions, 1492 events. 60/1492 cut-off events. For 7/13 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 8541 event pairs, 7 based on Foata normal form. 0/1401 useless extension candidates. Maximal degree in co-relation 1694. Up to 36 conditions per place. [2025-02-06 09:28:53,892 INFO L140 encePairwiseOnDemand]: 451/454 looper letters, 10 selfloop transitions, 1 changer transitions 0/396 dead transitions. [2025-02-06 09:28:53,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 396 transitions, 912 flow [2025-02-06 09:28:53,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:53,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:53,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1291 transitions. [2025-02-06 09:28:53,896 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9478707782672541 [2025-02-06 09:28:53,896 INFO L175 Difference]: Start difference. First operand has 410 places, 398 transitions, 894 flow. Second operand 3 states and 1291 transitions. [2025-02-06 09:28:53,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 396 transitions, 912 flow [2025-02-06 09:28:53,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 396 transitions, 911 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:28:53,904 INFO L231 Difference]: Finished difference. Result has 409 places, 396 transitions, 891 flow [2025-02-06 09:28:53,904 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=889, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=395, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=891, PETRI_PLACES=409, PETRI_TRANSITIONS=396} [2025-02-06 09:28:53,905 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -16 predicate places. [2025-02-06 09:28:53,906 INFO L471 AbstractCegarLoop]: Abstraction has has 409 places, 396 transitions, 891 flow [2025-02-06 09:28:53,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 429.0) internal successors, (1287), 3 states have internal predecessors, (1287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:28:53,906 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:53,907 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:28:53,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 09:28:53,907 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-06 09:28:53,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:53,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1095718236, now seen corresponding path program 1 times [2025-02-06 09:28:53,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:53,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314962220] [2025-02-06 09:28:53,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:53,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:53,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 341 statements into 1 equivalence classes. [2025-02-06 09:28:53,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 341 of 341 statements. [2025-02-06 09:28:53,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:53,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:54,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:28:54,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:54,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314962220] [2025-02-06 09:28:54,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314962220] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:54,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:54,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:54,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329802412] [2025-02-06 09:28:54,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:54,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:54,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:54,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:54,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:54,026 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 454 [2025-02-06 09:28:54,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 396 transitions, 891 flow. Second operand has 3 states, 3 states have (on average 429.0) internal successors, (1287), 3 states have internal predecessors, (1287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:28:54,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:54,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 454 [2025-02-06 09:28:54,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:54,190 INFO L124 PetriNetUnfolderBase]: 50/1171 cut-off events. [2025-02-06 09:28:54,191 INFO L125 PetriNetUnfolderBase]: For 10/16 co-relation queries the response was YES. [2025-02-06 09:28:54,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1374 conditions, 1171 events. 50/1171 cut-off events. For 10/16 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 5821 event pairs, 5 based on Foata normal form. 1/1103 useless extension candidates. Maximal degree in co-relation 1349. Up to 36 conditions per place. [2025-02-06 09:28:54,210 INFO L140 encePairwiseOnDemand]: 451/454 looper letters, 0 selfloop transitions, 0 changer transitions 394/394 dead transitions. [2025-02-06 09:28:54,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 394 transitions, 907 flow [2025-02-06 09:28:54,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:54,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:54,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1290 transitions. [2025-02-06 09:28:54,213 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.947136563876652 [2025-02-06 09:28:54,213 INFO L175 Difference]: Start difference. First operand has 409 places, 396 transitions, 891 flow. Second operand 3 states and 1290 transitions. [2025-02-06 09:28:54,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 394 transitions, 907 flow [2025-02-06 09:28:54,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 394 transitions, 906 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:28:54,219 INFO L231 Difference]: Finished difference. Result has 408 places, 0 transitions, 0 flow [2025-02-06 09:28:54,219 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=886, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=408, PETRI_TRANSITIONS=0} [2025-02-06 09:28:54,219 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -17 predicate places. [2025-02-06 09:28:54,220 INFO L471 AbstractCegarLoop]: Abstraction has has 408 places, 0 transitions, 0 flow [2025-02-06 09:28:54,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 429.0) internal successors, (1287), 3 states have internal predecessors, (1287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:28:54,222 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (70 of 71 remaining) [2025-02-06 09:28:54,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (69 of 71 remaining) [2025-02-06 09:28:54,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (68 of 71 remaining) [2025-02-06 09:28:54,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (67 of 71 remaining) [2025-02-06 09:28:54,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (66 of 71 remaining) [2025-02-06 09:28:54,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (65 of 71 remaining) [2025-02-06 09:28:54,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (64 of 71 remaining) [2025-02-06 09:28:54,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (63 of 71 remaining) [2025-02-06 09:28:54,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (62 of 71 remaining) [2025-02-06 09:28:54,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (61 of 71 remaining) [2025-02-06 09:28:54,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (60 of 71 remaining) [2025-02-06 09:28:54,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (59 of 71 remaining) [2025-02-06 09:28:54,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (58 of 71 remaining) [2025-02-06 09:28:54,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (57 of 71 remaining) [2025-02-06 09:28:54,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (56 of 71 remaining) [2025-02-06 09:28:54,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (55 of 71 remaining) [2025-02-06 09:28:54,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (54 of 71 remaining) [2025-02-06 09:28:54,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (53 of 71 remaining) [2025-02-06 09:28:54,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (52 of 71 remaining) [2025-02-06 09:28:54,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (51 of 71 remaining) [2025-02-06 09:28:54,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (50 of 71 remaining) [2025-02-06 09:28:54,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (49 of 71 remaining) [2025-02-06 09:28:54,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (48 of 71 remaining) [2025-02-06 09:28:54,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (47 of 71 remaining) [2025-02-06 09:28:54,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (46 of 71 remaining) [2025-02-06 09:28:54,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (45 of 71 remaining) [2025-02-06 09:28:54,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (44 of 71 remaining) [2025-02-06 09:28:54,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (43 of 71 remaining) [2025-02-06 09:28:54,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (42 of 71 remaining) [2025-02-06 09:28:54,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (41 of 71 remaining) [2025-02-06 09:28:54,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (40 of 71 remaining) [2025-02-06 09:28:54,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (39 of 71 remaining) [2025-02-06 09:28:54,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (38 of 71 remaining) [2025-02-06 09:28:54,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (37 of 71 remaining) [2025-02-06 09:28:54,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (36 of 71 remaining) [2025-02-06 09:28:54,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (35 of 71 remaining) [2025-02-06 09:28:54,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (34 of 71 remaining) [2025-02-06 09:28:54,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (33 of 71 remaining) [2025-02-06 09:28:54,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (32 of 71 remaining) [2025-02-06 09:28:54,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (31 of 71 remaining) [2025-02-06 09:28:54,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (30 of 71 remaining) [2025-02-06 09:28:54,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 71 remaining) [2025-02-06 09:28:54,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 71 remaining) [2025-02-06 09:28:54,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 71 remaining) [2025-02-06 09:28:54,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (26 of 71 remaining) [2025-02-06 09:28:54,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (25 of 71 remaining) [2025-02-06 09:28:54,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (24 of 71 remaining) [2025-02-06 09:28:54,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (23 of 71 remaining) [2025-02-06 09:28:54,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (22 of 71 remaining) [2025-02-06 09:28:54,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (21 of 71 remaining) [2025-02-06 09:28:54,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (20 of 71 remaining) [2025-02-06 09:28:54,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (19 of 71 remaining) [2025-02-06 09:28:54,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (18 of 71 remaining) [2025-02-06 09:28:54,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (17 of 71 remaining) [2025-02-06 09:28:54,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (16 of 71 remaining) [2025-02-06 09:28:54,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (15 of 71 remaining) [2025-02-06 09:28:54,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (14 of 71 remaining) [2025-02-06 09:28:54,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (13 of 71 remaining) [2025-02-06 09:28:54,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (12 of 71 remaining) [2025-02-06 09:28:54,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (11 of 71 remaining) [2025-02-06 09:28:54,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (10 of 71 remaining) [2025-02-06 09:28:54,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (9 of 71 remaining) [2025-02-06 09:28:54,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (8 of 71 remaining) [2025-02-06 09:28:54,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (7 of 71 remaining) [2025-02-06 09:28:54,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (6 of 71 remaining) [2025-02-06 09:28:54,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (5 of 71 remaining) [2025-02-06 09:28:54,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (4 of 71 remaining) [2025-02-06 09:28:54,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (3 of 71 remaining) [2025-02-06 09:28:54,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (2 of 71 remaining) [2025-02-06 09:28:54,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (1 of 71 remaining) [2025-02-06 09:28:54,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (0 of 71 remaining) [2025-02-06 09:28:54,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-06 09:28:54,228 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:28:54,237 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 09:28:54,237 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 09:28:54,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 09:28:54 BasicIcfg [2025-02-06 09:28:54,246 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 09:28:54,246 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 09:28:54,246 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 09:28:54,246 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 09:28:54,247 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:28:45" (3/4) ... [2025-02-06 09:28:54,248 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 09:28:54,251 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-06 09:28:54,251 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-06 09:28:54,251 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-06 09:28:54,257 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-02-06 09:28:54,258 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-06 09:28:54,258 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-06 09:28:54,258 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 09:28:54,347 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 09:28:54,348 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 09:28:54,348 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 09:28:54,348 INFO L158 Benchmark]: Toolchain (without parser) took 9931.11ms. Allocated memory was 142.6MB in the beginning and 536.9MB in the end (delta: 394.3MB). Free memory was 112.2MB in the beginning and 241.2MB in the end (delta: -129.0MB). Peak memory consumption was 260.1MB. Max. memory is 16.1GB. [2025-02-06 09:28:54,349 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 201.3MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:28:54,350 INFO L158 Benchmark]: CACSL2BoogieTranslator took 287.41ms. Allocated memory is still 142.6MB. Free memory was 111.7MB in the beginning and 99.4MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 09:28:54,350 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.00ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 97.3MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 09:28:54,351 INFO L158 Benchmark]: Boogie Preprocessor took 34.20ms. Allocated memory is still 142.6MB. Free memory was 97.3MB in the beginning and 95.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:28:54,352 INFO L158 Benchmark]: IcfgBuilder took 677.08ms. Allocated memory is still 142.6MB. Free memory was 95.9MB in the beginning and 67.6MB in the end (delta: 28.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 09:28:54,352 INFO L158 Benchmark]: TraceAbstraction took 8786.02ms. Allocated memory was 142.6MB in the beginning and 536.9MB in the end (delta: 394.3MB). Free memory was 67.2MB in the beginning and 245.4MB in the end (delta: -178.3MB). Peak memory consumption was 218.2MB. Max. memory is 16.1GB. [2025-02-06 09:28:54,353 INFO L158 Benchmark]: Witness Printer took 101.41ms. Allocated memory is still 536.9MB. Free memory was 245.4MB in the beginning and 241.2MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:28:54,354 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.42ms. Allocated memory is still 201.3MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 287.41ms. Allocated memory is still 142.6MB. Free memory was 111.7MB in the beginning and 99.4MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.00ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 97.3MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.20ms. Allocated memory is still 142.6MB. Free memory was 97.3MB in the beginning and 95.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 677.08ms. Allocated memory is still 142.6MB. Free memory was 95.9MB in the beginning and 67.6MB in the end (delta: 28.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 8786.02ms. Allocated memory was 142.6MB in the beginning and 536.9MB in the end (delta: 394.3MB). Free memory was 67.2MB in the beginning and 245.4MB in the end (delta: -178.3MB). Peak memory consumption was 218.2MB. Max. memory is 16.1GB. * Witness Printer took 101.41ms. Allocated memory is still 536.9MB. Free memory was 245.4MB in the beginning and 241.2MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 710 locations, 71 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.6s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 527 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 168 mSDsluCounter, 129 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 84 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 642 IncrementalHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 84 mSolverCounterUnsat, 129 mSDtfsCounter, 642 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=902occurred in iteration=19, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 3270 NumberOfCodeBlocks, 3270 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 3246 ConstructedInterpolants, 0 QuantifiedInterpolants, 3294 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 41 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-06 09:28:54,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE