./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-more-sorted.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/popl20-more-sorted.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 39e987e3198040ef6af9e29359b0ab7bee89306d1945f6e4e7a9286ebbe2a705 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:14:36,974 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:14:37,033 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 11:14:37,037 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:14:37,038 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:14:37,060 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:14:37,060 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:14:37,061 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:14:37,061 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:14:37,061 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:14:37,062 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:14:37,062 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:14:37,062 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:14:37,062 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:14:37,062 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 11:14:37,062 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:14:37,062 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:14:37,062 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:14:37,062 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:14:37,062 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 11:14:37,062 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:14:37,062 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 11:14:37,062 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 11:14:37,063 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:14:37,063 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:14:37,063 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 11:14:37,063 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:14:37,063 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:14:37,063 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:14:37,063 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:14:37,063 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:14:37,063 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:14:37,063 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:14:37,063 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:14:37,063 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 11:14:37,063 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 11:14:37,063 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:14:37,063 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:14:37,063 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:14:37,063 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:14:37,063 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:14:37,063 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:14:37,063 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 -> 39e987e3198040ef6af9e29359b0ab7bee89306d1945f6e4e7a9286ebbe2a705 [2025-03-17 11:14:37,287 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:14:37,296 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:14:37,298 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:14:37,299 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:14:37,299 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:14:37,300 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-sorted.wvr.c [2025-03-17 11:14:38,449 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e16bac2f/3511a2039d94492d97c5261bfce998ae/FLAG0ad5fef16 [2025-03-17 11:14:38,680 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:14:38,680 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-sorted.wvr.c [2025-03-17 11:14:38,686 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e16bac2f/3511a2039d94492d97c5261bfce998ae/FLAG0ad5fef16 [2025-03-17 11:14:39,015 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e16bac2f/3511a2039d94492d97c5261bfce998ae [2025-03-17 11:14:39,017 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:14:39,018 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:14:39,019 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:14:39,019 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:14:39,022 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:14:39,022 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:14:39" (1/1) ... [2025-03-17 11:14:39,023 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79c199b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:39, skipping insertion in model container [2025-03-17 11:14:39,023 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:14:39" (1/1) ... [2025-03-17 11:14:39,037 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:14:39,190 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:14:39,198 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:14:39,230 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:14:39,246 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:14:39,247 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:39 WrapperNode [2025-03-17 11:14:39,247 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:14:39,248 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:14:39,248 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:14:39,248 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:14:39,253 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:14:39" (1/1) ... [2025-03-17 11:14:39,265 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:14:39" (1/1) ... [2025-03-17 11:14:39,287 INFO L138 Inliner]: procedures = 23, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 142 [2025-03-17 11:14:39,287 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:14:39,288 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:14:39,288 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:14:39,288 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:14:39,293 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:39" (1/1) ... [2025-03-17 11:14:39,294 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:39" (1/1) ... [2025-03-17 11:14:39,296 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:39" (1/1) ... [2025-03-17 11:14:39,296 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:39" (1/1) ... [2025-03-17 11:14:39,310 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:39" (1/1) ... [2025-03-17 11:14:39,311 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:39" (1/1) ... [2025-03-17 11:14:39,316 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:39" (1/1) ... [2025-03-17 11:14:39,317 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:39" (1/1) ... [2025-03-17 11:14:39,318 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:14:39,322 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:14:39,322 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:14:39,322 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:14:39,323 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:39" (1/1) ... [2025-03-17 11:14:39,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:14:39,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:14:39,354 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:14:39,356 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:14:39,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:14:39,375 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-17 11:14:39,375 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-17 11:14:39,375 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-17 11:14:39,376 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-17 11:14:39,376 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-17 11:14:39,376 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-17 11:14:39,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 11:14:39,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 11:14:39,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 11:14:39,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:14:39,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:14:39,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 11:14:39,378 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:14:39,449 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:14:39,450 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:14:39,831 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 11:14:39,831 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:14:39,850 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:14:39,853 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:14:39,853 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:14:39 BoogieIcfgContainer [2025-03-17 11:14:39,854 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:14:39,855 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:14:39,856 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:14:39,859 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:14:39,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:14:39" (1/3) ... [2025-03-17 11:14:39,860 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24272bd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:14:39, skipping insertion in model container [2025-03-17 11:14:39,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:39" (2/3) ... [2025-03-17 11:14:39,861 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24272bd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:14:39, skipping insertion in model container [2025-03-17 11:14:39,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:14:39" (3/3) ... [2025-03-17 11:14:39,862 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-sorted.wvr.c [2025-03-17 11:14:39,873 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:14:39,875 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-sorted.wvr.c that has 4 procedures, 323 locations, 1 initial locations, 4 loop locations, and 36 error locations. [2025-03-17 11:14:39,875 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 11:14:39,968 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-17 11:14:40,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 332 places, 338 transitions, 697 flow [2025-03-17 11:14:40,096 INFO L124 PetriNetUnfolderBase]: 16/335 cut-off events. [2025-03-17 11:14:40,098 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-17 11:14:40,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 348 conditions, 335 events. 16/335 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 727 event pairs, 0 based on Foata normal form. 0/283 useless extension candidates. Maximal degree in co-relation 250. Up to 2 conditions per place. [2025-03-17 11:14:40,110 INFO L82 GeneralOperation]: Start removeDead. Operand has 332 places, 338 transitions, 697 flow [2025-03-17 11:14:40,117 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 311 places, 315 transitions, 648 flow [2025-03-17 11:14:40,124 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:14:40,137 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;@1eb10dad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:14:40,137 INFO L334 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2025-03-17 11:14:40,142 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:14:40,143 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2025-03-17 11:14:40,143 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:14:40,143 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:40,143 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:14:40,144 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-17 11:14:40,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:40,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1716735072, now seen corresponding path program 1 times [2025-03-17 11:14:40,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:40,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520905348] [2025-03-17 11:14:40,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:40,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:40,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 11:14:40,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 11:14:40,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:40,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:40,311 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:14:40,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:40,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520905348] [2025-03-17 11:14:40,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520905348] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:40,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:40,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:14:40,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169983149] [2025-03-17 11:14:40,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:40,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:14:40,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:40,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:14:40,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:14:40,376 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 338 [2025-03-17 11:14:40,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 315 transitions, 648 flow. Second operand has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 0 states have call successors, (0), 0 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:14:40,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:40,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 338 [2025-03-17 11:14:40,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:40,497 INFO L124 PetriNetUnfolderBase]: 28/613 cut-off events. [2025-03-17 11:14:40,497 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2025-03-17 11:14:40,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 665 conditions, 613 events. 28/613 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2716 event pairs, 7 based on Foata normal form. 15/522 useless extension candidates. Maximal degree in co-relation 439. Up to 31 conditions per place. [2025-03-17 11:14:40,504 INFO L140 encePairwiseOnDemand]: 329/338 looper letters, 13 selfloop transitions, 2 changer transitions 3/308 dead transitions. [2025-03-17 11:14:40,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 308 transitions, 664 flow [2025-03-17 11:14:40,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:14:40,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:14:40,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 961 transitions. [2025-03-17 11:14:40,519 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9477317554240631 [2025-03-17 11:14:40,522 INFO L175 Difference]: Start difference. First operand has 311 places, 315 transitions, 648 flow. Second operand 3 states and 961 transitions. [2025-03-17 11:14:40,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 308 transitions, 664 flow [2025-03-17 11:14:40,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 308 transitions, 652 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-17 11:14:40,534 INFO L231 Difference]: Finished difference. Result has 306 places, 305 transitions, 620 flow [2025-03-17 11:14:40,537 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=620, PETRI_PLACES=306, PETRI_TRANSITIONS=305} [2025-03-17 11:14:40,541 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, -5 predicate places. [2025-03-17 11:14:40,542 INFO L471 AbstractCegarLoop]: Abstraction has has 306 places, 305 transitions, 620 flow [2025-03-17 11:14:40,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 0 states have call successors, (0), 0 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:14:40,543 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:40,543 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] [2025-03-17 11:14:40,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:14:40,544 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-17 11:14:40,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:40,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1473928708, now seen corresponding path program 1 times [2025-03-17 11:14:40,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:40,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979352228] [2025-03-17 11:14:40,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:40,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:40,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 11:14:40,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 11:14:40,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:40,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:40,589 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:14:40,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:40,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979352228] [2025-03-17 11:14:40,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979352228] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:40,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:40,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:14:40,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778307090] [2025-03-17 11:14:40,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:40,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:14:40,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:40,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:14:40,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:14:40,628 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 338 [2025-03-17 11:14:40,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 305 transitions, 620 flow. Second operand has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 0 states have call successors, (0), 0 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:14:40,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:40,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 338 [2025-03-17 11:14:40,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:40,701 INFO L124 PetriNetUnfolderBase]: 19/455 cut-off events. [2025-03-17 11:14:40,701 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 11:14:40,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 493 conditions, 455 events. 19/455 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1761 event pairs, 5 based on Foata normal form. 0/384 useless extension candidates. Maximal degree in co-relation 462. Up to 27 conditions per place. [2025-03-17 11:14:40,705 INFO L140 encePairwiseOnDemand]: 335/338 looper letters, 13 selfloop transitions, 2 changer transitions 0/304 dead transitions. [2025-03-17 11:14:40,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 304 transitions, 648 flow [2025-03-17 11:14:40,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:14:40,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:14:40,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 955 transitions. [2025-03-17 11:14:40,708 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9418145956607495 [2025-03-17 11:14:40,709 INFO L175 Difference]: Start difference. First operand has 306 places, 305 transitions, 620 flow. Second operand 3 states and 955 transitions. [2025-03-17 11:14:40,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 304 transitions, 648 flow [2025-03-17 11:14:40,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 304 transitions, 644 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:14:40,716 INFO L231 Difference]: Finished difference. Result has 302 places, 304 transitions, 618 flow [2025-03-17 11:14:40,717 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=614, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=618, PETRI_PLACES=302, PETRI_TRANSITIONS=304} [2025-03-17 11:14:40,718 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, -9 predicate places. [2025-03-17 11:14:40,718 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 304 transitions, 618 flow [2025-03-17 11:14:40,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 0 states have call successors, (0), 0 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:14:40,719 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:40,719 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:14:40,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:14:40,719 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-17 11:14:40,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:40,720 INFO L85 PathProgramCache]: Analyzing trace with hash -115307553, now seen corresponding path program 1 times [2025-03-17 11:14:40,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:40,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403111456] [2025-03-17 11:14:40,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:40,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:40,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 11:14:40,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 11:14:40,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:40,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:40,766 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:14:40,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:40,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403111456] [2025-03-17 11:14:40,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403111456] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:40,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:40,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:14:40,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377232000] [2025-03-17 11:14:40,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:40,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:14:40,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:40,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:14:40,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:14:40,784 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 311 out of 338 [2025-03-17 11:14:40,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 304 transitions, 618 flow. Second operand has 3 states, 3 states have (on average 312.0) internal successors, (936), 3 states have internal predecessors, (936), 0 states have call successors, (0), 0 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:14:40,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:40,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 311 of 338 [2025-03-17 11:14:40,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:40,862 INFO L124 PetriNetUnfolderBase]: 34/596 cut-off events. [2025-03-17 11:14:40,862 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-17 11:14:40,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 655 conditions, 596 events. 34/596 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2838 event pairs, 12 based on Foata normal form. 0/502 useless extension candidates. Maximal degree in co-relation 616. Up to 46 conditions per place. [2025-03-17 11:14:40,867 INFO L140 encePairwiseOnDemand]: 333/338 looper letters, 14 selfloop transitions, 1 changer transitions 0/300 dead transitions. [2025-03-17 11:14:40,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 300 transitions, 640 flow [2025-03-17 11:14:40,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:14:40,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:14:40,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 952 transitions. [2025-03-17 11:14:40,870 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9388560157790927 [2025-03-17 11:14:40,870 INFO L175 Difference]: Start difference. First operand has 302 places, 304 transitions, 618 flow. Second operand 3 states and 952 transitions. [2025-03-17 11:14:40,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 300 transitions, 640 flow [2025-03-17 11:14:40,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 300 transitions, 636 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:14:40,874 INFO L231 Difference]: Finished difference. Result has 298 places, 300 transitions, 608 flow [2025-03-17 11:14:40,874 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=606, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=608, PETRI_PLACES=298, PETRI_TRANSITIONS=300} [2025-03-17 11:14:40,875 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, -13 predicate places. [2025-03-17 11:14:40,875 INFO L471 AbstractCegarLoop]: Abstraction has has 298 places, 300 transitions, 608 flow [2025-03-17 11:14:40,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 312.0) internal successors, (936), 3 states have internal predecessors, (936), 0 states have call successors, (0), 0 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:14:40,875 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:40,875 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:14:40,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:14:40,876 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-17 11:14:40,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:40,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1643159496, now seen corresponding path program 1 times [2025-03-17 11:14:40,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:40,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506321187] [2025-03-17 11:14:40,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:40,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:40,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-17 11:14:40,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-17 11:14:40,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:40,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:41,367 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:14:41,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:41,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506321187] [2025-03-17 11:14:41,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506321187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:41,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:41,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:14:41,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110449555] [2025-03-17 11:14:41,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:41,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:14:41,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:41,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:14:41,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:14:41,519 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 286 out of 338 [2025-03-17 11:14:41,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 300 transitions, 608 flow. Second operand has 6 states, 6 states have (on average 287.5) internal successors, (1725), 6 states have internal predecessors, (1725), 0 states have call successors, (0), 0 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:14:41,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:41,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 286 of 338 [2025-03-17 11:14:41,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:42,493 INFO L124 PetriNetUnfolderBase]: 2053/8840 cut-off events. [2025-03-17 11:14:42,493 INFO L125 PetriNetUnfolderBase]: For 179/179 co-relation queries the response was YES. [2025-03-17 11:14:42,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11743 conditions, 8840 events. 2053/8840 cut-off events. For 179/179 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 92364 event pairs, 1520 based on Foata normal form. 0/7251 useless extension candidates. Maximal degree in co-relation 11705. Up to 2804 conditions per place. [2025-03-17 11:14:42,571 INFO L140 encePairwiseOnDemand]: 332/338 looper letters, 38 selfloop transitions, 5 changer transitions 0/299 dead transitions. [2025-03-17 11:14:42,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 299 transitions, 692 flow [2025-03-17 11:14:42,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:14:42,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:14:42,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1760 transitions. [2025-03-17 11:14:42,575 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8678500986193294 [2025-03-17 11:14:42,575 INFO L175 Difference]: Start difference. First operand has 298 places, 300 transitions, 608 flow. Second operand 6 states and 1760 transitions. [2025-03-17 11:14:42,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 299 transitions, 692 flow [2025-03-17 11:14:42,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 299 transitions, 691 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:14:42,580 INFO L231 Difference]: Finished difference. Result has 301 places, 299 transitions, 615 flow [2025-03-17 11:14:42,580 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=605, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=615, PETRI_PLACES=301, PETRI_TRANSITIONS=299} [2025-03-17 11:14:42,582 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, -10 predicate places. [2025-03-17 11:14:42,582 INFO L471 AbstractCegarLoop]: Abstraction has has 301 places, 299 transitions, 615 flow [2025-03-17 11:14:42,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 287.5) internal successors, (1725), 6 states have internal predecessors, (1725), 0 states have call successors, (0), 0 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:14:42,583 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:42,583 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:14:42,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:14:42,584 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-17 11:14:42,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:42,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1759460354, now seen corresponding path program 1 times [2025-03-17 11:14:42,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:42,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904744671] [2025-03-17 11:14:42,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:42,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:42,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-17 11:14:42,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-17 11:14:42,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:42,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:42,636 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:14:42,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:42,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904744671] [2025-03-17 11:14:42,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904744671] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:42,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:42,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:14:42,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095308496] [2025-03-17 11:14:42,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:42,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:14:42,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:42,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:14:42,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:14:42,673 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 311 out of 338 [2025-03-17 11:14:42,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 299 transitions, 615 flow. Second operand has 3 states, 3 states have (on average 312.3333333333333) internal successors, (937), 3 states have internal predecessors, (937), 0 states have call successors, (0), 0 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:14:42,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:42,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 311 of 338 [2025-03-17 11:14:42,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:42,790 INFO L124 PetriNetUnfolderBase]: 84/906 cut-off events. [2025-03-17 11:14:42,790 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-03-17 11:14:42,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1041 conditions, 906 events. 84/906 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 5358 event pairs, 56 based on Foata normal form. 0/770 useless extension candidates. Maximal degree in co-relation 1023. Up to 112 conditions per place. [2025-03-17 11:14:42,797 INFO L140 encePairwiseOnDemand]: 335/338 looper letters, 15 selfloop transitions, 2 changer transitions 0/298 dead transitions. [2025-03-17 11:14:42,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 298 transitions, 647 flow [2025-03-17 11:14:42,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:14:42,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:14:42,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 951 transitions. [2025-03-17 11:14:42,799 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9378698224852071 [2025-03-17 11:14:42,800 INFO L175 Difference]: Start difference. First operand has 301 places, 299 transitions, 615 flow. Second operand 3 states and 951 transitions. [2025-03-17 11:14:42,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 298 transitions, 647 flow [2025-03-17 11:14:42,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 298 transitions, 637 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:14:42,804 INFO L231 Difference]: Finished difference. Result has 297 places, 298 transitions, 607 flow [2025-03-17 11:14:42,805 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=603, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=607, PETRI_PLACES=297, PETRI_TRANSITIONS=298} [2025-03-17 11:14:42,805 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, -14 predicate places. [2025-03-17 11:14:42,806 INFO L471 AbstractCegarLoop]: Abstraction has has 297 places, 298 transitions, 607 flow [2025-03-17 11:14:42,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 312.3333333333333) internal successors, (937), 3 states have internal predecessors, (937), 0 states have call successors, (0), 0 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:14:42,806 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:42,807 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:14:42,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:14:42,807 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-17 11:14:42,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:42,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1598751722, now seen corresponding path program 1 times [2025-03-17 11:14:42,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:42,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240522816] [2025-03-17 11:14:42,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:42,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:42,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-17 11:14:42,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-17 11:14:42,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:42,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:42,859 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:14:42,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:42,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240522816] [2025-03-17 11:14:42,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240522816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:42,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:42,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:14:42,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304126862] [2025-03-17 11:14:42,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:42,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:14:42,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:42,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:14:42,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:14:42,885 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 338 [2025-03-17 11:14:42,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 298 transitions, 607 flow. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 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:14:42,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:42,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 338 [2025-03-17 11:14:42,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:42,934 INFO L124 PetriNetUnfolderBase]: 20/519 cut-off events. [2025-03-17 11:14:42,934 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 11:14:42,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 554 conditions, 519 events. 20/519 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2185 event pairs, 4 based on Foata normal form. 0/449 useless extension candidates. Maximal degree in co-relation 515. Up to 21 conditions per place. [2025-03-17 11:14:42,942 INFO L140 encePairwiseOnDemand]: 335/338 looper letters, 12 selfloop transitions, 2 changer transitions 0/297 dead transitions. [2025-03-17 11:14:42,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 297 transitions, 633 flow [2025-03-17 11:14:42,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:14:42,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:14:42,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 957 transitions. [2025-03-17 11:14:42,945 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9437869822485208 [2025-03-17 11:14:42,945 INFO L175 Difference]: Start difference. First operand has 297 places, 298 transitions, 607 flow. Second operand 3 states and 957 transitions. [2025-03-17 11:14:42,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 297 transitions, 633 flow [2025-03-17 11:14:42,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 297 transitions, 629 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:14:42,949 INFO L231 Difference]: Finished difference. Result has 296 places, 297 transitions, 605 flow [2025-03-17 11:14:42,950 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=601, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=605, PETRI_PLACES=296, PETRI_TRANSITIONS=297} [2025-03-17 11:14:42,952 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, -15 predicate places. [2025-03-17 11:14:42,953 INFO L471 AbstractCegarLoop]: Abstraction has has 296 places, 297 transitions, 605 flow [2025-03-17 11:14:42,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 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:14:42,953 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:42,954 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] [2025-03-17 11:14:42,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:14:42,954 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-17 11:14:42,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:42,954 INFO L85 PathProgramCache]: Analyzing trace with hash -229170740, now seen corresponding path program 1 times [2025-03-17 11:14:42,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:42,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260366633] [2025-03-17 11:14:42,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:42,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:42,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-17 11:14:42,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-17 11:14:42,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:42,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:42,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:14:42,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:42,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260366633] [2025-03-17 11:14:42,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260366633] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:42,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:42,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:14:42,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183279210] [2025-03-17 11:14:42,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:42,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:14:42,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:42,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:14:42,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:14:43,007 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 338 [2025-03-17 11:14:43,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 297 transitions, 605 flow. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 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:14:43,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:43,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 338 [2025-03-17 11:14:43,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:43,067 INFO L124 PetriNetUnfolderBase]: 16/410 cut-off events. [2025-03-17 11:14:43,068 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-17 11:14:43,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 443 conditions, 410 events. 16/410 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1355 event pairs, 4 based on Foata normal form. 0/359 useless extension candidates. Maximal degree in co-relation 404. Up to 21 conditions per place. [2025-03-17 11:14:43,072 INFO L140 encePairwiseOnDemand]: 335/338 looper letters, 12 selfloop transitions, 2 changer transitions 0/296 dead transitions. [2025-03-17 11:14:43,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 296 transitions, 631 flow [2025-03-17 11:14:43,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:14:43,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:14:43,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 957 transitions. [2025-03-17 11:14:43,082 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9437869822485208 [2025-03-17 11:14:43,082 INFO L175 Difference]: Start difference. First operand has 296 places, 297 transitions, 605 flow. Second operand 3 states and 957 transitions. [2025-03-17 11:14:43,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 296 transitions, 631 flow [2025-03-17 11:14:43,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 296 transitions, 627 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:14:43,085 INFO L231 Difference]: Finished difference. Result has 295 places, 296 transitions, 603 flow [2025-03-17 11:14:43,086 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=599, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=603, PETRI_PLACES=295, PETRI_TRANSITIONS=296} [2025-03-17 11:14:43,086 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, -16 predicate places. [2025-03-17 11:14:43,087 INFO L471 AbstractCegarLoop]: Abstraction has has 295 places, 296 transitions, 603 flow [2025-03-17 11:14:43,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 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:14:43,087 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:43,087 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:14:43,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:14:43,088 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-17 11:14:43,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:43,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1339621521, now seen corresponding path program 1 times [2025-03-17 11:14:43,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:43,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333938697] [2025-03-17 11:14:43,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:43,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:43,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-17 11:14:43,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-17 11:14:43,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:43,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:43,165 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:14:43,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:43,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333938697] [2025-03-17 11:14:43,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333938697] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:43,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:43,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:14:43,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668949936] [2025-03-17 11:14:43,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:43,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:14:43,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:43,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:14:43,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:14:43,226 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 338 [2025-03-17 11:14:43,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 296 transitions, 603 flow. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 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:14:43,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:43,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 338 [2025-03-17 11:14:43,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:43,275 INFO L124 PetriNetUnfolderBase]: 12/303 cut-off events. [2025-03-17 11:14:43,278 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-17 11:14:43,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 334 conditions, 303 events. 12/303 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 730 event pairs, 4 based on Foata normal form. 0/271 useless extension candidates. Maximal degree in co-relation 295. Up to 21 conditions per place. [2025-03-17 11:14:43,281 INFO L140 encePairwiseOnDemand]: 335/338 looper letters, 12 selfloop transitions, 2 changer transitions 0/295 dead transitions. [2025-03-17 11:14:43,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 295 transitions, 629 flow [2025-03-17 11:14:43,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:14:43,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:14:43,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 957 transitions. [2025-03-17 11:14:43,289 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9437869822485208 [2025-03-17 11:14:43,289 INFO L175 Difference]: Start difference. First operand has 295 places, 296 transitions, 603 flow. Second operand 3 states and 957 transitions. [2025-03-17 11:14:43,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 295 transitions, 629 flow [2025-03-17 11:14:43,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 295 transitions, 625 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:14:43,301 INFO L231 Difference]: Finished difference. Result has 294 places, 295 transitions, 601 flow [2025-03-17 11:14:43,302 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=597, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=601, PETRI_PLACES=294, PETRI_TRANSITIONS=295} [2025-03-17 11:14:43,303 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, -17 predicate places. [2025-03-17 11:14:43,303 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 295 transitions, 601 flow [2025-03-17 11:14:43,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 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:14:43,304 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:43,304 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] [2025-03-17 11:14:43,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:14:43,305 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-17 11:14:43,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:43,305 INFO L85 PathProgramCache]: Analyzing trace with hash 171977629, now seen corresponding path program 1 times [2025-03-17 11:14:43,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:43,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818545584] [2025-03-17 11:14:43,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:43,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:43,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-17 11:14:43,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-17 11:14:43,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:43,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:43,357 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:14:43,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:43,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818545584] [2025-03-17 11:14:43,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818545584] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:43,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:43,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:14:43,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103491172] [2025-03-17 11:14:43,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:43,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:14:43,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:43,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:14:43,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:14:43,375 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 311 out of 338 [2025-03-17 11:14:43,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 295 transitions, 601 flow. Second operand has 3 states, 3 states have (on average 312.0) internal successors, (936), 3 states have internal predecessors, (936), 0 states have call successors, (0), 0 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:14:43,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:43,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 311 of 338 [2025-03-17 11:14:43,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:43,461 INFO L124 PetriNetUnfolderBase]: 49/747 cut-off events. [2025-03-17 11:14:43,462 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-03-17 11:14:43,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 815 conditions, 747 events. 49/747 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 4048 event pairs, 20 based on Foata normal form. 0/639 useless extension candidates. Maximal degree in co-relation 776. Up to 56 conditions per place. [2025-03-17 11:14:43,467 INFO L140 encePairwiseOnDemand]: 333/338 looper letters, 14 selfloop transitions, 1 changer transitions 0/291 dead transitions. [2025-03-17 11:14:43,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 291 transitions, 623 flow [2025-03-17 11:14:43,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:14:43,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:14:43,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 952 transitions. [2025-03-17 11:14:43,470 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9388560157790927 [2025-03-17 11:14:43,470 INFO L175 Difference]: Start difference. First operand has 294 places, 295 transitions, 601 flow. Second operand 3 states and 952 transitions. [2025-03-17 11:14:43,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 291 transitions, 623 flow [2025-03-17 11:14:43,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 291 transitions, 619 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:14:43,474 INFO L231 Difference]: Finished difference. Result has 290 places, 291 transitions, 591 flow [2025-03-17 11:14:43,475 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=589, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=591, PETRI_PLACES=290, PETRI_TRANSITIONS=291} [2025-03-17 11:14:43,475 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, -21 predicate places. [2025-03-17 11:14:43,475 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 291 transitions, 591 flow [2025-03-17 11:14:43,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 312.0) internal successors, (936), 3 states have internal predecessors, (936), 0 states have call successors, (0), 0 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:14:43,476 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:43,476 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:14:43,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 11:14:43,476 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-17 11:14:43,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:43,477 INFO L85 PathProgramCache]: Analyzing trace with hash 764360965, now seen corresponding path program 1 times [2025-03-17 11:14:43,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:43,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642642886] [2025-03-17 11:14:43,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:43,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:43,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 11:14:43,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 11:14:43,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:43,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:43,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:14:43,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:43,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642642886] [2025-03-17 11:14:43,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642642886] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:43,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:43,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:14:43,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434000257] [2025-03-17 11:14:43,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:43,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:14:43,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:43,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:14:43,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:14:43,523 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 338 [2025-03-17 11:14:43,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 291 transitions, 591 flow. Second operand has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 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:14:43,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:43,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 338 [2025-03-17 11:14:43,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:43,580 INFO L124 PetriNetUnfolderBase]: 20/458 cut-off events. [2025-03-17 11:14:43,580 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 11:14:43,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 496 conditions, 458 events. 20/458 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1734 event pairs, 2 based on Foata normal form. 0/406 useless extension candidates. Maximal degree in co-relation 458. Up to 13 conditions per place. [2025-03-17 11:14:43,583 INFO L140 encePairwiseOnDemand]: 333/338 looper letters, 11 selfloop transitions, 3 changer transitions 0/291 dead transitions. [2025-03-17 11:14:43,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 291 transitions, 621 flow [2025-03-17 11:14:43,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:14:43,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:14:43,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 964 transitions. [2025-03-17 11:14:43,587 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9506903353057199 [2025-03-17 11:14:43,587 INFO L175 Difference]: Start difference. First operand has 290 places, 291 transitions, 591 flow. Second operand 3 states and 964 transitions. [2025-03-17 11:14:43,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 291 transitions, 621 flow [2025-03-17 11:14:43,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 291 transitions, 620 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:14:43,591 INFO L231 Difference]: Finished difference. Result has 289 places, 289 transitions, 592 flow [2025-03-17 11:14:43,592 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=592, PETRI_PLACES=289, PETRI_TRANSITIONS=289} [2025-03-17 11:14:43,592 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, -22 predicate places. [2025-03-17 11:14:43,593 INFO L471 AbstractCegarLoop]: Abstraction has has 289 places, 289 transitions, 592 flow [2025-03-17 11:14:43,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 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:14:43,593 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:43,593 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] [2025-03-17 11:14:43,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 11:14:43,594 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-17 11:14:43,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:43,594 INFO L85 PathProgramCache]: Analyzing trace with hash -222009816, now seen corresponding path program 1 times [2025-03-17 11:14:43,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:43,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100622721] [2025-03-17 11:14:43,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:43,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:43,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 11:14:43,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 11:14:43,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:43,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:43,633 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:14:43,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:43,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100622721] [2025-03-17 11:14:43,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100622721] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:43,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:43,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:14:43,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620564866] [2025-03-17 11:14:43,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:43,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:14:43,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:43,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:14:43,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:14:43,664 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 338 [2025-03-17 11:14:43,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 289 transitions, 592 flow. Second operand has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 0 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:14:43,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:43,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 338 [2025-03-17 11:14:43,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:43,991 INFO L124 PetriNetUnfolderBase]: 460/3169 cut-off events. [2025-03-17 11:14:43,992 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2025-03-17 11:14:44,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3819 conditions, 3169 events. 460/3169 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 28123 event pairs, 172 based on Foata normal form. 0/2737 useless extension candidates. Maximal degree in co-relation 3781. Up to 577 conditions per place. [2025-03-17 11:14:44,010 INFO L140 encePairwiseOnDemand]: 329/338 looper letters, 24 selfloop transitions, 3 changer transitions 0/291 dead transitions. [2025-03-17 11:14:44,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 291 transitions, 655 flow [2025-03-17 11:14:44,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:14:44,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:14:44,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 948 transitions. [2025-03-17 11:14:44,012 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9349112426035503 [2025-03-17 11:14:44,012 INFO L175 Difference]: Start difference. First operand has 289 places, 289 transitions, 592 flow. Second operand 3 states and 948 transitions. [2025-03-17 11:14:44,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 291 transitions, 655 flow [2025-03-17 11:14:44,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 291 transitions, 649 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:14:44,017 INFO L231 Difference]: Finished difference. Result has 284 places, 286 transitions, 595 flow [2025-03-17 11:14:44,018 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=574, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=595, PETRI_PLACES=284, PETRI_TRANSITIONS=286} [2025-03-17 11:14:44,018 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, -27 predicate places. [2025-03-17 11:14:44,019 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 286 transitions, 595 flow [2025-03-17 11:14:44,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 0 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:14:44,019 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:44,019 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] [2025-03-17 11:14:44,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 11:14:44,020 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-17 11:14:44,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:44,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1397908076, now seen corresponding path program 1 times [2025-03-17 11:14:44,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:44,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729913422] [2025-03-17 11:14:44,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:44,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:44,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-17 11:14:44,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-17 11:14:44,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:44,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:44,049 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:14:44,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:44,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729913422] [2025-03-17 11:14:44,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729913422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:44,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:44,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:14:44,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183459921] [2025-03-17 11:14:44,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:44,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:14:44,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:44,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:14:44,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:14:44,067 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 338 [2025-03-17 11:14:44,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 286 transitions, 595 flow. Second operand has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 0 states have call successors, (0), 0 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:14:44,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:44,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 338 [2025-03-17 11:14:44,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:44,165 INFO L124 PetriNetUnfolderBase]: 81/1164 cut-off events. [2025-03-17 11:14:44,165 INFO L125 PetriNetUnfolderBase]: For 5/9 co-relation queries the response was YES. [2025-03-17 11:14:44,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1311 conditions, 1164 events. 81/1164 cut-off events. For 5/9 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 6903 event pairs, 13 based on Foata normal form. 0/1033 useless extension candidates. Maximal degree in co-relation 1273. Up to 50 conditions per place. [2025-03-17 11:14:44,174 INFO L140 encePairwiseOnDemand]: 335/338 looper letters, 13 selfloop transitions, 2 changer transitions 0/287 dead transitions. [2025-03-17 11:14:44,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 287 transitions, 629 flow [2025-03-17 11:14:44,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:14:44,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:14:44,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 964 transitions. [2025-03-17 11:14:44,176 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9506903353057199 [2025-03-17 11:14:44,176 INFO L175 Difference]: Start difference. First operand has 284 places, 286 transitions, 595 flow. Second operand 3 states and 964 transitions. [2025-03-17 11:14:44,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 287 transitions, 629 flow [2025-03-17 11:14:44,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 287 transitions, 629 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:14:44,180 INFO L231 Difference]: Finished difference. Result has 285 places, 285 transitions, 597 flow [2025-03-17 11:14:44,180 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=593, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=597, PETRI_PLACES=285, PETRI_TRANSITIONS=285} [2025-03-17 11:14:44,180 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, -26 predicate places. [2025-03-17 11:14:44,181 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 285 transitions, 597 flow [2025-03-17 11:14:44,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 0 states have call successors, (0), 0 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:14:44,181 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:44,181 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] [2025-03-17 11:14:44,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 11:14:44,181 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-17 11:14:44,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:44,182 INFO L85 PathProgramCache]: Analyzing trace with hash 143539674, now seen corresponding path program 1 times [2025-03-17 11:14:44,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:44,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601647517] [2025-03-17 11:14:44,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:44,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:44,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-17 11:14:44,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-17 11:14:44,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:44,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:44,215 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:14:44,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:44,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601647517] [2025-03-17 11:14:44,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601647517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:44,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:44,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:14:44,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260868454] [2025-03-17 11:14:44,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:44,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:14:44,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:44,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:14:44,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:14:44,232 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 338 [2025-03-17 11:14:44,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 285 transitions, 597 flow. Second operand has 3 states, 3 states have (on average 317.6666666666667) internal successors, (953), 3 states have internal predecessors, (953), 0 states have call successors, (0), 0 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:14:44,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:44,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 338 [2025-03-17 11:14:44,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:44,313 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([829] thread3EXIT-->L91-13: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][265], [227#L91-13true, Black: 368#true, 370#(= |#race~A~0| 0), 372#true, 343#(= |#race~N~0| 0), 364#(= |#race~M~0| 0), 375#true]) [2025-03-17 11:14:44,313 INFO L294 olderBase$Statistics]: this new event has 210 ancestors and is cut-off event [2025-03-17 11:14:44,314 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2025-03-17 11:14:44,314 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2025-03-17 11:14:44,314 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-17 11:14:44,315 INFO L124 PetriNetUnfolderBase]: 75/820 cut-off events. [2025-03-17 11:14:44,315 INFO L125 PetriNetUnfolderBase]: For 17/43 co-relation queries the response was YES. [2025-03-17 11:14:44,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 959 conditions, 820 events. 75/820 cut-off events. For 17/43 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4233 event pairs, 6 based on Foata normal form. 2/736 useless extension candidates. Maximal degree in co-relation 920. Up to 41 conditions per place. [2025-03-17 11:14:44,323 INFO L140 encePairwiseOnDemand]: 333/338 looper letters, 11 selfloop transitions, 3 changer transitions 0/285 dead transitions. [2025-03-17 11:14:44,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 285 transitions, 627 flow [2025-03-17 11:14:44,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:14:44,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:14:44,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 964 transitions. [2025-03-17 11:14:44,325 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9506903353057199 [2025-03-17 11:14:44,325 INFO L175 Difference]: Start difference. First operand has 285 places, 285 transitions, 597 flow. Second operand 3 states and 964 transitions. [2025-03-17 11:14:44,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 285 transitions, 627 flow [2025-03-17 11:14:44,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 285 transitions, 623 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:14:44,330 INFO L231 Difference]: Finished difference. Result has 283 places, 283 transitions, 595 flow [2025-03-17 11:14:44,331 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=589, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=595, PETRI_PLACES=283, PETRI_TRANSITIONS=283} [2025-03-17 11:14:44,332 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, -28 predicate places. [2025-03-17 11:14:44,332 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 283 transitions, 595 flow [2025-03-17 11:14:44,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 317.6666666666667) internal successors, (953), 3 states have internal predecessors, (953), 0 states have call successors, (0), 0 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:14:44,333 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:44,333 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:14:44,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 11:14:44,333 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-17 11:14:44,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:44,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1590141102, now seen corresponding path program 1 times [2025-03-17 11:14:44,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:44,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550475108] [2025-03-17 11:14:44,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:44,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:44,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-17 11:14:44,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-17 11:14:44,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:44,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:44,454 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:14:44,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:44,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550475108] [2025-03-17 11:14:44,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550475108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:44,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:44,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 11:14:44,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623786810] [2025-03-17 11:14:44,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:44,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 11:14:44,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:44,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 11:14:44,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:14:44,682 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 309 out of 338 [2025-03-17 11:14:44,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 283 transitions, 595 flow. Second operand has 7 states, 7 states have (on average 310.85714285714283) internal successors, (2176), 7 states have internal predecessors, (2176), 0 states have call successors, (0), 0 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:14:44,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:44,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 309 of 338 [2025-03-17 11:14:44,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:44,865 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([829] thread3EXIT-->L91-13: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][293], [Black: 368#true, 227#L91-13true, 378#true, 370#(= |#race~A~0| 0), 343#(= |#race~N~0| 0), 375#true, 364#(= |#race~M~0| 0)]) [2025-03-17 11:14:44,865 INFO L294 olderBase$Statistics]: this new event has 260 ancestors and is cut-off event [2025-03-17 11:14:44,865 INFO L297 olderBase$Statistics]: existing Event has 190 ancestors and is cut-off event [2025-03-17 11:14:44,865 INFO L297 olderBase$Statistics]: existing Event has 225 ancestors and is cut-off event [2025-03-17 11:14:44,865 INFO L297 olderBase$Statistics]: existing Event has 190 ancestors and is cut-off event [2025-03-17 11:14:44,865 INFO L124 PetriNetUnfolderBase]: 95/1385 cut-off events. [2025-03-17 11:14:44,865 INFO L125 PetriNetUnfolderBase]: For 11/40 co-relation queries the response was YES. [2025-03-17 11:14:44,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1599 conditions, 1385 events. 95/1385 cut-off events. For 11/40 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 8671 event pairs, 18 based on Foata normal form. 4/1258 useless extension candidates. Maximal degree in co-relation 1558. Up to 67 conditions per place. [2025-03-17 11:14:44,877 INFO L140 encePairwiseOnDemand]: 325/338 looper letters, 22 selfloop transitions, 14 changer transitions 0/298 dead transitions. [2025-03-17 11:14:44,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 298 transitions, 705 flow [2025-03-17 11:14:44,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 11:14:44,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 11:14:44,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 3127 transitions. [2025-03-17 11:14:44,882 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9251479289940828 [2025-03-17 11:14:44,882 INFO L175 Difference]: Start difference. First operand has 283 places, 283 transitions, 595 flow. Second operand 10 states and 3127 transitions. [2025-03-17 11:14:44,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 298 transitions, 705 flow [2025-03-17 11:14:44,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 298 transitions, 699 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:14:44,886 INFO L231 Difference]: Finished difference. Result has 294 places, 290 transitions, 655 flow [2025-03-17 11:14:44,886 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=589, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=655, PETRI_PLACES=294, PETRI_TRANSITIONS=290} [2025-03-17 11:14:44,887 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, -17 predicate places. [2025-03-17 11:14:44,887 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 290 transitions, 655 flow [2025-03-17 11:14:44,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 310.85714285714283) internal successors, (2176), 7 states have internal predecessors, (2176), 0 states have call successors, (0), 0 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:14:44,888 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:44,888 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:14:44,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 11:14:44,888 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-17 11:14:44,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:44,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1481107903, now seen corresponding path program 1 times [2025-03-17 11:14:44,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:44,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161447603] [2025-03-17 11:14:44,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:44,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:44,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 11:14:44,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 11:14:44,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:44,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:44,918 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:14:44,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:44,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161447603] [2025-03-17 11:14:44,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161447603] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:44,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:44,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:14:44,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59341013] [2025-03-17 11:14:44,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:44,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:14:44,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:44,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:14:44,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:14:44,936 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 338 [2025-03-17 11:14:44,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 290 transitions, 655 flow. Second operand has 3 states, 3 states have (on average 318.3333333333333) internal successors, (955), 3 states have internal predecessors, (955), 0 states have call successors, (0), 0 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:14:44,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:44,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 338 [2025-03-17 11:14:44,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:45,090 INFO L124 PetriNetUnfolderBase]: 145/1650 cut-off events. [2025-03-17 11:14:45,090 INFO L125 PetriNetUnfolderBase]: For 53/108 co-relation queries the response was YES. [2025-03-17 11:14:45,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1959 conditions, 1650 events. 145/1650 cut-off events. For 53/108 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 10790 event pairs, 29 based on Foata normal form. 0/1496 useless extension candidates. Maximal degree in co-relation 1913. Up to 120 conditions per place. [2025-03-17 11:14:45,106 INFO L140 encePairwiseOnDemand]: 335/338 looper letters, 13 selfloop transitions, 2 changer transitions 0/291 dead transitions. [2025-03-17 11:14:45,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 291 transitions, 689 flow [2025-03-17 11:14:45,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:14:45,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:14:45,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 964 transitions. [2025-03-17 11:14:45,109 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9506903353057199 [2025-03-17 11:14:45,110 INFO L175 Difference]: Start difference. First operand has 294 places, 290 transitions, 655 flow. Second operand 3 states and 964 transitions. [2025-03-17 11:14:45,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 291 transitions, 689 flow [2025-03-17 11:14:45,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 291 transitions, 685 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:14:45,115 INFO L231 Difference]: Finished difference. Result has 294 places, 289 transitions, 653 flow [2025-03-17 11:14:45,116 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=649, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=653, PETRI_PLACES=294, PETRI_TRANSITIONS=289} [2025-03-17 11:14:45,116 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, -17 predicate places. [2025-03-17 11:14:45,116 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 289 transitions, 653 flow [2025-03-17 11:14:45,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.3333333333333) internal successors, (955), 3 states have internal predecessors, (955), 0 states have call successors, (0), 0 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:14:45,118 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:45,119 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] [2025-03-17 11:14:45,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 11:14:45,119 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-17 11:14:45,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:45,120 INFO L85 PathProgramCache]: Analyzing trace with hash -193452105, now seen corresponding path program 1 times [2025-03-17 11:14:45,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:45,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331989553] [2025-03-17 11:14:45,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:45,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:45,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-17 11:14:45,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-17 11:14:45,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:45,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:45,156 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:14:45,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:45,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331989553] [2025-03-17 11:14:45,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331989553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:45,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:45,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:14:45,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718883977] [2025-03-17 11:14:45,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:45,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:14:45,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:45,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:14:45,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:14:45,170 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 338 [2025-03-17 11:14:45,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 289 transitions, 653 flow. Second operand has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 0 states have call successors, (0), 0 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:14:45,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:45,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 338 [2025-03-17 11:14:45,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:45,292 INFO L124 PetriNetUnfolderBase]: 119/1101 cut-off events. [2025-03-17 11:14:45,292 INFO L125 PetriNetUnfolderBase]: For 58/89 co-relation queries the response was YES. [2025-03-17 11:14:45,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1351 conditions, 1101 events. 119/1101 cut-off events. For 58/89 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 6187 event pairs, 11 based on Foata normal form. 4/1005 useless extension candidates. Maximal degree in co-relation 1306. Up to 79 conditions per place. [2025-03-17 11:14:45,300 INFO L140 encePairwiseOnDemand]: 333/338 looper letters, 9 selfloop transitions, 2 changer transitions 8/289 dead transitions. [2025-03-17 11:14:45,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 289 transitions, 681 flow [2025-03-17 11:14:45,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:14:45,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:14:45,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 963 transitions. [2025-03-17 11:14:45,302 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9497041420118343 [2025-03-17 11:14:45,302 INFO L175 Difference]: Start difference. First operand has 294 places, 289 transitions, 653 flow. Second operand 3 states and 963 transitions. [2025-03-17 11:14:45,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 289 transitions, 681 flow [2025-03-17 11:14:45,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 289 transitions, 677 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:14:45,306 INFO L231 Difference]: Finished difference. Result has 292 places, 279 transitions, 632 flow [2025-03-17 11:14:45,307 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=645, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=632, PETRI_PLACES=292, PETRI_TRANSITIONS=279} [2025-03-17 11:14:45,307 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, -19 predicate places. [2025-03-17 11:14:45,307 INFO L471 AbstractCegarLoop]: Abstraction has has 292 places, 279 transitions, 632 flow [2025-03-17 11:14:45,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 0 states have call successors, (0), 0 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:14:45,308 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:45,308 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] [2025-03-17 11:14:45,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 11:14:45,308 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-17 11:14:45,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:45,309 INFO L85 PathProgramCache]: Analyzing trace with hash -554901885, now seen corresponding path program 1 times [2025-03-17 11:14:45,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:45,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888205672] [2025-03-17 11:14:45,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:45,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:45,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-17 11:14:45,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-17 11:14:45,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:45,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:45,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:14:45,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:45,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888205672] [2025-03-17 11:14:45,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888205672] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:45,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:45,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:14:45,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972811850] [2025-03-17 11:14:45,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:45,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:14:45,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:45,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:14:45,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:14:45,459 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 311 out of 338 [2025-03-17 11:14:45,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 279 transitions, 632 flow. Second operand has 5 states, 5 states have (on average 313.0) internal successors, (1565), 5 states have internal predecessors, (1565), 0 states have call successors, (0), 0 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:14:45,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:45,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 311 of 338 [2025-03-17 11:14:45,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:45,624 INFO L124 PetriNetUnfolderBase]: 133/1669 cut-off events. [2025-03-17 11:14:45,624 INFO L125 PetriNetUnfolderBase]: For 60/70 co-relation queries the response was YES. [2025-03-17 11:14:45,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2016 conditions, 1669 events. 133/1669 cut-off events. For 60/70 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 11206 event pairs, 40 based on Foata normal form. 8/1543 useless extension candidates. Maximal degree in co-relation 1968. Up to 114 conditions per place. [2025-03-17 11:14:45,641 INFO L140 encePairwiseOnDemand]: 332/338 looper letters, 22 selfloop transitions, 5 changer transitions 0/289 dead transitions. [2025-03-17 11:14:45,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 289 transitions, 713 flow [2025-03-17 11:14:45,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:14:45,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 11:14:45,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1583 transitions. [2025-03-17 11:14:45,645 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9366863905325444 [2025-03-17 11:14:45,645 INFO L175 Difference]: Start difference. First operand has 292 places, 279 transitions, 632 flow. Second operand 5 states and 1583 transitions. [2025-03-17 11:14:45,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 289 transitions, 713 flow [2025-03-17 11:14:45,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 289 transitions, 709 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:14:45,650 INFO L231 Difference]: Finished difference. Result has 288 places, 281 transitions, 653 flow [2025-03-17 11:14:45,651 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=628, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=653, PETRI_PLACES=288, PETRI_TRANSITIONS=281} [2025-03-17 11:14:45,651 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, -23 predicate places. [2025-03-17 11:14:45,651 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 281 transitions, 653 flow [2025-03-17 11:14:45,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 313.0) internal successors, (1565), 5 states have internal predecessors, (1565), 0 states have call successors, (0), 0 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:14:45,652 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:45,652 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] [2025-03-17 11:14:45,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 11:14:45,652 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-17 11:14:45,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:45,653 INFO L85 PathProgramCache]: Analyzing trace with hash -721092034, now seen corresponding path program 1 times [2025-03-17 11:14:45,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:45,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850443205] [2025-03-17 11:14:45,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:45,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:45,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-17 11:14:45,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-17 11:14:45,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:45,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:45,688 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:14:45,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:45,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850443205] [2025-03-17 11:14:45,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850443205] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:45,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:45,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:14:45,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885826732] [2025-03-17 11:14:45,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:45,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:14:45,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:45,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:14:45,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:14:45,703 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 338 [2025-03-17 11:14:45,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 281 transitions, 653 flow. Second operand has 3 states, 3 states have (on average 318.6666666666667) internal successors, (956), 3 states have internal predecessors, (956), 0 states have call successors, (0), 0 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:14:45,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:45,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 338 [2025-03-17 11:14:45,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:45,939 INFO L124 PetriNetUnfolderBase]: 233/1746 cut-off events. [2025-03-17 11:14:45,939 INFO L125 PetriNetUnfolderBase]: For 147/218 co-relation queries the response was YES. [2025-03-17 11:14:45,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2243 conditions, 1746 events. 233/1746 cut-off events. For 147/218 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 12223 event pairs, 56 based on Foata normal form. 0/1602 useless extension candidates. Maximal degree in co-relation 2196. Up to 235 conditions per place. [2025-03-17 11:14:45,949 INFO L140 encePairwiseOnDemand]: 335/338 looper letters, 11 selfloop transitions, 2 changer transitions 0/282 dead transitions. [2025-03-17 11:14:45,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 282 transitions, 683 flow [2025-03-17 11:14:45,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:14:45,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:14:45,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 962 transitions. [2025-03-17 11:14:45,951 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9487179487179487 [2025-03-17 11:14:45,951 INFO L175 Difference]: Start difference. First operand has 288 places, 281 transitions, 653 flow. Second operand 3 states and 962 transitions. [2025-03-17 11:14:45,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 282 transitions, 683 flow [2025-03-17 11:14:45,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 282 transitions, 678 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:14:45,954 INFO L231 Difference]: Finished difference. Result has 287 places, 280 transitions, 650 flow [2025-03-17 11:14:45,955 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=646, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=650, PETRI_PLACES=287, PETRI_TRANSITIONS=280} [2025-03-17 11:14:45,955 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, -24 predicate places. [2025-03-17 11:14:45,955 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 280 transitions, 650 flow [2025-03-17 11:14:45,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.6666666666667) internal successors, (956), 3 states have internal predecessors, (956), 0 states have call successors, (0), 0 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:14:45,956 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:45,956 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] [2025-03-17 11:14:45,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 11:14:45,956 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-17 11:14:45,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:45,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1641063340, now seen corresponding path program 1 times [2025-03-17 11:14:45,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:45,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520113435] [2025-03-17 11:14:45,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:45,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:45,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 11:14:45,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 11:14:45,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:45,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:46,229 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:14:46,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:46,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520113435] [2025-03-17 11:14:46,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520113435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:46,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:46,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:14:46,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118987624] [2025-03-17 11:14:46,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:46,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:14:46,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:46,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:14:46,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:14:46,487 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 309 out of 338 [2025-03-17 11:14:46,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 280 transitions, 650 flow. Second operand has 6 states, 6 states have (on average 310.6666666666667) internal successors, (1864), 6 states have internal predecessors, (1864), 0 states have call successors, (0), 0 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:14:46,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:46,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 309 of 338 [2025-03-17 11:14:46,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:46,687 INFO L124 PetriNetUnfolderBase]: 151/1753 cut-off events. [2025-03-17 11:14:46,687 INFO L125 PetriNetUnfolderBase]: For 141/150 co-relation queries the response was YES. [2025-03-17 11:14:46,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2218 conditions, 1753 events. 151/1753 cut-off events. For 141/150 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 11833 event pairs, 37 based on Foata normal form. 0/1636 useless extension candidates. Maximal degree in co-relation 2170. Up to 142 conditions per place. [2025-03-17 11:14:46,698 INFO L140 encePairwiseOnDemand]: 332/338 looper letters, 25 selfloop transitions, 5 changer transitions 0/288 dead transitions. [2025-03-17 11:14:46,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 288 transitions, 734 flow [2025-03-17 11:14:46,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:14:46,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:14:46,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1883 transitions. [2025-03-17 11:14:46,705 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9285009861932939 [2025-03-17 11:14:46,706 INFO L175 Difference]: Start difference. First operand has 287 places, 280 transitions, 650 flow. Second operand 6 states and 1883 transitions. [2025-03-17 11:14:46,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 288 transitions, 734 flow [2025-03-17 11:14:46,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 288 transitions, 730 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:14:46,710 INFO L231 Difference]: Finished difference. Result has 290 places, 280 transitions, 660 flow [2025-03-17 11:14:46,711 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=644, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=660, PETRI_PLACES=290, PETRI_TRANSITIONS=280} [2025-03-17 11:14:46,711 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, -21 predicate places. [2025-03-17 11:14:46,712 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 280 transitions, 660 flow [2025-03-17 11:14:46,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 310.6666666666667) internal successors, (1864), 6 states have internal predecessors, (1864), 0 states have call successors, (0), 0 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:14:46,712 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:46,712 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] [2025-03-17 11:14:46,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 11:14:46,713 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread3Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-17 11:14:46,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:46,713 INFO L85 PathProgramCache]: Analyzing trace with hash -2083362496, now seen corresponding path program 1 times [2025-03-17 11:14:46,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:46,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691812223] [2025-03-17 11:14:46,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:46,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:46,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-17 11:14:46,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 11:14:46,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:46,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:47,061 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:14:47,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:47,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691812223] [2025-03-17 11:14:47,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691812223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:47,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:47,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:14:47,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727269897] [2025-03-17 11:14:47,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:47,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:14:47,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:47,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:14:47,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:14:47,356 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 309 out of 338 [2025-03-17 11:14:47,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 280 transitions, 660 flow. Second operand has 6 states, 6 states have (on average 310.8333333333333) internal successors, (1865), 6 states have internal predecessors, (1865), 0 states have call successors, (0), 0 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:14:47,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:47,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 309 of 338 [2025-03-17 11:14:47,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:47,540 INFO L124 PetriNetUnfolderBase]: 232/1738 cut-off events. [2025-03-17 11:14:47,541 INFO L125 PetriNetUnfolderBase]: For 147/268 co-relation queries the response was YES. [2025-03-17 11:14:47,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2276 conditions, 1738 events. 232/1738 cut-off events. For 147/268 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 12217 event pairs, 52 based on Foata normal form. 4/1628 useless extension candidates. Maximal degree in co-relation 2227. Up to 219 conditions per place. [2025-03-17 11:14:47,555 INFO L140 encePairwiseOnDemand]: 332/338 looper letters, 23 selfloop transitions, 5 changer transitions 0/288 dead transitions. [2025-03-17 11:14:47,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 288 transitions, 740 flow [2025-03-17 11:14:47,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:14:47,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:14:47,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1883 transitions. [2025-03-17 11:14:47,558 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9285009861932939 [2025-03-17 11:14:47,558 INFO L175 Difference]: Start difference. First operand has 290 places, 280 transitions, 660 flow. Second operand 6 states and 1883 transitions. [2025-03-17 11:14:47,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 288 transitions, 740 flow [2025-03-17 11:14:47,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 288 transitions, 732 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 11:14:47,562 INFO L231 Difference]: Finished difference. Result has 291 places, 280 transitions, 666 flow [2025-03-17 11:14:47,562 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=650, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=666, PETRI_PLACES=291, PETRI_TRANSITIONS=280} [2025-03-17 11:14:47,562 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, -20 predicate places. [2025-03-17 11:14:47,563 INFO L471 AbstractCegarLoop]: Abstraction has has 291 places, 280 transitions, 666 flow [2025-03-17 11:14:47,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 310.8333333333333) internal successors, (1865), 6 states have internal predecessors, (1865), 0 states have call successors, (0), 0 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:14:47,563 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:47,563 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:14:47,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 11:14:47,564 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-17 11:14:47,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:47,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1339892944, now seen corresponding path program 1 times [2025-03-17 11:14:47,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:47,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259312106] [2025-03-17 11:14:47,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:47,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:47,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-17 11:14:47,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-17 11:14:47,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:47,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:47,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:14:47,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:47,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259312106] [2025-03-17 11:14:47,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259312106] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:14:47,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732734828] [2025-03-17 11:14:47,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:47,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:14:47,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:14:47,723 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:14:47,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 11:14:47,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-17 11:14:47,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-17 11:14:47,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:47,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:47,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 11:14:47,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:14:48,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:14:48,019 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:14:48,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:14:48,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732734828] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:14:48,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:14:48,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2025-03-17 11:14:48,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778711864] [2025-03-17 11:14:48,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:14:48,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 11:14:48,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:48,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 11:14:48,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2025-03-17 11:14:48,671 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 338 [2025-03-17 11:14:48,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 280 transitions, 666 flow. Second operand has 19 states, 19 states have (on average 306.89473684210526) internal successors, (5831), 19 states have internal predecessors, (5831), 0 states have call successors, (0), 0 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:14:48,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:48,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 338 [2025-03-17 11:14:48,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:49,213 INFO L124 PetriNetUnfolderBase]: 219/3631 cut-off events. [2025-03-17 11:14:49,213 INFO L125 PetriNetUnfolderBase]: For 100/112 co-relation queries the response was YES. [2025-03-17 11:14:49,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4494 conditions, 3631 events. 219/3631 cut-off events. For 100/112 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 31625 event pairs, 31 based on Foata normal form. 8/3435 useless extension candidates. Maximal degree in co-relation 4443. Up to 116 conditions per place. [2025-03-17 11:14:49,235 INFO L140 encePairwiseOnDemand]: 321/338 looper letters, 26 selfloop transitions, 27 changer transitions 0/302 dead transitions. [2025-03-17 11:14:49,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 302 transitions, 838 flow [2025-03-17 11:14:49,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 11:14:49,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-17 11:14:49,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 4930 transitions. [2025-03-17 11:14:49,243 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.911612426035503 [2025-03-17 11:14:49,243 INFO L175 Difference]: Start difference. First operand has 291 places, 280 transitions, 666 flow. Second operand 16 states and 4930 transitions. [2025-03-17 11:14:49,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 302 transitions, 838 flow [2025-03-17 11:14:49,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 302 transitions, 830 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 11:14:49,248 INFO L231 Difference]: Finished difference. Result has 310 places, 291 transitions, 797 flow [2025-03-17 11:14:49,249 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=797, PETRI_PLACES=310, PETRI_TRANSITIONS=291} [2025-03-17 11:14:49,249 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, -1 predicate places. [2025-03-17 11:14:49,249 INFO L471 AbstractCegarLoop]: Abstraction has has 310 places, 291 transitions, 797 flow [2025-03-17 11:14:49,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 306.89473684210526) internal successors, (5831), 19 states have internal predecessors, (5831), 0 states have call successors, (0), 0 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:14:49,251 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:49,251 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] [2025-03-17 11:14:49,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 11:14:49,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-17 11:14:49,455 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-17 11:14:49,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:49,457 INFO L85 PathProgramCache]: Analyzing trace with hash -757162286, now seen corresponding path program 1 times [2025-03-17 11:14:49,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:49,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149986370] [2025-03-17 11:14:49,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:49,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:49,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-17 11:14:49,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-17 11:14:49,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:49,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:49,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:14:49,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:49,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149986370] [2025-03-17 11:14:49,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149986370] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:49,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:49,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:14:49,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283130546] [2025-03-17 11:14:49,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:49,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:14:49,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:49,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:14:49,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:14:49,994 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 309 out of 338 [2025-03-17 11:14:49,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 291 transitions, 797 flow. Second operand has 6 states, 6 states have (on average 310.6666666666667) internal successors, (1864), 6 states have internal predecessors, (1864), 0 states have call successors, (0), 0 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:14:49,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:49,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 309 of 338 [2025-03-17 11:14:49,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:50,302 INFO L124 PetriNetUnfolderBase]: 198/2471 cut-off events. [2025-03-17 11:14:50,302 INFO L125 PetriNetUnfolderBase]: For 285/294 co-relation queries the response was YES. [2025-03-17 11:14:50,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3256 conditions, 2471 events. 198/2471 cut-off events. For 285/294 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 18819 event pairs, 51 based on Foata normal form. 0/2341 useless extension candidates. Maximal degree in co-relation 3195. Up to 196 conditions per place. [2025-03-17 11:14:50,318 INFO L140 encePairwiseOnDemand]: 332/338 looper letters, 25 selfloop transitions, 5 changer transitions 0/298 dead transitions. [2025-03-17 11:14:50,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 298 transitions, 879 flow [2025-03-17 11:14:50,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:14:50,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:14:50,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1883 transitions. [2025-03-17 11:14:50,321 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9285009861932939 [2025-03-17 11:14:50,321 INFO L175 Difference]: Start difference. First operand has 310 places, 291 transitions, 797 flow. Second operand 6 states and 1883 transitions. [2025-03-17 11:14:50,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 298 transitions, 879 flow [2025-03-17 11:14:50,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 298 transitions, 862 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-03-17 11:14:50,326 INFO L231 Difference]: Finished difference. Result has 312 places, 290 transitions, 788 flow [2025-03-17 11:14:50,327 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=778, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=788, PETRI_PLACES=312, PETRI_TRANSITIONS=290} [2025-03-17 11:14:50,327 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, 1 predicate places. [2025-03-17 11:14:50,327 INFO L471 AbstractCegarLoop]: Abstraction has has 312 places, 290 transitions, 788 flow [2025-03-17 11:14:50,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 310.6666666666667) internal successors, (1864), 6 states have internal predecessors, (1864), 0 states have call successors, (0), 0 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:14:50,328 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:50,328 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:14:50,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 11:14:50,329 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread3Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-17 11:14:50,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:50,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1751598362, now seen corresponding path program 1 times [2025-03-17 11:14:50,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:50,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938123781] [2025-03-17 11:14:50,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:50,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:50,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-17 11:14:50,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-17 11:14:50,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:50,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:50,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:14:50,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:50,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938123781] [2025-03-17 11:14:50,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938123781] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:50,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:50,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:14:50,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530993365] [2025-03-17 11:14:50,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:50,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:14:50,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:50,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:14:50,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:14:50,857 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 309 out of 338 [2025-03-17 11:14:50,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 290 transitions, 788 flow. Second operand has 6 states, 6 states have (on average 310.8333333333333) internal successors, (1865), 6 states have internal predecessors, (1865), 0 states have call successors, (0), 0 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:14:50,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:50,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 309 of 338 [2025-03-17 11:14:50,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:51,182 INFO L124 PetriNetUnfolderBase]: 310/2227 cut-off events. [2025-03-17 11:14:51,182 INFO L125 PetriNetUnfolderBase]: For 335/504 co-relation queries the response was YES. [2025-03-17 11:14:51,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3143 conditions, 2227 events. 310/2227 cut-off events. For 335/504 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 16450 event pairs, 75 based on Foata normal form. 20/2123 useless extension candidates. Maximal degree in co-relation 3081. Up to 307 conditions per place. [2025-03-17 11:14:51,197 INFO L140 encePairwiseOnDemand]: 332/338 looper letters, 23 selfloop transitions, 5 changer transitions 13/297 dead transitions. [2025-03-17 11:14:51,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 297 transitions, 866 flow [2025-03-17 11:14:51,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:14:51,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:14:51,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1883 transitions. [2025-03-17 11:14:51,200 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9285009861932939 [2025-03-17 11:14:51,200 INFO L175 Difference]: Start difference. First operand has 312 places, 290 transitions, 788 flow. Second operand 6 states and 1883 transitions. [2025-03-17 11:14:51,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 297 transitions, 866 flow [2025-03-17 11:14:51,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 297 transitions, 854 flow, removed 1 selfloop flow, removed 5 redundant places. [2025-03-17 11:14:51,205 INFO L231 Difference]: Finished difference. Result has 311 places, 276 transitions, 694 flow [2025-03-17 11:14:51,205 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=694, PETRI_PLACES=311, PETRI_TRANSITIONS=276} [2025-03-17 11:14:51,206 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, 0 predicate places. [2025-03-17 11:14:51,206 INFO L471 AbstractCegarLoop]: Abstraction has has 311 places, 276 transitions, 694 flow [2025-03-17 11:14:51,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 310.8333333333333) internal successors, (1865), 6 states have internal predecessors, (1865), 0 states have call successors, (0), 0 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:14:51,207 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:51,207 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:51,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 11:14:51,207 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-17 11:14:51,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:51,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1245770642, now seen corresponding path program 2 times [2025-03-17 11:14:51,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:51,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000994399] [2025-03-17 11:14:51,208 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:14:51,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:51,224 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 144 statements into 2 equivalence classes. [2025-03-17 11:14:51,228 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 114 of 144 statements. [2025-03-17 11:14:51,228 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 11:14:51,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:51,419 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-17 11:14:51,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:51,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000994399] [2025-03-17 11:14:51,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000994399] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:51,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:51,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:14:51,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839612250] [2025-03-17 11:14:51,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:51,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:14:51,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:51,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:14:51,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:14:51,680 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 309 out of 338 [2025-03-17 11:14:51,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 276 transitions, 694 flow. Second operand has 6 states, 6 states have (on average 311.1666666666667) internal successors, (1867), 6 states have internal predecessors, (1867), 0 states have call successors, (0), 0 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:14:51,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:51,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 309 of 338 [2025-03-17 11:14:51,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:51,825 INFO L124 PetriNetUnfolderBase]: 96/1255 cut-off events. [2025-03-17 11:14:51,826 INFO L125 PetriNetUnfolderBase]: For 40/64 co-relation queries the response was YES. [2025-03-17 11:14:51,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1676 conditions, 1255 events. 96/1255 cut-off events. For 40/64 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 7455 event pairs, 21 based on Foata normal form. 8/1214 useless extension candidates. Maximal degree in co-relation 1656. Up to 88 conditions per place. [2025-03-17 11:14:51,838 INFO L140 encePairwiseOnDemand]: 332/338 looper letters, 23 selfloop transitions, 5 changer transitions 0/284 dead transitions. [2025-03-17 11:14:51,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 284 transitions, 774 flow [2025-03-17 11:14:51,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:14:51,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:14:51,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1883 transitions. [2025-03-17 11:14:51,840 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9285009861932939 [2025-03-17 11:14:51,840 INFO L175 Difference]: Start difference. First operand has 311 places, 276 transitions, 694 flow. Second operand 6 states and 1883 transitions. [2025-03-17 11:14:51,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 284 transitions, 774 flow [2025-03-17 11:14:51,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 284 transitions, 722 flow, removed 4 selfloop flow, removed 18 redundant places. [2025-03-17 11:14:51,879 INFO L231 Difference]: Finished difference. Result has 290 places, 276 transitions, 656 flow [2025-03-17 11:14:51,879 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=640, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=656, PETRI_PLACES=290, PETRI_TRANSITIONS=276} [2025-03-17 11:14:51,880 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, -21 predicate places. [2025-03-17 11:14:51,880 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 276 transitions, 656 flow [2025-03-17 11:14:51,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 311.1666666666667) internal successors, (1867), 6 states have internal predecessors, (1867), 0 states have call successors, (0), 0 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:14:51,880 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:51,881 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:51,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 11:14:51,881 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-17 11:14:51,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:51,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1968935788, now seen corresponding path program 1 times [2025-03-17 11:14:51,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:51,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214458404] [2025-03-17 11:14:51,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:51,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:51,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 11:14:51,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 11:14:51,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:51,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:52,243 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-17 11:14:52,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:52,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214458404] [2025-03-17 11:14:52,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214458404] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:52,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:52,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:14:52,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635701493] [2025-03-17 11:14:52,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:52,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:14:52,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:52,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:14:52,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:14:52,528 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 309 out of 338 [2025-03-17 11:14:52,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 276 transitions, 656 flow. Second operand has 6 states, 6 states have (on average 311.1666666666667) internal successors, (1867), 6 states have internal predecessors, (1867), 0 states have call successors, (0), 0 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:14:52,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:52,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 309 of 338 [2025-03-17 11:14:52,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:52,678 INFO L124 PetriNetUnfolderBase]: 96/1249 cut-off events. [2025-03-17 11:14:52,679 INFO L125 PetriNetUnfolderBase]: For 33/57 co-relation queries the response was YES. [2025-03-17 11:14:52,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1618 conditions, 1249 events. 96/1249 cut-off events. For 33/57 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 7342 event pairs, 21 based on Foata normal form. 8/1202 useless extension candidates. Maximal degree in co-relation 1603. Up to 88 conditions per place. [2025-03-17 11:14:52,688 INFO L140 encePairwiseOnDemand]: 332/338 looper letters, 0 selfloop transitions, 0 changer transitions 283/283 dead transitions. [2025-03-17 11:14:52,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 283 transitions, 734 flow [2025-03-17 11:14:52,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:14:52,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:14:52,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1883 transitions. [2025-03-17 11:14:52,689 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9285009861932939 [2025-03-17 11:14:52,690 INFO L175 Difference]: Start difference. First operand has 290 places, 276 transitions, 656 flow. Second operand 6 states and 1883 transitions. [2025-03-17 11:14:52,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 283 transitions, 734 flow [2025-03-17 11:14:52,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 283 transitions, 726 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 11:14:52,692 INFO L231 Difference]: Finished difference. Result has 290 places, 0 transitions, 0 flow [2025-03-17 11:14:52,693 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=646, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=290, PETRI_TRANSITIONS=0} [2025-03-17 11:14:52,693 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, -21 predicate places. [2025-03-17 11:14:52,693 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 0 transitions, 0 flow [2025-03-17 11:14:52,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 311.1666666666667) internal successors, (1867), 6 states have internal predecessors, (1867), 0 states have call successors, (0), 0 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:14:52,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (60 of 61 remaining) [2025-03-17 11:14:52,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (59 of 61 remaining) [2025-03-17 11:14:52,698 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (58 of 61 remaining) [2025-03-17 11:14:52,698 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (57 of 61 remaining) [2025-03-17 11:14:52,698 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (56 of 61 remaining) [2025-03-17 11:14:52,698 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (55 of 61 remaining) [2025-03-17 11:14:52,698 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (54 of 61 remaining) [2025-03-17 11:14:52,698 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (53 of 61 remaining) [2025-03-17 11:14:52,698 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (52 of 61 remaining) [2025-03-17 11:14:52,698 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (51 of 61 remaining) [2025-03-17 11:14:52,698 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (50 of 61 remaining) [2025-03-17 11:14:52,698 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (49 of 61 remaining) [2025-03-17 11:14:52,699 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (48 of 61 remaining) [2025-03-17 11:14:52,699 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (47 of 61 remaining) [2025-03-17 11:14:52,699 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (46 of 61 remaining) [2025-03-17 11:14:52,699 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (45 of 61 remaining) [2025-03-17 11:14:52,699 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (44 of 61 remaining) [2025-03-17 11:14:52,699 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (43 of 61 remaining) [2025-03-17 11:14:52,699 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (42 of 61 remaining) [2025-03-17 11:14:52,700 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (41 of 61 remaining) [2025-03-17 11:14:52,700 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (40 of 61 remaining) [2025-03-17 11:14:52,700 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (39 of 61 remaining) [2025-03-17 11:14:52,700 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (38 of 61 remaining) [2025-03-17 11:14:52,700 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (37 of 61 remaining) [2025-03-17 11:14:52,700 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (36 of 61 remaining) [2025-03-17 11:14:52,700 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (35 of 61 remaining) [2025-03-17 11:14:52,700 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (34 of 61 remaining) [2025-03-17 11:14:52,700 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (33 of 61 remaining) [2025-03-17 11:14:52,700 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (32 of 61 remaining) [2025-03-17 11:14:52,700 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (31 of 61 remaining) [2025-03-17 11:14:52,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (30 of 61 remaining) [2025-03-17 11:14:52,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (29 of 61 remaining) [2025-03-17 11:14:52,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (28 of 61 remaining) [2025-03-17 11:14:52,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (27 of 61 remaining) [2025-03-17 11:14:52,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (26 of 61 remaining) [2025-03-17 11:14:52,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (25 of 61 remaining) [2025-03-17 11:14:52,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 61 remaining) [2025-03-17 11:14:52,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 61 remaining) [2025-03-17 11:14:52,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 61 remaining) [2025-03-17 11:14:52,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (21 of 61 remaining) [2025-03-17 11:14:52,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (20 of 61 remaining) [2025-03-17 11:14:52,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (19 of 61 remaining) [2025-03-17 11:14:52,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (18 of 61 remaining) [2025-03-17 11:14:52,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (17 of 61 remaining) [2025-03-17 11:14:52,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (16 of 61 remaining) [2025-03-17 11:14:52,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (15 of 61 remaining) [2025-03-17 11:14:52,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (14 of 61 remaining) [2025-03-17 11:14:52,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (13 of 61 remaining) [2025-03-17 11:14:52,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (12 of 61 remaining) [2025-03-17 11:14:52,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (11 of 61 remaining) [2025-03-17 11:14:52,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (10 of 61 remaining) [2025-03-17 11:14:52,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (9 of 61 remaining) [2025-03-17 11:14:52,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (8 of 61 remaining) [2025-03-17 11:14:52,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (7 of 61 remaining) [2025-03-17 11:14:52,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (6 of 61 remaining) [2025-03-17 11:14:52,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (5 of 61 remaining) [2025-03-17 11:14:52,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (4 of 61 remaining) [2025-03-17 11:14:52,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (3 of 61 remaining) [2025-03-17 11:14:52,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (2 of 61 remaining) [2025-03-17 11:14:52,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (1 of 61 remaining) [2025-03-17 11:14:52,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (0 of 61 remaining) [2025-03-17 11:14:52,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 11:14:52,703 INFO L422 BasicCegarLoop]: Path program histogram: [2, 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:14:52,707 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-17 11:14:52,708 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 11:14:52,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 11:14:52 BasicIcfg [2025-03-17 11:14:52,713 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 11:14:52,714 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 11:14:52,714 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 11:14:52,714 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 11:14:52,715 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:14:39" (3/4) ... [2025-03-17 11:14:52,716 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 11:14:52,718 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-17 11:14:52,718 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-17 11:14:52,718 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-17 11:14:52,723 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2025-03-17 11:14:52,723 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-17 11:14:52,723 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 11:14:52,724 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 11:14:52,785 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 11:14:52,785 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 11:14:52,785 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 11:14:52,786 INFO L158 Benchmark]: Toolchain (without parser) took 13767.71ms. Allocated memory was 167.8MB in the beginning and 226.5MB in the end (delta: 58.7MB). Free memory was 129.0MB in the beginning and 69.3MB in the end (delta: 59.7MB). Peak memory consumption was 116.3MB. Max. memory is 16.1GB. [2025-03-17 11:14:52,787 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:14:52,787 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.64ms. Allocated memory is still 167.8MB. Free memory was 128.5MB in the beginning and 115.8MB in the end (delta: 12.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 11:14:52,787 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.08ms. Allocated memory is still 167.8MB. Free memory was 115.8MB in the beginning and 114.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:14:52,787 INFO L158 Benchmark]: Boogie Preprocessor took 33.67ms. Allocated memory is still 167.8MB. Free memory was 114.4MB in the beginning and 112.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:14:52,787 INFO L158 Benchmark]: IcfgBuilder took 531.70ms. Allocated memory is still 167.8MB. Free memory was 112.6MB in the beginning and 84.1MB in the end (delta: 28.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 11:14:52,788 INFO L158 Benchmark]: TraceAbstraction took 12858.12ms. Allocated memory was 167.8MB in the beginning and 226.5MB in the end (delta: 58.7MB). Free memory was 83.7MB in the beginning and 76.4MB in the end (delta: 7.3MB). Peak memory consumption was 106.0MB. Max. memory is 16.1GB. [2025-03-17 11:14:52,789 INFO L158 Benchmark]: Witness Printer took 71.11ms. Allocated memory is still 226.5MB. Free memory was 76.4MB in the beginning and 69.3MB in the end (delta: 7.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 11:14:52,789 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 228.64ms. Allocated memory is still 167.8MB. Free memory was 128.5MB in the beginning and 115.8MB in the end (delta: 12.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.08ms. Allocated memory is still 167.8MB. Free memory was 115.8MB in the beginning and 114.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.67ms. Allocated memory is still 167.8MB. Free memory was 114.4MB in the beginning and 112.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 531.70ms. Allocated memory is still 167.8MB. Free memory was 112.6MB in the beginning and 84.1MB in the end (delta: 28.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 12858.12ms. Allocated memory was 167.8MB in the beginning and 226.5MB in the end (delta: 58.7MB). Free memory was 83.7MB in the beginning and 76.4MB in the end (delta: 7.3MB). Peak memory consumption was 106.0MB. Max. memory is 16.1GB. * Witness Printer took 71.11ms. Allocated memory is still 226.5MB. Free memory was 76.4MB in the beginning and 69.3MB in the end (delta: 7.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 473 locations, 497 edges, 61 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 12.7s, OverallIterations: 25, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 8.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2588 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1576 mSDsluCounter, 1425 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1211 mSDsCounter, 588 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4286 IncrementalHoareTripleChecker+Invalid, 4874 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 588 mSolverCounterUnsat, 214 mSDtfsCounter, 4286 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 364 GetRequests, 280 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=797occurred in iteration=21, InterpolantAutomatonStates: 118, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 2631 NumberOfCodeBlocks, 2601 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2733 ConstructedInterpolants, 0 QuantifiedInterpolants, 4644 SizeOfPredicates, 7 NumberOfNonLiveVariables, 261 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 27 InterpolantComputations, 24 PerfectInterpolantSequences, 36/39 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 36 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-17 11:14:52,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE