./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-more-buffer-series.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-buffer-series.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 8dbd267b0e0821e8d358e8d234024d8e484ea32431972ed8b70b87052179a50c --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 22:25:51,356 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 22:25:51,412 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 22:25:51,416 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 22:25:51,420 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 22:25:51,442 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 22:25:51,443 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 22:25:51,443 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 22:25:51,444 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 22:25:51,444 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 22:25:51,445 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 22:25:51,445 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 22:25:51,445 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 22:25:51,445 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 22:25:51,445 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 22:25:51,445 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 22:25:51,446 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 22:25:51,446 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 22:25:51,446 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 22:25:51,446 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 22:25:51,446 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 22:25:51,446 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 22:25:51,446 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 22:25:51,446 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 22:25:51,447 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 22:25:51,447 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 22:25:51,447 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 22:25:51,447 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 22:25:51,447 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 22:25:51,447 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 22:25:51,447 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 22:25:51,447 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:25:51,447 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 22:25:51,448 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 22:25:51,448 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 22:25:51,448 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 22:25:51,448 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 22:25:51,449 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 22:25:51,449 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 22:25:51,449 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 22:25:51,449 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 22:25:51,449 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 22:25:51,449 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 -> 8dbd267b0e0821e8d358e8d234024d8e484ea32431972ed8b70b87052179a50c [2025-03-13 22:25:51,656 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 22:25:51,665 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 22:25:51,667 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 22:25:51,668 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 22:25:51,668 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 22:25:51,670 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-buffer-series.wvr.c [2025-03-13 22:25:52,852 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36d8cd69f/a6865cf96c514bf7999b7c5cc421b071/FLAG49c105fc0 [2025-03-13 22:25:53,132 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 22:25:53,136 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-buffer-series.wvr.c [2025-03-13 22:25:53,145 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36d8cd69f/a6865cf96c514bf7999b7c5cc421b071/FLAG49c105fc0 [2025-03-13 22:25:53,163 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36d8cd69f/a6865cf96c514bf7999b7c5cc421b071 [2025-03-13 22:25:53,165 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 22:25:53,166 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 22:25:53,167 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 22:25:53,167 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 22:25:53,171 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 22:25:53,172 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:25:53" (1/1) ... [2025-03-13 22:25:53,173 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c5421e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:53, skipping insertion in model container [2025-03-13 22:25:53,174 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:25:53" (1/1) ... [2025-03-13 22:25:53,191 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 22:25:53,347 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:25:53,356 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 22:25:53,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:25:53,410 INFO L204 MainTranslator]: Completed translation [2025-03-13 22:25:53,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:53 WrapperNode [2025-03-13 22:25:53,412 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 22:25:53,413 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 22:25:53,413 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 22:25:53,413 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 22:25:53,418 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:53" (1/1) ... [2025-03-13 22:25:53,428 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:53" (1/1) ... [2025-03-13 22:25:53,475 INFO L138 Inliner]: procedures = 26, calls = 68, calls flagged for inlining = 23, calls inlined = 29, statements flattened = 631 [2025-03-13 22:25:53,475 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 22:25:53,476 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 22:25:53,476 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 22:25:53,476 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 22:25:53,485 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:53" (1/1) ... [2025-03-13 22:25:53,485 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:53" (1/1) ... [2025-03-13 22:25:53,494 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:53" (1/1) ... [2025-03-13 22:25:53,498 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:53" (1/1) ... [2025-03-13 22:25:53,517 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:53" (1/1) ... [2025-03-13 22:25:53,525 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:53" (1/1) ... [2025-03-13 22:25:53,527 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:53" (1/1) ... [2025-03-13 22:25:53,528 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:53" (1/1) ... [2025-03-13 22:25:53,534 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 22:25:53,539 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 22:25:53,539 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 22:25:53,539 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 22:25:53,540 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:53" (1/1) ... [2025-03-13 22:25:53,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:25:53,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:25:53,570 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-13 22:25:53,572 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-13 22:25:53,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 22:25:53,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-13 22:25:53,592 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-13 22:25:53,592 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-13 22:25:53,592 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-13 22:25:53,592 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-13 22:25:53,593 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-13 22:25:53,593 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-13 22:25:53,593 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-13 22:25:53,593 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-13 22:25:53,593 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-13 22:25:53,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 22:25:53,593 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-13 22:25:53,593 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-13 22:25:53,593 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-13 22:25:53,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 22:25:53,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 22:25:53,595 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 22:25:53,702 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 22:25:53,704 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 22:25:54,416 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 22:25:54,416 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 22:25:54,417 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 22:25:54,963 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 22:25:54,963 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:25:54 BoogieIcfgContainer [2025-03-13 22:25:54,964 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 22:25:54,965 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 22:25:54,965 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 22:25:54,968 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 22:25:54,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 10:25:53" (1/3) ... [2025-03-13 22:25:54,969 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b9508cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:25:54, skipping insertion in model container [2025-03-13 22:25:54,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:53" (2/3) ... [2025-03-13 22:25:54,969 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b9508cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:25:54, skipping insertion in model container [2025-03-13 22:25:54,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:25:54" (3/3) ... [2025-03-13 22:25:54,970 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-series.wvr.c [2025-03-13 22:25:54,981 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 22:25:54,982 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-buffer-series.wvr.c that has 5 procedures, 417 locations, 1 initial locations, 7 loop locations, and 99 error locations. [2025-03-13 22:25:54,982 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 22:25:55,103 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-13 22:25:55,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 429 places, 431 transitions, 890 flow [2025-03-13 22:25:55,254 INFO L124 PetriNetUnfolderBase]: 15/427 cut-off events. [2025-03-13 22:25:55,260 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-13 22:25:55,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 444 conditions, 427 events. 15/427 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 674 event pairs, 0 based on Foata normal form. 0/313 useless extension candidates. Maximal degree in co-relation 379. Up to 2 conditions per place. [2025-03-13 22:25:55,276 INFO L82 GeneralOperation]: Start removeDead. Operand has 429 places, 431 transitions, 890 flow [2025-03-13 22:25:55,284 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 409 places, 410 transitions, 844 flow [2025-03-13 22:25:55,290 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:25:55,297 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;@4749a7e5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:25:55,297 INFO L334 AbstractCegarLoop]: Starting to check reachability of 182 error locations. [2025-03-13 22:25:55,302 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:25:55,302 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2025-03-13 22:25:55,302 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:25:55,302 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:55,303 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:25:55,303 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 178 more)] === [2025-03-13 22:25:55,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:55,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1745459089, now seen corresponding path program 1 times [2025-03-13 22:25:55,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:55,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920353966] [2025-03-13 22:25:55,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:55,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:55,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-13 22:25:55,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-13 22:25:55,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:55,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:55,446 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-13 22:25:55,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:55,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920353966] [2025-03-13 22:25:55,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920353966] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:55,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:55,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:25:55,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596573512] [2025-03-13 22:25:55,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:55,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:25:55,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:55,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:25:55,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:25:55,503 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 312 out of 431 [2025-03-13 22:25:55,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 410 transitions, 844 flow. Second operand has 3 states, 3 states have (on average 313.3333333333333) internal successors, (940), 3 states have internal predecessors, (940), 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-13 22:25:55,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:55,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 312 of 431 [2025-03-13 22:25:55,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:56,000 INFO L124 PetriNetUnfolderBase]: 745/1700 cut-off events. [2025-03-13 22:25:56,000 INFO L125 PetriNetUnfolderBase]: For 214/214 co-relation queries the response was YES. [2025-03-13 22:25:56,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2903 conditions, 1700 events. 745/1700 cut-off events. For 214/214 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8810 event pairs, 485 based on Foata normal form. 7/1547 useless extension candidates. Maximal degree in co-relation 2496. Up to 1009 conditions per place. [2025-03-13 22:25:56,013 INFO L140 encePairwiseOnDemand]: 342/431 looper letters, 27 selfloop transitions, 2 changer transitions 7/323 dead transitions. [2025-03-13 22:25:56,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 323 transitions, 728 flow [2025-03-13 22:25:56,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:25:56,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:25:56,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1052 transitions. [2025-03-13 22:25:56,028 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8136117556071152 [2025-03-13 22:25:56,032 INFO L175 Difference]: Start difference. First operand has 409 places, 410 transitions, 844 flow. Second operand 3 states and 1052 transitions. [2025-03-13 22:25:56,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 323 transitions, 728 flow [2025-03-13 22:25:56,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 323 transitions, 712 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-13 22:25:56,043 INFO L231 Difference]: Finished difference. Result has 323 places, 316 transitions, 644 flow [2025-03-13 22:25:56,046 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=644, PETRI_PLACES=323, PETRI_TRANSITIONS=316} [2025-03-13 22:25:56,048 INFO L279 CegarLoopForPetriNet]: 409 programPoint places, -86 predicate places. [2025-03-13 22:25:56,048 INFO L471 AbstractCegarLoop]: Abstraction has has 323 places, 316 transitions, 644 flow [2025-03-13 22:25:56,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 313.3333333333333) internal successors, (940), 3 states have internal predecessors, (940), 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-13 22:25:56,049 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:56,049 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] [2025-03-13 22:25:56,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 22:25:56,049 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 178 more)] === [2025-03-13 22:25:56,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:56,050 INFO L85 PathProgramCache]: Analyzing trace with hash -119049280, now seen corresponding path program 1 times [2025-03-13 22:25:56,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:56,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527794670] [2025-03-13 22:25:56,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:56,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:56,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-13 22:25:56,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-13 22:25:56,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:56,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:56,112 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-13 22:25:56,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:56,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527794670] [2025-03-13 22:25:56,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527794670] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:56,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:56,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:25:56,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453805365] [2025-03-13 22:25:56,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:56,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:25:56,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:56,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:25:56,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:25:56,129 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 431 [2025-03-13 22:25:56,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 316 transitions, 644 flow. Second operand has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:56,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:56,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 431 [2025-03-13 22:25:56,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:56,423 INFO L124 PetriNetUnfolderBase]: 745/1692 cut-off events. [2025-03-13 22:25:56,423 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-03-13 22:25:56,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2775 conditions, 1692 events. 745/1692 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8823 event pairs, 485 based on Foata normal form. 0/1540 useless extension candidates. Maximal degree in co-relation 2736. Up to 1008 conditions per place. [2025-03-13 22:25:56,432 INFO L140 encePairwiseOnDemand]: 428/431 looper letters, 26 selfloop transitions, 2 changer transitions 0/315 dead transitions. [2025-03-13 22:25:56,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 315 transitions, 698 flow [2025-03-13 22:25:56,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:25:56,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:25:56,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 968 transitions. [2025-03-13 22:25:56,435 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.748646558391338 [2025-03-13 22:25:56,435 INFO L175 Difference]: Start difference. First operand has 323 places, 316 transitions, 644 flow. Second operand 3 states and 968 transitions. [2025-03-13 22:25:56,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 315 transitions, 698 flow [2025-03-13 22:25:56,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 315 transitions, 694 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:25:56,440 INFO L231 Difference]: Finished difference. Result has 315 places, 315 transitions, 642 flow [2025-03-13 22:25:56,440 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=638, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=642, PETRI_PLACES=315, PETRI_TRANSITIONS=315} [2025-03-13 22:25:56,441 INFO L279 CegarLoopForPetriNet]: 409 programPoint places, -94 predicate places. [2025-03-13 22:25:56,441 INFO L471 AbstractCegarLoop]: Abstraction has has 315 places, 315 transitions, 642 flow [2025-03-13 22:25:56,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:56,442 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:56,442 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] [2025-03-13 22:25:56,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 22:25:56,442 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 178 more)] === [2025-03-13 22:25:56,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:56,443 INFO L85 PathProgramCache]: Analyzing trace with hash -512510493, now seen corresponding path program 1 times [2025-03-13 22:25:56,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:56,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257085544] [2025-03-13 22:25:56,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:56,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:56,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-13 22:25:56,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-13 22:25:56,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:56,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:56,494 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-13 22:25:56,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:56,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257085544] [2025-03-13 22:25:56,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257085544] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:56,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:56,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:25:56,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244921819] [2025-03-13 22:25:56,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:56,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:25:56,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:56,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:25:56,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:25:56,515 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 431 [2025-03-13 22:25:56,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 315 transitions, 642 flow. Second operand has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:56,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:56,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 431 [2025-03-13 22:25:56,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:56,776 INFO L124 PetriNetUnfolderBase]: 745/1691 cut-off events. [2025-03-13 22:25:56,776 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-03-13 22:25:56,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2774 conditions, 1691 events. 745/1691 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8776 event pairs, 485 based on Foata normal form. 0/1540 useless extension candidates. Maximal degree in co-relation 2727. Up to 1008 conditions per place. [2025-03-13 22:25:56,786 INFO L140 encePairwiseOnDemand]: 428/431 looper letters, 26 selfloop transitions, 2 changer transitions 0/314 dead transitions. [2025-03-13 22:25:56,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 314 transitions, 696 flow [2025-03-13 22:25:56,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:25:56,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:25:56,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 968 transitions. [2025-03-13 22:25:56,790 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.748646558391338 [2025-03-13 22:25:56,790 INFO L175 Difference]: Start difference. First operand has 315 places, 315 transitions, 642 flow. Second operand 3 states and 968 transitions. [2025-03-13 22:25:56,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 314 transitions, 696 flow [2025-03-13 22:25:56,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 314 transitions, 692 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:25:56,795 INFO L231 Difference]: Finished difference. Result has 314 places, 314 transitions, 640 flow [2025-03-13 22:25:56,796 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=640, PETRI_PLACES=314, PETRI_TRANSITIONS=314} [2025-03-13 22:25:56,797 INFO L279 CegarLoopForPetriNet]: 409 programPoint places, -95 predicate places. [2025-03-13 22:25:56,797 INFO L471 AbstractCegarLoop]: Abstraction has has 314 places, 314 transitions, 640 flow [2025-03-13 22:25:56,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:56,798 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:56,798 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] [2025-03-13 22:25:56,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 22:25:56,798 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 178 more)] === [2025-03-13 22:25:56,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:56,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1716954058, now seen corresponding path program 1 times [2025-03-13 22:25:56,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:56,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121717341] [2025-03-13 22:25:56,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:56,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:56,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-13 22:25:56,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-13 22:25:56,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:56,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:56,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:25:56,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:56,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121717341] [2025-03-13 22:25:56,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121717341] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:56,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:56,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:25:56,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660161016] [2025-03-13 22:25:56,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:56,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:25:56,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:56,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:25:56,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:25:56,874 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 431 [2025-03-13 22:25:56,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 314 transitions, 640 flow. Second operand has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:56,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:56,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 431 [2025-03-13 22:25:56,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:57,167 INFO L124 PetriNetUnfolderBase]: 745/1690 cut-off events. [2025-03-13 22:25:57,168 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-03-13 22:25:57,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2773 conditions, 1690 events. 745/1690 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8772 event pairs, 485 based on Foata normal form. 0/1540 useless extension candidates. Maximal degree in co-relation 2718. Up to 1008 conditions per place. [2025-03-13 22:25:57,177 INFO L140 encePairwiseOnDemand]: 428/431 looper letters, 26 selfloop transitions, 2 changer transitions 0/313 dead transitions. [2025-03-13 22:25:57,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 313 transitions, 694 flow [2025-03-13 22:25:57,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:25:57,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:25:57,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 968 transitions. [2025-03-13 22:25:57,180 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.748646558391338 [2025-03-13 22:25:57,180 INFO L175 Difference]: Start difference. First operand has 314 places, 314 transitions, 640 flow. Second operand 3 states and 968 transitions. [2025-03-13 22:25:57,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 313 transitions, 694 flow [2025-03-13 22:25:57,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 313 transitions, 690 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:25:57,183 INFO L231 Difference]: Finished difference. Result has 313 places, 313 transitions, 638 flow [2025-03-13 22:25:57,184 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=634, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=638, PETRI_PLACES=313, PETRI_TRANSITIONS=313} [2025-03-13 22:25:57,185 INFO L279 CegarLoopForPetriNet]: 409 programPoint places, -96 predicate places. [2025-03-13 22:25:57,185 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 313 transitions, 638 flow [2025-03-13 22:25:57,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:57,186 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:57,186 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:25:57,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 22:25:57,186 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 178 more)] === [2025-03-13 22:25:57,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:57,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1269581761, now seen corresponding path program 1 times [2025-03-13 22:25:57,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:57,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724008541] [2025-03-13 22:25:57,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:57,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:57,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-13 22:25:57,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-13 22:25:57,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:57,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:57,240 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-13 22:25:57,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:57,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724008541] [2025-03-13 22:25:57,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724008541] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:57,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:57,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:25:57,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759265111] [2025-03-13 22:25:57,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:57,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:25:57,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:57,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:25:57,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:25:57,248 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 431 [2025-03-13 22:25:57,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 313 transitions, 638 flow. Second operand has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:57,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:57,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 431 [2025-03-13 22:25:57,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:57,539 INFO L124 PetriNetUnfolderBase]: 982/2330 cut-off events. [2025-03-13 22:25:57,539 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2025-03-13 22:25:57,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3746 conditions, 2330 events. 982/2330 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 14371 event pairs, 392 based on Foata normal form. 0/2110 useless extension candidates. Maximal degree in co-relation 3683. Up to 714 conditions per place. [2025-03-13 22:25:57,550 INFO L140 encePairwiseOnDemand]: 428/431 looper letters, 40 selfloop transitions, 2 changer transitions 0/329 dead transitions. [2025-03-13 22:25:57,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 329 transitions, 759 flow [2025-03-13 22:25:57,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:25:57,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:25:57,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 994 transitions. [2025-03-13 22:25:57,552 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.768754833720031 [2025-03-13 22:25:57,552 INFO L175 Difference]: Start difference. First operand has 313 places, 313 transitions, 638 flow. Second operand 3 states and 994 transitions. [2025-03-13 22:25:57,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 329 transitions, 759 flow [2025-03-13 22:25:57,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 329 transitions, 755 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:25:57,556 INFO L231 Difference]: Finished difference. Result has 313 places, 313 transitions, 642 flow [2025-03-13 22:25:57,557 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=632, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=642, PETRI_PLACES=313, PETRI_TRANSITIONS=313} [2025-03-13 22:25:57,557 INFO L279 CegarLoopForPetriNet]: 409 programPoint places, -96 predicate places. [2025-03-13 22:25:57,557 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 313 transitions, 642 flow [2025-03-13 22:25:57,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:57,558 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:57,558 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] [2025-03-13 22:25:57,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 22:25:57,558 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 178 more)] === [2025-03-13 22:25:57,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:57,559 INFO L85 PathProgramCache]: Analyzing trace with hash 2062579139, now seen corresponding path program 1 times [2025-03-13 22:25:57,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:57,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421727917] [2025-03-13 22:25:57,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:57,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:57,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-13 22:25:57,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-13 22:25:57,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:57,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:57,610 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-13 22:25:57,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:57,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421727917] [2025-03-13 22:25:57,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421727917] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:57,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:57,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:25:57,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111852878] [2025-03-13 22:25:57,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:57,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:25:57,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:57,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:25:57,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:25:57,621 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 431 [2025-03-13 22:25:57,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 313 transitions, 642 flow. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:57,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:57,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 431 [2025-03-13 22:25:57,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:57,898 INFO L124 PetriNetUnfolderBase]: 982/2326 cut-off events. [2025-03-13 22:25:57,898 INFO L125 PetriNetUnfolderBase]: For 225/225 co-relation queries the response was YES. [2025-03-13 22:25:57,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3981 conditions, 2326 events. 982/2326 cut-off events. For 225/225 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 14499 event pairs, 665 based on Foata normal form. 0/2099 useless extension candidates. Maximal degree in co-relation 2132. Up to 1327 conditions per place. [2025-03-13 22:25:57,912 INFO L140 encePairwiseOnDemand]: 428/431 looper letters, 26 selfloop transitions, 2 changer transitions 0/312 dead transitions. [2025-03-13 22:25:57,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 312 transitions, 696 flow [2025-03-13 22:25:57,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:25:57,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:25:57,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 970 transitions. [2025-03-13 22:25:57,914 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7501933488012374 [2025-03-13 22:25:57,914 INFO L175 Difference]: Start difference. First operand has 313 places, 313 transitions, 642 flow. Second operand 3 states and 970 transitions. [2025-03-13 22:25:57,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 312 transitions, 696 flow [2025-03-13 22:25:57,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 312 transitions, 694 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:25:57,918 INFO L231 Difference]: Finished difference. Result has 313 places, 312 transitions, 642 flow [2025-03-13 22:25:57,919 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=638, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=642, PETRI_PLACES=313, PETRI_TRANSITIONS=312} [2025-03-13 22:25:57,919 INFO L279 CegarLoopForPetriNet]: 409 programPoint places, -96 predicate places. [2025-03-13 22:25:57,920 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 312 transitions, 642 flow [2025-03-13 22:25:57,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:57,921 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:57,921 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] [2025-03-13 22:25:57,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 22:25:57,921 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 178 more)] === [2025-03-13 22:25:57,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:57,922 INFO L85 PathProgramCache]: Analyzing trace with hash -507094483, now seen corresponding path program 1 times [2025-03-13 22:25:57,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:57,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222050918] [2025-03-13 22:25:57,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:57,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:57,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-13 22:25:57,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-13 22:25:57,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:57,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:57,959 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-13 22:25:57,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:57,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222050918] [2025-03-13 22:25:57,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222050918] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:57,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:57,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:25:57,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256159921] [2025-03-13 22:25:57,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:57,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:25:57,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:57,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:25:57,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:25:57,975 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 431 [2025-03-13 22:25:57,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 312 transitions, 642 flow. Second operand has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:57,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:57,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 431 [2025-03-13 22:25:57,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:58,271 INFO L124 PetriNetUnfolderBase]: 982/2325 cut-off events. [2025-03-13 22:25:58,273 INFO L125 PetriNetUnfolderBase]: For 224/224 co-relation queries the response was YES. [2025-03-13 22:25:58,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3904 conditions, 2325 events. 982/2325 cut-off events. For 224/224 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 14489 event pairs, 665 based on Foata normal form. 0/2099 useless extension candidates. Maximal degree in co-relation 3832. Up to 1328 conditions per place. [2025-03-13 22:25:58,283 INFO L140 encePairwiseOnDemand]: 428/431 looper letters, 27 selfloop transitions, 2 changer transitions 0/311 dead transitions. [2025-03-13 22:25:58,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 311 transitions, 698 flow [2025-03-13 22:25:58,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:25:58,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:25:58,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 968 transitions. [2025-03-13 22:25:58,286 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.748646558391338 [2025-03-13 22:25:58,286 INFO L175 Difference]: Start difference. First operand has 313 places, 312 transitions, 642 flow. Second operand 3 states and 968 transitions. [2025-03-13 22:25:58,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 311 transitions, 698 flow [2025-03-13 22:25:58,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 311 transitions, 694 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:25:58,292 INFO L231 Difference]: Finished difference. Result has 312 places, 311 transitions, 640 flow [2025-03-13 22:25:58,293 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=640, PETRI_PLACES=312, PETRI_TRANSITIONS=311} [2025-03-13 22:25:58,293 INFO L279 CegarLoopForPetriNet]: 409 programPoint places, -97 predicate places. [2025-03-13 22:25:58,294 INFO L471 AbstractCegarLoop]: Abstraction has has 312 places, 311 transitions, 640 flow [2025-03-13 22:25:58,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:58,295 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:58,295 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] [2025-03-13 22:25:58,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 22:25:58,296 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 178 more)] === [2025-03-13 22:25:58,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:58,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1995788498, now seen corresponding path program 1 times [2025-03-13 22:25:58,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:58,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785970224] [2025-03-13 22:25:58,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:58,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:58,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-13 22:25:58,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-13 22:25:58,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:58,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:58,343 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-13 22:25:58,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:58,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785970224] [2025-03-13 22:25:58,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785970224] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:58,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:58,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:25:58,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109580278] [2025-03-13 22:25:58,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:58,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:25:58,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:58,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:25:58,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:25:58,351 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 431 [2025-03-13 22:25:58,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 311 transitions, 640 flow. Second operand has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:58,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:58,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 431 [2025-03-13 22:25:58,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:58,722 INFO L124 PetriNetUnfolderBase]: 1232/2818 cut-off events. [2025-03-13 22:25:58,723 INFO L125 PetriNetUnfolderBase]: For 291/291 co-relation queries the response was YES. [2025-03-13 22:25:58,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4774 conditions, 2818 events. 1232/2818 cut-off events. For 291/291 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 18090 event pairs, 472 based on Foata normal form. 0/2558 useless extension candidates. Maximal degree in co-relation 4694. Up to 903 conditions per place. [2025-03-13 22:25:58,734 INFO L140 encePairwiseOnDemand]: 428/431 looper letters, 41 selfloop transitions, 2 changer transitions 0/327 dead transitions. [2025-03-13 22:25:58,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 327 transitions, 766 flow [2025-03-13 22:25:58,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:25:58,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:25:58,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 993 transitions. [2025-03-13 22:25:58,738 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7679814385150812 [2025-03-13 22:25:58,738 INFO L175 Difference]: Start difference. First operand has 312 places, 311 transitions, 640 flow. Second operand 3 states and 993 transitions. [2025-03-13 22:25:58,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 327 transitions, 766 flow [2025-03-13 22:25:58,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 327 transitions, 762 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:25:58,743 INFO L231 Difference]: Finished difference. Result has 312 places, 311 transitions, 644 flow [2025-03-13 22:25:58,744 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=634, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=644, PETRI_PLACES=312, PETRI_TRANSITIONS=311} [2025-03-13 22:25:58,744 INFO L279 CegarLoopForPetriNet]: 409 programPoint places, -97 predicate places. [2025-03-13 22:25:58,745 INFO L471 AbstractCegarLoop]: Abstraction has has 312 places, 311 transitions, 644 flow [2025-03-13 22:25:58,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:58,746 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:58,746 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] [2025-03-13 22:25:58,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 22:25:58,747 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 178 more)] === [2025-03-13 22:25:58,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:58,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1680340764, now seen corresponding path program 1 times [2025-03-13 22:25:58,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:58,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218123174] [2025-03-13 22:25:58,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:58,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:58,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-13 22:25:58,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-13 22:25:58,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:58,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:58,805 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-13 22:25:58,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:58,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218123174] [2025-03-13 22:25:58,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218123174] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:58,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:58,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:25:58,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118691235] [2025-03-13 22:25:58,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:58,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:25:58,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:58,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:25:58,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:25:58,813 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 431 [2025-03-13 22:25:58,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 311 transitions, 644 flow. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:58,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:58,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 431 [2025-03-13 22:25:58,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:59,194 INFO L124 PetriNetUnfolderBase]: 1232/3009 cut-off events. [2025-03-13 22:25:59,194 INFO L125 PetriNetUnfolderBase]: For 463/463 co-relation queries the response was YES. [2025-03-13 22:25:59,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5225 conditions, 3009 events. 1232/3009 cut-off events. For 463/463 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 21061 event pairs, 858 based on Foata normal form. 0/2695 useless extension candidates. Maximal degree in co-relation 3076. Up to 1665 conditions per place. [2025-03-13 22:25:59,205 INFO L140 encePairwiseOnDemand]: 428/431 looper letters, 27 selfloop transitions, 2 changer transitions 0/310 dead transitions. [2025-03-13 22:25:59,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 310 transitions, 700 flow [2025-03-13 22:25:59,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:25:59,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:25:59,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 970 transitions. [2025-03-13 22:25:59,208 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7501933488012374 [2025-03-13 22:25:59,208 INFO L175 Difference]: Start difference. First operand has 312 places, 311 transitions, 644 flow. Second operand 3 states and 970 transitions. [2025-03-13 22:25:59,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 310 transitions, 700 flow [2025-03-13 22:25:59,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 310 transitions, 698 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:25:59,212 INFO L231 Difference]: Finished difference. Result has 312 places, 310 transitions, 644 flow [2025-03-13 22:25:59,213 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=640, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=644, PETRI_PLACES=312, PETRI_TRANSITIONS=310} [2025-03-13 22:25:59,213 INFO L279 CegarLoopForPetriNet]: 409 programPoint places, -97 predicate places. [2025-03-13 22:25:59,213 INFO L471 AbstractCegarLoop]: Abstraction has has 312 places, 310 transitions, 644 flow [2025-03-13 22:25:59,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:59,214 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:59,214 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-13 22:25:59,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 22:25:59,214 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 178 more)] === [2025-03-13 22:25:59,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:59,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1185920988, now seen corresponding path program 1 times [2025-03-13 22:25:59,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:59,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227004904] [2025-03-13 22:25:59,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:59,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:59,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-13 22:25:59,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-13 22:25:59,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:59,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:59,251 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-13 22:25:59,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:59,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227004904] [2025-03-13 22:25:59,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227004904] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:59,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:59,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:25:59,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411156756] [2025-03-13 22:25:59,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:59,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:25:59,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:59,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:25:59,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:25:59,257 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 431 [2025-03-13 22:25:59,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 310 transitions, 644 flow. Second operand has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:59,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:59,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 431 [2025-03-13 22:25:59,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:59,611 INFO L124 PetriNetUnfolderBase]: 1232/3008 cut-off events. [2025-03-13 22:25:59,611 INFO L125 PetriNetUnfolderBase]: For 462/462 co-relation queries the response was YES. [2025-03-13 22:25:59,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5138 conditions, 3008 events. 1232/3008 cut-off events. For 462/462 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 21095 event pairs, 858 based on Foata normal form. 0/2695 useless extension candidates. Maximal degree in co-relation 5049. Up to 1663 conditions per place. [2025-03-13 22:25:59,623 INFO L140 encePairwiseOnDemand]: 429/431 looper letters, 26 selfloop transitions, 1 changer transitions 0/309 dead transitions. [2025-03-13 22:25:59,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 309 transitions, 696 flow [2025-03-13 22:25:59,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:25:59,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:25:59,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 977 transitions. [2025-03-13 22:25:59,626 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7556071152358855 [2025-03-13 22:25:59,627 INFO L175 Difference]: Start difference. First operand has 312 places, 310 transitions, 644 flow. Second operand 3 states and 977 transitions. [2025-03-13 22:25:59,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 309 transitions, 696 flow [2025-03-13 22:25:59,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 309 transitions, 692 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:25:59,631 INFO L231 Difference]: Finished difference. Result has 311 places, 309 transitions, 640 flow [2025-03-13 22:25:59,632 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=638, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=640, PETRI_PLACES=311, PETRI_TRANSITIONS=309} [2025-03-13 22:25:59,632 INFO L279 CegarLoopForPetriNet]: 409 programPoint places, -98 predicate places. [2025-03-13 22:25:59,632 INFO L471 AbstractCegarLoop]: Abstraction has has 311 places, 309 transitions, 640 flow [2025-03-13 22:25:59,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:59,633 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:59,633 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] [2025-03-13 22:25:59,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 22:25:59,633 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 178 more)] === [2025-03-13 22:25:59,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:59,634 INFO L85 PathProgramCache]: Analyzing trace with hash -907327850, now seen corresponding path program 1 times [2025-03-13 22:25:59,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:59,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149835670] [2025-03-13 22:25:59,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:59,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:59,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-13 22:25:59,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-13 22:25:59,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:59,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:00,076 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-13 22:26:00,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:00,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149835670] [2025-03-13 22:26:00,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149835670] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:00,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:00,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:26:00,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535173125] [2025-03-13 22:26:00,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:00,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:26:00,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:00,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:26:00,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:26:00,233 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 279 out of 431 [2025-03-13 22:26:00,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 309 transitions, 640 flow. Second operand has 6 states, 6 states have (on average 280.5) internal successors, (1683), 6 states have internal predecessors, (1683), 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-13 22:26:00,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:00,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 279 of 431 [2025-03-13 22:26:00,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:00,606 INFO L124 PetriNetUnfolderBase]: 1232/3005 cut-off events. [2025-03-13 22:26:00,606 INFO L125 PetriNetUnfolderBase]: For 462/462 co-relation queries the response was YES. [2025-03-13 22:26:00,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5170 conditions, 3005 events. 1232/3005 cut-off events. For 462/462 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 20994 event pairs, 858 based on Foata normal form. 0/2695 useless extension candidates. Maximal degree in co-relation 5082. Up to 1686 conditions per place. [2025-03-13 22:26:00,616 INFO L140 encePairwiseOnDemand]: 413/431 looper letters, 48 selfloop transitions, 15 changer transitions 0/306 dead transitions. [2025-03-13 22:26:00,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 306 transitions, 760 flow [2025-03-13 22:26:00,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:26:00,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:26:00,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1738 transitions. [2025-03-13 22:26:00,619 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6720804331013148 [2025-03-13 22:26:00,620 INFO L175 Difference]: Start difference. First operand has 311 places, 309 transitions, 640 flow. Second operand 6 states and 1738 transitions. [2025-03-13 22:26:00,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 306 transitions, 760 flow [2025-03-13 22:26:00,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 306 transitions, 759 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:26:00,624 INFO L231 Difference]: Finished difference. Result has 312 places, 306 transitions, 663 flow [2025-03-13 22:26:00,625 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=633, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=663, PETRI_PLACES=312, PETRI_TRANSITIONS=306} [2025-03-13 22:26:00,625 INFO L279 CegarLoopForPetriNet]: 409 programPoint places, -97 predicate places. [2025-03-13 22:26:00,625 INFO L471 AbstractCegarLoop]: Abstraction has has 312 places, 306 transitions, 663 flow [2025-03-13 22:26:00,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 280.5) internal successors, (1683), 6 states have internal predecessors, (1683), 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-13 22:26:00,626 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:00,626 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] [2025-03-13 22:26:00,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-13 22:26:00,626 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 178 more)] === [2025-03-13 22:26:00,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:00,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1851948464, now seen corresponding path program 1 times [2025-03-13 22:26:00,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:00,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50480362] [2025-03-13 22:26:00,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:00,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:00,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-13 22:26:00,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-13 22:26:00,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:00,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:00,658 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-13 22:26:00,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:00,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50480362] [2025-03-13 22:26:00,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50480362] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:00,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:00,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:00,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409949597] [2025-03-13 22:26:00,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:00,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:00,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:00,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:00,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:00,666 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 431 [2025-03-13 22:26:00,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 306 transitions, 663 flow. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:00,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:00,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 431 [2025-03-13 22:26:00,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:01,042 INFO L124 PetriNetUnfolderBase]: 1232/3004 cut-off events. [2025-03-13 22:26:01,042 INFO L125 PetriNetUnfolderBase]: For 462/462 co-relation queries the response was YES. [2025-03-13 22:26:01,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5150 conditions, 3004 events. 1232/3004 cut-off events. For 462/462 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 21058 event pairs, 858 based on Foata normal form. 0/2695 useless extension candidates. Maximal degree in co-relation 5100. Up to 1665 conditions per place. [2025-03-13 22:26:01,054 INFO L140 encePairwiseOnDemand]: 428/431 looper letters, 27 selfloop transitions, 2 changer transitions 0/305 dead transitions. [2025-03-13 22:26:01,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 305 transitions, 719 flow [2025-03-13 22:26:01,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:01,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:01,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 970 transitions. [2025-03-13 22:26:01,056 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7501933488012374 [2025-03-13 22:26:01,057 INFO L175 Difference]: Start difference. First operand has 312 places, 306 transitions, 663 flow. Second operand 3 states and 970 transitions. [2025-03-13 22:26:01,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 305 transitions, 719 flow [2025-03-13 22:26:01,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 305 transitions, 689 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:26:01,061 INFO L231 Difference]: Finished difference. Result has 308 places, 305 transitions, 635 flow [2025-03-13 22:26:01,062 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=631, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=635, PETRI_PLACES=308, PETRI_TRANSITIONS=305} [2025-03-13 22:26:01,062 INFO L279 CegarLoopForPetriNet]: 409 programPoint places, -101 predicate places. [2025-03-13 22:26:01,062 INFO L471 AbstractCegarLoop]: Abstraction has has 308 places, 305 transitions, 635 flow [2025-03-13 22:26:01,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:01,063 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:01,063 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] [2025-03-13 22:26:01,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 22:26:01,063 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 178 more)] === [2025-03-13 22:26:01,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:01,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1543763346, now seen corresponding path program 1 times [2025-03-13 22:26:01,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:01,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598158010] [2025-03-13 22:26:01,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:01,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:01,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-13 22:26:01,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-13 22:26:01,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:01,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:01,095 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-13 22:26:01,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:01,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598158010] [2025-03-13 22:26:01,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598158010] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:01,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:01,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:01,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261407551] [2025-03-13 22:26:01,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:01,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:01,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:01,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:01,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:01,102 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 431 [2025-03-13 22:26:01,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 305 transitions, 635 flow. Second operand has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:01,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:01,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 431 [2025-03-13 22:26:01,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:01,523 INFO L124 PetriNetUnfolderBase]: 1232/3003 cut-off events. [2025-03-13 22:26:01,523 INFO L125 PetriNetUnfolderBase]: For 462/462 co-relation queries the response was YES. [2025-03-13 22:26:01,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5134 conditions, 3003 events. 1232/3003 cut-off events. For 462/462 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 21053 event pairs, 858 based on Foata normal form. 0/2695 useless extension candidates. Maximal degree in co-relation 5045. Up to 1663 conditions per place. [2025-03-13 22:26:01,536 INFO L140 encePairwiseOnDemand]: 429/431 looper letters, 26 selfloop transitions, 1 changer transitions 0/304 dead transitions. [2025-03-13 22:26:01,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 304 transitions, 687 flow [2025-03-13 22:26:01,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:01,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:01,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 977 transitions. [2025-03-13 22:26:01,539 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7556071152358855 [2025-03-13 22:26:01,539 INFO L175 Difference]: Start difference. First operand has 308 places, 305 transitions, 635 flow. Second operand 3 states and 977 transitions. [2025-03-13 22:26:01,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 304 transitions, 687 flow [2025-03-13 22:26:01,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 304 transitions, 683 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:01,543 INFO L231 Difference]: Finished difference. Result has 307 places, 304 transitions, 631 flow [2025-03-13 22:26:01,543 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=629, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=631, PETRI_PLACES=307, PETRI_TRANSITIONS=304} [2025-03-13 22:26:01,544 INFO L279 CegarLoopForPetriNet]: 409 programPoint places, -102 predicate places. [2025-03-13 22:26:01,544 INFO L471 AbstractCegarLoop]: Abstraction has has 307 places, 304 transitions, 631 flow [2025-03-13 22:26:01,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:01,545 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:01,545 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:01,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-13 22:26:01,545 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 178 more)] === [2025-03-13 22:26:01,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:01,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1589617619, now seen corresponding path program 1 times [2025-03-13 22:26:01,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:01,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28851034] [2025-03-13 22:26:01,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:01,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:01,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-13 22:26:01,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-13 22:26:01,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:01,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:01,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:26:01,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:01,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28851034] [2025-03-13 22:26:01,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28851034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:01,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:01,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:01,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841700341] [2025-03-13 22:26:01,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:01,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:01,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:01,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:01,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:01,592 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 431 [2025-03-13 22:26:01,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 304 transitions, 631 flow. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:01,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:01,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 431 [2025-03-13 22:26:01,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:01,919 INFO L124 PetriNetUnfolderBase]: 1232/3002 cut-off events. [2025-03-13 22:26:01,919 INFO L125 PetriNetUnfolderBase]: For 462/462 co-relation queries the response was YES. [2025-03-13 22:26:01,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5134 conditions, 3002 events. 1232/3002 cut-off events. For 462/462 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 21050 event pairs, 858 based on Foata normal form. 0/2695 useless extension candidates. Maximal degree in co-relation 5045. Up to 1665 conditions per place. [2025-03-13 22:26:01,932 INFO L140 encePairwiseOnDemand]: 428/431 looper letters, 27 selfloop transitions, 2 changer transitions 0/303 dead transitions. [2025-03-13 22:26:01,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 303 transitions, 687 flow [2025-03-13 22:26:01,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:01,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:01,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 970 transitions. [2025-03-13 22:26:01,934 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7501933488012374 [2025-03-13 22:26:01,934 INFO L175 Difference]: Start difference. First operand has 307 places, 304 transitions, 631 flow. Second operand 3 states and 970 transitions. [2025-03-13 22:26:01,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 303 transitions, 687 flow [2025-03-13 22:26:01,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 303 transitions, 686 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:26:01,938 INFO L231 Difference]: Finished difference. Result has 307 places, 303 transitions, 632 flow [2025-03-13 22:26:01,939 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=628, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=632, PETRI_PLACES=307, PETRI_TRANSITIONS=303} [2025-03-13 22:26:01,939 INFO L279 CegarLoopForPetriNet]: 409 programPoint places, -102 predicate places. [2025-03-13 22:26:01,939 INFO L471 AbstractCegarLoop]: Abstraction has has 307 places, 303 transitions, 632 flow [2025-03-13 22:26:01,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:01,940 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:01,940 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:01,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-13 22:26:01,940 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 178 more)] === [2025-03-13 22:26:01,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:01,941 INFO L85 PathProgramCache]: Analyzing trace with hash 394103329, now seen corresponding path program 1 times [2025-03-13 22:26:01,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:01,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808865419] [2025-03-13 22:26:01,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:01,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:01,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-13 22:26:01,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-13 22:26:01,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:01,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:01,973 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-13 22:26:01,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:01,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808865419] [2025-03-13 22:26:01,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808865419] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:01,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:01,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:01,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794612366] [2025-03-13 22:26:01,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:01,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:01,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:01,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:01,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:01,982 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 431 [2025-03-13 22:26:01,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 303 transitions, 632 flow. Second operand has 3 states, 3 states have (on average 315.0) internal successors, (945), 3 states have internal predecessors, (945), 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-13 22:26:01,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:01,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 431 [2025-03-13 22:26:01,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:02,298 INFO L124 PetriNetUnfolderBase]: 1232/3000 cut-off events. [2025-03-13 22:26:02,298 INFO L125 PetriNetUnfolderBase]: For 462/462 co-relation queries the response was YES. [2025-03-13 22:26:02,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5134 conditions, 3000 events. 1232/3000 cut-off events. For 462/462 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 21044 event pairs, 858 based on Foata normal form. 0/2695 useless extension candidates. Maximal degree in co-relation 5045. Up to 1665 conditions per place. [2025-03-13 22:26:02,308 INFO L140 encePairwiseOnDemand]: 428/431 looper letters, 28 selfloop transitions, 1 changer transitions 0/301 dead transitions. [2025-03-13 22:26:02,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 301 transitions, 686 flow [2025-03-13 22:26:02,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:02,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:02,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 971 transitions. [2025-03-13 22:26:02,310 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7509667440061871 [2025-03-13 22:26:02,310 INFO L175 Difference]: Start difference. First operand has 307 places, 303 transitions, 632 flow. Second operand 3 states and 971 transitions. [2025-03-13 22:26:02,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 301 transitions, 686 flow [2025-03-13 22:26:02,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 301 transitions, 682 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:02,314 INFO L231 Difference]: Finished difference. Result has 305 places, 301 transitions, 626 flow [2025-03-13 22:26:02,314 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=624, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=626, PETRI_PLACES=305, PETRI_TRANSITIONS=301} [2025-03-13 22:26:02,315 INFO L279 CegarLoopForPetriNet]: 409 programPoint places, -104 predicate places. [2025-03-13 22:26:02,315 INFO L471 AbstractCegarLoop]: Abstraction has has 305 places, 301 transitions, 626 flow [2025-03-13 22:26:02,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.0) internal successors, (945), 3 states have internal predecessors, (945), 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-13 22:26:02,315 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:02,316 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:02,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-13 22:26:02,316 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 178 more)] === [2025-03-13 22:26:02,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:02,316 INFO L85 PathProgramCache]: Analyzing trace with hash -331836830, now seen corresponding path program 1 times [2025-03-13 22:26:02,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:02,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817627432] [2025-03-13 22:26:02,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:02,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:02,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-13 22:26:02,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-13 22:26:02,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:02,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:02,361 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-13 22:26:02,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:02,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817627432] [2025-03-13 22:26:02,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817627432] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:02,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:02,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:02,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865133690] [2025-03-13 22:26:02,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:02,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:02,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:02,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:02,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:02,371 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 431 [2025-03-13 22:26:02,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 301 transitions, 626 flow. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:02,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:02,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 431 [2025-03-13 22:26:02,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:02,715 INFO L124 PetriNetUnfolderBase]: 1232/2999 cut-off events. [2025-03-13 22:26:02,716 INFO L125 PetriNetUnfolderBase]: For 462/462 co-relation queries the response was YES. [2025-03-13 22:26:02,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5132 conditions, 2999 events. 1232/2999 cut-off events. For 462/462 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 21008 event pairs, 858 based on Foata normal form. 0/2695 useless extension candidates. Maximal degree in co-relation 5043. Up to 1665 conditions per place. [2025-03-13 22:26:02,732 INFO L140 encePairwiseOnDemand]: 428/431 looper letters, 27 selfloop transitions, 2 changer transitions 0/300 dead transitions. [2025-03-13 22:26:02,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 300 transitions, 682 flow [2025-03-13 22:26:02,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:02,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:02,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 970 transitions. [2025-03-13 22:26:02,734 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7501933488012374 [2025-03-13 22:26:02,734 INFO L175 Difference]: Start difference. First operand has 305 places, 301 transitions, 626 flow. Second operand 3 states and 970 transitions. [2025-03-13 22:26:02,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 300 transitions, 682 flow [2025-03-13 22:26:02,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 300 transitions, 681 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:26:02,738 INFO L231 Difference]: Finished difference. Result has 305 places, 300 transitions, 627 flow [2025-03-13 22:26:02,739 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=623, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=627, PETRI_PLACES=305, PETRI_TRANSITIONS=300} [2025-03-13 22:26:02,739 INFO L279 CegarLoopForPetriNet]: 409 programPoint places, -104 predicate places. [2025-03-13 22:26:02,739 INFO L471 AbstractCegarLoop]: Abstraction has has 305 places, 300 transitions, 627 flow [2025-03-13 22:26:02,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:02,740 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:02,740 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:02,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-13 22:26:02,740 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 178 more)] === [2025-03-13 22:26:02,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:02,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1993271760, now seen corresponding path program 1 times [2025-03-13 22:26:02,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:02,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100648908] [2025-03-13 22:26:02,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:02,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:02,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 239 statements into 1 equivalence classes. [2025-03-13 22:26:02,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 239 of 239 statements. [2025-03-13 22:26:02,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:02,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:02,834 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-13 22:26:02,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:02,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100648908] [2025-03-13 22:26:02,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100648908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:02,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:02,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:02,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078763119] [2025-03-13 22:26:02,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:02,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:02,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:02,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:02,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:02,838 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 431 [2025-03-13 22:26:02,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 300 transitions, 627 flow. Second operand has 3 states, 3 states have (on average 322.6666666666667) internal successors, (968), 3 states have internal predecessors, (968), 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-13 22:26:02,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:02,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 431 [2025-03-13 22:26:02,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:03,176 INFO L124 PetriNetUnfolderBase]: 1232/2995 cut-off events. [2025-03-13 22:26:03,177 INFO L125 PetriNetUnfolderBase]: For 462/462 co-relation queries the response was YES. [2025-03-13 22:26:03,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5129 conditions, 2995 events. 1232/2995 cut-off events. For 462/462 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 21071 event pairs, 858 based on Foata normal form. 4/2695 useless extension candidates. Maximal degree in co-relation 5041. Up to 1662 conditions per place. [2025-03-13 22:26:03,185 INFO L140 encePairwiseOnDemand]: 429/431 looper letters, 0 selfloop transitions, 0 changer transitions 299/299 dead transitions. [2025-03-13 22:26:03,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 299 transitions, 675 flow [2025-03-13 22:26:03,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:03,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:03,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 978 transitions. [2025-03-13 22:26:03,187 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7563805104408353 [2025-03-13 22:26:03,187 INFO L175 Difference]: Start difference. First operand has 305 places, 300 transitions, 627 flow. Second operand 3 states and 978 transitions. [2025-03-13 22:26:03,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 299 transitions, 675 flow [2025-03-13 22:26:03,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 299 transitions, 671 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:03,191 INFO L231 Difference]: Finished difference. Result has 304 places, 0 transitions, 0 flow [2025-03-13 22:26:03,191 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=621, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=304, PETRI_TRANSITIONS=0} [2025-03-13 22:26:03,191 INFO L279 CegarLoopForPetriNet]: 409 programPoint places, -105 predicate places. [2025-03-13 22:26:03,192 INFO L471 AbstractCegarLoop]: Abstraction has has 304 places, 0 transitions, 0 flow [2025-03-13 22:26:03,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 322.6666666666667) internal successors, (968), 3 states have internal predecessors, (968), 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-13 22:26:03,194 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (181 of 182 remaining) [2025-03-13 22:26:03,194 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (180 of 182 remaining) [2025-03-13 22:26:03,194 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (179 of 182 remaining) [2025-03-13 22:26:03,195 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (178 of 182 remaining) [2025-03-13 22:26:03,195 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (177 of 182 remaining) [2025-03-13 22:26:03,195 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (176 of 182 remaining) [2025-03-13 22:26:03,195 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (175 of 182 remaining) [2025-03-13 22:26:03,195 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (174 of 182 remaining) [2025-03-13 22:26:03,195 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (173 of 182 remaining) [2025-03-13 22:26:03,195 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (172 of 182 remaining) [2025-03-13 22:26:03,195 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (171 of 182 remaining) [2025-03-13 22:26:03,195 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (170 of 182 remaining) [2025-03-13 22:26:03,195 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (169 of 182 remaining) [2025-03-13 22:26:03,195 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (168 of 182 remaining) [2025-03-13 22:26:03,195 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (167 of 182 remaining) [2025-03-13 22:26:03,195 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (166 of 182 remaining) [2025-03-13 22:26:03,195 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (165 of 182 remaining) [2025-03-13 22:26:03,195 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (164 of 182 remaining) [2025-03-13 22:26:03,196 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (163 of 182 remaining) [2025-03-13 22:26:03,196 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (162 of 182 remaining) [2025-03-13 22:26:03,196 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (161 of 182 remaining) [2025-03-13 22:26:03,196 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (160 of 182 remaining) [2025-03-13 22:26:03,196 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (159 of 182 remaining) [2025-03-13 22:26:03,196 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (158 of 182 remaining) [2025-03-13 22:26:03,196 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (157 of 182 remaining) [2025-03-13 22:26:03,196 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (156 of 182 remaining) [2025-03-13 22:26:03,196 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (155 of 182 remaining) [2025-03-13 22:26:03,196 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (154 of 182 remaining) [2025-03-13 22:26:03,196 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (153 of 182 remaining) [2025-03-13 22:26:03,196 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (152 of 182 remaining) [2025-03-13 22:26:03,196 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (151 of 182 remaining) [2025-03-13 22:26:03,196 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (150 of 182 remaining) [2025-03-13 22:26:03,196 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (149 of 182 remaining) [2025-03-13 22:26:03,196 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (148 of 182 remaining) [2025-03-13 22:26:03,197 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (147 of 182 remaining) [2025-03-13 22:26:03,197 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (146 of 182 remaining) [2025-03-13 22:26:03,197 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (145 of 182 remaining) [2025-03-13 22:26:03,197 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (144 of 182 remaining) [2025-03-13 22:26:03,197 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (143 of 182 remaining) [2025-03-13 22:26:03,197 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (142 of 182 remaining) [2025-03-13 22:26:03,197 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (141 of 182 remaining) [2025-03-13 22:26:03,197 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (140 of 182 remaining) [2025-03-13 22:26:03,197 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (139 of 182 remaining) [2025-03-13 22:26:03,197 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (138 of 182 remaining) [2025-03-13 22:26:03,197 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (137 of 182 remaining) [2025-03-13 22:26:03,197 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (136 of 182 remaining) [2025-03-13 22:26:03,197 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (135 of 182 remaining) [2025-03-13 22:26:03,197 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (134 of 182 remaining) [2025-03-13 22:26:03,197 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (133 of 182 remaining) [2025-03-13 22:26:03,198 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (132 of 182 remaining) [2025-03-13 22:26:03,198 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (131 of 182 remaining) [2025-03-13 22:26:03,198 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (130 of 182 remaining) [2025-03-13 22:26:03,198 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (129 of 182 remaining) [2025-03-13 22:26:03,198 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (128 of 182 remaining) [2025-03-13 22:26:03,198 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (127 of 182 remaining) [2025-03-13 22:26:03,198 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (126 of 182 remaining) [2025-03-13 22:26:03,198 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (125 of 182 remaining) [2025-03-13 22:26:03,198 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (124 of 182 remaining) [2025-03-13 22:26:03,198 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (123 of 182 remaining) [2025-03-13 22:26:03,198 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (122 of 182 remaining) [2025-03-13 22:26:03,198 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (121 of 182 remaining) [2025-03-13 22:26:03,198 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (120 of 182 remaining) [2025-03-13 22:26:03,198 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (119 of 182 remaining) [2025-03-13 22:26:03,198 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (118 of 182 remaining) [2025-03-13 22:26:03,198 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (117 of 182 remaining) [2025-03-13 22:26:03,198 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (116 of 182 remaining) [2025-03-13 22:26:03,198 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (115 of 182 remaining) [2025-03-13 22:26:03,198 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (114 of 182 remaining) [2025-03-13 22:26:03,198 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (113 of 182 remaining) [2025-03-13 22:26:03,198 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (112 of 182 remaining) [2025-03-13 22:26:03,198 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (111 of 182 remaining) [2025-03-13 22:26:03,198 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (110 of 182 remaining) [2025-03-13 22:26:03,198 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (109 of 182 remaining) [2025-03-13 22:26:03,198 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (108 of 182 remaining) [2025-03-13 22:26:03,198 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (107 of 182 remaining) [2025-03-13 22:26:03,198 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (106 of 182 remaining) [2025-03-13 22:26:03,198 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (105 of 182 remaining) [2025-03-13 22:26:03,198 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (104 of 182 remaining) [2025-03-13 22:26:03,198 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (103 of 182 remaining) [2025-03-13 22:26:03,198 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (102 of 182 remaining) [2025-03-13 22:26:03,198 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (101 of 182 remaining) [2025-03-13 22:26:03,198 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (100 of 182 remaining) [2025-03-13 22:26:03,198 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (99 of 182 remaining) [2025-03-13 22:26:03,199 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (98 of 182 remaining) [2025-03-13 22:26:03,199 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (97 of 182 remaining) [2025-03-13 22:26:03,199 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (96 of 182 remaining) [2025-03-13 22:26:03,199 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (95 of 182 remaining) [2025-03-13 22:26:03,199 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (94 of 182 remaining) [2025-03-13 22:26:03,199 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (93 of 182 remaining) [2025-03-13 22:26:03,199 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (92 of 182 remaining) [2025-03-13 22:26:03,199 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (91 of 182 remaining) [2025-03-13 22:26:03,199 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (90 of 182 remaining) [2025-03-13 22:26:03,199 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (89 of 182 remaining) [2025-03-13 22:26:03,199 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (88 of 182 remaining) [2025-03-13 22:26:03,199 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (87 of 182 remaining) [2025-03-13 22:26:03,199 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (86 of 182 remaining) [2025-03-13 22:26:03,199 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (85 of 182 remaining) [2025-03-13 22:26:03,199 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (84 of 182 remaining) [2025-03-13 22:26:03,199 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (83 of 182 remaining) [2025-03-13 22:26:03,199 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (82 of 182 remaining) [2025-03-13 22:26:03,200 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (81 of 182 remaining) [2025-03-13 22:26:03,200 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (80 of 182 remaining) [2025-03-13 22:26:03,200 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (79 of 182 remaining) [2025-03-13 22:26:03,200 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (78 of 182 remaining) [2025-03-13 22:26:03,200 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (77 of 182 remaining) [2025-03-13 22:26:03,200 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (76 of 182 remaining) [2025-03-13 22:26:03,200 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (75 of 182 remaining) [2025-03-13 22:26:03,200 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (74 of 182 remaining) [2025-03-13 22:26:03,200 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (73 of 182 remaining) [2025-03-13 22:26:03,200 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (72 of 182 remaining) [2025-03-13 22:26:03,200 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (71 of 182 remaining) [2025-03-13 22:26:03,200 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (70 of 182 remaining) [2025-03-13 22:26:03,200 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (69 of 182 remaining) [2025-03-13 22:26:03,200 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (68 of 182 remaining) [2025-03-13 22:26:03,200 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (67 of 182 remaining) [2025-03-13 22:26:03,201 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (66 of 182 remaining) [2025-03-13 22:26:03,201 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (65 of 182 remaining) [2025-03-13 22:26:03,201 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (64 of 182 remaining) [2025-03-13 22:26:03,201 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (63 of 182 remaining) [2025-03-13 22:26:03,201 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (62 of 182 remaining) [2025-03-13 22:26:03,201 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (61 of 182 remaining) [2025-03-13 22:26:03,201 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (60 of 182 remaining) [2025-03-13 22:26:03,201 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (59 of 182 remaining) [2025-03-13 22:26:03,201 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (58 of 182 remaining) [2025-03-13 22:26:03,201 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (57 of 182 remaining) [2025-03-13 22:26:03,201 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (56 of 182 remaining) [2025-03-13 22:26:03,201 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (55 of 182 remaining) [2025-03-13 22:26:03,201 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (54 of 182 remaining) [2025-03-13 22:26:03,201 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (53 of 182 remaining) [2025-03-13 22:26:03,201 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (52 of 182 remaining) [2025-03-13 22:26:03,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (51 of 182 remaining) [2025-03-13 22:26:03,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (50 of 182 remaining) [2025-03-13 22:26:03,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (49 of 182 remaining) [2025-03-13 22:26:03,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (48 of 182 remaining) [2025-03-13 22:26:03,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (47 of 182 remaining) [2025-03-13 22:26:03,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (46 of 182 remaining) [2025-03-13 22:26:03,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (45 of 182 remaining) [2025-03-13 22:26:03,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (44 of 182 remaining) [2025-03-13 22:26:03,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (43 of 182 remaining) [2025-03-13 22:26:03,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (42 of 182 remaining) [2025-03-13 22:26:03,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (41 of 182 remaining) [2025-03-13 22:26:03,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (40 of 182 remaining) [2025-03-13 22:26:03,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (39 of 182 remaining) [2025-03-13 22:26:03,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (38 of 182 remaining) [2025-03-13 22:26:03,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (37 of 182 remaining) [2025-03-13 22:26:03,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (36 of 182 remaining) [2025-03-13 22:26:03,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (35 of 182 remaining) [2025-03-13 22:26:03,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (34 of 182 remaining) [2025-03-13 22:26:03,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (33 of 182 remaining) [2025-03-13 22:26:03,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (32 of 182 remaining) [2025-03-13 22:26:03,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (31 of 182 remaining) [2025-03-13 22:26:03,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (30 of 182 remaining) [2025-03-13 22:26:03,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (29 of 182 remaining) [2025-03-13 22:26:03,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (28 of 182 remaining) [2025-03-13 22:26:03,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (27 of 182 remaining) [2025-03-13 22:26:03,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (26 of 182 remaining) [2025-03-13 22:26:03,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (25 of 182 remaining) [2025-03-13 22:26:03,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (24 of 182 remaining) [2025-03-13 22:26:03,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (23 of 182 remaining) [2025-03-13 22:26:03,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (22 of 182 remaining) [2025-03-13 22:26:03,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (21 of 182 remaining) [2025-03-13 22:26:03,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (20 of 182 remaining) [2025-03-13 22:26:03,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (19 of 182 remaining) [2025-03-13 22:26:03,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (18 of 182 remaining) [2025-03-13 22:26:03,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (17 of 182 remaining) [2025-03-13 22:26:03,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (16 of 182 remaining) [2025-03-13 22:26:03,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (15 of 182 remaining) [2025-03-13 22:26:03,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (14 of 182 remaining) [2025-03-13 22:26:03,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (13 of 182 remaining) [2025-03-13 22:26:03,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (12 of 182 remaining) [2025-03-13 22:26:03,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (11 of 182 remaining) [2025-03-13 22:26:03,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (10 of 182 remaining) [2025-03-13 22:26:03,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (9 of 182 remaining) [2025-03-13 22:26:03,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (8 of 182 remaining) [2025-03-13 22:26:03,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (7 of 182 remaining) [2025-03-13 22:26:03,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (6 of 182 remaining) [2025-03-13 22:26:03,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (5 of 182 remaining) [2025-03-13 22:26:03,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (4 of 182 remaining) [2025-03-13 22:26:03,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (3 of 182 remaining) [2025-03-13 22:26:03,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (2 of 182 remaining) [2025-03-13 22:26:03,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (1 of 182 remaining) [2025-03-13 22:26:03,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (0 of 182 remaining) [2025-03-13 22:26:03,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-13 22:26:03,205 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:03,210 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-13 22:26:03,210 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-13 22:26:03,214 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.03 10:26:03 BasicIcfg [2025-03-13 22:26:03,214 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-13 22:26:03,215 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-13 22:26:03,215 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-13 22:26:03,215 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-13 22:26:03,216 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:25:54" (3/4) ... [2025-03-13 22:26:03,218 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-13 22:26:03,220 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-13 22:26:03,220 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-13 22:26:03,221 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-13 22:26:03,221 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread4 [2025-03-13 22:26:03,227 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2025-03-13 22:26:03,228 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-13 22:26:03,228 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-13 22:26:03,228 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-13 22:26:03,306 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-13 22:26:03,307 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-13 22:26:03,307 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-13 22:26:03,307 INFO L158 Benchmark]: Toolchain (without parser) took 10141.30ms. Allocated memory was 142.6MB in the beginning and 822.1MB in the end (delta: 679.5MB). Free memory was 111.7MB in the beginning and 414.0MB in the end (delta: -302.3MB). Peak memory consumption was 377.2MB. Max. memory is 16.1GB. [2025-03-13 22:26:03,308 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 22:26:03,308 INFO L158 Benchmark]: CACSL2BoogieTranslator took 245.13ms. Allocated memory is still 142.6MB. Free memory was 111.7MB in the beginning and 97.0MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-13 22:26:03,308 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.99ms. Allocated memory is still 142.6MB. Free memory was 97.0MB in the beginning and 93.0MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 22:26:03,309 INFO L158 Benchmark]: Boogie Preprocessor took 62.43ms. Allocated memory is still 142.6MB. Free memory was 93.0MB in the beginning and 89.9MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 22:26:03,309 INFO L158 Benchmark]: IcfgBuilder took 1424.71ms. Allocated memory is still 142.6MB. Free memory was 89.9MB in the beginning and 55.8MB in the end (delta: 34.1MB). Peak memory consumption was 65.1MB. Max. memory is 16.1GB. [2025-03-13 22:26:03,309 INFO L158 Benchmark]: TraceAbstraction took 8249.15ms. Allocated memory was 142.6MB in the beginning and 822.1MB in the end (delta: 679.5MB). Free memory was 55.8MB in the beginning and 422.4MB in the end (delta: -366.6MB). Peak memory consumption was 315.9MB. Max. memory is 16.1GB. [2025-03-13 22:26:03,310 INFO L158 Benchmark]: Witness Printer took 91.88ms. Allocated memory is still 822.1MB. Free memory was 422.4MB in the beginning and 414.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 22:26:03,311 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.21ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 245.13ms. Allocated memory is still 142.6MB. Free memory was 111.7MB in the beginning and 97.0MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.99ms. Allocated memory is still 142.6MB. Free memory was 97.0MB in the beginning and 93.0MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 62.43ms. Allocated memory is still 142.6MB. Free memory was 93.0MB in the beginning and 89.9MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1424.71ms. Allocated memory is still 142.6MB. Free memory was 89.9MB in the beginning and 55.8MB in the end (delta: 34.1MB). Peak memory consumption was 65.1MB. Max. memory is 16.1GB. * TraceAbstraction took 8249.15ms. Allocated memory was 142.6MB in the beginning and 822.1MB in the end (delta: 679.5MB). Free memory was 55.8MB in the beginning and 422.4MB in the end (delta: -366.6MB). Peak memory consumption was 315.9MB. Max. memory is 16.1GB. * Witness Printer took 91.88ms. Allocated memory is still 822.1MB. Free memory was 422.4MB in the beginning and 414.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: 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: 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: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 131]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 132]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 136]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 138]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 166]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 138]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 139]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 166]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 139]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 140]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 166]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 140]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 142]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 154]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 117]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 117]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 117]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 117]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 117]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 118]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 118]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: 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 9 procedures, 534 locations, 182 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.1s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 373 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 202 mSDsluCounter, 57 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 70 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1047 IncrementalHoareTripleChecker+Invalid, 1117 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 70 mSolverCounterUnsat, 57 mSDtfsCounter, 1047 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=844occurred in iteration=0, InterpolantAutomatonStates: 54, 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, 1.0s InterpolantComputationTime, 1646 NumberOfCodeBlocks, 1646 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1629 ConstructedInterpolants, 0 QuantifiedInterpolants, 1776 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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 99 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-13 22:26:03,332 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