./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-file-item-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 735b3cc8 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-file-item-symm.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 3bc77f08e5fdc1758b216096ce0b18debc22015dafe53c78389dc7da36650394 --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:42:45,085 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:42:45,130 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-14 01:42:45,134 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:42:45,135 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:42:45,152 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:42:45,152 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:42:45,153 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:42:45,153 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:42:45,153 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:42:45,153 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:42:45,153 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:42:45,153 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:42:45,154 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:42:45,154 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:42:45,154 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:42:45,154 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:42:45,154 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:42:45,154 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:42:45,154 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:42:45,154 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:42:45,154 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:42:45,154 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-14 01:42:45,155 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-14 01:42:45,155 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:42:45,155 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:42:45,155 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:42:45,155 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:42:45,155 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:42:45,155 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:42:45,155 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:42:45,155 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:42:45,156 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:42:45,156 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:42:45,156 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:42:45,156 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:42:45,156 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:42:45,156 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:42:45,156 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:42:45,156 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:42:45,156 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:42:45,156 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:42:45,156 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 -> 3bc77f08e5fdc1758b216096ce0b18debc22015dafe53c78389dc7da36650394 [2025-03-14 01:42:45,382 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:42:45,390 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:42:45,394 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:42:45,395 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:42:45,395 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:42:45,396 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-file-item-symm.wvr.c [2025-03-14 01:42:46,559 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35d99061b/e917f1e7eed04587a876c650daa0f964/FLAG51fc26de7 [2025-03-14 01:42:46,782 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:42:46,782 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-file-item-symm.wvr.c [2025-03-14 01:42:46,791 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35d99061b/e917f1e7eed04587a876c650daa0f964/FLAG51fc26de7 [2025-03-14 01:42:47,144 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35d99061b/e917f1e7eed04587a876c650daa0f964 [2025-03-14 01:42:47,146 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:42:47,147 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:42:47,148 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:42:47,148 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:42:47,151 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:42:47,152 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:42:47" (1/1) ... [2025-03-14 01:42:47,152 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@480f5233 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:47, skipping insertion in model container [2025-03-14 01:42:47,152 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:42:47" (1/1) ... [2025-03-14 01:42:47,162 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:42:47,283 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:42:47,290 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:42:47,306 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:42:47,319 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:42:47,319 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:47 WrapperNode [2025-03-14 01:42:47,319 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:42:47,320 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:42:47,320 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:42:47,320 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:42:47,325 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:47" (1/1) ... [2025-03-14 01:42:47,330 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:47" (1/1) ... [2025-03-14 01:42:47,353 INFO L138 Inliner]: procedures = 21, calls = 16, calls flagged for inlining = 10, calls inlined = 12, statements flattened = 231 [2025-03-14 01:42:47,354 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:42:47,354 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:42:47,354 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:42:47,355 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:42:47,359 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:47" (1/1) ... [2025-03-14 01:42:47,359 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:47" (1/1) ... [2025-03-14 01:42:47,361 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:47" (1/1) ... [2025-03-14 01:42:47,361 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:47" (1/1) ... [2025-03-14 01:42:47,370 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:47" (1/1) ... [2025-03-14 01:42:47,378 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:47" (1/1) ... [2025-03-14 01:42:47,380 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:47" (1/1) ... [2025-03-14 01:42:47,380 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:47" (1/1) ... [2025-03-14 01:42:47,382 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:42:47,386 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:42:47,386 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:42:47,386 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:42:47,387 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:47" (1/1) ... [2025-03-14 01:42:47,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:42:47,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:42:47,416 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-14 01:42:47,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-14 01:42:47,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:42:47,435 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-14 01:42:47,435 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-14 01:42:47,435 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-14 01:42:47,435 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-14 01:42:47,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 01:42:47,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:42:47,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:42:47,436 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:42:47,502 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:42:47,503 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:42:47,823 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:42:47,824 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:42:47,824 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:42:47,838 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:42:47,839 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:42:47 BoogieIcfgContainer [2025-03-14 01:42:47,839 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:42:47,841 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:42:47,841 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:42:47,844 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:42:47,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:42:47" (1/3) ... [2025-03-14 01:42:47,844 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24e9ea26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:42:47, skipping insertion in model container [2025-03-14 01:42:47,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:47" (2/3) ... [2025-03-14 01:42:47,845 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24e9ea26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:42:47, skipping insertion in model container [2025-03-14 01:42:47,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:42:47" (3/3) ... [2025-03-14 01:42:47,845 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-file-item-symm.wvr.c [2025-03-14 01:42:47,856 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:42:47,857 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-file-item-symm.wvr.c that has 3 procedures, 296 locations, 1 initial locations, 0 loop locations, and 30 error locations. [2025-03-14 01:42:47,857 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:42:47,940 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-14 01:42:47,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 302 places, 313 transitions, 640 flow [2025-03-14 01:42:48,062 INFO L124 PetriNetUnfolderBase]: 18/311 cut-off events. [2025-03-14 01:42:48,065 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:42:48,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 320 conditions, 311 events. 18/311 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 606 event pairs, 0 based on Foata normal form. 0/263 useless extension candidates. Maximal degree in co-relation 170. Up to 2 conditions per place. [2025-03-14 01:42:48,074 INFO L82 GeneralOperation]: Start removeDead. Operand has 302 places, 313 transitions, 640 flow [2025-03-14 01:42:48,080 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 282 places, 291 transitions, 594 flow [2025-03-14 01:42:48,090 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:42:48,104 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;@2d6b68b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:42:48,104 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2025-03-14 01:42:48,109 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:42:48,109 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2025-03-14 01:42:48,109 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:42:48,109 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:48,110 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:42:48,110 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-03-14 01:42:48,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:48,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1702198485, now seen corresponding path program 1 times [2025-03-14 01:42:48,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:48,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171521860] [2025-03-14 01:42:48,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:48,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:48,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-14 01:42:48,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-14 01:42:48,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:48,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:48,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:42:48,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:48,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171521860] [2025-03-14 01:42:48,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171521860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:48,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:48,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:48,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901843864] [2025-03-14 01:42:48,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:48,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:48,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:48,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:48,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:48,347 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 292 out of 313 [2025-03-14 01:42:48,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 291 transitions, 594 flow. Second operand has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:48,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:48,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 292 of 313 [2025-03-14 01:42:48,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:48,434 INFO L124 PetriNetUnfolderBase]: 17/369 cut-off events. [2025-03-14 01:42:48,434 INFO L125 PetriNetUnfolderBase]: For 10/11 co-relation queries the response was YES. [2025-03-14 01:42:48,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 399 conditions, 369 events. 17/369 cut-off events. For 10/11 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1095 event pairs, 3 based on Foata normal form. 12/321 useless extension candidates. Maximal degree in co-relation 258. Up to 16 conditions per place. [2025-03-14 01:42:48,439 INFO L140 encePairwiseOnDemand]: 304/313 looper letters, 9 selfloop transitions, 2 changer transitions 2/284 dead transitions. [2025-03-14 01:42:48,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 284 transitions, 602 flow [2025-03-14 01:42:48,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:48,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:48,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 894 transitions. [2025-03-14 01:42:48,454 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.952076677316294 [2025-03-14 01:42:48,455 INFO L175 Difference]: Start difference. First operand has 282 places, 291 transitions, 594 flow. Second operand 3 states and 894 transitions. [2025-03-14 01:42:48,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 284 transitions, 602 flow [2025-03-14 01:42:48,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 284 transitions, 594 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-14 01:42:48,467 INFO L231 Difference]: Finished difference. Result has 279 places, 282 transitions, 572 flow [2025-03-14 01:42:48,469 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=572, PETRI_PLACES=279, PETRI_TRANSITIONS=282} [2025-03-14 01:42:48,471 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, -3 predicate places. [2025-03-14 01:42:48,473 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 282 transitions, 572 flow [2025-03-14 01:42:48,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:48,474 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:48,474 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] [2025-03-14 01:42:48,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:42:48,474 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-03-14 01:42:48,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:48,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1515472259, now seen corresponding path program 1 times [2025-03-14 01:42:48,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:48,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678355069] [2025-03-14 01:42:48,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:48,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:48,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-14 01:42:48,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-14 01:42:48,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:48,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:48,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:42:48,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:48,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678355069] [2025-03-14 01:42:48,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678355069] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:48,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:48,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:48,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111539993] [2025-03-14 01:42:48,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:48,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:48,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:48,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:48,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:48,547 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 292 out of 313 [2025-03-14 01:42:48,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 282 transitions, 572 flow. Second operand has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:48,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:48,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 292 of 313 [2025-03-14 01:42:48,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:48,591 INFO L124 PetriNetUnfolderBase]: 17/366 cut-off events. [2025-03-14 01:42:48,592 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2025-03-14 01:42:48,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 391 conditions, 366 events. 17/366 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1089 event pairs, 3 based on Foata normal form. 0/309 useless extension candidates. Maximal degree in co-relation 359. Up to 16 conditions per place. [2025-03-14 01:42:48,595 INFO L140 encePairwiseOnDemand]: 310/313 looper letters, 9 selfloop transitions, 2 changer transitions 0/281 dead transitions. [2025-03-14 01:42:48,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 281 transitions, 592 flow [2025-03-14 01:42:48,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:48,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:48,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 888 transitions. [2025-03-14 01:42:48,598 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9456869009584664 [2025-03-14 01:42:48,598 INFO L175 Difference]: Start difference. First operand has 279 places, 282 transitions, 572 flow. Second operand 3 states and 888 transitions. [2025-03-14 01:42:48,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 281 transitions, 592 flow [2025-03-14 01:42:48,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 281 transitions, 588 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:48,603 INFO L231 Difference]: Finished difference. Result has 276 places, 281 transitions, 570 flow [2025-03-14 01:42:48,604 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=570, PETRI_PLACES=276, PETRI_TRANSITIONS=281} [2025-03-14 01:42:48,604 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, -6 predicate places. [2025-03-14 01:42:48,605 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 281 transitions, 570 flow [2025-03-14 01:42:48,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:48,605 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:48,605 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:42:48,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:42:48,606 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-03-14 01:42:48,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:48,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1588475311, now seen corresponding path program 1 times [2025-03-14 01:42:48,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:48,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469489322] [2025-03-14 01:42:48,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:48,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:48,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-14 01:42:48,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-14 01:42:48,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:48,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:48,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:42:48,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:48,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469489322] [2025-03-14 01:42:48,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469489322] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:48,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:48,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:48,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132489888] [2025-03-14 01:42:48,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:48,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:48,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:48,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:48,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:48,690 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 313 [2025-03-14 01:42:48,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 281 transitions, 570 flow. Second operand has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:48,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:48,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 313 [2025-03-14 01:42:48,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:48,775 INFO L124 PetriNetUnfolderBase]: 27/518 cut-off events. [2025-03-14 01:42:48,775 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-14 01:42:48,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 548 conditions, 518 events. 27/518 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2216 event pairs, 5 based on Foata normal form. 0/430 useless extension candidates. Maximal degree in co-relation 508. Up to 21 conditions per place. [2025-03-14 01:42:48,779 INFO L140 encePairwiseOnDemand]: 310/313 looper letters, 10 selfloop transitions, 2 changer transitions 0/280 dead transitions. [2025-03-14 01:42:48,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 280 transitions, 592 flow [2025-03-14 01:42:48,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:48,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:48,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 886 transitions. [2025-03-14 01:42:48,781 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9435569755058573 [2025-03-14 01:42:48,781 INFO L175 Difference]: Start difference. First operand has 276 places, 281 transitions, 570 flow. Second operand 3 states and 886 transitions. [2025-03-14 01:42:48,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 280 transitions, 592 flow [2025-03-14 01:42:48,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 280 transitions, 588 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:48,789 INFO L231 Difference]: Finished difference. Result has 275 places, 280 transitions, 568 flow [2025-03-14 01:42:48,789 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=273, 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=568, PETRI_PLACES=275, PETRI_TRANSITIONS=280} [2025-03-14 01:42:48,790 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, -7 predicate places. [2025-03-14 01:42:48,790 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 280 transitions, 568 flow [2025-03-14 01:42:48,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:48,791 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:48,791 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] [2025-03-14 01:42:48,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:42:48,791 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-03-14 01:42:48,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:48,792 INFO L85 PathProgramCache]: Analyzing trace with hash 924434999, now seen corresponding path program 1 times [2025-03-14 01:42:48,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:48,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697179813] [2025-03-14 01:42:48,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:48,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:48,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-14 01:42:48,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-14 01:42:48,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:48,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:48,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:42:48,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:48,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697179813] [2025-03-14 01:42:48,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697179813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:48,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:48,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:48,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330133293] [2025-03-14 01:42:48,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:48,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:48,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:48,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:48,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:48,865 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 313 [2025-03-14 01:42:48,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 280 transitions, 568 flow. Second operand has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:48,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:48,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 313 [2025-03-14 01:42:48,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:48,901 INFO L124 PetriNetUnfolderBase]: 23/429 cut-off events. [2025-03-14 01:42:48,901 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:42:48,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 460 conditions, 429 events. 23/429 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1585 event pairs, 5 based on Foata normal form. 0/364 useless extension candidates. Maximal degree in co-relation 412. Up to 21 conditions per place. [2025-03-14 01:42:48,904 INFO L140 encePairwiseOnDemand]: 310/313 looper letters, 10 selfloop transitions, 2 changer transitions 0/279 dead transitions. [2025-03-14 01:42:48,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 279 transitions, 590 flow [2025-03-14 01:42:48,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:48,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:48,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 886 transitions. [2025-03-14 01:42:48,906 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9435569755058573 [2025-03-14 01:42:48,906 INFO L175 Difference]: Start difference. First operand has 275 places, 280 transitions, 568 flow. Second operand 3 states and 886 transitions. [2025-03-14 01:42:48,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 279 transitions, 590 flow [2025-03-14 01:42:48,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 279 transitions, 586 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:48,909 INFO L231 Difference]: Finished difference. Result has 274 places, 279 transitions, 566 flow [2025-03-14 01:42:48,910 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=566, PETRI_PLACES=274, PETRI_TRANSITIONS=279} [2025-03-14 01:42:48,910 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, -8 predicate places. [2025-03-14 01:42:48,911 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 279 transitions, 566 flow [2025-03-14 01:42:48,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:48,911 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:48,911 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] [2025-03-14 01:42:48,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:42:48,912 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-03-14 01:42:48,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:48,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1637092499, now seen corresponding path program 1 times [2025-03-14 01:42:48,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:48,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169422939] [2025-03-14 01:42:48,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:48,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:48,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-14 01:42:48,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-14 01:42:48,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:48,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:48,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:42:48,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:48,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169422939] [2025-03-14 01:42:48,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169422939] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:48,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:48,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:48,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915500156] [2025-03-14 01:42:48,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:48,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:48,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:48,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:48,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:48,986 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 313 [2025-03-14 01:42:48,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 279 transitions, 566 flow. Second operand has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:48,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:48,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 313 [2025-03-14 01:42:48,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:49,056 INFO L124 PetriNetUnfolderBase]: 22/422 cut-off events. [2025-03-14 01:42:49,056 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2025-03-14 01:42:49,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 453 conditions, 422 events. 22/422 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1422 event pairs, 5 based on Foata normal form. 0/358 useless extension candidates. Maximal degree in co-relation 397. Up to 22 conditions per place. [2025-03-14 01:42:49,059 INFO L140 encePairwiseOnDemand]: 310/313 looper letters, 10 selfloop transitions, 2 changer transitions 0/278 dead transitions. [2025-03-14 01:42:49,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 278 transitions, 588 flow [2025-03-14 01:42:49,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:49,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:49,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 886 transitions. [2025-03-14 01:42:49,061 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9435569755058573 [2025-03-14 01:42:49,061 INFO L175 Difference]: Start difference. First operand has 274 places, 279 transitions, 566 flow. Second operand 3 states and 886 transitions. [2025-03-14 01:42:49,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 278 transitions, 588 flow [2025-03-14 01:42:49,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 278 transitions, 584 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:49,064 INFO L231 Difference]: Finished difference. Result has 273 places, 278 transitions, 564 flow [2025-03-14 01:42:49,064 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=564, PETRI_PLACES=273, PETRI_TRANSITIONS=278} [2025-03-14 01:42:49,065 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, -9 predicate places. [2025-03-14 01:42:49,065 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 278 transitions, 564 flow [2025-03-14 01:42:49,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:49,065 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:49,065 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] [2025-03-14 01:42:49,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:42:49,066 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-03-14 01:42:49,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:49,066 INFO L85 PathProgramCache]: Analyzing trace with hash 482146302, now seen corresponding path program 1 times [2025-03-14 01:42:49,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:49,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981996284] [2025-03-14 01:42:49,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:49,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:49,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-14 01:42:49,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-14 01:42:49,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:49,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:49,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:42:49,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:49,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981996284] [2025-03-14 01:42:49,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981996284] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:49,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:49,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:49,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625905441] [2025-03-14 01:42:49,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:49,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:49,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:49,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:49,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:49,149 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 313 [2025-03-14 01:42:49,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 278 transitions, 564 flow. Second operand has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:49,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:49,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 313 [2025-03-14 01:42:49,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:49,201 INFO L124 PetriNetUnfolderBase]: 26/507 cut-off events. [2025-03-14 01:42:49,202 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-14 01:42:49,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 539 conditions, 507 events. 26/507 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2034 event pairs, 5 based on Foata normal form. 0/427 useless extension candidates. Maximal degree in co-relation 475. Up to 22 conditions per place. [2025-03-14 01:42:49,205 INFO L140 encePairwiseOnDemand]: 310/313 looper letters, 10 selfloop transitions, 2 changer transitions 0/277 dead transitions. [2025-03-14 01:42:49,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 277 transitions, 586 flow [2025-03-14 01:42:49,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:49,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:49,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 886 transitions. [2025-03-14 01:42:49,207 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9435569755058573 [2025-03-14 01:42:49,207 INFO L175 Difference]: Start difference. First operand has 273 places, 278 transitions, 564 flow. Second operand 3 states and 886 transitions. [2025-03-14 01:42:49,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 277 transitions, 586 flow [2025-03-14 01:42:49,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 277 transitions, 582 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:49,210 INFO L231 Difference]: Finished difference. Result has 272 places, 277 transitions, 562 flow [2025-03-14 01:42:49,211 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=562, PETRI_PLACES=272, PETRI_TRANSITIONS=277} [2025-03-14 01:42:49,211 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, -10 predicate places. [2025-03-14 01:42:49,211 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 277 transitions, 562 flow [2025-03-14 01:42:49,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:49,213 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:49,213 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] [2025-03-14 01:42:49,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:42:49,213 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-03-14 01:42:49,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:49,213 INFO L85 PathProgramCache]: Analyzing trace with hash 964455006, now seen corresponding path program 1 times [2025-03-14 01:42:49,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:49,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592610064] [2025-03-14 01:42:49,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:49,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:49,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-14 01:42:49,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-14 01:42:49,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:49,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:49,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:42:49,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:49,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592610064] [2025-03-14 01:42:49,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592610064] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:49,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:49,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:49,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479538808] [2025-03-14 01:42:49,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:49,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:49,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:49,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:49,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:49,291 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 313 [2025-03-14 01:42:49,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 277 transitions, 562 flow. Second operand has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:49,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:49,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 313 [2025-03-14 01:42:49,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:49,388 INFO L124 PetriNetUnfolderBase]: 48/722 cut-off events. [2025-03-14 01:42:49,388 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-14 01:42:49,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 770 conditions, 722 events. 48/722 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 3809 event pairs, 8 based on Foata normal form. 0/608 useless extension candidates. Maximal degree in co-relation 698. Up to 36 conditions per place. [2025-03-14 01:42:49,391 INFO L140 encePairwiseOnDemand]: 307/313 looper letters, 12 selfloop transitions, 3 changer transitions 0/278 dead transitions. [2025-03-14 01:42:49,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 278 transitions, 595 flow [2025-03-14 01:42:49,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:49,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:49,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 891 transitions. [2025-03-14 01:42:49,393 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9488817891373802 [2025-03-14 01:42:49,393 INFO L175 Difference]: Start difference. First operand has 272 places, 277 transitions, 562 flow. Second operand 3 states and 891 transitions. [2025-03-14 01:42:49,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 278 transitions, 595 flow [2025-03-14 01:42:49,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 278 transitions, 591 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:49,397 INFO L231 Difference]: Finished difference. Result has 270 places, 277 transitions, 573 flow [2025-03-14 01:42:49,397 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=573, PETRI_PLACES=270, PETRI_TRANSITIONS=277} [2025-03-14 01:42:49,398 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, -12 predicate places. [2025-03-14 01:42:49,398 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 277 transitions, 573 flow [2025-03-14 01:42:49,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:49,398 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:49,399 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-14 01:42:49,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:42:49,399 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-03-14 01:42:49,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:49,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1251530627, now seen corresponding path program 1 times [2025-03-14 01:42:49,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:49,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116203987] [2025-03-14 01:42:49,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:49,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:49,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-14 01:42:49,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-14 01:42:49,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:49,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:49,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:42:49,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:49,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116203987] [2025-03-14 01:42:49,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116203987] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:49,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:49,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:49,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443845633] [2025-03-14 01:42:49,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:49,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:49,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:49,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:49,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:49,457 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 313 [2025-03-14 01:42:49,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 277 transitions, 573 flow. Second operand has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:49,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:49,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 313 [2025-03-14 01:42:49,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:49,517 INFO L124 PetriNetUnfolderBase]: 54/797 cut-off events. [2025-03-14 01:42:49,517 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-14 01:42:49,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 865 conditions, 797 events. 54/797 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4507 event pairs, 6 based on Foata normal form. 0/682 useless extension candidates. Maximal degree in co-relation 707. Up to 36 conditions per place. [2025-03-14 01:42:49,521 INFO L140 encePairwiseOnDemand]: 307/313 looper letters, 12 selfloop transitions, 3 changer transitions 0/278 dead transitions. [2025-03-14 01:42:49,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 278 transitions, 606 flow [2025-03-14 01:42:49,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:49,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:49,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 891 transitions. [2025-03-14 01:42:49,523 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9488817891373802 [2025-03-14 01:42:49,523 INFO L175 Difference]: Start difference. First operand has 270 places, 277 transitions, 573 flow. Second operand 3 states and 891 transitions. [2025-03-14 01:42:49,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 278 transitions, 606 flow [2025-03-14 01:42:49,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 278 transitions, 606 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:42:49,527 INFO L231 Difference]: Finished difference. Result has 270 places, 277 transitions, 588 flow [2025-03-14 01:42:49,528 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=567, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=588, PETRI_PLACES=270, PETRI_TRANSITIONS=277} [2025-03-14 01:42:49,528 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, -12 predicate places. [2025-03-14 01:42:49,528 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 277 transitions, 588 flow [2025-03-14 01:42:49,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:49,529 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:49,529 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] [2025-03-14 01:42:49,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:42:49,529 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-03-14 01:42:49,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:49,530 INFO L85 PathProgramCache]: Analyzing trace with hash 262792455, now seen corresponding path program 1 times [2025-03-14 01:42:49,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:49,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620077653] [2025-03-14 01:42:49,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:49,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:49,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-14 01:42:49,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-14 01:42:49,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:49,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:49,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:42:49,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:49,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620077653] [2025-03-14 01:42:49,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620077653] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:49,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:49,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:49,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593245225] [2025-03-14 01:42:49,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:49,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:49,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:49,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:49,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:49,597 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 313 [2025-03-14 01:42:49,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 277 transitions, 588 flow. Second operand has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:49,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:49,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 313 [2025-03-14 01:42:49,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:49,677 INFO L124 PetriNetUnfolderBase]: 56/962 cut-off events. [2025-03-14 01:42:49,677 INFO L125 PetriNetUnfolderBase]: For 12/14 co-relation queries the response was YES. [2025-03-14 01:42:49,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1054 conditions, 962 events. 56/962 cut-off events. For 12/14 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 6015 event pairs, 4 based on Foata normal form. 0/842 useless extension candidates. Maximal degree in co-relation 879. Up to 55 conditions per place. [2025-03-14 01:42:49,682 INFO L140 encePairwiseOnDemand]: 307/313 looper letters, 14 selfloop transitions, 3 changer transitions 0/280 dead transitions. [2025-03-14 01:42:49,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 280 transitions, 631 flow [2025-03-14 01:42:49,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:49,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:49,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 893 transitions. [2025-03-14 01:42:49,685 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9510117145899893 [2025-03-14 01:42:49,685 INFO L175 Difference]: Start difference. First operand has 270 places, 277 transitions, 588 flow. Second operand 3 states and 893 transitions. [2025-03-14 01:42:49,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 280 transitions, 631 flow [2025-03-14 01:42:49,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 280 transitions, 631 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:42:49,689 INFO L231 Difference]: Finished difference. Result has 270 places, 277 transitions, 603 flow [2025-03-14 01:42:49,689 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=582, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=603, PETRI_PLACES=270, PETRI_TRANSITIONS=277} [2025-03-14 01:42:49,689 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, -12 predicate places. [2025-03-14 01:42:49,689 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 277 transitions, 603 flow [2025-03-14 01:42:49,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:49,690 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:49,690 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:42:49,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 01:42:49,690 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-03-14 01:42:49,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:49,691 INFO L85 PathProgramCache]: Analyzing trace with hash 745984970, now seen corresponding path program 1 times [2025-03-14 01:42:49,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:49,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328470957] [2025-03-14 01:42:49,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:49,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:49,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-14 01:42:49,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-14 01:42:49,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:49,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:49,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:42:49,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:49,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328470957] [2025-03-14 01:42:49,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328470957] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:49,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:49,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:49,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943499672] [2025-03-14 01:42:49,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:49,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:49,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:49,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:49,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:49,762 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 293 out of 313 [2025-03-14 01:42:49,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 277 transitions, 603 flow. Second operand has 3 states, 3 states have (on average 294.3333333333333) internal successors, (883), 3 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:49,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:49,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 293 of 313 [2025-03-14 01:42:49,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:49,846 INFO L124 PetriNetUnfolderBase]: 42/793 cut-off events. [2025-03-14 01:42:49,846 INFO L125 PetriNetUnfolderBase]: For 4/12 co-relation queries the response was YES. [2025-03-14 01:42:49,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 902 conditions, 793 events. 42/793 cut-off events. For 4/12 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 4526 event pairs, 4 based on Foata normal form. 2/704 useless extension candidates. Maximal degree in co-relation 727. Up to 25 conditions per place. [2025-03-14 01:42:49,852 INFO L140 encePairwiseOnDemand]: 310/313 looper letters, 10 selfloop transitions, 2 changer transitions 0/277 dead transitions. [2025-03-14 01:42:49,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 277 transitions, 628 flow [2025-03-14 01:42:49,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:49,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:49,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 892 transitions. [2025-03-14 01:42:49,854 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9499467518636848 [2025-03-14 01:42:49,854 INFO L175 Difference]: Start difference. First operand has 270 places, 277 transitions, 603 flow. Second operand 3 states and 892 transitions. [2025-03-14 01:42:49,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 277 transitions, 628 flow [2025-03-14 01:42:49,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 277 transitions, 628 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:42:49,858 INFO L231 Difference]: Finished difference. Result has 271 places, 276 transitions, 605 flow [2025-03-14 01:42:49,858 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=601, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=605, PETRI_PLACES=271, PETRI_TRANSITIONS=276} [2025-03-14 01:42:49,859 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, -11 predicate places. [2025-03-14 01:42:49,859 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 276 transitions, 605 flow [2025-03-14 01:42:49,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 294.3333333333333) internal successors, (883), 3 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:49,860 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:49,860 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] [2025-03-14 01:42:49,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 01:42:49,861 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-03-14 01:42:49,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:49,861 INFO L85 PathProgramCache]: Analyzing trace with hash -874738904, now seen corresponding path program 1 times [2025-03-14 01:42:49,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:49,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154292980] [2025-03-14 01:42:49,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:49,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:49,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-14 01:42:49,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-14 01:42:49,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:49,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:49,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:42:49,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:49,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154292980] [2025-03-14 01:42:49,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154292980] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:49,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:49,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:49,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871366984] [2025-03-14 01:42:49,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:49,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:49,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:49,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:49,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:49,922 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 313 [2025-03-14 01:42:49,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 276 transitions, 605 flow. Second operand has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:49,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:49,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 313 [2025-03-14 01:42:49,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:50,029 INFO L124 PetriNetUnfolderBase]: 60/1068 cut-off events. [2025-03-14 01:42:50,030 INFO L125 PetriNetUnfolderBase]: For 8/10 co-relation queries the response was YES. [2025-03-14 01:42:50,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1200 conditions, 1068 events. 60/1068 cut-off events. For 8/10 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 7109 event pairs, 6 based on Foata normal form. 0/948 useless extension candidates. Maximal degree in co-relation 1022. Up to 47 conditions per place. [2025-03-14 01:42:50,037 INFO L140 encePairwiseOnDemand]: 307/313 looper letters, 14 selfloop transitions, 3 changer transitions 0/279 dead transitions. [2025-03-14 01:42:50,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 279 transitions, 648 flow [2025-03-14 01:42:50,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:50,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:50,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 893 transitions. [2025-03-14 01:42:50,039 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9510117145899893 [2025-03-14 01:42:50,039 INFO L175 Difference]: Start difference. First operand has 271 places, 276 transitions, 605 flow. Second operand 3 states and 893 transitions. [2025-03-14 01:42:50,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 279 transitions, 648 flow [2025-03-14 01:42:50,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 279 transitions, 644 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:50,043 INFO L231 Difference]: Finished difference. Result has 269 places, 276 transitions, 616 flow [2025-03-14 01:42:50,044 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=595, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=616, PETRI_PLACES=269, PETRI_TRANSITIONS=276} [2025-03-14 01:42:50,044 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, -13 predicate places. [2025-03-14 01:42:50,044 INFO L471 AbstractCegarLoop]: Abstraction has has 269 places, 276 transitions, 616 flow [2025-03-14 01:42:50,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:50,045 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:50,045 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:42:50,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 01:42:50,045 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-03-14 01:42:50,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:50,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1779476525, now seen corresponding path program 1 times [2025-03-14 01:42:50,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:50,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006362093] [2025-03-14 01:42:50,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:50,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:50,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-14 01:42:50,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-14 01:42:50,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:50,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:50,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:42:50,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:50,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006362093] [2025-03-14 01:42:50,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006362093] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:50,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:50,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:50,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110237182] [2025-03-14 01:42:50,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:50,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:50,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:50,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:50,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:50,089 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 313 [2025-03-14 01:42:50,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 276 transitions, 616 flow. Second operand has 3 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:50,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:50,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 313 [2025-03-14 01:42:50,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:50,204 INFO L124 PetriNetUnfolderBase]: 45/1163 cut-off events. [2025-03-14 01:42:50,205 INFO L125 PetriNetUnfolderBase]: For 13/18 co-relation queries the response was YES. [2025-03-14 01:42:50,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1290 conditions, 1163 events. 45/1163 cut-off events. For 13/18 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 7243 event pairs, 2 based on Foata normal form. 0/1055 useless extension candidates. Maximal degree in co-relation 1095. Up to 42 conditions per place. [2025-03-14 01:42:50,211 INFO L140 encePairwiseOnDemand]: 309/313 looper letters, 12 selfloop transitions, 2 changer transitions 0/279 dead transitions. [2025-03-14 01:42:50,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 279 transitions, 653 flow [2025-03-14 01:42:50,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:50,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:50,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 898 transitions. [2025-03-14 01:42:50,213 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9563365282215123 [2025-03-14 01:42:50,213 INFO L175 Difference]: Start difference. First operand has 269 places, 276 transitions, 616 flow. Second operand 3 states and 898 transitions. [2025-03-14 01:42:50,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 279 transitions, 653 flow [2025-03-14 01:42:50,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 279 transitions, 653 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:42:50,217 INFO L231 Difference]: Finished difference. Result has 270 places, 276 transitions, 626 flow [2025-03-14 01:42:50,218 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=626, PETRI_PLACES=270, PETRI_TRANSITIONS=276} [2025-03-14 01:42:50,218 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, -12 predicate places. [2025-03-14 01:42:50,218 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 276 transitions, 626 flow [2025-03-14 01:42:50,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:50,219 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:50,219 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] [2025-03-14 01:42:50,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-14 01:42:50,219 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-03-14 01:42:50,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:50,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1482939589, now seen corresponding path program 1 times [2025-03-14 01:42:50,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:50,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770121601] [2025-03-14 01:42:50,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:50,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:50,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-14 01:42:50,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-14 01:42:50,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:50,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:50,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:42:50,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:50,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770121601] [2025-03-14 01:42:50,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770121601] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:50,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:50,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:50,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637285476] [2025-03-14 01:42:50,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:50,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:50,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:50,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:50,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:50,285 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 293 out of 313 [2025-03-14 01:42:50,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 276 transitions, 626 flow. Second operand has 3 states, 3 states have (on average 294.6666666666667) internal successors, (884), 3 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:50,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:50,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 293 of 313 [2025-03-14 01:42:50,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:50,356 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([790] thread1EXIT-->L69: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][170], [8#L50-7true, Black: 323#true, 16#L69true, Black: 327#true, 325#(= |#race~isNull_0~0| 0), 344#(= |#race~filename_1~0| 0), Black: 331#true, 329#(= |#race~isNull_3~0| 0), 346#true, Black: 338#true, Black: 342#true, 340#(= |#race~filename_5~0| 0), 333#(= |#race~filename_2~0| 0)]) [2025-03-14 01:42:50,356 INFO L294 olderBase$Statistics]: this new event has 143 ancestors and is cut-off event [2025-03-14 01:42:50,357 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2025-03-14 01:42:50,357 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2025-03-14 01:42:50,357 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2025-03-14 01:42:50,357 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([723] L50-8-->L50-7: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_#t~nondet12#1=|v_thread2Thread1of1ForFork0_#t~nondet12#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~nondet12#1][134], [8#L50-7true, Black: 323#true, 16#L69true, Black: 327#true, 344#(= |#race~filename_1~0| 0), 325#(= |#race~isNull_0~0| 0), Black: 331#true, 329#(= |#race~isNull_3~0| 0), 346#true, Black: 338#true, Black: 342#true, 340#(= |#race~filename_5~0| 0), 333#(= |#race~filename_2~0| 0)]) [2025-03-14 01:42:50,357 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is cut-off event [2025-03-14 01:42:50,357 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2025-03-14 01:42:50,357 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2025-03-14 01:42:50,357 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2025-03-14 01:42:50,358 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([790] thread1EXIT-->L69: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][170], [8#L50-7true, Black: 323#true, 16#L69true, Black: 327#true, 325#(= |#race~isNull_0~0| 0), 344#(= |#race~filename_1~0| 0), Black: 331#true, 329#(= |#race~isNull_3~0| 0), 346#true, Black: 338#true, Black: 342#true, 340#(= |#race~filename_5~0| 0), 333#(= |#race~filename_2~0| 0)]) [2025-03-14 01:42:50,358 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is cut-off event [2025-03-14 01:42:50,358 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2025-03-14 01:42:50,358 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2025-03-14 01:42:50,359 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2025-03-14 01:42:50,359 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2025-03-14 01:42:50,360 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([790] thread1EXIT-->L69: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][178], [Black: 323#true, 16#L69true, Black: 327#true, 325#(= |#race~isNull_0~0| 0), 344#(= |#race~filename_1~0| 0), 348#(= |thread2Thread1of1ForFork0_#t~nondet12#1| |#race~result_7~0|), Black: 331#true, 10#L50-5true, 329#(= |#race~isNull_3~0| 0), Black: 338#true, Black: 342#true, 340#(= |#race~filename_5~0| 0), 333#(= |#race~filename_2~0| 0)]) [2025-03-14 01:42:50,360 INFO L294 olderBase$Statistics]: this new event has 180 ancestors and is cut-off event [2025-03-14 01:42:50,360 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-03-14 01:42:50,360 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-03-14 01:42:50,360 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-03-14 01:42:50,361 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([790] thread1EXIT-->L69: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][178], [Black: 323#true, 233#L50-6true, 16#L69true, Black: 327#true, 325#(= |#race~isNull_0~0| 0), 344#(= |#race~filename_1~0| 0), 348#(= |thread2Thread1of1ForFork0_#t~nondet12#1| |#race~result_7~0|), Black: 331#true, 329#(= |#race~isNull_3~0| 0), Black: 338#true, Black: 342#true, 340#(= |#race~filename_5~0| 0), 333#(= |#race~filename_2~0| 0)]) [2025-03-14 01:42:50,361 INFO L294 olderBase$Statistics]: this new event has 181 ancestors and is cut-off event [2025-03-14 01:42:50,361 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-03-14 01:42:50,361 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-03-14 01:42:50,361 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-03-14 01:42:50,364 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([723] L50-8-->L50-7: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_#t~nondet12#1=|v_thread2Thread1of1ForFork0_#t~nondet12#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~nondet12#1][134], [8#L50-7true, Black: 323#true, 16#L69true, Black: 327#true, 344#(= |#race~filename_1~0| 0), 325#(= |#race~isNull_0~0| 0), Black: 331#true, 329#(= |#race~isNull_3~0| 0), 346#true, Black: 338#true, Black: 342#true, 340#(= |#race~filename_5~0| 0), 333#(= |#race~filename_2~0| 0)]) [2025-03-14 01:42:50,364 INFO L294 olderBase$Statistics]: this new event has 143 ancestors and is not cut-off event [2025-03-14 01:42:50,364 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is not cut-off event [2025-03-14 01:42:50,365 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is not cut-off event [2025-03-14 01:42:50,365 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is not cut-off event [2025-03-14 01:42:50,365 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is not cut-off event [2025-03-14 01:42:50,365 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([790] thread1EXIT-->L69: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][178], [Black: 323#true, 16#L69true, Black: 327#true, 325#(= |#race~isNull_0~0| 0), 344#(= |#race~filename_1~0| 0), 348#(= |thread2Thread1of1ForFork0_#t~nondet12#1| |#race~result_7~0|), Black: 331#true, 10#L50-5true, 329#(= |#race~isNull_3~0| 0), Black: 338#true, Black: 342#true, 340#(= |#race~filename_5~0| 0), 333#(= |#race~filename_2~0| 0)]) [2025-03-14 01:42:50,365 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2025-03-14 01:42:50,365 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-03-14 01:42:50,365 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-03-14 01:42:50,365 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2025-03-14 01:42:50,365 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-03-14 01:42:50,365 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([790] thread1EXIT-->L69: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][170], [Black: 323#true, 16#L69true, 100#L52true, Black: 327#true, 325#(= |#race~isNull_0~0| 0), 344#(= |#race~filename_1~0| 0), Black: 331#true, 329#(= |#race~isNull_3~0| 0), 346#true, Black: 338#true, Black: 342#true, 340#(= |#race~filename_5~0| 0), 333#(= |#race~filename_2~0| 0)]) [2025-03-14 01:42:50,365 INFO L294 olderBase$Statistics]: this new event has 187 ancestors and is cut-off event [2025-03-14 01:42:50,365 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2025-03-14 01:42:50,365 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2025-03-14 01:42:50,365 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2025-03-14 01:42:50,366 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([790] thread1EXIT-->L69: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][178], [Black: 323#true, 233#L50-6true, 16#L69true, Black: 327#true, 325#(= |#race~isNull_0~0| 0), 344#(= |#race~filename_1~0| 0), 348#(= |thread2Thread1of1ForFork0_#t~nondet12#1| |#race~result_7~0|), Black: 331#true, 329#(= |#race~isNull_3~0| 0), Black: 338#true, Black: 342#true, 340#(= |#race~filename_5~0| 0), 333#(= |#race~filename_2~0| 0)]) [2025-03-14 01:42:50,366 INFO L294 olderBase$Statistics]: this new event has 145 ancestors and is cut-off event [2025-03-14 01:42:50,366 INFO L297 olderBase$Statistics]: existing Event has 181 ancestors and is cut-off event [2025-03-14 01:42:50,366 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-03-14 01:42:50,366 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-03-14 01:42:50,366 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-03-14 01:42:50,367 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([790] thread1EXIT-->L69: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][170], [Black: 323#true, 16#L69true, 100#L52true, Black: 327#true, 325#(= |#race~isNull_0~0| 0), 344#(= |#race~filename_1~0| 0), Black: 331#true, 329#(= |#race~isNull_3~0| 0), 346#true, Black: 338#true, Black: 342#true, 340#(= |#race~filename_5~0| 0), 333#(= |#race~filename_2~0| 0)]) [2025-03-14 01:42:50,367 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2025-03-14 01:42:50,367 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2025-03-14 01:42:50,367 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2025-03-14 01:42:50,367 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2025-03-14 01:42:50,367 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2025-03-14 01:42:50,370 INFO L124 PetriNetUnfolderBase]: 70/1028 cut-off events. [2025-03-14 01:42:50,371 INFO L125 PetriNetUnfolderBase]: For 42/45 co-relation queries the response was YES. [2025-03-14 01:42:50,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1268 conditions, 1028 events. 70/1028 cut-off events. For 42/45 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 6032 event pairs, 6 based on Foata normal form. 0/940 useless extension candidates. Maximal degree in co-relation 1064. Up to 86 conditions per place. [2025-03-14 01:42:50,376 INFO L140 encePairwiseOnDemand]: 310/313 looper letters, 10 selfloop transitions, 2 changer transitions 0/276 dead transitions. [2025-03-14 01:42:50,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 276 transitions, 651 flow [2025-03-14 01:42:50,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:50,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:50,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 892 transitions. [2025-03-14 01:42:50,378 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9499467518636848 [2025-03-14 01:42:50,378 INFO L175 Difference]: Start difference. First operand has 270 places, 276 transitions, 626 flow. Second operand 3 states and 892 transitions. [2025-03-14 01:42:50,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 276 transitions, 651 flow [2025-03-14 01:42:50,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 276 transitions, 651 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:42:50,382 INFO L231 Difference]: Finished difference. Result has 271 places, 275 transitions, 628 flow [2025-03-14 01:42:50,382 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=624, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=628, PETRI_PLACES=271, PETRI_TRANSITIONS=275} [2025-03-14 01:42:50,384 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, -11 predicate places. [2025-03-14 01:42:50,384 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 275 transitions, 628 flow [2025-03-14 01:42:50,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 294.6666666666667) internal successors, (884), 3 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:50,385 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:50,385 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] [2025-03-14 01:42:50,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-14 01:42:50,385 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-03-14 01:42:50,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:50,386 INFO L85 PathProgramCache]: Analyzing trace with hash -679936171, now seen corresponding path program 1 times [2025-03-14 01:42:50,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:50,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491343692] [2025-03-14 01:42:50,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:50,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:50,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-14 01:42:50,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-14 01:42:50,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:50,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:50,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:42:50,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:50,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491343692] [2025-03-14 01:42:50,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491343692] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:50,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:50,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:50,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098700913] [2025-03-14 01:42:50,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:50,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:50,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:50,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:50,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:50,437 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 313 [2025-03-14 01:42:50,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 275 transitions, 628 flow. Second operand has 3 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:50,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:50,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 313 [2025-03-14 01:42:50,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:50,515 INFO L124 PetriNetUnfolderBase]: 46/1179 cut-off events. [2025-03-14 01:42:50,516 INFO L125 PetriNetUnfolderBase]: For 13/18 co-relation queries the response was YES. [2025-03-14 01:42:50,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1376 conditions, 1179 events. 46/1179 cut-off events. For 13/18 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 7440 event pairs, 4 based on Foata normal form. 0/1100 useless extension candidates. Maximal degree in co-relation 1175. Up to 43 conditions per place. [2025-03-14 01:42:50,521 INFO L140 encePairwiseOnDemand]: 309/313 looper letters, 12 selfloop transitions, 2 changer transitions 0/278 dead transitions. [2025-03-14 01:42:50,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 278 transitions, 665 flow [2025-03-14 01:42:50,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:50,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:50,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 898 transitions. [2025-03-14 01:42:50,523 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9563365282215123 [2025-03-14 01:42:50,523 INFO L175 Difference]: Start difference. First operand has 271 places, 275 transitions, 628 flow. Second operand 3 states and 898 transitions. [2025-03-14 01:42:50,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 278 transitions, 665 flow [2025-03-14 01:42:50,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 278 transitions, 661 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:50,527 INFO L231 Difference]: Finished difference. Result has 270 places, 275 transitions, 634 flow [2025-03-14 01:42:50,527 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=620, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=634, PETRI_PLACES=270, PETRI_TRANSITIONS=275} [2025-03-14 01:42:50,528 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, -12 predicate places. [2025-03-14 01:42:50,528 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 275 transitions, 634 flow [2025-03-14 01:42:50,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:50,528 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:50,529 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-14 01:42:50,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-14 01:42:50,529 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-03-14 01:42:50,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:50,529 INFO L85 PathProgramCache]: Analyzing trace with hash -866122088, now seen corresponding path program 1 times [2025-03-14 01:42:50,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:50,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079397767] [2025-03-14 01:42:50,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:50,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:50,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-14 01:42:50,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-14 01:42:50,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:50,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:50,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:42:50,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:50,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079397767] [2025-03-14 01:42:50,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079397767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:50,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:50,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:50,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040128517] [2025-03-14 01:42:50,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:50,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:50,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:50,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:50,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:50,587 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 313 [2025-03-14 01:42:50,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 275 transitions, 634 flow. Second operand has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:50,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:50,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 313 [2025-03-14 01:42:50,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:50,663 INFO L124 PetriNetUnfolderBase]: 43/1137 cut-off events. [2025-03-14 01:42:50,664 INFO L125 PetriNetUnfolderBase]: For 6/12 co-relation queries the response was YES. [2025-03-14 01:42:50,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1315 conditions, 1137 events. 43/1137 cut-off events. For 6/12 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 7052 event pairs, 3 based on Foata normal form. 0/1063 useless extension candidates. Maximal degree in co-relation 1121. Up to 30 conditions per place. [2025-03-14 01:42:50,670 INFO L140 encePairwiseOnDemand]: 309/313 looper letters, 10 selfloop transitions, 1 changer transitions 0/272 dead transitions. [2025-03-14 01:42:50,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 272 transitions, 650 flow [2025-03-14 01:42:50,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:50,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:50,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 887 transitions. [2025-03-14 01:42:50,672 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9446219382321619 [2025-03-14 01:42:50,672 INFO L175 Difference]: Start difference. First operand has 270 places, 275 transitions, 634 flow. Second operand 3 states and 887 transitions. [2025-03-14 01:42:50,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 272 transitions, 650 flow [2025-03-14 01:42:50,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 272 transitions, 650 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:42:50,676 INFO L231 Difference]: Finished difference. Result has 269 places, 272 transitions, 630 flow [2025-03-14 01:42:50,677 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=628, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=630, PETRI_PLACES=269, PETRI_TRANSITIONS=272} [2025-03-14 01:42:50,677 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, -13 predicate places. [2025-03-14 01:42:50,677 INFO L471 AbstractCegarLoop]: Abstraction has has 269 places, 272 transitions, 630 flow [2025-03-14 01:42:50,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:50,678 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:50,678 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-14 01:42:50,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-14 01:42:50,678 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-03-14 01:42:50,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:50,679 INFO L85 PathProgramCache]: Analyzing trace with hash 396513737, now seen corresponding path program 1 times [2025-03-14 01:42:50,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:50,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061510233] [2025-03-14 01:42:50,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:50,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:50,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-14 01:42:50,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-14 01:42:50,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:50,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:50,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:42:50,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:50,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061510233] [2025-03-14 01:42:50,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061510233] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:50,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:50,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:50,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285008482] [2025-03-14 01:42:50,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:50,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:50,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:50,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:50,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:50,749 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 313 [2025-03-14 01:42:50,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 272 transitions, 630 flow. Second operand has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:50,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:50,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 313 [2025-03-14 01:42:50,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:50,803 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([790] thread1EXIT-->L69: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][169], [Black: 349#true, Black: 323#true, 16#L69true, Black: 327#true, 325#(= |#race~isNull_0~0| 0), 344#(= |#race~filename_1~0| 0), Black: 331#true, 10#L50-5true, 329#(= |#race~isNull_3~0| 0), 353#true, Black: 338#true, 351#(= |#race~filename_4~0| 0), Black: 342#true, 356#true, 340#(= |#race~filename_5~0| 0), 333#(= |#race~filename_2~0| 0)]) [2025-03-14 01:42:50,804 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2025-03-14 01:42:50,804 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-03-14 01:42:50,804 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-03-14 01:42:50,804 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-03-14 01:42:50,807 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([727] L50-7-->L50-5: Formula: (= |v_#race~result_7~0_3| |v_thread2Thread1of1ForFork0_#t~nondet12#1_3|) InVars {thread2Thread1of1ForFork0_#t~nondet12#1=|v_thread2Thread1of1ForFork0_#t~nondet12#1_3|} OutVars{#race~result_7~0=|v_#race~result_7~0_3|, thread2Thread1of1ForFork0_#t~nondet12#1=|v_thread2Thread1of1ForFork0_#t~nondet12#1_3|} AuxVars[] AssignedVars[#race~result_7~0][140], [Black: 349#true, Black: 323#true, 16#L69true, Black: 327#true, 325#(= |#race~isNull_0~0| 0), 344#(= |#race~filename_1~0| 0), Black: 331#true, 10#L50-5true, 329#(= |#race~isNull_3~0| 0), 353#true, Black: 338#true, 351#(= |#race~filename_4~0| 0), Black: 342#true, 356#true, 340#(= |#race~filename_5~0| 0), 333#(= |#race~filename_2~0| 0)]) [2025-03-14 01:42:50,807 INFO L294 olderBase$Statistics]: this new event has 180 ancestors and is cut-off event [2025-03-14 01:42:50,808 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-03-14 01:42:50,808 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-03-14 01:42:50,808 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-03-14 01:42:50,808 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([790] thread1EXIT-->L69: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][169], [Black: 349#true, Black: 323#true, 16#L69true, Black: 327#true, 325#(= |#race~isNull_0~0| 0), 344#(= |#race~filename_1~0| 0), Black: 331#true, 10#L50-5true, 329#(= |#race~isNull_3~0| 0), 353#true, Black: 338#true, 351#(= |#race~filename_4~0| 0), Black: 342#true, 356#true, 340#(= |#race~filename_5~0| 0), 333#(= |#race~filename_2~0| 0)]) [2025-03-14 01:42:50,808 INFO L294 olderBase$Statistics]: this new event has 180 ancestors and is cut-off event [2025-03-14 01:42:50,809 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-03-14 01:42:50,809 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-03-14 01:42:50,809 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-03-14 01:42:50,809 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-03-14 01:42:50,812 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([727] L50-7-->L50-5: Formula: (= |v_#race~result_7~0_3| |v_thread2Thread1of1ForFork0_#t~nondet12#1_3|) InVars {thread2Thread1of1ForFork0_#t~nondet12#1=|v_thread2Thread1of1ForFork0_#t~nondet12#1_3|} OutVars{#race~result_7~0=|v_#race~result_7~0_3|, thread2Thread1of1ForFork0_#t~nondet12#1=|v_thread2Thread1of1ForFork0_#t~nondet12#1_3|} AuxVars[] AssignedVars[#race~result_7~0][140], [Black: 349#true, Black: 323#true, 16#L69true, Black: 327#true, 325#(= |#race~isNull_0~0| 0), 344#(= |#race~filename_1~0| 0), Black: 331#true, 10#L50-5true, 329#(= |#race~isNull_3~0| 0), 353#true, Black: 338#true, 351#(= |#race~filename_4~0| 0), Black: 342#true, 356#true, 340#(= |#race~filename_5~0| 0), 333#(= |#race~filename_2~0| 0)]) [2025-03-14 01:42:50,812 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is not cut-off event [2025-03-14 01:42:50,812 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is not cut-off event [2025-03-14 01:42:50,812 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is not cut-off event [2025-03-14 01:42:50,812 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is not cut-off event [2025-03-14 01:42:50,812 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is not cut-off event [2025-03-14 01:42:50,817 INFO L124 PetriNetUnfolderBase]: 47/1092 cut-off events. [2025-03-14 01:42:50,818 INFO L125 PetriNetUnfolderBase]: For 15/18 co-relation queries the response was YES. [2025-03-14 01:42:50,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1276 conditions, 1092 events. 47/1092 cut-off events. For 15/18 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 6286 event pairs, 3 based on Foata normal form. 3/1031 useless extension candidates. Maximal degree in co-relation 1078. Up to 47 conditions per place. [2025-03-14 01:42:50,821 INFO L140 encePairwiseOnDemand]: 307/313 looper letters, 0 selfloop transitions, 0 changer transitions 271/271 dead transitions. [2025-03-14 01:42:50,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 271 transitions, 652 flow [2025-03-14 01:42:50,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:50,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:50,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 888 transitions. [2025-03-14 01:42:50,823 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9456869009584664 [2025-03-14 01:42:50,823 INFO L175 Difference]: Start difference. First operand has 269 places, 272 transitions, 630 flow. Second operand 3 states and 888 transitions. [2025-03-14 01:42:50,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 271 transitions, 652 flow [2025-03-14 01:42:50,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 271 transitions, 651 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:42:50,826 INFO L231 Difference]: Finished difference. Result has 267 places, 0 transitions, 0 flow [2025-03-14 01:42:50,826 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=623, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=267, PETRI_TRANSITIONS=0} [2025-03-14 01:42:50,826 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, -15 predicate places. [2025-03-14 01:42:50,826 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 0 transitions, 0 flow [2025-03-14 01:42:50,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:42:50,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (49 of 50 remaining) [2025-03-14 01:42:50,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (48 of 50 remaining) [2025-03-14 01:42:50,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (47 of 50 remaining) [2025-03-14 01:42:50,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (46 of 50 remaining) [2025-03-14 01:42:50,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (45 of 50 remaining) [2025-03-14 01:42:50,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (44 of 50 remaining) [2025-03-14 01:42:50,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (43 of 50 remaining) [2025-03-14 01:42:50,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (42 of 50 remaining) [2025-03-14 01:42:50,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (41 of 50 remaining) [2025-03-14 01:42:50,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (40 of 50 remaining) [2025-03-14 01:42:50,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (39 of 50 remaining) [2025-03-14 01:42:50,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (38 of 50 remaining) [2025-03-14 01:42:50,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (37 of 50 remaining) [2025-03-14 01:42:50,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (36 of 50 remaining) [2025-03-14 01:42:50,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (35 of 50 remaining) [2025-03-14 01:42:50,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (34 of 50 remaining) [2025-03-14 01:42:50,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (33 of 50 remaining) [2025-03-14 01:42:50,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (32 of 50 remaining) [2025-03-14 01:42:50,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (31 of 50 remaining) [2025-03-14 01:42:50,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (30 of 50 remaining) [2025-03-14 01:42:50,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (29 of 50 remaining) [2025-03-14 01:42:50,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (28 of 50 remaining) [2025-03-14 01:42:50,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (27 of 50 remaining) [2025-03-14 01:42:50,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (26 of 50 remaining) [2025-03-14 01:42:50,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (25 of 50 remaining) [2025-03-14 01:42:50,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (24 of 50 remaining) [2025-03-14 01:42:50,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (23 of 50 remaining) [2025-03-14 01:42:50,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (22 of 50 remaining) [2025-03-14 01:42:50,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (21 of 50 remaining) [2025-03-14 01:42:50,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (20 of 50 remaining) [2025-03-14 01:42:50,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 50 remaining) [2025-03-14 01:42:50,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 50 remaining) [2025-03-14 01:42:50,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (17 of 50 remaining) [2025-03-14 01:42:50,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (16 of 50 remaining) [2025-03-14 01:42:50,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (15 of 50 remaining) [2025-03-14 01:42:50,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (14 of 50 remaining) [2025-03-14 01:42:50,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (13 of 50 remaining) [2025-03-14 01:42:50,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (12 of 50 remaining) [2025-03-14 01:42:50,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (11 of 50 remaining) [2025-03-14 01:42:50,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (10 of 50 remaining) [2025-03-14 01:42:50,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (9 of 50 remaining) [2025-03-14 01:42:50,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (8 of 50 remaining) [2025-03-14 01:42:50,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (7 of 50 remaining) [2025-03-14 01:42:50,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (6 of 50 remaining) [2025-03-14 01:42:50,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (5 of 50 remaining) [2025-03-14 01:42:50,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (4 of 50 remaining) [2025-03-14 01:42:50,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (3 of 50 remaining) [2025-03-14 01:42:50,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (2 of 50 remaining) [2025-03-14 01:42:50,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (1 of 50 remaining) [2025-03-14 01:42:50,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (0 of 50 remaining) [2025-03-14 01:42:50,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-14 01:42:50,832 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:42:50,836 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-14 01:42:50,836 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-14 01:42:50,839 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.03 01:42:50 BasicIcfg [2025-03-14 01:42:50,839 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-14 01:42:50,840 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-14 01:42:50,840 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-14 01:42:50,840 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-14 01:42:50,840 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:42:47" (3/4) ... [2025-03-14 01:42:50,841 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-14 01:42:50,844 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-14 01:42:50,844 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-14 01:42:50,847 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-14 01:42:50,847 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-14 01:42:50,847 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-14 01:42:50,848 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-14 01:42:50,918 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-14 01:42:50,919 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-14 01:42:50,919 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-14 01:42:50,919 INFO L158 Benchmark]: Toolchain (without parser) took 3772.05ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 105.2MB in the beginning and 225.3MB in the end (delta: -120.1MB). Peak memory consumption was 61.6MB. Max. memory is 16.1GB. [2025-03-14 01:42:50,920 INFO L158 Benchmark]: CDTParser took 0.53ms. Allocated memory is still 201.3MB. Free memory was 126.8MB in the beginning and 126.5MB in the end (delta: 307.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:42:50,920 INFO L158 Benchmark]: CACSL2BoogieTranslator took 171.38ms. Allocated memory is still 142.6MB. Free memory was 105.2MB in the beginning and 93.8MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 01:42:50,920 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.99ms. Allocated memory is still 142.6MB. Free memory was 93.0MB in the beginning and 90.8MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 01:42:50,920 INFO L158 Benchmark]: Boogie Preprocessor took 27.63ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 89.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:42:50,920 INFO L158 Benchmark]: IcfgBuilder took 453.23ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 68.4MB in the end (delta: 21.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-14 01:42:50,920 INFO L158 Benchmark]: TraceAbstraction took 2998.51ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 67.8MB in the beginning and 232.7MB in the end (delta: -164.9MB). Peak memory consumption was 19.7MB. Max. memory is 16.1GB. [2025-03-14 01:42:50,920 INFO L158 Benchmark]: Witness Printer took 78.89ms. Allocated memory is still 327.2MB. Free memory was 232.7MB in the beginning and 225.3MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 01:42:50,922 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.53ms. Allocated memory is still 201.3MB. Free memory was 126.8MB in the beginning and 126.5MB in the end (delta: 307.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 171.38ms. Allocated memory is still 142.6MB. Free memory was 105.2MB in the beginning and 93.8MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.99ms. Allocated memory is still 142.6MB. Free memory was 93.0MB in the beginning and 90.8MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.63ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 89.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 453.23ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 68.4MB in the end (delta: 21.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2998.51ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 67.8MB in the beginning and 232.7MB in the end (delta: -164.9MB). Peak memory consumption was 19.7MB. Max. memory is 16.1GB. * Witness Printer took 78.89ms. Allocated memory is still 327.2MB. Free memory was 232.7MB in the beginning and 225.3MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: 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: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: 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 5 procedures, 448 locations, 50 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: 2.9s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 351 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 103 mSDsluCounter, 106 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 61 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 403 IncrementalHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 61 mSolverCounterUnsat, 106 mSDtfsCounter, 403 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=634occurred in iteration=14, InterpolantAutomatonStates: 48, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 1158 NumberOfCodeBlocks, 1158 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1142 ConstructedInterpolants, 0 QuantifiedInterpolants, 1174 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 30 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-14 01:42:50,934 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