./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/loop-tiling-eq.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/loop-tiling-eq.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2c579ed20cf5b381709dcc4ef9fbcf839f80c68ac017a29b947b11bd3a57dd56 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:12:46,635 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:12:46,693 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 11:12:46,696 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:12:46,696 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:12:46,717 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:12:46,718 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:12:46,718 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:12:46,718 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:12:46,719 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:12:46,719 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:12:46,719 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:12:46,719 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:12:46,720 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:12:46,720 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 11:12:46,720 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:12:46,720 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:12:46,720 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:12:46,720 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:12:46,720 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 11:12:46,720 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:12:46,720 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 11:12:46,720 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 11:12:46,720 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:12:46,720 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:12:46,720 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 11:12:46,720 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:12:46,720 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:12:46,721 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:12:46,721 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:12:46,721 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:12:46,721 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:12:46,721 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:12:46,721 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:12:46,721 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 11:12:46,721 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 11:12:46,721 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:12:46,721 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:12:46,721 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:12:46,721 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:12:46,721 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:12:46,721 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:12:46,721 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2c579ed20cf5b381709dcc4ef9fbcf839f80c68ac017a29b947b11bd3a57dd56 [2025-03-17 11:12:46,937 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:12:46,943 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:12:46,945 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:12:46,946 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:12:46,946 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:12:46,947 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/loop-tiling-eq.wvr.c [2025-03-17 11:12:48,082 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a0ae36f2/98d345792602499cb131e96002ff8994/FLAG3f66a3176 [2025-03-17 11:12:48,365 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:12:48,365 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/loop-tiling-eq.wvr.c [2025-03-17 11:12:48,373 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a0ae36f2/98d345792602499cb131e96002ff8994/FLAG3f66a3176 [2025-03-17 11:12:48,656 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a0ae36f2/98d345792602499cb131e96002ff8994 [2025-03-17 11:12:48,658 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:12:48,659 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:12:48,659 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:12:48,659 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:12:48,662 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:12:48,663 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:12:48" (1/1) ... [2025-03-17 11:12:48,663 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cc4af40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:12:48, skipping insertion in model container [2025-03-17 11:12:48,663 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:12:48" (1/1) ... [2025-03-17 11:12:48,673 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:12:48,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:12:48,834 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:12:48,866 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:12:48,879 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:12:48,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:12:48 WrapperNode [2025-03-17 11:12:48,881 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:12:48,882 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:12:48,882 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:12:48,882 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:12:48,887 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:12:48" (1/1) ... [2025-03-17 11:12:48,899 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:12:48" (1/1) ... [2025-03-17 11:12:48,925 INFO L138 Inliner]: procedures = 24, calls = 32, calls flagged for inlining = 14, calls inlined = 18, statements flattened = 321 [2025-03-17 11:12:48,930 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:12:48,930 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:12:48,931 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:12:48,931 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:12:48,937 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:12:48" (1/1) ... [2025-03-17 11:12:48,938 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:12:48" (1/1) ... [2025-03-17 11:12:48,940 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:12:48" (1/1) ... [2025-03-17 11:12:48,941 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:12:48" (1/1) ... [2025-03-17 11:12:48,950 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:12:48" (1/1) ... [2025-03-17 11:12:48,952 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:12:48" (1/1) ... [2025-03-17 11:12:48,953 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:12:48" (1/1) ... [2025-03-17 11:12:48,954 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:12:48" (1/1) ... [2025-03-17 11:12:48,956 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:12:48,957 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:12:48,957 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:12:48,957 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:12:48,958 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:12:48" (1/1) ... [2025-03-17 11:12:48,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:12:48,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:12:48,996 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 11:12:48,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 11:12:49,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-17 11:12:49,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:12:49,014 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-17 11:12:49,014 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-17 11:12:49,014 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-17 11:12:49,014 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-17 11:12:49,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 11:12:49,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-17 11:12:49,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 11:12:49,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 11:12:49,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:12:49,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:12:49,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 11:12:49,016 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 11:12:49,097 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:12:49,098 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:12:49,706 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 11:12:49,707 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:12:49,729 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:12:49,729 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:12:49,733 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:12:49 BoogieIcfgContainer [2025-03-17 11:12:49,733 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:12:49,735 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:12:49,735 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:12:49,739 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:12:49,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:12:48" (1/3) ... [2025-03-17 11:12:49,740 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d99afbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:12:49, skipping insertion in model container [2025-03-17 11:12:49,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:12:48" (2/3) ... [2025-03-17 11:12:49,740 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d99afbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:12:49, skipping insertion in model container [2025-03-17 11:12:49,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:12:49" (3/3) ... [2025-03-17 11:12:49,741 INFO L128 eAbstractionObserver]: Analyzing ICFG loop-tiling-eq.wvr.c [2025-03-17 11:12:49,755 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:12:49,756 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG loop-tiling-eq.wvr.c that has 3 procedures, 505 locations, 1 initial locations, 7 loop locations, and 55 error locations. [2025-03-17 11:12:49,756 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 11:12:49,862 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-17 11:12:49,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 511 places, 531 transitions, 1076 flow [2025-03-17 11:12:50,038 INFO L124 PetriNetUnfolderBase]: 27/529 cut-off events. [2025-03-17 11:12:50,041 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 11:12:50,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 538 conditions, 529 events. 27/529 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 888 event pairs, 0 based on Foata normal form. 0/447 useless extension candidates. Maximal degree in co-relation 347. Up to 2 conditions per place. [2025-03-17 11:12:50,047 INFO L82 GeneralOperation]: Start removeDead. Operand has 511 places, 531 transitions, 1076 flow [2025-03-17 11:12:50,055 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 490 places, 509 transitions, 1030 flow [2025-03-17 11:12:50,061 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:12:50,074 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;@2dd9a7bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:12:50,074 INFO L334 AbstractCegarLoop]: Starting to check reachability of 70 error locations. [2025-03-17 11:12:50,080 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:12:50,080 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2025-03-17 11:12:50,080 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:12:50,080 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:50,081 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:12:50,081 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-17 11:12:50,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:50,085 INFO L85 PathProgramCache]: Analyzing trace with hash -2069529946, now seen corresponding path program 1 times [2025-03-17 11:12:50,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:50,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767252948] [2025-03-17 11:12:50,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:50,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:50,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 11:12:50,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 11:12:50,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:50,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:50,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:50,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:50,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767252948] [2025-03-17 11:12:50,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767252948] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:50,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:50,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:50,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103586338] [2025-03-17 11:12:50,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:50,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:50,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:50,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:50,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:50,315 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 495 out of 531 [2025-03-17 11:12:50,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 490 places, 509 transitions, 1030 flow. Second operand has 3 states, 3 states have (on average 496.3333333333333) internal successors, (1489), 3 states have internal predecessors, (1489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:50,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:50,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 495 of 531 [2025-03-17 11:12:50,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:50,429 INFO L124 PetriNetUnfolderBase]: 13/497 cut-off events. [2025-03-17 11:12:50,429 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-03-17 11:12:50,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 530 conditions, 497 events. 13/497 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 880 event pairs, 2 based on Foata normal form. 18/439 useless extension candidates. Maximal degree in co-relation 344. Up to 20 conditions per place. [2025-03-17 11:12:50,433 INFO L140 encePairwiseOnDemand]: 513/531 looper letters, 15 selfloop transitions, 2 changer transitions 11/493 dead transitions. [2025-03-17 11:12:50,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 491 places, 493 transitions, 1032 flow [2025-03-17 11:12:50,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:50,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:50,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1518 transitions. [2025-03-17 11:12:50,452 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9529190207156308 [2025-03-17 11:12:50,453 INFO L175 Difference]: Start difference. First operand has 490 places, 509 transitions, 1030 flow. Second operand 3 states and 1518 transitions. [2025-03-17 11:12:50,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 491 places, 493 transitions, 1032 flow [2025-03-17 11:12:50,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 487 places, 493 transitions, 1024 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 11:12:50,469 INFO L231 Difference]: Finished difference. Result has 487 places, 482 transitions, 972 flow [2025-03-17 11:12:50,473 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=990, PETRI_DIFFERENCE_MINUEND_PLACES=485, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=493, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=491, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=972, PETRI_PLACES=487, PETRI_TRANSITIONS=482} [2025-03-17 11:12:50,477 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, -3 predicate places. [2025-03-17 11:12:50,477 INFO L471 AbstractCegarLoop]: Abstraction has has 487 places, 482 transitions, 972 flow [2025-03-17 11:12:50,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 496.3333333333333) internal successors, (1489), 3 states have internal predecessors, (1489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:50,478 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:50,478 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:12:50,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:12:50,479 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-17 11:12:50,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:50,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1816234779, now seen corresponding path program 1 times [2025-03-17 11:12:50,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:50,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155923340] [2025-03-17 11:12:50,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:50,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:50,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 11:12:50,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 11:12:50,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:50,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:50,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:50,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:50,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155923340] [2025-03-17 11:12:50,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155923340] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:50,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:50,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:50,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910520769] [2025-03-17 11:12:50,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:50,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:50,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:50,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:50,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:50,585 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 485 out of 531 [2025-03-17 11:12:50,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 487 places, 482 transitions, 972 flow. Second operand has 3 states, 3 states have (on average 486.0) internal successors, (1458), 3 states have internal predecessors, (1458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:50,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:50,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 485 of 531 [2025-03-17 11:12:50,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:50,640 INFO L124 PetriNetUnfolderBase]: 18/533 cut-off events. [2025-03-17 11:12:50,640 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-17 11:12:50,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 571 conditions, 533 events. 18/533 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1177 event pairs, 4 based on Foata normal form. 0/469 useless extension candidates. Maximal degree in co-relation 539. Up to 30 conditions per place. [2025-03-17 11:12:50,643 INFO L140 encePairwiseOnDemand]: 522/531 looper letters, 20 selfloop transitions, 1 changer transitions 0/474 dead transitions. [2025-03-17 11:12:50,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 470 places, 474 transitions, 998 flow [2025-03-17 11:12:50,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:50,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:50,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1484 transitions. [2025-03-17 11:12:50,648 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9315756434400502 [2025-03-17 11:12:50,648 INFO L175 Difference]: Start difference. First operand has 487 places, 482 transitions, 972 flow. Second operand 3 states and 1484 transitions. [2025-03-17 11:12:50,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 470 places, 474 transitions, 998 flow [2025-03-17 11:12:50,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 468 places, 474 transitions, 994 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:50,656 INFO L231 Difference]: Finished difference. Result has 468 places, 474 transitions, 954 flow [2025-03-17 11:12:50,657 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=952, PETRI_DIFFERENCE_MINUEND_PLACES=466, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=474, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=473, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=954, PETRI_PLACES=468, PETRI_TRANSITIONS=474} [2025-03-17 11:12:50,657 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, -22 predicate places. [2025-03-17 11:12:50,657 INFO L471 AbstractCegarLoop]: Abstraction has has 468 places, 474 transitions, 954 flow [2025-03-17 11:12:50,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 486.0) internal successors, (1458), 3 states have internal predecessors, (1458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:50,658 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:50,658 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:12:50,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:12:50,659 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-17 11:12:50,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:50,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1691262611, now seen corresponding path program 1 times [2025-03-17 11:12:50,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:50,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076303736] [2025-03-17 11:12:50,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:50,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:50,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 11:12:50,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 11:12:50,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:50,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:50,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:50,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:50,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076303736] [2025-03-17 11:12:50,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076303736] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:50,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:50,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:50,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246262771] [2025-03-17 11:12:50,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:50,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:50,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:50,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:50,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:50,746 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 494 out of 531 [2025-03-17 11:12:50,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 468 places, 474 transitions, 954 flow. Second operand has 3 states, 3 states have (on average 495.3333333333333) internal successors, (1486), 3 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:50,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:50,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 494 of 531 [2025-03-17 11:12:50,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:50,816 INFO L124 PetriNetUnfolderBase]: 14/528 cut-off events. [2025-03-17 11:12:50,816 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-17 11:12:50,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 555 conditions, 528 events. 14/528 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1075 event pairs, 1 based on Foata normal form. 0/465 useless extension candidates. Maximal degree in co-relation 523. Up to 20 conditions per place. [2025-03-17 11:12:50,820 INFO L140 encePairwiseOnDemand]: 528/531 looper letters, 16 selfloop transitions, 2 changer transitions 0/473 dead transitions. [2025-03-17 11:12:50,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 469 places, 473 transitions, 988 flow [2025-03-17 11:12:50,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:50,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:50,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1501 transitions. [2025-03-17 11:12:50,823 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9422473320778405 [2025-03-17 11:12:50,823 INFO L175 Difference]: Start difference. First operand has 468 places, 474 transitions, 954 flow. Second operand 3 states and 1501 transitions. [2025-03-17 11:12:50,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 469 places, 473 transitions, 988 flow [2025-03-17 11:12:50,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 468 places, 473 transitions, 987 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:12:50,828 INFO L231 Difference]: Finished difference. Result has 468 places, 473 transitions, 955 flow [2025-03-17 11:12:50,829 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=951, PETRI_DIFFERENCE_MINUEND_PLACES=466, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=473, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=471, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=955, PETRI_PLACES=468, PETRI_TRANSITIONS=473} [2025-03-17 11:12:50,830 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, -22 predicate places. [2025-03-17 11:12:50,830 INFO L471 AbstractCegarLoop]: Abstraction has has 468 places, 473 transitions, 955 flow [2025-03-17 11:12:50,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 495.3333333333333) internal successors, (1486), 3 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:50,830 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:50,831 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] [2025-03-17 11:12:50,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:12:50,831 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-17 11:12:50,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:50,831 INFO L85 PathProgramCache]: Analyzing trace with hash 167489685, now seen corresponding path program 1 times [2025-03-17 11:12:50,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:50,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459051928] [2025-03-17 11:12:50,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:50,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:50,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 11:12:50,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 11:12:50,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:50,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:50,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-03-17 11:12:50,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:50,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459051928] [2025-03-17 11:12:50,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459051928] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:50,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:50,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:50,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780140679] [2025-03-17 11:12:50,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:50,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:50,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:50,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:50,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:50,904 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 482 out of 531 [2025-03-17 11:12:50,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 468 places, 473 transitions, 955 flow. Second operand has 3 states, 3 states have (on average 483.0) internal successors, (1449), 3 states have internal predecessors, (1449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:50,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:50,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 482 of 531 [2025-03-17 11:12:50,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:50,958 INFO L124 PetriNetUnfolderBase]: 15/519 cut-off events. [2025-03-17 11:12:50,959 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-17 11:12:50,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 555 conditions, 519 events. 15/519 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1063 event pairs, 2 based on Foata normal form. 0/466 useless extension candidates. Maximal degree in co-relation 524. Up to 27 conditions per place. [2025-03-17 11:12:50,962 INFO L140 encePairwiseOnDemand]: 521/531 looper letters, 22 selfloop transitions, 1 changer transitions 0/464 dead transitions. [2025-03-17 11:12:50,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 461 places, 464 transitions, 983 flow [2025-03-17 11:12:50,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:50,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:50,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1478 transitions. [2025-03-17 11:12:50,964 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9278091650973007 [2025-03-17 11:12:50,964 INFO L175 Difference]: Start difference. First operand has 468 places, 473 transitions, 955 flow. Second operand 3 states and 1478 transitions. [2025-03-17 11:12:50,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 461 places, 464 transitions, 983 flow [2025-03-17 11:12:50,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 459 places, 464 transitions, 979 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:50,970 INFO L231 Difference]: Finished difference. Result has 459 places, 464 transitions, 935 flow [2025-03-17 11:12:50,970 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=933, PETRI_DIFFERENCE_MINUEND_PLACES=457, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=464, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=463, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=935, PETRI_PLACES=459, PETRI_TRANSITIONS=464} [2025-03-17 11:12:50,971 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, -31 predicate places. [2025-03-17 11:12:50,972 INFO L471 AbstractCegarLoop]: Abstraction has has 459 places, 464 transitions, 935 flow [2025-03-17 11:12:50,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 483.0) internal successors, (1449), 3 states have internal predecessors, (1449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:50,973 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:50,973 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-03-17 11:12:50,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:12:50,973 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-17 11:12:50,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:50,974 INFO L85 PathProgramCache]: Analyzing trace with hash 95595605, now seen corresponding path program 1 times [2025-03-17 11:12:50,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:50,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448265] [2025-03-17 11:12:50,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:50,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:50,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 11:12:50,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 11:12:50,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:50,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:51,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:51,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:51,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448265] [2025-03-17 11:12:51,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448265] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:51,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:51,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:51,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932793544] [2025-03-17 11:12:51,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:51,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:51,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:51,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:51,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:51,064 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 500 out of 531 [2025-03-17 11:12:51,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 459 places, 464 transitions, 935 flow. Second operand has 3 states, 3 states have (on average 501.3333333333333) internal successors, (1504), 3 states have internal predecessors, (1504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:51,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:51,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 500 of 531 [2025-03-17 11:12:51,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:51,120 INFO L124 PetriNetUnfolderBase]: 13/499 cut-off events. [2025-03-17 11:12:51,120 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 11:12:51,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 522 conditions, 499 events. 13/499 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 960 event pairs, 1 based on Foata normal form. 0/447 useless extension candidates. Maximal degree in co-relation 490. Up to 14 conditions per place. [2025-03-17 11:12:51,122 INFO L140 encePairwiseOnDemand]: 528/531 looper letters, 10 selfloop transitions, 2 changer transitions 0/463 dead transitions. [2025-03-17 11:12:51,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 460 places, 463 transitions, 957 flow [2025-03-17 11:12:51,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:51,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:51,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1513 transitions. [2025-03-17 11:12:51,125 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9497802887633396 [2025-03-17 11:12:51,125 INFO L175 Difference]: Start difference. First operand has 459 places, 464 transitions, 935 flow. Second operand 3 states and 1513 transitions. [2025-03-17 11:12:51,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 460 places, 463 transitions, 957 flow [2025-03-17 11:12:51,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 459 places, 463 transitions, 956 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:12:51,132 INFO L231 Difference]: Finished difference. Result has 459 places, 463 transitions, 936 flow [2025-03-17 11:12:51,134 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=932, PETRI_DIFFERENCE_MINUEND_PLACES=457, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=463, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=461, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=936, PETRI_PLACES=459, PETRI_TRANSITIONS=463} [2025-03-17 11:12:51,135 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, -31 predicate places. [2025-03-17 11:12:51,135 INFO L471 AbstractCegarLoop]: Abstraction has has 459 places, 463 transitions, 936 flow [2025-03-17 11:12:51,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 501.3333333333333) internal successors, (1504), 3 states have internal predecessors, (1504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:51,136 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:51,136 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] [2025-03-17 11:12:51,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:12:51,136 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-17 11:12:51,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:51,136 INFO L85 PathProgramCache]: Analyzing trace with hash 326011456, now seen corresponding path program 1 times [2025-03-17 11:12:51,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:51,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101313529] [2025-03-17 11:12:51,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:51,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:51,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-17 11:12:51,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-17 11:12:51,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:51,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:51,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:51,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:51,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101313529] [2025-03-17 11:12:51,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101313529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:51,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:51,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:51,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4003915] [2025-03-17 11:12:51,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:51,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:51,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:51,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:51,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:51,208 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 500 out of 531 [2025-03-17 11:12:51,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 459 places, 463 transitions, 936 flow. Second operand has 3 states, 3 states have (on average 501.0) internal successors, (1503), 3 states have internal predecessors, (1503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:51,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:51,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 500 of 531 [2025-03-17 11:12:51,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:51,246 INFO L124 PetriNetUnfolderBase]: 14/496 cut-off events. [2025-03-17 11:12:51,246 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 11:12:51,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 523 conditions, 496 events. 14/496 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 946 event pairs, 2 based on Foata normal form. 0/447 useless extension candidates. Maximal degree in co-relation 492. Up to 15 conditions per place. [2025-03-17 11:12:51,248 INFO L140 encePairwiseOnDemand]: 527/531 looper letters, 10 selfloop transitions, 1 changer transitions 0/460 dead transitions. [2025-03-17 11:12:51,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 458 places, 460 transitions, 952 flow [2025-03-17 11:12:51,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:51,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:51,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1514 transitions. [2025-03-17 11:12:51,250 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9504080351537979 [2025-03-17 11:12:51,250 INFO L175 Difference]: Start difference. First operand has 459 places, 463 transitions, 936 flow. Second operand 3 states and 1514 transitions. [2025-03-17 11:12:51,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 458 places, 460 transitions, 952 flow [2025-03-17 11:12:51,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 456 places, 460 transitions, 948 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:51,255 INFO L231 Difference]: Finished difference. Result has 456 places, 460 transitions, 928 flow [2025-03-17 11:12:51,256 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=926, PETRI_DIFFERENCE_MINUEND_PLACES=454, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=460, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=459, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=928, PETRI_PLACES=456, PETRI_TRANSITIONS=460} [2025-03-17 11:12:51,256 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, -34 predicate places. [2025-03-17 11:12:51,256 INFO L471 AbstractCegarLoop]: Abstraction has has 456 places, 460 transitions, 928 flow [2025-03-17 11:12:51,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 501.0) internal successors, (1503), 3 states have internal predecessors, (1503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:51,257 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:51,257 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-03-17 11:12:51,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:12:51,257 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-17 11:12:51,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:51,258 INFO L85 PathProgramCache]: Analyzing trace with hash 560876861, now seen corresponding path program 1 times [2025-03-17 11:12:51,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:51,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039047553] [2025-03-17 11:12:51,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:51,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:51,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-17 11:12:51,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 11:12:51,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:51,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:51,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:51,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:51,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039047553] [2025-03-17 11:12:51,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039047553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:51,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:51,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:12:51,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003909915] [2025-03-17 11:12:51,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:51,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:12:51,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:51,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:12:51,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:12:52,114 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 432 out of 531 [2025-03-17 11:12:52,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 456 places, 460 transitions, 928 flow. Second operand has 6 states, 6 states have (on average 433.5) internal successors, (2601), 6 states have internal predecessors, (2601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:52,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:52,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 432 of 531 [2025-03-17 11:12:52,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:52,353 INFO L124 PetriNetUnfolderBase]: 172/1159 cut-off events. [2025-03-17 11:12:52,354 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-03-17 11:12:52,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1521 conditions, 1159 events. 172/1159 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 5683 event pairs, 116 based on Foata normal form. 0/1021 useless extension candidates. Maximal degree in co-relation 1490. Up to 332 conditions per place. [2025-03-17 11:12:52,359 INFO L140 encePairwiseOnDemand]: 513/531 looper letters, 64 selfloop transitions, 15 changer transitions 0/457 dead transitions. [2025-03-17 11:12:52,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 458 places, 457 transitions, 1080 flow [2025-03-17 11:12:52,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:12:52,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:12:52,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2674 transitions. [2025-03-17 11:12:52,363 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8392969240426867 [2025-03-17 11:12:52,363 INFO L175 Difference]: Start difference. First operand has 456 places, 460 transitions, 928 flow. Second operand 6 states and 2674 transitions. [2025-03-17 11:12:52,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 458 places, 457 transitions, 1080 flow [2025-03-17 11:12:52,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 457 places, 457 transitions, 1079 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:12:52,368 INFO L231 Difference]: Finished difference. Result has 457 places, 457 transitions, 951 flow [2025-03-17 11:12:52,369 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=921, PETRI_DIFFERENCE_MINUEND_PLACES=452, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=457, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=442, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=951, PETRI_PLACES=457, PETRI_TRANSITIONS=457} [2025-03-17 11:12:52,370 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, -33 predicate places. [2025-03-17 11:12:52,370 INFO L471 AbstractCegarLoop]: Abstraction has has 457 places, 457 transitions, 951 flow [2025-03-17 11:12:52,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 433.5) internal successors, (2601), 6 states have internal predecessors, (2601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:52,371 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:52,372 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-03-17 11:12:52,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:12:52,372 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-17 11:12:52,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:52,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1330576271, now seen corresponding path program 1 times [2025-03-17 11:12:52,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:52,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656285750] [2025-03-17 11:12:52,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:52,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:52,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-17 11:12:52,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 11:12:52,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:52,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:52,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:52,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:52,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656285750] [2025-03-17 11:12:52,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656285750] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:52,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:52,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:52,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70621532] [2025-03-17 11:12:52,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:52,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:52,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:52,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:52,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:52,434 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 501 out of 531 [2025-03-17 11:12:52,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 457 places, 457 transitions, 951 flow. Second operand has 3 states, 3 states have (on average 502.3333333333333) internal successors, (1507), 3 states have internal predecessors, (1507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:52,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:52,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 501 of 531 [2025-03-17 11:12:52,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:52,480 INFO L124 PetriNetUnfolderBase]: 14/514 cut-off events. [2025-03-17 11:12:52,481 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 11:12:52,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 551 conditions, 514 events. 14/514 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1046 event pairs, 1 based on Foata normal form. 0/469 useless extension candidates. Maximal degree in co-relation 519. Up to 12 conditions per place. [2025-03-17 11:12:52,483 INFO L140 encePairwiseOnDemand]: 528/531 looper letters, 9 selfloop transitions, 2 changer transitions 0/456 dead transitions. [2025-03-17 11:12:52,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 458 places, 456 transitions, 971 flow [2025-03-17 11:12:52,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:52,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:52,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1515 transitions. [2025-03-17 11:12:52,486 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9510357815442562 [2025-03-17 11:12:52,486 INFO L175 Difference]: Start difference. First operand has 457 places, 457 transitions, 951 flow. Second operand 3 states and 1515 transitions. [2025-03-17 11:12:52,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 458 places, 456 transitions, 971 flow [2025-03-17 11:12:52,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 453 places, 456 transitions, 941 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:12:52,494 INFO L231 Difference]: Finished difference. Result has 453 places, 456 transitions, 923 flow [2025-03-17 11:12:52,495 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=919, PETRI_DIFFERENCE_MINUEND_PLACES=451, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=456, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=454, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=923, PETRI_PLACES=453, PETRI_TRANSITIONS=456} [2025-03-17 11:12:52,496 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, -37 predicate places. [2025-03-17 11:12:52,496 INFO L471 AbstractCegarLoop]: Abstraction has has 453 places, 456 transitions, 923 flow [2025-03-17 11:12:52,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 502.3333333333333) internal successors, (1507), 3 states have internal predecessors, (1507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:52,497 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:52,497 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:12:52,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:12:52,498 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-17 11:12:52,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:52,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1575305481, now seen corresponding path program 1 times [2025-03-17 11:12:52,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:52,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710504437] [2025-03-17 11:12:52,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:52,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:52,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-17 11:12:52,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-17 11:12:52,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:52,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:52,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:52,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:52,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710504437] [2025-03-17 11:12:52,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710504437] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:52,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:52,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:52,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469471342] [2025-03-17 11:12:52,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:52,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:52,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:52,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:52,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:52,560 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 501 out of 531 [2025-03-17 11:12:52,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 453 places, 456 transitions, 923 flow. Second operand has 3 states, 3 states have (on average 502.3333333333333) internal successors, (1507), 3 states have internal predecessors, (1507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:52,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:52,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 501 of 531 [2025-03-17 11:12:52,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:52,604 INFO L124 PetriNetUnfolderBase]: 16/516 cut-off events. [2025-03-17 11:12:52,604 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 11:12:52,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 544 conditions, 516 events. 16/516 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1102 event pairs, 3 based on Foata normal form. 0/470 useless extension candidates. Maximal degree in co-relation 512. Up to 16 conditions per place. [2025-03-17 11:12:52,607 INFO L140 encePairwiseOnDemand]: 528/531 looper letters, 9 selfloop transitions, 2 changer transitions 0/455 dead transitions. [2025-03-17 11:12:52,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 455 transitions, 943 flow [2025-03-17 11:12:52,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:52,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:52,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1515 transitions. [2025-03-17 11:12:52,610 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9510357815442562 [2025-03-17 11:12:52,610 INFO L175 Difference]: Start difference. First operand has 453 places, 456 transitions, 923 flow. Second operand 3 states and 1515 transitions. [2025-03-17 11:12:52,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 455 transitions, 943 flow [2025-03-17 11:12:52,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 452 places, 455 transitions, 939 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:52,616 INFO L231 Difference]: Finished difference. Result has 452 places, 455 transitions, 921 flow [2025-03-17 11:12:52,617 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=917, PETRI_DIFFERENCE_MINUEND_PLACES=450, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=455, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=453, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=921, PETRI_PLACES=452, PETRI_TRANSITIONS=455} [2025-03-17 11:12:52,617 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, -38 predicate places. [2025-03-17 11:12:52,617 INFO L471 AbstractCegarLoop]: Abstraction has has 452 places, 455 transitions, 921 flow [2025-03-17 11:12:52,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 502.3333333333333) internal successors, (1507), 3 states have internal predecessors, (1507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:52,618 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:52,618 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:12:52,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 11:12:52,618 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-17 11:12:52,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:52,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1858387715, now seen corresponding path program 1 times [2025-03-17 11:12:52,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:52,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674881044] [2025-03-17 11:12:52,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:52,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:52,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-17 11:12:52,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-17 11:12:52,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:52,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:52,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:52,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:52,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674881044] [2025-03-17 11:12:52,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674881044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:52,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:52,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:52,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933213420] [2025-03-17 11:12:52,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:52,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:52,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:52,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:52,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:52,687 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 500 out of 531 [2025-03-17 11:12:52,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 452 places, 455 transitions, 921 flow. Second operand has 3 states, 3 states have (on average 501.3333333333333) internal successors, (1504), 3 states have internal predecessors, (1504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:52,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:52,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 500 of 531 [2025-03-17 11:12:52,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:52,735 INFO L124 PetriNetUnfolderBase]: 12/456 cut-off events. [2025-03-17 11:12:52,735 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 11:12:52,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 480 conditions, 456 events. 12/456 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 711 event pairs, 1 based on Foata normal form. 0/420 useless extension candidates. Maximal degree in co-relation 448. Up to 13 conditions per place. [2025-03-17 11:12:52,736 INFO L140 encePairwiseOnDemand]: 528/531 looper letters, 10 selfloop transitions, 2 changer transitions 0/454 dead transitions. [2025-03-17 11:12:52,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 453 places, 454 transitions, 943 flow [2025-03-17 11:12:52,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:52,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:52,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1513 transitions. [2025-03-17 11:12:52,739 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9497802887633396 [2025-03-17 11:12:52,739 INFO L175 Difference]: Start difference. First operand has 452 places, 455 transitions, 921 flow. Second operand 3 states and 1513 transitions. [2025-03-17 11:12:52,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 453 places, 454 transitions, 943 flow [2025-03-17 11:12:52,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 451 places, 454 transitions, 939 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:52,744 INFO L231 Difference]: Finished difference. Result has 451 places, 454 transitions, 919 flow [2025-03-17 11:12:52,745 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=915, PETRI_DIFFERENCE_MINUEND_PLACES=449, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=452, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=919, PETRI_PLACES=451, PETRI_TRANSITIONS=454} [2025-03-17 11:12:52,746 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, -39 predicate places. [2025-03-17 11:12:52,746 INFO L471 AbstractCegarLoop]: Abstraction has has 451 places, 454 transitions, 919 flow [2025-03-17 11:12:52,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 501.3333333333333) internal successors, (1504), 3 states have internal predecessors, (1504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:52,746 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:52,747 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] [2025-03-17 11:12:52,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 11:12:52,747 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-17 11:12:52,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:52,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1692671595, now seen corresponding path program 1 times [2025-03-17 11:12:52,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:52,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198902994] [2025-03-17 11:12:52,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:52,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:52,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-17 11:12:52,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-17 11:12:52,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:52,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:52,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:52,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:52,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198902994] [2025-03-17 11:12:52,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198902994] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:52,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:52,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:12:52,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051008360] [2025-03-17 11:12:52,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:52,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:12:52,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:52,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:12:52,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:12:52,965 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 497 out of 531 [2025-03-17 11:12:52,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 451 places, 454 transitions, 919 flow. Second operand has 5 states, 5 states have (on average 498.6) internal successors, (2493), 5 states have internal predecessors, (2493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:52,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:52,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 497 of 531 [2025-03-17 11:12:52,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:53,036 INFO L124 PetriNetUnfolderBase]: 18/788 cut-off events. [2025-03-17 11:12:53,037 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 11:12:53,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 826 conditions, 788 events. 18/788 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2219 event pairs, 0 based on Foata normal form. 1/723 useless extension candidates. Maximal degree in co-relation 793. Up to 12 conditions per place. [2025-03-17 11:12:53,041 INFO L140 encePairwiseOnDemand]: 523/531 looper letters, 16 selfloop transitions, 7 changer transitions 0/461 dead transitions. [2025-03-17 11:12:53,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 455 places, 461 transitions, 983 flow [2025-03-17 11:12:53,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:12:53,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 11:12:53,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2509 transitions. [2025-03-17 11:12:53,044 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9450094161958569 [2025-03-17 11:12:53,044 INFO L175 Difference]: Start difference. First operand has 451 places, 454 transitions, 919 flow. Second operand 5 states and 2509 transitions. [2025-03-17 11:12:53,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 455 places, 461 transitions, 983 flow [2025-03-17 11:12:53,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 453 places, 461 transitions, 979 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:53,052 INFO L231 Difference]: Finished difference. Result has 455 places, 456 transitions, 946 flow [2025-03-17 11:12:53,053 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=915, PETRI_DIFFERENCE_MINUEND_PLACES=449, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=447, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=946, PETRI_PLACES=455, PETRI_TRANSITIONS=456} [2025-03-17 11:12:53,053 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, -35 predicate places. [2025-03-17 11:12:53,053 INFO L471 AbstractCegarLoop]: Abstraction has has 455 places, 456 transitions, 946 flow [2025-03-17 11:12:53,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 498.6) internal successors, (2493), 5 states have internal predecessors, (2493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:53,055 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:53,055 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-03-17 11:12:53,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 11:12:53,055 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-17 11:12:53,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:53,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1914010650, now seen corresponding path program 1 times [2025-03-17 11:12:53,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:53,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350279273] [2025-03-17 11:12:53,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:53,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:53,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-17 11:12:53,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-17 11:12:53,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:53,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:53,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:53,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:53,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350279273] [2025-03-17 11:12:53,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350279273] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:53,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:53,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:53,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930444409] [2025-03-17 11:12:53,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:53,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:53,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:53,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:53,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:53,111 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 500 out of 531 [2025-03-17 11:12:53,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 455 places, 456 transitions, 946 flow. Second operand has 3 states, 3 states have (on average 501.0) internal successors, (1503), 3 states have internal predecessors, (1503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:53,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:53,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 500 of 531 [2025-03-17 11:12:53,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:53,223 INFO L124 PetriNetUnfolderBase]: 39/1132 cut-off events. [2025-03-17 11:12:53,223 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-03-17 11:12:53,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1203 conditions, 1132 events. 39/1132 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 4221 event pairs, 0 based on Foata normal form. 0/1025 useless extension candidates. Maximal degree in co-relation 1169. Up to 31 conditions per place. [2025-03-17 11:12:53,226 INFO L140 encePairwiseOnDemand]: 525/531 looper letters, 15 selfloop transitions, 3 changer transitions 0/460 dead transitions. [2025-03-17 11:12:53,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 460 transitions, 994 flow [2025-03-17 11:12:53,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:53,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:53,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1521 transitions. [2025-03-17 11:12:53,228 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9548022598870056 [2025-03-17 11:12:53,228 INFO L175 Difference]: Start difference. First operand has 455 places, 456 transitions, 946 flow. Second operand 3 states and 1521 transitions. [2025-03-17 11:12:53,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 460 transitions, 994 flow [2025-03-17 11:12:53,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 452 places, 460 transitions, 987 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:53,233 INFO L231 Difference]: Finished difference. Result has 453 places, 456 transitions, 954 flow [2025-03-17 11:12:53,234 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=933, PETRI_DIFFERENCE_MINUEND_PLACES=450, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=453, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=450, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=954, PETRI_PLACES=453, PETRI_TRANSITIONS=456} [2025-03-17 11:12:53,236 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, -37 predicate places. [2025-03-17 11:12:53,236 INFO L471 AbstractCegarLoop]: Abstraction has has 453 places, 456 transitions, 954 flow [2025-03-17 11:12:53,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 501.0) internal successors, (1503), 3 states have internal predecessors, (1503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:53,237 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:53,237 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] [2025-03-17 11:12:53,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 11:12:53,237 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-17 11:12:53,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:53,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1457139889, now seen corresponding path program 1 times [2025-03-17 11:12:53,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:53,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258588735] [2025-03-17 11:12:53,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:53,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:53,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-17 11:12:53,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-17 11:12:53,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:53,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:53,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:53,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:53,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258588735] [2025-03-17 11:12:53,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258588735] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:53,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:53,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:53,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454259730] [2025-03-17 11:12:53,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:53,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:53,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:53,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:53,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:53,293 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 531 [2025-03-17 11:12:53,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 453 places, 456 transitions, 954 flow. Second operand has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:53,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:53,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 531 [2025-03-17 11:12:53,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:53,416 INFO L124 PetriNetUnfolderBase]: 55/1376 cut-off events. [2025-03-17 11:12:53,416 INFO L125 PetriNetUnfolderBase]: For 10/18 co-relation queries the response was YES. [2025-03-17 11:12:53,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1482 conditions, 1376 events. 55/1376 cut-off events. For 10/18 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 5970 event pairs, 0 based on Foata normal form. 0/1237 useless extension candidates. Maximal degree in co-relation 1448. Up to 43 conditions per place. [2025-03-17 11:12:53,421 INFO L140 encePairwiseOnDemand]: 527/531 looper letters, 12 selfloop transitions, 2 changer transitions 0/459 dead transitions. [2025-03-17 11:12:53,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 453 places, 459 transitions, 991 flow [2025-03-17 11:12:53,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:53,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:53,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1525 transitions. [2025-03-17 11:12:53,424 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9573132454488387 [2025-03-17 11:12:53,424 INFO L175 Difference]: Start difference. First operand has 453 places, 456 transitions, 954 flow. Second operand 3 states and 1525 transitions. [2025-03-17 11:12:53,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 453 places, 459 transitions, 991 flow [2025-03-17 11:12:53,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 453 places, 459 transitions, 991 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:12:53,430 INFO L231 Difference]: Finished difference. Result has 454 places, 456 transitions, 964 flow [2025-03-17 11:12:53,431 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=950, PETRI_DIFFERENCE_MINUEND_PLACES=451, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=452, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=964, PETRI_PLACES=454, PETRI_TRANSITIONS=456} [2025-03-17 11:12:53,432 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, -36 predicate places. [2025-03-17 11:12:53,432 INFO L471 AbstractCegarLoop]: Abstraction has has 454 places, 456 transitions, 964 flow [2025-03-17 11:12:53,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:53,433 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:53,433 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] [2025-03-17 11:12:53,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 11:12:53,433 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-17 11:12:53,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:53,434 INFO L85 PathProgramCache]: Analyzing trace with hash 152128178, now seen corresponding path program 1 times [2025-03-17 11:12:53,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:53,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202664975] [2025-03-17 11:12:53,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:53,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:53,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-17 11:12:53,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-17 11:12:53,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:53,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:53,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:53,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:53,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202664975] [2025-03-17 11:12:53,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202664975] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:53,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:53,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:53,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430025279] [2025-03-17 11:12:53,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:53,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:53,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:53,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:53,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:53,488 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 531 [2025-03-17 11:12:53,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 454 places, 456 transitions, 964 flow. Second operand has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:53,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:53,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 531 [2025-03-17 11:12:53,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:53,682 INFO L124 PetriNetUnfolderBase]: 95/2044 cut-off events. [2025-03-17 11:12:53,682 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-03-17 11:12:53,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2233 conditions, 2044 events. 95/2044 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 11935 event pairs, 8 based on Foata normal form. 0/1828 useless extension candidates. Maximal degree in co-relation 2198. Up to 84 conditions per place. [2025-03-17 11:12:53,690 INFO L140 encePairwiseOnDemand]: 527/531 looper letters, 12 selfloop transitions, 2 changer transitions 0/459 dead transitions. [2025-03-17 11:12:53,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 459 transitions, 1001 flow [2025-03-17 11:12:53,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:53,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:53,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1525 transitions. [2025-03-17 11:12:53,693 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9573132454488387 [2025-03-17 11:12:53,693 INFO L175 Difference]: Start difference. First operand has 454 places, 456 transitions, 964 flow. Second operand 3 states and 1525 transitions. [2025-03-17 11:12:53,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 459 transitions, 1001 flow [2025-03-17 11:12:53,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 454 places, 459 transitions, 1001 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:12:53,698 INFO L231 Difference]: Finished difference. Result has 455 places, 456 transitions, 974 flow [2025-03-17 11:12:53,699 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=960, PETRI_DIFFERENCE_MINUEND_PLACES=452, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=452, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=974, PETRI_PLACES=455, PETRI_TRANSITIONS=456} [2025-03-17 11:12:53,699 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, -35 predicate places. [2025-03-17 11:12:53,699 INFO L471 AbstractCegarLoop]: Abstraction has has 455 places, 456 transitions, 974 flow [2025-03-17 11:12:53,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:53,700 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:53,700 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] [2025-03-17 11:12:53,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 11:12:53,700 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-17 11:12:53,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:53,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1069606635, now seen corresponding path program 1 times [2025-03-17 11:12:53,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:53,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303087039] [2025-03-17 11:12:53,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:53,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:53,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-17 11:12:53,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-17 11:12:53,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:53,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:53,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:53,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:53,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303087039] [2025-03-17 11:12:53,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303087039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:53,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:53,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 11:12:53,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254345702] [2025-03-17 11:12:53,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:53,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 11:12:53,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:53,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 11:12:53,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:12:54,102 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 477 out of 531 [2025-03-17 11:12:54,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 455 places, 456 transitions, 974 flow. Second operand has 7 states, 7 states have (on average 480.0) internal successors, (3360), 7 states have internal predecessors, (3360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:54,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:54,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 477 of 531 [2025-03-17 11:12:54,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:54,442 INFO L124 PetriNetUnfolderBase]: 123/2878 cut-off events. [2025-03-17 11:12:54,443 INFO L125 PetriNetUnfolderBase]: For 19/37 co-relation queries the response was YES. [2025-03-17 11:12:54,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3290 conditions, 2878 events. 123/2878 cut-off events. For 19/37 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 18108 event pairs, 18 based on Foata normal form. 8/2620 useless extension candidates. Maximal degree in co-relation 3253. Up to 100 conditions per place. [2025-03-17 11:12:54,452 INFO L140 encePairwiseOnDemand]: 510/531 looper letters, 44 selfloop transitions, 28 changer transitions 0/491 dead transitions. [2025-03-17 11:12:54,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 464 places, 491 transitions, 1193 flow [2025-03-17 11:12:54,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 11:12:54,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 11:12:54,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4843 transitions. [2025-03-17 11:12:54,459 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9120527306967985 [2025-03-17 11:12:54,459 INFO L175 Difference]: Start difference. First operand has 455 places, 456 transitions, 974 flow. Second operand 10 states and 4843 transitions. [2025-03-17 11:12:54,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 464 places, 491 transitions, 1193 flow [2025-03-17 11:12:54,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 464 places, 491 transitions, 1193 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:12:54,466 INFO L231 Difference]: Finished difference. Result has 468 places, 472 transitions, 1103 flow [2025-03-17 11:12:54,466 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=974, PETRI_DIFFERENCE_MINUEND_PLACES=455, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=456, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=436, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1103, PETRI_PLACES=468, PETRI_TRANSITIONS=472} [2025-03-17 11:12:54,467 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, -22 predicate places. [2025-03-17 11:12:54,467 INFO L471 AbstractCegarLoop]: Abstraction has has 468 places, 472 transitions, 1103 flow [2025-03-17 11:12:54,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 480.0) internal successors, (3360), 7 states have internal predecessors, (3360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:54,468 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:54,468 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:12:54,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 11:12:54,468 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-17 11:12:54,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:54,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1704259246, now seen corresponding path program 1 times [2025-03-17 11:12:54,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:54,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703826763] [2025-03-17 11:12:54,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:54,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:54,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-17 11:12:54,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-17 11:12:54,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:54,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:54,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-03-17 11:12:54,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:54,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703826763] [2025-03-17 11:12:54,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703826763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:54,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:54,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:12:54,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060393436] [2025-03-17 11:12:54,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:54,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:12:54,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:54,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:12:54,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:12:54,657 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 497 out of 531 [2025-03-17 11:12:54,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 468 places, 472 transitions, 1103 flow. Second operand has 5 states, 5 states have (on average 499.0) internal successors, (2495), 5 states have internal predecessors, (2495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:54,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:54,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 497 of 531 [2025-03-17 11:12:54,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:54,881 INFO L124 PetriNetUnfolderBase]: 122/2431 cut-off events. [2025-03-17 11:12:54,881 INFO L125 PetriNetUnfolderBase]: For 83/86 co-relation queries the response was YES. [2025-03-17 11:12:54,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2844 conditions, 2431 events. 122/2431 cut-off events. For 83/86 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 14433 event pairs, 33 based on Foata normal form. 5/2230 useless extension candidates. Maximal degree in co-relation 2800. Up to 115 conditions per place. [2025-03-17 11:12:54,890 INFO L140 encePairwiseOnDemand]: 523/531 looper letters, 17 selfloop transitions, 7 changer transitions 0/480 dead transitions. [2025-03-17 11:12:54,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 472 places, 480 transitions, 1172 flow [2025-03-17 11:12:54,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:12:54,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 11:12:54,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2510 transitions. [2025-03-17 11:12:54,894 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9453860640301318 [2025-03-17 11:12:54,894 INFO L175 Difference]: Start difference. First operand has 468 places, 472 transitions, 1103 flow. Second operand 5 states and 2510 transitions. [2025-03-17 11:12:54,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 472 places, 480 transitions, 1172 flow [2025-03-17 11:12:54,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 472 places, 480 transitions, 1172 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:12:54,901 INFO L231 Difference]: Finished difference. Result has 474 places, 474 transitions, 1134 flow [2025-03-17 11:12:54,902 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=1103, PETRI_DIFFERENCE_MINUEND_PLACES=468, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=472, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=465, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1134, PETRI_PLACES=474, PETRI_TRANSITIONS=474} [2025-03-17 11:12:54,903 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, -16 predicate places. [2025-03-17 11:12:54,903 INFO L471 AbstractCegarLoop]: Abstraction has has 474 places, 474 transitions, 1134 flow [2025-03-17 11:12:54,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 499.0) internal successors, (2495), 5 states have internal predecessors, (2495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:54,904 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:54,904 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] [2025-03-17 11:12:54,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 11:12:54,904 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-17 11:12:54,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:54,905 INFO L85 PathProgramCache]: Analyzing trace with hash 151420829, now seen corresponding path program 1 times [2025-03-17 11:12:54,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:54,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879786135] [2025-03-17 11:12:54,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:54,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:54,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-17 11:12:54,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-17 11:12:54,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:54,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:55,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:55,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:55,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879786135] [2025-03-17 11:12:55,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879786135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:55,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:55,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:12:55,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427006129] [2025-03-17 11:12:55,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:55,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:12:55,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:55,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:12:55,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:12:55,096 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 498 out of 531 [2025-03-17 11:12:55,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 474 places, 474 transitions, 1134 flow. Second operand has 5 states, 5 states have (on average 500.0) internal successors, (2500), 5 states have internal predecessors, (2500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:55,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:55,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 498 of 531 [2025-03-17 11:12:55,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:55,334 INFO L124 PetriNetUnfolderBase]: 104/2582 cut-off events. [2025-03-17 11:12:55,334 INFO L125 PetriNetUnfolderBase]: For 160/163 co-relation queries the response was YES. [2025-03-17 11:12:55,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3044 conditions, 2582 events. 104/2582 cut-off events. For 160/163 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 14842 event pairs, 24 based on Foata normal form. 5/2375 useless extension candidates. Maximal degree in co-relation 2996. Up to 78 conditions per place. [2025-03-17 11:12:55,343 INFO L140 encePairwiseOnDemand]: 522/531 looper letters, 17 selfloop transitions, 12 changer transitions 0/483 dead transitions. [2025-03-17 11:12:55,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 479 places, 483 transitions, 1218 flow [2025-03-17 11:12:55,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:12:55,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:12:55,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3014 transitions. [2025-03-17 11:12:55,348 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9460138104205901 [2025-03-17 11:12:55,348 INFO L175 Difference]: Start difference. First operand has 474 places, 474 transitions, 1134 flow. Second operand 6 states and 3014 transitions. [2025-03-17 11:12:55,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 479 places, 483 transitions, 1218 flow [2025-03-17 11:12:55,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 477 places, 483 transitions, 1209 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:55,354 INFO L231 Difference]: Finished difference. Result has 481 places, 478 transitions, 1191 flow [2025-03-17 11:12:55,355 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=1120, PETRI_DIFFERENCE_MINUEND_PLACES=472, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=473, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=461, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1191, PETRI_PLACES=481, PETRI_TRANSITIONS=478} [2025-03-17 11:12:55,355 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, -9 predicate places. [2025-03-17 11:12:55,355 INFO L471 AbstractCegarLoop]: Abstraction has has 481 places, 478 transitions, 1191 flow [2025-03-17 11:12:55,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 500.0) internal successors, (2500), 5 states have internal predecessors, (2500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:55,360 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:55,360 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:12:55,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 11:12:55,360 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-17 11:12:55,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:55,361 INFO L85 PathProgramCache]: Analyzing trace with hash 2083433539, now seen corresponding path program 1 times [2025-03-17 11:12:55,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:55,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515241202] [2025-03-17 11:12:55,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:55,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:55,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-17 11:12:55,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-17 11:12:55,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:55,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:55,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:55,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:55,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515241202] [2025-03-17 11:12:55,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515241202] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:55,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:55,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:55,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591363120] [2025-03-17 11:12:55,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:55,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:55,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:55,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:55,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:55,431 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 499 out of 531 [2025-03-17 11:12:55,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 481 places, 478 transitions, 1191 flow. Second operand has 3 states, 3 states have (on average 501.6666666666667) internal successors, (1505), 3 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:55,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:55,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 499 of 531 [2025-03-17 11:12:55,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:55,670 INFO L124 PetriNetUnfolderBase]: 64/2292 cut-off events. [2025-03-17 11:12:55,671 INFO L125 PetriNetUnfolderBase]: For 119/125 co-relation queries the response was YES. [2025-03-17 11:12:55,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2745 conditions, 2292 events. 64/2292 cut-off events. For 119/125 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 11844 event pairs, 0 based on Foata normal form. 0/2113 useless extension candidates. Maximal degree in co-relation 2693. Up to 99 conditions per place. [2025-03-17 11:12:55,678 INFO L140 encePairwiseOnDemand]: 528/531 looper letters, 11 selfloop transitions, 2 changer transitions 0/477 dead transitions. [2025-03-17 11:12:55,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 482 places, 477 transitions, 1215 flow [2025-03-17 11:12:55,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:55,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:55,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1511 transitions. [2025-03-17 11:12:55,681 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9485247959824231 [2025-03-17 11:12:55,682 INFO L175 Difference]: Start difference. First operand has 481 places, 478 transitions, 1191 flow. Second operand 3 states and 1511 transitions. [2025-03-17 11:12:55,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 482 places, 477 transitions, 1215 flow [2025-03-17 11:12:55,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 481 places, 477 transitions, 1206 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-17 11:12:55,688 INFO L231 Difference]: Finished difference. Result has 481 places, 477 transitions, 1184 flow [2025-03-17 11:12:55,689 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=1180, PETRI_DIFFERENCE_MINUEND_PLACES=479, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=477, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=475, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1184, PETRI_PLACES=481, PETRI_TRANSITIONS=477} [2025-03-17 11:12:55,689 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, -9 predicate places. [2025-03-17 11:12:55,689 INFO L471 AbstractCegarLoop]: Abstraction has has 481 places, 477 transitions, 1184 flow [2025-03-17 11:12:55,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 501.6666666666667) internal successors, (1505), 3 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:55,690 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:55,690 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:12:55,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 11:12:55,690 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-17 11:12:55,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:55,691 INFO L85 PathProgramCache]: Analyzing trace with hash -302741343, now seen corresponding path program 1 times [2025-03-17 11:12:55,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:55,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485053029] [2025-03-17 11:12:55,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:55,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:55,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-17 11:12:55,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-17 11:12:55,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:55,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:56,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:56,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:56,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485053029] [2025-03-17 11:12:56,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485053029] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:56,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:56,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:12:56,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624877746] [2025-03-17 11:12:56,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:56,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:12:56,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:56,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:12:56,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:12:56,321 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 531 [2025-03-17 11:12:56,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 481 places, 477 transitions, 1184 flow. Second operand has 6 states, 6 states have (on average 452.6666666666667) internal successors, (2716), 6 states have internal predecessors, (2716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:56,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:56,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 531 [2025-03-17 11:12:56,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:56,651 INFO L124 PetriNetUnfolderBase]: 258/3166 cut-off events. [2025-03-17 11:12:56,652 INFO L125 PetriNetUnfolderBase]: For 187/187 co-relation queries the response was YES. [2025-03-17 11:12:56,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4274 conditions, 3166 events. 258/3166 cut-off events. For 187/187 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 20428 event pairs, 164 based on Foata normal form. 0/2916 useless extension candidates. Maximal degree in co-relation 4221. Up to 654 conditions per place. [2025-03-17 11:12:56,662 INFO L140 encePairwiseOnDemand]: 525/531 looper letters, 60 selfloop transitions, 5 changer transitions 0/476 dead transitions. [2025-03-17 11:12:56,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 485 places, 476 transitions, 1312 flow [2025-03-17 11:12:56,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:12:56,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:12:56,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2768 transitions. [2025-03-17 11:12:56,666 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8688010043942247 [2025-03-17 11:12:56,666 INFO L175 Difference]: Start difference. First operand has 481 places, 477 transitions, 1184 flow. Second operand 6 states and 2768 transitions. [2025-03-17 11:12:56,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 485 places, 476 transitions, 1312 flow [2025-03-17 11:12:56,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 483 places, 476 transitions, 1308 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:56,672 INFO L231 Difference]: Finished difference. Result has 483 places, 476 transitions, 1188 flow [2025-03-17 11:12:56,672 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=1178, PETRI_DIFFERENCE_MINUEND_PLACES=478, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=476, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=471, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1188, PETRI_PLACES=483, PETRI_TRANSITIONS=476} [2025-03-17 11:12:56,673 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, -7 predicate places. [2025-03-17 11:12:56,673 INFO L471 AbstractCegarLoop]: Abstraction has has 483 places, 476 transitions, 1188 flow [2025-03-17 11:12:56,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 452.6666666666667) internal successors, (2716), 6 states have internal predecessors, (2716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:56,674 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:56,674 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:12:56,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 11:12:56,674 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-17 11:12:56,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:56,675 INFO L85 PathProgramCache]: Analyzing trace with hash -251454790, now seen corresponding path program 1 times [2025-03-17 11:12:56,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:56,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958381645] [2025-03-17 11:12:56,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:56,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:56,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-17 11:12:56,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-17 11:12:56,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:56,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:56,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:56,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:56,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958381645] [2025-03-17 11:12:56,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958381645] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:56,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:56,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:56,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314655615] [2025-03-17 11:12:56,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:56,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:56,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:56,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:56,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:56,732 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 499 out of 531 [2025-03-17 11:12:56,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 483 places, 476 transitions, 1188 flow. Second operand has 3 states, 3 states have (on average 501.6666666666667) internal successors, (1505), 3 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:56,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:56,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 499 of 531 [2025-03-17 11:12:56,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:56,915 INFO L124 PetriNetUnfolderBase]: 64/2277 cut-off events. [2025-03-17 11:12:56,915 INFO L125 PetriNetUnfolderBase]: For 96/102 co-relation queries the response was YES. [2025-03-17 11:12:56,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2737 conditions, 2277 events. 64/2277 cut-off events. For 96/102 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 11749 event pairs, 0 based on Foata normal form. 0/2113 useless extension candidates. Maximal degree in co-relation 2685. Up to 99 conditions per place. [2025-03-17 11:12:56,923 INFO L140 encePairwiseOnDemand]: 528/531 looper letters, 11 selfloop transitions, 2 changer transitions 0/475 dead transitions. [2025-03-17 11:12:56,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 484 places, 475 transitions, 1212 flow [2025-03-17 11:12:56,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:56,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:56,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1511 transitions. [2025-03-17 11:12:56,925 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9485247959824231 [2025-03-17 11:12:56,925 INFO L175 Difference]: Start difference. First operand has 483 places, 476 transitions, 1188 flow. Second operand 3 states and 1511 transitions. [2025-03-17 11:12:56,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 484 places, 475 transitions, 1212 flow [2025-03-17 11:12:56,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 479 places, 475 transitions, 1202 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:12:56,932 INFO L231 Difference]: Finished difference. Result has 479 places, 475 transitions, 1180 flow [2025-03-17 11:12:56,932 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=1176, PETRI_DIFFERENCE_MINUEND_PLACES=477, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=475, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=473, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1180, PETRI_PLACES=479, PETRI_TRANSITIONS=475} [2025-03-17 11:12:56,932 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, -11 predicate places. [2025-03-17 11:12:56,933 INFO L471 AbstractCegarLoop]: Abstraction has has 479 places, 475 transitions, 1180 flow [2025-03-17 11:12:56,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 501.6666666666667) internal successors, (1505), 3 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:56,933 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:56,933 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:12:56,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 11:12:56,933 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-17 11:12:56,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:56,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1770215443, now seen corresponding path program 1 times [2025-03-17 11:12:56,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:56,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205287370] [2025-03-17 11:12:56,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:56,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:56,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-17 11:12:56,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-17 11:12:56,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:56,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:56,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:56,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:56,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205287370] [2025-03-17 11:12:56,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205287370] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:56,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:56,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:56,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126749203] [2025-03-17 11:12:56,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:56,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:56,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:56,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:56,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:56,995 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 497 out of 531 [2025-03-17 11:12:56,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 479 places, 475 transitions, 1180 flow. Second operand has 3 states, 3 states have (on average 499.3333333333333) internal successors, (1498), 3 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:56,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:56,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 497 of 531 [2025-03-17 11:12:56,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:57,178 INFO L124 PetriNetUnfolderBase]: 64/2235 cut-off events. [2025-03-17 11:12:57,179 INFO L125 PetriNetUnfolderBase]: For 96/102 co-relation queries the response was YES. [2025-03-17 11:12:57,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2705 conditions, 2235 events. 64/2235 cut-off events. For 96/102 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 11404 event pairs, 0 based on Foata normal form. 0/2113 useless extension candidates. Maximal degree in co-relation 2654. Up to 84 conditions per place. [2025-03-17 11:12:57,187 INFO L140 encePairwiseOnDemand]: 526/531 looper letters, 12 selfloop transitions, 1 changer transitions 0/471 dead transitions. [2025-03-17 11:12:57,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 477 places, 471 transitions, 1198 flow [2025-03-17 11:12:57,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:57,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:57,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1508 transitions. [2025-03-17 11:12:57,189 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9466415568110483 [2025-03-17 11:12:57,189 INFO L175 Difference]: Start difference. First operand has 479 places, 475 transitions, 1180 flow. Second operand 3 states and 1508 transitions. [2025-03-17 11:12:57,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 477 places, 471 transitions, 1198 flow [2025-03-17 11:12:57,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 475 places, 471 transitions, 1194 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:57,196 INFO L231 Difference]: Finished difference. Result has 475 places, 471 transitions, 1170 flow [2025-03-17 11:12:57,197 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=1168, PETRI_DIFFERENCE_MINUEND_PLACES=473, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=471, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=470, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1170, PETRI_PLACES=475, PETRI_TRANSITIONS=471} [2025-03-17 11:12:57,197 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, -15 predicate places. [2025-03-17 11:12:57,197 INFO L471 AbstractCegarLoop]: Abstraction has has 475 places, 471 transitions, 1170 flow [2025-03-17 11:12:57,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 499.3333333333333) internal successors, (1498), 3 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:57,198 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:57,198 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] [2025-03-17 11:12:57,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 11:12:57,198 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-17 11:12:57,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:57,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1722135497, now seen corresponding path program 1 times [2025-03-17 11:12:57,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:57,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816463205] [2025-03-17 11:12:57,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:57,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:57,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-17 11:12:57,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-17 11:12:57,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:57,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:57,624 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:12:57,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:57,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816463205] [2025-03-17 11:12:57,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816463205] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:57,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:57,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:12:57,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391072746] [2025-03-17 11:12:57,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:57,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:12:57,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:57,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:12:57,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:12:58,079 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 475 out of 531 [2025-03-17 11:12:58,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 475 places, 471 transitions, 1170 flow. Second operand has 6 states, 6 states have (on average 477.8333333333333) internal successors, (2867), 6 states have internal predecessors, (2867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:58,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:58,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 475 of 531 [2025-03-17 11:12:58,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:58,471 INFO L124 PetriNetUnfolderBase]: 242/3490 cut-off events. [2025-03-17 11:12:58,472 INFO L125 PetriNetUnfolderBase]: For 192/193 co-relation queries the response was YES. [2025-03-17 11:12:58,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4470 conditions, 3490 events. 242/3490 cut-off events. For 192/193 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 23016 event pairs, 82 based on Foata normal form. 0/3257 useless extension candidates. Maximal degree in co-relation 4418. Up to 402 conditions per place. [2025-03-17 11:12:58,483 INFO L140 encePairwiseOnDemand]: 520/531 looper letters, 44 selfloop transitions, 22 changer transitions 0/496 dead transitions. [2025-03-17 11:12:58,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 480 places, 496 transitions, 1356 flow [2025-03-17 11:12:58,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:12:58,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:12:58,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2915 transitions. [2025-03-17 11:12:58,487 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9149403640929065 [2025-03-17 11:12:58,487 INFO L175 Difference]: Start difference. First operand has 475 places, 471 transitions, 1170 flow. Second operand 6 states and 2915 transitions. [2025-03-17 11:12:58,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 480 places, 496 transitions, 1356 flow [2025-03-17 11:12:58,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 479 places, 496 transitions, 1355 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:12:58,493 INFO L231 Difference]: Finished difference. Result has 484 places, 492 transitions, 1319 flow [2025-03-17 11:12:58,494 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=1169, PETRI_DIFFERENCE_MINUEND_PLACES=474, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=471, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=461, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1319, PETRI_PLACES=484, PETRI_TRANSITIONS=492} [2025-03-17 11:12:58,494 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, -6 predicate places. [2025-03-17 11:12:58,494 INFO L471 AbstractCegarLoop]: Abstraction has has 484 places, 492 transitions, 1319 flow [2025-03-17 11:12:58,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 477.8333333333333) internal successors, (2867), 6 states have internal predecessors, (2867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:58,495 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:58,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:12:58,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 11:12:58,495 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-17 11:12:58,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:58,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1117323030, now seen corresponding path program 1 times [2025-03-17 11:12:58,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:58,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302162774] [2025-03-17 11:12:58,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:58,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:58,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-17 11:12:58,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-17 11:12:58,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:58,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:58,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:58,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:58,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302162774] [2025-03-17 11:12:58,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302162774] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:58,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:58,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:58,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022627071] [2025-03-17 11:12:58,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:58,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:58,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:58,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:58,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:58,542 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 497 out of 531 [2025-03-17 11:12:58,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 484 places, 492 transitions, 1319 flow. Second operand has 3 states, 3 states have (on average 499.3333333333333) internal successors, (1498), 3 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:58,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:58,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 497 of 531 [2025-03-17 11:12:58,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:58,783 INFO L124 PetriNetUnfolderBase]: 128/2803 cut-off events. [2025-03-17 11:12:58,783 INFO L125 PetriNetUnfolderBase]: For 128/137 co-relation queries the response was YES. [2025-03-17 11:12:58,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3512 conditions, 2803 events. 128/2803 cut-off events. For 128/137 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 16265 event pairs, 4 based on Foata normal form. 0/2688 useless extension candidates. Maximal degree in co-relation 3457. Up to 105 conditions per place. [2025-03-17 11:12:58,790 INFO L140 encePairwiseOnDemand]: 524/531 looper letters, 12 selfloop transitions, 3 changer transitions 0/490 dead transitions. [2025-03-17 11:12:58,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 482 places, 490 transitions, 1345 flow [2025-03-17 11:12:58,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:58,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:58,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1510 transitions. [2025-03-17 11:12:58,791 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9478970495919649 [2025-03-17 11:12:58,792 INFO L175 Difference]: Start difference. First operand has 484 places, 492 transitions, 1319 flow. Second operand 3 states and 1510 transitions. [2025-03-17 11:12:58,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 482 places, 490 transitions, 1345 flow [2025-03-17 11:12:58,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 482 places, 490 transitions, 1345 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:12:58,798 INFO L231 Difference]: Finished difference. Result has 483 places, 490 transitions, 1328 flow [2025-03-17 11:12:58,798 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=1311, PETRI_DIFFERENCE_MINUEND_PLACES=480, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=488, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=485, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1328, PETRI_PLACES=483, PETRI_TRANSITIONS=490} [2025-03-17 11:12:58,798 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, -7 predicate places. [2025-03-17 11:12:58,798 INFO L471 AbstractCegarLoop]: Abstraction has has 483 places, 490 transitions, 1328 flow [2025-03-17 11:12:58,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 499.3333333333333) internal successors, (1498), 3 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:58,799 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:58,799 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:12:58,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 11:12:58,799 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-17 11:12:58,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:58,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1792411158, now seen corresponding path program 1 times [2025-03-17 11:12:58,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:58,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001841341] [2025-03-17 11:12:58,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:58,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:58,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-17 11:12:58,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-17 11:12:58,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:58,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:59,112 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:12:59,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:59,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001841341] [2025-03-17 11:12:59,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001841341] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:59,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:59,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:12:59,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603941703] [2025-03-17 11:12:59,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:59,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:12:59,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:59,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:12:59,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:12:59,293 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 453 out of 531 [2025-03-17 11:12:59,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 483 places, 490 transitions, 1328 flow. Second operand has 6 states, 6 states have (on average 456.6666666666667) internal successors, (2740), 6 states have internal predecessors, (2740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:59,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:59,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 453 of 531 [2025-03-17 11:12:59,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:59,939 INFO L124 PetriNetUnfolderBase]: 575/4337 cut-off events. [2025-03-17 11:12:59,940 INFO L125 PetriNetUnfolderBase]: For 590/615 co-relation queries the response was YES. [2025-03-17 11:12:59,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6741 conditions, 4337 events. 575/4337 cut-off events. For 590/615 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 30558 event pairs, 232 based on Foata normal form. 4/4107 useless extension candidates. Maximal degree in co-relation 6684. Up to 1126 conditions per place. [2025-03-17 11:12:59,955 INFO L140 encePairwiseOnDemand]: 512/531 looper letters, 85 selfloop transitions, 55 changer transitions 0/547 dead transitions. [2025-03-17 11:12:59,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 488 places, 547 transitions, 1758 flow [2025-03-17 11:12:59,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:12:59,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:12:59,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2837 transitions. [2025-03-17 11:12:59,960 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8904582548650345 [2025-03-17 11:12:59,960 INFO L175 Difference]: Start difference. First operand has 483 places, 490 transitions, 1328 flow. Second operand 6 states and 2837 transitions. [2025-03-17 11:12:59,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 488 places, 547 transitions, 1758 flow [2025-03-17 11:12:59,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 488 places, 547 transitions, 1758 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:12:59,969 INFO L231 Difference]: Finished difference. Result has 493 places, 543 transitions, 1722 flow [2025-03-17 11:12:59,969 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=1328, PETRI_DIFFERENCE_MINUEND_PLACES=483, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=490, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=471, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1722, PETRI_PLACES=493, PETRI_TRANSITIONS=543} [2025-03-17 11:12:59,970 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, 3 predicate places. [2025-03-17 11:12:59,970 INFO L471 AbstractCegarLoop]: Abstraction has has 493 places, 543 transitions, 1722 flow [2025-03-17 11:12:59,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 456.6666666666667) internal successors, (2740), 6 states have internal predecessors, (2740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:59,971 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:59,971 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:12:59,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 11:12:59,971 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-17 11:12:59,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:59,972 INFO L85 PathProgramCache]: Analyzing trace with hash 633639004, now seen corresponding path program 1 times [2025-03-17 11:12:59,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:59,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159079902] [2025-03-17 11:12:59,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:59,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:59,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-03-17 11:12:59,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-03-17 11:12:59,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:59,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:00,120 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:13:00,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:00,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159079902] [2025-03-17 11:13:00,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159079902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:00,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:00,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 11:13:00,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012824470] [2025-03-17 11:13:00,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:00,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 11:13:00,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:00,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 11:13:00,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:13:00,412 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 477 out of 531 [2025-03-17 11:13:00,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 493 places, 543 transitions, 1722 flow. Second operand has 7 states, 7 states have (on average 481.2857142857143) internal successors, (3369), 7 states have internal predecessors, (3369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:13:00,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:00,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 477 of 531 [2025-03-17 11:13:00,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:00,921 INFO L124 PetriNetUnfolderBase]: 335/4076 cut-off events. [2025-03-17 11:13:00,922 INFO L125 PetriNetUnfolderBase]: For 478/501 co-relation queries the response was YES. [2025-03-17 11:13:00,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5843 conditions, 4076 events. 335/4076 cut-off events. For 478/501 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 28185 event pairs, 33 based on Foata normal form. 13/3951 useless extension candidates. Maximal degree in co-relation 5780. Up to 265 conditions per place. [2025-03-17 11:13:00,935 INFO L140 encePairwiseOnDemand]: 518/531 looper letters, 54 selfloop transitions, 18 changer transitions 0/564 dead transitions. [2025-03-17 11:13:00,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 502 places, 564 transitions, 1913 flow [2025-03-17 11:13:00,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 11:13:00,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 11:13:00,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4829 transitions. [2025-03-17 11:13:00,939 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9094161958568738 [2025-03-17 11:13:00,939 INFO L175 Difference]: Start difference. First operand has 493 places, 543 transitions, 1722 flow. Second operand 10 states and 4829 transitions. [2025-03-17 11:13:00,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 502 places, 564 transitions, 1913 flow [2025-03-17 11:13:00,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 502 places, 564 transitions, 1881 flow, removed 16 selfloop flow, removed 0 redundant places. [2025-03-17 11:13:00,948 INFO L231 Difference]: Finished difference. Result has 506 places, 554 transitions, 1777 flow [2025-03-17 11:13:00,948 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=1690, PETRI_DIFFERENCE_MINUEND_PLACES=493, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=543, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=531, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1777, PETRI_PLACES=506, PETRI_TRANSITIONS=554} [2025-03-17 11:13:00,949 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, 16 predicate places. [2025-03-17 11:13:00,949 INFO L471 AbstractCegarLoop]: Abstraction has has 506 places, 554 transitions, 1777 flow [2025-03-17 11:13:00,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 481.2857142857143) internal successors, (3369), 7 states have internal predecessors, (3369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:13:00,950 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:00,950 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] [2025-03-17 11:13:00,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 11:13:00,950 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-17 11:13:00,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:00,951 INFO L85 PathProgramCache]: Analyzing trace with hash 948652687, now seen corresponding path program 1 times [2025-03-17 11:13:00,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:00,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576114419] [2025-03-17 11:13:00,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:00,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:00,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-03-17 11:13:00,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-03-17 11:13:00,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:00,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat