./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-bad-commit-1.wvr-bad.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-bad-commit-1.wvr-bad.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 83c7202603a0719c5812e4d7043f4665de4d954c89c656bd6312ac9e8fdcb494 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:30:54,354 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:30:54,419 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-06 09:30:54,424 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:30:54,424 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:30:54,444 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:30:54,444 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:30:54,445 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:30:54,445 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:30:54,446 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:30:54,447 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:30:54,447 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:30:54,447 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:30:54,447 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:30:54,447 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:30:54,447 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:30:54,447 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:30:54,447 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:30:54,447 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:30:54,448 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:30:54,448 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:30:54,448 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:30:54,448 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 09:30:54,448 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:30:54,448 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:30:54,448 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:30:54,448 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:30:54,448 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:30:54,448 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:30:54,449 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:30:54,449 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:30:54,449 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:30:54,449 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:30:54,449 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:30:54,450 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 09:30:54,450 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 09:30:54,450 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:30:54,450 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:30:54,450 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:30:54,450 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:30:54,450 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:30:54,450 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:30:54,450 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 83c7202603a0719c5812e4d7043f4665de4d954c89c656bd6312ac9e8fdcb494 [2025-02-06 09:30:54,720 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:30:54,736 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:30:54,737 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:30:54,742 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:30:54,743 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:30:54,744 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-commit-1.wvr-bad.c [2025-02-06 09:30:56,226 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8934b5323/fb1855e9fb3245348f75244fc218d713/FLAG6ff90adb9 [2025-02-06 09:30:56,516 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:30:56,517 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-commit-1.wvr-bad.c [2025-02-06 09:30:56,553 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8934b5323/fb1855e9fb3245348f75244fc218d713/FLAG6ff90adb9 [2025-02-06 09:30:56,574 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8934b5323/fb1855e9fb3245348f75244fc218d713 [2025-02-06 09:30:56,576 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:30:56,577 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:30:56,579 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:30:56,580 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:30:56,583 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:30:56,583 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:30:56" (1/1) ... [2025-02-06 09:30:56,585 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c7102fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:30:56, skipping insertion in model container [2025-02-06 09:30:56,585 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:30:56" (1/1) ... [2025-02-06 09:30:56,599 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:30:56,762 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:30:56,774 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:30:56,807 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:30:56,817 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:30:56,818 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:30:56 WrapperNode [2025-02-06 09:30:56,818 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:30:56,819 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:30:56,819 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:30:56,819 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:30:56,823 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:30:56" (1/1) ... [2025-02-06 09:30:56,831 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:30:56" (1/1) ... [2025-02-06 09:30:56,857 INFO L138 Inliner]: procedures = 24, calls = 54, calls flagged for inlining = 21, calls inlined = 25, statements flattened = 734 [2025-02-06 09:30:56,857 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:30:56,858 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:30:56,858 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:30:56,858 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:30:56,863 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:30:56" (1/1) ... [2025-02-06 09:30:56,863 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:30:56" (1/1) ... [2025-02-06 09:30:56,867 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:30:56" (1/1) ... [2025-02-06 09:30:56,868 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:30:56" (1/1) ... [2025-02-06 09:30:56,883 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:30:56" (1/1) ... [2025-02-06 09:30:56,885 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:30:56" (1/1) ... [2025-02-06 09:30:56,890 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:30:56" (1/1) ... [2025-02-06 09:30:56,895 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:30:56" (1/1) ... [2025-02-06 09:30:56,902 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:30:56,902 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:30:56,903 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:30:56,903 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:30:56,903 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:30:56" (1/1) ... [2025-02-06 09:30:56,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:30:56,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:30:56,946 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 09:30:56,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 09:30:56,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:30:56,966 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 09:30:56,966 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 09:30:56,966 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 09:30:56,966 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 09:30:56,966 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-06 09:30:56,966 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-06 09:30:56,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 09:30:56,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 09:30:56,967 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 09:30:56,967 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 09:30:56,967 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 09:30:56,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:30:56,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:30:56,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 09:30:56,968 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 09:30:57,085 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:30:57,087 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:30:57,851 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 09:30:57,851 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:30:58,228 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:30:58,230 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:30:58,231 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:30:58 BoogieIcfgContainer [2025-02-06 09:30:58,231 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:30:58,234 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:30:58,235 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:30:58,239 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:30:58,239 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:30:56" (1/3) ... [2025-02-06 09:30:58,240 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63e46ae9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:30:58, skipping insertion in model container [2025-02-06 09:30:58,240 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:30:56" (2/3) ... [2025-02-06 09:30:58,240 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63e46ae9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:30:58, skipping insertion in model container [2025-02-06 09:30:58,240 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:30:58" (3/3) ... [2025-02-06 09:30:58,242 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-commit-1.wvr-bad.c [2025-02-06 09:30:58,256 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:30:58,260 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-commit-1.wvr-bad.c that has 4 procedures, 489 locations, 1 initial locations, 6 loop locations, and 125 error locations. [2025-02-06 09:30:58,260 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 09:30:58,390 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-06 09:30:58,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 498 places, 512 transitions, 1045 flow [2025-02-06 09:30:58,606 INFO L124 PetriNetUnfolderBase]: 24/509 cut-off events. [2025-02-06 09:30:58,608 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 09:30:58,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 522 conditions, 509 events. 24/509 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1046 event pairs, 0 based on Foata normal form. 0/360 useless extension candidates. Maximal degree in co-relation 444. Up to 6 conditions per place. [2025-02-06 09:30:58,617 INFO L82 GeneralOperation]: Start removeDead. Operand has 498 places, 512 transitions, 1045 flow [2025-02-06 09:30:58,627 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 479 places, 492 transitions, 1002 flow [2025-02-06 09:30:58,637 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:30:58,650 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;@213cbbaf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:30:58,651 INFO L334 AbstractCegarLoop]: Starting to check reachability of 228 error locations. [2025-02-06 09:30:58,660 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:30:58,662 INFO L124 PetriNetUnfolderBase]: 0/33 cut-off events. [2025-02-06 09:30:58,662 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:30:58,663 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:58,663 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] [2025-02-06 09:30:58,664 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err49ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 224 more)] === [2025-02-06 09:30:58,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:58,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1089921, now seen corresponding path program 1 times [2025-02-06 09:30:58,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:58,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659237905] [2025-02-06 09:30:58,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:58,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:58,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 09:30:58,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 09:30:58,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:58,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:58,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:30:58,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:58,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659237905] [2025-02-06 09:30:58,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659237905] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:58,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:58,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:58,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132970544] [2025-02-06 09:30:58,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:58,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:58,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:58,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:58,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:58,946 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 512 [2025-02-06 09:30:58,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 479 places, 492 transitions, 1002 flow. Second operand has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:58,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:58,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 512 [2025-02-06 09:30:58,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:59,070 INFO L124 PetriNetUnfolderBase]: 30/406 cut-off events. [2025-02-06 09:30:59,071 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-02-06 09:30:59,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 456 conditions, 406 events. 30/406 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 403 event pairs, 0 based on Foata normal form. 15/361 useless extension candidates. Maximal degree in co-relation 387. Up to 35 conditions per place. [2025-02-06 09:30:59,074 INFO L140 encePairwiseOnDemand]: 408/512 looper letters, 18 selfloop transitions, 2 changer transitions 6/390 dead transitions. [2025-02-06 09:30:59,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 390 transitions, 838 flow [2025-02-06 09:30:59,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:59,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:59,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1283 transitions. [2025-02-06 09:30:59,090 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8352864583333334 [2025-02-06 09:30:59,091 INFO L175 Difference]: Start difference. First operand has 479 places, 492 transitions, 1002 flow. Second operand 3 states and 1283 transitions. [2025-02-06 09:30:59,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 388 places, 390 transitions, 838 flow [2025-02-06 09:30:59,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 390 transitions, 826 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-06 09:30:59,101 INFO L231 Difference]: Finished difference. Result has 382 places, 384 transitions, 778 flow [2025-02-06 09:30:59,104 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=512, PETRI_DIFFERENCE_MINUEND_FLOW=786, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=388, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=778, PETRI_PLACES=382, PETRI_TRANSITIONS=384} [2025-02-06 09:30:59,106 INFO L279 CegarLoopForPetriNet]: 479 programPoint places, -97 predicate places. [2025-02-06 09:30:59,106 INFO L471 AbstractCegarLoop]: Abstraction has has 382 places, 384 transitions, 778 flow [2025-02-06 09:30:59,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:59,107 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:59,107 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:30:59,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:30:59,108 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err49ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 224 more)] === [2025-02-06 09:30:59,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:59,108 INFO L85 PathProgramCache]: Analyzing trace with hash 402880914, now seen corresponding path program 1 times [2025-02-06 09:30:59,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:59,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911266185] [2025-02-06 09:30:59,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:59,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:59,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-06 09:30:59,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-06 09:30:59,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:59,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:59,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:30:59,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:59,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911266185] [2025-02-06 09:30:59,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911266185] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:59,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:59,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:59,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600944197] [2025-02-06 09:30:59,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:59,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:59,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:59,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:59,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:59,173 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 512 [2025-02-06 09:30:59,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 384 transitions, 778 flow. Second operand has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:59,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:59,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 512 [2025-02-06 09:30:59,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:59,284 INFO L124 PetriNetUnfolderBase]: 30/399 cut-off events. [2025-02-06 09:30:59,284 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 09:30:59,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 443 conditions, 399 events. 30/399 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 393 event pairs, 0 based on Foata normal form. 0/346 useless extension candidates. Maximal degree in co-relation 403. Up to 35 conditions per place. [2025-02-06 09:30:59,288 INFO L140 encePairwiseOnDemand]: 509/512 looper letters, 18 selfloop transitions, 2 changer transitions 0/383 dead transitions. [2025-02-06 09:30:59,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 383 transitions, 816 flow [2025-02-06 09:30:59,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:59,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:59,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1182 transitions. [2025-02-06 09:30:59,291 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.76953125 [2025-02-06 09:30:59,291 INFO L175 Difference]: Start difference. First operand has 382 places, 384 transitions, 778 flow. Second operand 3 states and 1182 transitions. [2025-02-06 09:30:59,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 383 transitions, 816 flow [2025-02-06 09:30:59,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 383 transitions, 812 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:30:59,298 INFO L231 Difference]: Finished difference. Result has 375 places, 383 transitions, 776 flow [2025-02-06 09:30:59,298 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=512, PETRI_DIFFERENCE_MINUEND_FLOW=772, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=776, PETRI_PLACES=375, PETRI_TRANSITIONS=383} [2025-02-06 09:30:59,299 INFO L279 CegarLoopForPetriNet]: 479 programPoint places, -104 predicate places. [2025-02-06 09:30:59,299 INFO L471 AbstractCegarLoop]: Abstraction has has 375 places, 383 transitions, 776 flow [2025-02-06 09:30:59,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:59,300 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:59,300 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:30:59,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 09:30:59,300 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err49ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 224 more)] === [2025-02-06 09:30:59,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:59,301 INFO L85 PathProgramCache]: Analyzing trace with hash -411565252, now seen corresponding path program 1 times [2025-02-06 09:30:59,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:59,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677147725] [2025-02-06 09:30:59,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:59,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:59,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 09:30:59,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 09:30:59,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:59,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:59,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:30:59,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:59,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677147725] [2025-02-06 09:30:59,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677147725] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:59,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:59,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:59,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570287473] [2025-02-06 09:30:59,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:59,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:59,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:59,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:59,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:59,354 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 512 [2025-02-06 09:30:59,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 383 transitions, 776 flow. Second operand has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:59,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:59,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 512 [2025-02-06 09:30:59,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:59,434 INFO L124 PetriNetUnfolderBase]: 30/398 cut-off events. [2025-02-06 09:30:59,434 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 09:30:59,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 442 conditions, 398 events. 30/398 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 387 event pairs, 0 based on Foata normal form. 0/346 useless extension candidates. Maximal degree in co-relation 394. Up to 35 conditions per place. [2025-02-06 09:30:59,437 INFO L140 encePairwiseOnDemand]: 509/512 looper letters, 18 selfloop transitions, 2 changer transitions 0/382 dead transitions. [2025-02-06 09:30:59,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 382 transitions, 814 flow [2025-02-06 09:30:59,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:59,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:59,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1182 transitions. [2025-02-06 09:30:59,440 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.76953125 [2025-02-06 09:30:59,440 INFO L175 Difference]: Start difference. First operand has 375 places, 383 transitions, 776 flow. Second operand 3 states and 1182 transitions. [2025-02-06 09:30:59,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 382 transitions, 814 flow [2025-02-06 09:30:59,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 382 transitions, 810 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:30:59,445 INFO L231 Difference]: Finished difference. Result has 374 places, 382 transitions, 774 flow [2025-02-06 09:30:59,446 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=512, PETRI_DIFFERENCE_MINUEND_FLOW=770, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=774, PETRI_PLACES=374, PETRI_TRANSITIONS=382} [2025-02-06 09:30:59,446 INFO L279 CegarLoopForPetriNet]: 479 programPoint places, -105 predicate places. [2025-02-06 09:30:59,446 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 382 transitions, 774 flow [2025-02-06 09:30:59,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:59,447 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:59,447 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] [2025-02-06 09:30:59,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:30:59,448 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err49ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 224 more)] === [2025-02-06 09:30:59,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:59,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1669965647, now seen corresponding path program 1 times [2025-02-06 09:30:59,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:59,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010350255] [2025-02-06 09:30:59,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:59,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:59,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-06 09:30:59,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-06 09:30:59,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:59,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:59,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:30:59,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:59,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010350255] [2025-02-06 09:30:59,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010350255] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:59,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:59,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:59,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439390505] [2025-02-06 09:30:59,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:59,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:59,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:59,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:59,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:59,535 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 391 out of 512 [2025-02-06 09:30:59,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 382 transitions, 774 flow. Second operand has 3 states, 3 states have (on average 392.0) internal successors, (1176), 3 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:59,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:59,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 512 [2025-02-06 09:30:59,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:59,737 INFO L124 PetriNetUnfolderBase]: 56/512 cut-off events. [2025-02-06 09:30:59,737 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 09:30:59,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 584 conditions, 512 events. 56/512 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 917 event pairs, 0 based on Foata normal form. 0/434 useless extension candidates. Maximal degree in co-relation 528. Up to 37 conditions per place. [2025-02-06 09:30:59,740 INFO L140 encePairwiseOnDemand]: 508/512 looper letters, 27 selfloop transitions, 3 changer transitions 0/394 dead transitions. [2025-02-06 09:30:59,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 394 transitions, 863 flow [2025-02-06 09:30:59,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:59,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:59,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1204 transitions. [2025-02-06 09:30:59,743 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7838541666666666 [2025-02-06 09:30:59,743 INFO L175 Difference]: Start difference. First operand has 374 places, 382 transitions, 774 flow. Second operand 3 states and 1204 transitions. [2025-02-06 09:30:59,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 394 transitions, 863 flow [2025-02-06 09:30:59,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 394 transitions, 859 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:30:59,750 INFO L231 Difference]: Finished difference. Result has 374 places, 383 transitions, 785 flow [2025-02-06 09:30:59,751 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=512, PETRI_DIFFERENCE_MINUEND_FLOW=768, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=785, PETRI_PLACES=374, PETRI_TRANSITIONS=383} [2025-02-06 09:30:59,751 INFO L279 CegarLoopForPetriNet]: 479 programPoint places, -105 predicate places. [2025-02-06 09:30:59,751 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 383 transitions, 785 flow [2025-02-06 09:30:59,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 392.0) internal successors, (1176), 3 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:59,752 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:59,752 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:30:59,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:30:59,753 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err49ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 224 more)] === [2025-02-06 09:30:59,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:59,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1448273541, now seen corresponding path program 1 times [2025-02-06 09:30:59,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:59,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961538919] [2025-02-06 09:30:59,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:59,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:59,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-06 09:30:59,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-06 09:30:59,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:59,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:59,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:30:59,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:59,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961538919] [2025-02-06 09:30:59,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961538919] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:59,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:59,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:59,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370004132] [2025-02-06 09:30:59,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:59,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:59,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:59,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:59,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:59,811 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 512 [2025-02-06 09:30:59,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 383 transitions, 785 flow. Second operand has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:59,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:59,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 512 [2025-02-06 09:30:59,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:59,928 INFO L124 PetriNetUnfolderBase]: 56/498 cut-off events. [2025-02-06 09:30:59,928 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-02-06 09:30:59,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 590 conditions, 498 events. 56/498 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 881 event pairs, 2 based on Foata normal form. 0/420 useless extension candidates. Maximal degree in co-relation 370. Up to 63 conditions per place. [2025-02-06 09:30:59,932 INFO L140 encePairwiseOnDemand]: 509/512 looper letters, 19 selfloop transitions, 2 changer transitions 0/382 dead transitions. [2025-02-06 09:30:59,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 382 transitions, 825 flow [2025-02-06 09:30:59,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:59,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:59,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1184 transitions. [2025-02-06 09:30:59,935 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7708333333333334 [2025-02-06 09:30:59,935 INFO L175 Difference]: Start difference. First operand has 374 places, 383 transitions, 785 flow. Second operand 3 states and 1184 transitions. [2025-02-06 09:30:59,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 382 transitions, 825 flow [2025-02-06 09:30:59,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 382 transitions, 822 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:30:59,940 INFO L231 Difference]: Finished difference. Result has 374 places, 382 transitions, 784 flow [2025-02-06 09:30:59,941 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=512, PETRI_DIFFERENCE_MINUEND_FLOW=780, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=784, PETRI_PLACES=374, PETRI_TRANSITIONS=382} [2025-02-06 09:30:59,941 INFO L279 CegarLoopForPetriNet]: 479 programPoint places, -105 predicate places. [2025-02-06 09:30:59,941 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 382 transitions, 784 flow [2025-02-06 09:30:59,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:59,942 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:59,942 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-02-06 09:30:59,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:30:59,943 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err49ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 224 more)] === [2025-02-06 09:30:59,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:59,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1722506932, now seen corresponding path program 1 times [2025-02-06 09:30:59,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:59,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227858828] [2025-02-06 09:30:59,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:59,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:59,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-06 09:30:59,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-06 09:30:59,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:59,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:59,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:30:59,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:59,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227858828] [2025-02-06 09:30:59,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227858828] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:59,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:59,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:59,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795932680] [2025-02-06 09:30:59,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:59,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:59,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:59,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:59,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:59,988 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 391 out of 512 [2025-02-06 09:30:59,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 382 transitions, 784 flow. Second operand has 3 states, 3 states have (on average 392.0) internal successors, (1176), 3 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:59,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:59,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 512 [2025-02-06 09:30:59,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:00,091 INFO L124 PetriNetUnfolderBase]: 56/497 cut-off events. [2025-02-06 09:31:00,091 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-02-06 09:31:00,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 583 conditions, 497 events. 56/497 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 882 event pairs, 2 based on Foata normal form. 0/420 useless extension candidates. Maximal degree in co-relation 518. Up to 61 conditions per place. [2025-02-06 09:31:00,095 INFO L140 encePairwiseOnDemand]: 510/512 looper letters, 18 selfloop transitions, 1 changer transitions 0/381 dead transitions. [2025-02-06 09:31:00,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 381 transitions, 820 flow [2025-02-06 09:31:00,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:31:00,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:31:00,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1191 transitions. [2025-02-06 09:31:00,098 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.775390625 [2025-02-06 09:31:00,098 INFO L175 Difference]: Start difference. First operand has 374 places, 382 transitions, 784 flow. Second operand 3 states and 1191 transitions. [2025-02-06 09:31:00,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 381 transitions, 820 flow [2025-02-06 09:31:00,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 381 transitions, 816 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:31:00,104 INFO L231 Difference]: Finished difference. Result has 373 places, 381 transitions, 780 flow [2025-02-06 09:31:00,104 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=512, PETRI_DIFFERENCE_MINUEND_FLOW=778, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=780, PETRI_PLACES=373, PETRI_TRANSITIONS=381} [2025-02-06 09:31:00,105 INFO L279 CegarLoopForPetriNet]: 479 programPoint places, -106 predicate places. [2025-02-06 09:31:00,105 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 381 transitions, 780 flow [2025-02-06 09:31:00,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 392.0) internal successors, (1176), 3 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:00,106 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:00,106 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] [2025-02-06 09:31:00,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 09:31:00,106 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err49ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 224 more)] === [2025-02-06 09:31:00,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:00,107 INFO L85 PathProgramCache]: Analyzing trace with hash -8454578, now seen corresponding path program 1 times [2025-02-06 09:31:00,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:00,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420518463] [2025-02-06 09:31:00,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:00,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:00,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 09:31:00,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 09:31:00,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:00,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:00,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:31:00,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:00,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420518463] [2025-02-06 09:31:00,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420518463] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:00,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:00,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:31:00,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018439135] [2025-02-06 09:31:00,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:00,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:31:00,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:00,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:31:00,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:31:00,951 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 353 out of 512 [2025-02-06 09:31:00,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 381 transitions, 780 flow. Second operand has 6 states, 6 states have (on average 354.5) internal successors, (2127), 6 states have internal predecessors, (2127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:00,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:00,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 353 of 512 [2025-02-06 09:31:00,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:01,068 INFO L124 PetriNetUnfolderBase]: 56/494 cut-off events. [2025-02-06 09:31:01,069 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-02-06 09:31:01,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 615 conditions, 494 events. 56/494 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 868 event pairs, 2 based on Foata normal form. 0/420 useless extension candidates. Maximal degree in co-relation 551. Up to 84 conditions per place. [2025-02-06 09:31:01,071 INFO L140 encePairwiseOnDemand]: 494/512 looper letters, 40 selfloop transitions, 15 changer transitions 0/378 dead transitions. [2025-02-06 09:31:01,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 378 transitions, 884 flow [2025-02-06 09:31:01,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:31:01,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:31:01,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2174 transitions. [2025-02-06 09:31:01,075 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7076822916666666 [2025-02-06 09:31:01,075 INFO L175 Difference]: Start difference. First operand has 373 places, 381 transitions, 780 flow. Second operand 6 states and 2174 transitions. [2025-02-06 09:31:01,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 378 transitions, 884 flow [2025-02-06 09:31:01,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 378 transitions, 883 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:31:01,080 INFO L231 Difference]: Finished difference. Result has 374 places, 378 transitions, 803 flow [2025-02-06 09:31:01,080 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=512, PETRI_DIFFERENCE_MINUEND_FLOW=773, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=803, PETRI_PLACES=374, PETRI_TRANSITIONS=378} [2025-02-06 09:31:01,080 INFO L279 CegarLoopForPetriNet]: 479 programPoint places, -105 predicate places. [2025-02-06 09:31:01,081 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 378 transitions, 803 flow [2025-02-06 09:31:01,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 354.5) internal successors, (2127), 6 states have internal predecessors, (2127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:01,082 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:01,082 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] [2025-02-06 09:31:01,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 09:31:01,082 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err49ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 224 more)] === [2025-02-06 09:31:01,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:01,083 INFO L85 PathProgramCache]: Analyzing trace with hash 129388245, now seen corresponding path program 1 times [2025-02-06 09:31:01,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:01,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667015827] [2025-02-06 09:31:01,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:01,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:01,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 09:31:01,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 09:31:01,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:01,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:01,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:31:01,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:01,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667015827] [2025-02-06 09:31:01,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667015827] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:01,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:01,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:31:01,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190000344] [2025-02-06 09:31:01,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:01,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:31:01,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:01,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:31:01,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:31:01,120 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 512 [2025-02-06 09:31:01,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 378 transitions, 803 flow. Second operand has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:01,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:01,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 512 [2025-02-06 09:31:01,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:01,217 INFO L124 PetriNetUnfolderBase]: 56/493 cut-off events. [2025-02-06 09:31:01,218 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-02-06 09:31:01,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 595 conditions, 493 events. 56/493 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 862 event pairs, 2 based on Foata normal form. 0/420 useless extension candidates. Maximal degree in co-relation 546. Up to 63 conditions per place. [2025-02-06 09:31:01,221 INFO L140 encePairwiseOnDemand]: 509/512 looper letters, 19 selfloop transitions, 2 changer transitions 0/377 dead transitions. [2025-02-06 09:31:01,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 377 transitions, 843 flow [2025-02-06 09:31:01,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:31:01,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:31:01,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1184 transitions. [2025-02-06 09:31:01,223 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7708333333333334 [2025-02-06 09:31:01,223 INFO L175 Difference]: Start difference. First operand has 374 places, 378 transitions, 803 flow. Second operand 3 states and 1184 transitions. [2025-02-06 09:31:01,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 377 transitions, 843 flow [2025-02-06 09:31:01,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 377 transitions, 813 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:31:01,228 INFO L231 Difference]: Finished difference. Result has 370 places, 377 transitions, 775 flow [2025-02-06 09:31:01,229 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=512, PETRI_DIFFERENCE_MINUEND_FLOW=771, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=775, PETRI_PLACES=370, PETRI_TRANSITIONS=377} [2025-02-06 09:31:01,230 INFO L279 CegarLoopForPetriNet]: 479 programPoint places, -109 predicate places. [2025-02-06 09:31:01,230 INFO L471 AbstractCegarLoop]: Abstraction has has 370 places, 377 transitions, 775 flow [2025-02-06 09:31:01,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:01,231 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:01,231 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] [2025-02-06 09:31:01,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 09:31:01,231 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err49ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 224 more)] === [2025-02-06 09:31:01,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:01,232 INFO L85 PathProgramCache]: Analyzing trace with hash 249804765, now seen corresponding path program 1 times [2025-02-06 09:31:01,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:01,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338363409] [2025-02-06 09:31:01,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:01,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:01,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-06 09:31:01,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-06 09:31:01,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:01,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:01,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:31:01,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:01,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338363409] [2025-02-06 09:31:01,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338363409] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:01,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:01,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:31:01,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677931340] [2025-02-06 09:31:01,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:01,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:31:01,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:01,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:31:01,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:31:01,303 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 512 [2025-02-06 09:31:01,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 377 transitions, 775 flow. Second operand has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:01,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:01,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 512 [2025-02-06 09:31:01,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:01,399 INFO L124 PetriNetUnfolderBase]: 56/492 cut-off events. [2025-02-06 09:31:01,400 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-02-06 09:31:01,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 582 conditions, 492 events. 56/492 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 862 event pairs, 2 based on Foata normal form. 0/420 useless extension candidates. Maximal degree in co-relation 517. Up to 64 conditions per place. [2025-02-06 09:31:01,405 INFO L140 encePairwiseOnDemand]: 509/512 looper letters, 20 selfloop transitions, 2 changer transitions 0/376 dead transitions. [2025-02-06 09:31:01,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 376 transitions, 817 flow [2025-02-06 09:31:01,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:31:01,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:31:01,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1182 transitions. [2025-02-06 09:31:01,407 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.76953125 [2025-02-06 09:31:01,407 INFO L175 Difference]: Start difference. First operand has 370 places, 377 transitions, 775 flow. Second operand 3 states and 1182 transitions. [2025-02-06 09:31:01,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 376 transitions, 817 flow [2025-02-06 09:31:01,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 376 transitions, 813 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:31:01,411 INFO L231 Difference]: Finished difference. Result has 369 places, 376 transitions, 773 flow [2025-02-06 09:31:01,412 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=512, PETRI_DIFFERENCE_MINUEND_FLOW=769, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=773, PETRI_PLACES=369, PETRI_TRANSITIONS=376} [2025-02-06 09:31:01,413 INFO L279 CegarLoopForPetriNet]: 479 programPoint places, -110 predicate places. [2025-02-06 09:31:01,413 INFO L471 AbstractCegarLoop]: Abstraction has has 369 places, 376 transitions, 773 flow [2025-02-06 09:31:01,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:01,414 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:01,415 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] [2025-02-06 09:31:01,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 09:31:01,415 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err49ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 224 more)] === [2025-02-06 09:31:01,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:01,415 INFO L85 PathProgramCache]: Analyzing trace with hash 130947468, now seen corresponding path program 1 times [2025-02-06 09:31:01,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:01,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922825875] [2025-02-06 09:31:01,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:01,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:01,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-06 09:31:01,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-06 09:31:01,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:01,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:01,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:31:01,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:01,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922825875] [2025-02-06 09:31:01,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922825875] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:01,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:01,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:31:01,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011638063] [2025-02-06 09:31:01,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:01,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:31:01,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:01,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:31:01,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:31:01,469 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 391 out of 512 [2025-02-06 09:31:01,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 376 transitions, 773 flow. Second operand has 3 states, 3 states have (on average 392.0) internal successors, (1176), 3 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:01,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:01,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 512 [2025-02-06 09:31:01,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:01,643 INFO L124 PetriNetUnfolderBase]: 88/637 cut-off events. [2025-02-06 09:31:01,643 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2025-02-06 09:31:01,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 762 conditions, 637 events. 88/637 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1444 event pairs, 2 based on Foata normal form. 0/536 useless extension candidates. Maximal degree in co-relation 698. Up to 55 conditions per place. [2025-02-06 09:31:01,652 INFO L140 encePairwiseOnDemand]: 509/512 looper letters, 30 selfloop transitions, 2 changer transitions 0/388 dead transitions. [2025-02-06 09:31:01,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 388 transitions, 872 flow [2025-02-06 09:31:01,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:31:01,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:31:01,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1202 transitions. [2025-02-06 09:31:01,658 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7825520833333334 [2025-02-06 09:31:01,658 INFO L175 Difference]: Start difference. First operand has 369 places, 376 transitions, 773 flow. Second operand 3 states and 1202 transitions. [2025-02-06 09:31:01,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 388 transitions, 872 flow [2025-02-06 09:31:01,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 388 transitions, 868 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:31:01,663 INFO L231 Difference]: Finished difference. Result has 369 places, 376 transitions, 777 flow [2025-02-06 09:31:01,663 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=512, PETRI_DIFFERENCE_MINUEND_FLOW=767, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=777, PETRI_PLACES=369, PETRI_TRANSITIONS=376} [2025-02-06 09:31:01,664 INFO L279 CegarLoopForPetriNet]: 479 programPoint places, -110 predicate places. [2025-02-06 09:31:01,664 INFO L471 AbstractCegarLoop]: Abstraction has has 369 places, 376 transitions, 777 flow [2025-02-06 09:31:01,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 392.0) internal successors, (1176), 3 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:01,664 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:01,665 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] [2025-02-06 09:31:01,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 09:31:01,665 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err49ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 224 more)] === [2025-02-06 09:31:01,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:01,665 INFO L85 PathProgramCache]: Analyzing trace with hash -596814470, now seen corresponding path program 1 times [2025-02-06 09:31:01,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:01,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122443061] [2025-02-06 09:31:01,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:01,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:01,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-06 09:31:01,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-06 09:31:01,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:01,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:01,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:31:01,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:01,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122443061] [2025-02-06 09:31:01,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122443061] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:01,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:01,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:31:01,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825967796] [2025-02-06 09:31:01,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:01,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:31:01,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:01,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:31:01,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:31:01,724 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 512 [2025-02-06 09:31:01,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 376 transitions, 777 flow. Second operand has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:01,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:01,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 512 [2025-02-06 09:31:01,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:01,798 INFO L124 PetriNetUnfolderBase]: 84/564 cut-off events. [2025-02-06 09:31:01,798 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2025-02-06 09:31:01,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 709 conditions, 564 events. 84/564 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1146 event pairs, 7 based on Foata normal form. 0/482 useless extension candidates. Maximal degree in co-relation 643. Up to 97 conditions per place. [2025-02-06 09:31:01,801 INFO L140 encePairwiseOnDemand]: 509/512 looper letters, 20 selfloop transitions, 2 changer transitions 0/375 dead transitions. [2025-02-06 09:31:01,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 375 transitions, 819 flow [2025-02-06 09:31:01,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:31:01,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:31:01,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1184 transitions. [2025-02-06 09:31:01,805 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7708333333333334 [2025-02-06 09:31:01,805 INFO L175 Difference]: Start difference. First operand has 369 places, 376 transitions, 777 flow. Second operand 3 states and 1184 transitions. [2025-02-06 09:31:01,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 375 transitions, 819 flow [2025-02-06 09:31:01,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 375 transitions, 817 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:31:01,809 INFO L231 Difference]: Finished difference. Result has 369 places, 375 transitions, 777 flow [2025-02-06 09:31:01,809 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=512, PETRI_DIFFERENCE_MINUEND_FLOW=773, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=777, PETRI_PLACES=369, PETRI_TRANSITIONS=375} [2025-02-06 09:31:01,810 INFO L279 CegarLoopForPetriNet]: 479 programPoint places, -110 predicate places. [2025-02-06 09:31:01,810 INFO L471 AbstractCegarLoop]: Abstraction has has 369 places, 375 transitions, 777 flow [2025-02-06 09:31:01,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:01,811 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:01,811 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] [2025-02-06 09:31:01,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 09:31:01,811 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err49ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 224 more)] === [2025-02-06 09:31:01,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:01,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1649058555, now seen corresponding path program 1 times [2025-02-06 09:31:01,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:01,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817061164] [2025-02-06 09:31:01,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:01,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:01,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-06 09:31:01,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-06 09:31:01,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:01,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:01,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:31:01,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:01,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817061164] [2025-02-06 09:31:01,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817061164] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:01,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:01,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:31:01,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898850331] [2025-02-06 09:31:01,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:01,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:31:01,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:01,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:31:01,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:31:01,856 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 512 [2025-02-06 09:31:01,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 375 transitions, 777 flow. Second operand has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:01,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:01,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 512 [2025-02-06 09:31:01,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:01,944 INFO L124 PetriNetUnfolderBase]: 84/563 cut-off events. [2025-02-06 09:31:01,944 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-02-06 09:31:01,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 705 conditions, 563 events. 84/563 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1143 event pairs, 7 based on Foata normal form. 0/482 useless extension candidates. Maximal degree in co-relation 639. Up to 98 conditions per place. [2025-02-06 09:31:01,947 INFO L140 encePairwiseOnDemand]: 509/512 looper letters, 21 selfloop transitions, 2 changer transitions 0/374 dead transitions. [2025-02-06 09:31:01,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 374 transitions, 821 flow [2025-02-06 09:31:01,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:31:01,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:31:01,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1182 transitions. [2025-02-06 09:31:01,950 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.76953125 [2025-02-06 09:31:01,950 INFO L175 Difference]: Start difference. First operand has 369 places, 375 transitions, 777 flow. Second operand 3 states and 1182 transitions. [2025-02-06 09:31:01,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 374 transitions, 821 flow [2025-02-06 09:31:01,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 374 transitions, 817 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:31:01,955 INFO L231 Difference]: Finished difference. Result has 368 places, 374 transitions, 775 flow [2025-02-06 09:31:01,955 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=512, PETRI_DIFFERENCE_MINUEND_FLOW=771, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=775, PETRI_PLACES=368, PETRI_TRANSITIONS=374} [2025-02-06 09:31:01,956 INFO L279 CegarLoopForPetriNet]: 479 programPoint places, -111 predicate places. [2025-02-06 09:31:01,957 INFO L471 AbstractCegarLoop]: Abstraction has has 368 places, 374 transitions, 775 flow [2025-02-06 09:31:01,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:01,957 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:01,958 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:31:01,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 09:31:01,958 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err49ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 224 more)] === [2025-02-06 09:31:01,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:01,958 INFO L85 PathProgramCache]: Analyzing trace with hash -577735773, now seen corresponding path program 1 times [2025-02-06 09:31:01,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:01,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879812768] [2025-02-06 09:31:01,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:01,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:01,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-06 09:31:01,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 09:31:01,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:01,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:01,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:31:01,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:01,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879812768] [2025-02-06 09:31:01,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879812768] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:01,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:01,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:31:01,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093323974] [2025-02-06 09:31:01,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:01,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:31:01,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:01,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:31:01,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:31:01,997 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 391 out of 512 [2025-02-06 09:31:01,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 374 transitions, 775 flow. Second operand has 3 states, 3 states have (on average 392.0) internal successors, (1176), 3 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:01,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:01,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 512 [2025-02-06 09:31:01,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:02,072 INFO L124 PetriNetUnfolderBase]: 84/562 cut-off events. [2025-02-06 09:31:02,073 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2025-02-06 09:31:02,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 701 conditions, 562 events. 84/562 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1141 event pairs, 7 based on Foata normal form. 0/482 useless extension candidates. Maximal degree in co-relation 636. Up to 95 conditions per place. [2025-02-06 09:31:02,078 INFO L140 encePairwiseOnDemand]: 510/512 looper letters, 19 selfloop transitions, 1 changer transitions 0/373 dead transitions. [2025-02-06 09:31:02,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 373 transitions, 813 flow [2025-02-06 09:31:02,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:31:02,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:31:02,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1191 transitions. [2025-02-06 09:31:02,080 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.775390625 [2025-02-06 09:31:02,081 INFO L175 Difference]: Start difference. First operand has 368 places, 374 transitions, 775 flow. Second operand 3 states and 1191 transitions. [2025-02-06 09:31:02,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 373 transitions, 813 flow [2025-02-06 09:31:02,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 373 transitions, 809 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:31:02,085 INFO L231 Difference]: Finished difference. Result has 367 places, 373 transitions, 771 flow [2025-02-06 09:31:02,085 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=512, PETRI_DIFFERENCE_MINUEND_FLOW=769, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=771, PETRI_PLACES=367, PETRI_TRANSITIONS=373} [2025-02-06 09:31:02,086 INFO L279 CegarLoopForPetriNet]: 479 programPoint places, -112 predicate places. [2025-02-06 09:31:02,086 INFO L471 AbstractCegarLoop]: Abstraction has has 367 places, 373 transitions, 771 flow [2025-02-06 09:31:02,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 392.0) internal successors, (1176), 3 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:02,087 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:02,087 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:31:02,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 09:31:02,087 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err49ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 224 more)] === [2025-02-06 09:31:02,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:02,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1979850403, now seen corresponding path program 1 times [2025-02-06 09:31:02,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:02,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137069165] [2025-02-06 09:31:02,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:02,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:02,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-06 09:31:02,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-06 09:31:02,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:02,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:02,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:31:02,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:02,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137069165] [2025-02-06 09:31:02,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137069165] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:02,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:02,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:31:02,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854595427] [2025-02-06 09:31:02,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:02,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:31:02,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:02,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:31:02,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:31:02,137 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 512 [2025-02-06 09:31:02,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 373 transitions, 771 flow. Second operand has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:02,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:02,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 512 [2025-02-06 09:31:02,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:02,223 INFO L124 PetriNetUnfolderBase]: 84/561 cut-off events. [2025-02-06 09:31:02,223 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-02-06 09:31:02,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 701 conditions, 561 events. 84/561 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1131 event pairs, 7 based on Foata normal form. 0/482 useless extension candidates. Maximal degree in co-relation 635. Up to 97 conditions per place. [2025-02-06 09:31:02,227 INFO L140 encePairwiseOnDemand]: 509/512 looper letters, 20 selfloop transitions, 2 changer transitions 0/372 dead transitions. [2025-02-06 09:31:02,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 372 transitions, 813 flow [2025-02-06 09:31:02,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:31:02,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:31:02,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1184 transitions. [2025-02-06 09:31:02,230 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7708333333333334 [2025-02-06 09:31:02,230 INFO L175 Difference]: Start difference. First operand has 367 places, 373 transitions, 771 flow. Second operand 3 states and 1184 transitions. [2025-02-06 09:31:02,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 372 transitions, 813 flow [2025-02-06 09:31:02,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 372 transitions, 812 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:31:02,235 INFO L231 Difference]: Finished difference. Result has 367 places, 372 transitions, 772 flow [2025-02-06 09:31:02,236 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=512, PETRI_DIFFERENCE_MINUEND_FLOW=768, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=772, PETRI_PLACES=367, PETRI_TRANSITIONS=372} [2025-02-06 09:31:02,237 INFO L279 CegarLoopForPetriNet]: 479 programPoint places, -112 predicate places. [2025-02-06 09:31:02,237 INFO L471 AbstractCegarLoop]: Abstraction has has 367 places, 372 transitions, 772 flow [2025-02-06 09:31:02,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:02,238 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:02,238 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] [2025-02-06 09:31:02,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 09:31:02,238 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err49ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 224 more)] === [2025-02-06 09:31:02,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:02,239 INFO L85 PathProgramCache]: Analyzing trace with hash -2086519389, now seen corresponding path program 1 times [2025-02-06 09:31:02,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:02,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837527403] [2025-02-06 09:31:02,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:02,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:02,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-06 09:31:02,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-06 09:31:02,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:02,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:02,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:31:02,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:02,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837527403] [2025-02-06 09:31:02,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837527403] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:02,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:02,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:31:02,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323082802] [2025-02-06 09:31:02,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:02,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:31:02,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:02,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:31:02,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:31:02,292 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 512 [2025-02-06 09:31:02,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 372 transitions, 772 flow. Second operand has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:02,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:02,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 512 [2025-02-06 09:31:02,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:02,404 INFO L124 PetriNetUnfolderBase]: 84/560 cut-off events. [2025-02-06 09:31:02,405 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-02-06 09:31:02,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 703 conditions, 560 events. 84/560 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1127 event pairs, 7 based on Foata normal form. 0/482 useless extension candidates. Maximal degree in co-relation 637. Up to 98 conditions per place. [2025-02-06 09:31:02,409 INFO L140 encePairwiseOnDemand]: 509/512 looper letters, 21 selfloop transitions, 2 changer transitions 0/371 dead transitions. [2025-02-06 09:31:02,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 371 transitions, 816 flow [2025-02-06 09:31:02,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:31:02,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:31:02,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1182 transitions. [2025-02-06 09:31:02,412 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.76953125 [2025-02-06 09:31:02,412 INFO L175 Difference]: Start difference. First operand has 367 places, 372 transitions, 772 flow. Second operand 3 states and 1182 transitions. [2025-02-06 09:31:02,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 371 transitions, 816 flow [2025-02-06 09:31:02,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 371 transitions, 812 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:31:02,417 INFO L231 Difference]: Finished difference. Result has 366 places, 371 transitions, 770 flow [2025-02-06 09:31:02,417 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=512, PETRI_DIFFERENCE_MINUEND_FLOW=766, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=770, PETRI_PLACES=366, PETRI_TRANSITIONS=371} [2025-02-06 09:31:02,417 INFO L279 CegarLoopForPetriNet]: 479 programPoint places, -113 predicate places. [2025-02-06 09:31:02,418 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 371 transitions, 770 flow [2025-02-06 09:31:02,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:02,418 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:02,418 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:31:02,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 09:31:02,419 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err49ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 224 more)] === [2025-02-06 09:31:02,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:02,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1252514350, now seen corresponding path program 1 times [2025-02-06 09:31:02,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:02,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735892852] [2025-02-06 09:31:02,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:02,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:02,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-06 09:31:02,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-06 09:31:02,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:02,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:02,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:31:02,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:02,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735892852] [2025-02-06 09:31:02,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735892852] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:02,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:02,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:31:02,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140465966] [2025-02-06 09:31:02,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:02,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:31:02,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:02,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:31:02,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:31:02,482 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 391 out of 512 [2025-02-06 09:31:02,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 371 transitions, 770 flow. Second operand has 3 states, 3 states have (on average 392.0) internal successors, (1176), 3 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:02,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:02,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 512 [2025-02-06 09:31:02,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:02,657 INFO L124 PetriNetUnfolderBase]: 158/829 cut-off events. [2025-02-06 09:31:02,657 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-02-06 09:31:02,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1077 conditions, 829 events. 158/829 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2690 event pairs, 7 based on Foata normal form. 0/702 useless extension candidates. Maximal degree in co-relation 1012. Up to 94 conditions per place. [2025-02-06 09:31:02,665 INFO L140 encePairwiseOnDemand]: 509/512 looper letters, 33 selfloop transitions, 2 changer transitions 0/385 dead transitions. [2025-02-06 09:31:02,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 385 transitions, 884 flow [2025-02-06 09:31:02,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:31:02,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:31:02,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1203 transitions. [2025-02-06 09:31:02,668 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.783203125 [2025-02-06 09:31:02,668 INFO L175 Difference]: Start difference. First operand has 366 places, 371 transitions, 770 flow. Second operand 3 states and 1203 transitions. [2025-02-06 09:31:02,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 385 transitions, 884 flow [2025-02-06 09:31:02,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 385 transitions, 880 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:31:02,672 INFO L231 Difference]: Finished difference. Result has 366 places, 371 transitions, 774 flow [2025-02-06 09:31:02,673 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=512, PETRI_DIFFERENCE_MINUEND_FLOW=764, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=774, PETRI_PLACES=366, PETRI_TRANSITIONS=371} [2025-02-06 09:31:02,673 INFO L279 CegarLoopForPetriNet]: 479 programPoint places, -113 predicate places. [2025-02-06 09:31:02,673 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 371 transitions, 774 flow [2025-02-06 09:31:02,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 392.0) internal successors, (1176), 3 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:02,674 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:02,674 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:31:02,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 09:31:02,674 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err49ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 224 more)] === [2025-02-06 09:31:02,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:02,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1526558426, now seen corresponding path program 1 times [2025-02-06 09:31:02,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:02,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366800621] [2025-02-06 09:31:02,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:02,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:02,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-06 09:31:02,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-06 09:31:02,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:02,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:02,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:31:02,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:02,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366800621] [2025-02-06 09:31:02,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366800621] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:02,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:02,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:31:02,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579757597] [2025-02-06 09:31:02,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:02,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:31:02,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:02,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:31:02,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:31:02,717 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 512 [2025-02-06 09:31:02,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 371 transitions, 774 flow. Second operand has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:02,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:02,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 512 [2025-02-06 09:31:02,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:02,814 INFO L124 PetriNetUnfolderBase]: 154/760 cut-off events. [2025-02-06 09:31:02,814 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2025-02-06 09:31:02,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1040 conditions, 760 events. 154/760 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2276 event pairs, 22 based on Foata normal form. 0/644 useless extension candidates. Maximal degree in co-relation 973. Up to 179 conditions per place. [2025-02-06 09:31:02,821 INFO L140 encePairwiseOnDemand]: 509/512 looper letters, 21 selfloop transitions, 2 changer transitions 0/370 dead transitions. [2025-02-06 09:31:02,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 370 transitions, 818 flow [2025-02-06 09:31:02,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:31:02,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:31:02,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1184 transitions. [2025-02-06 09:31:02,823 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7708333333333334 [2025-02-06 09:31:02,823 INFO L175 Difference]: Start difference. First operand has 366 places, 371 transitions, 774 flow. Second operand 3 states and 1184 transitions. [2025-02-06 09:31:02,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 370 transitions, 818 flow [2025-02-06 09:31:02,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 370 transitions, 816 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:31:02,827 INFO L231 Difference]: Finished difference. Result has 366 places, 370 transitions, 774 flow [2025-02-06 09:31:02,828 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=512, PETRI_DIFFERENCE_MINUEND_FLOW=770, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=774, PETRI_PLACES=366, PETRI_TRANSITIONS=370} [2025-02-06 09:31:02,828 INFO L279 CegarLoopForPetriNet]: 479 programPoint places, -113 predicate places. [2025-02-06 09:31:02,828 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 370 transitions, 774 flow [2025-02-06 09:31:02,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:02,829 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:02,829 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] [2025-02-06 09:31:02,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 09:31:02,829 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err49ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 224 more)] === [2025-02-06 09:31:02,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:02,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1126979856, now seen corresponding path program 1 times [2025-02-06 09:31:02,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:02,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439759834] [2025-02-06 09:31:02,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:02,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:02,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-02-06 09:31:02,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-02-06 09:31:02,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:02,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:02,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:31:02,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:02,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439759834] [2025-02-06 09:31:02,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439759834] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:02,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:02,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:31:02,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592511011] [2025-02-06 09:31:02,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:02,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:31:02,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:02,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:31:02,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:31:02,875 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 512 [2025-02-06 09:31:02,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 370 transitions, 774 flow. Second operand has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:02,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:02,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 512 [2025-02-06 09:31:02,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:03,002 INFO L124 PetriNetUnfolderBase]: 154/759 cut-off events. [2025-02-06 09:31:03,003 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2025-02-06 09:31:03,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1032 conditions, 759 events. 154/759 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2271 event pairs, 22 based on Foata normal form. 0/644 useless extension candidates. Maximal degree in co-relation 965. Up to 180 conditions per place. [2025-02-06 09:31:03,009 INFO L140 encePairwiseOnDemand]: 509/512 looper letters, 22 selfloop transitions, 2 changer transitions 0/369 dead transitions. [2025-02-06 09:31:03,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 369 transitions, 820 flow [2025-02-06 09:31:03,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:31:03,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:31:03,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1182 transitions. [2025-02-06 09:31:03,013 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.76953125 [2025-02-06 09:31:03,013 INFO L175 Difference]: Start difference. First operand has 366 places, 370 transitions, 774 flow. Second operand 3 states and 1182 transitions. [2025-02-06 09:31:03,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 369 transitions, 820 flow [2025-02-06 09:31:03,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 369 transitions, 816 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:31:03,017 INFO L231 Difference]: Finished difference. Result has 365 places, 369 transitions, 772 flow [2025-02-06 09:31:03,017 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=512, PETRI_DIFFERENCE_MINUEND_FLOW=768, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=772, PETRI_PLACES=365, PETRI_TRANSITIONS=369} [2025-02-06 09:31:03,018 INFO L279 CegarLoopForPetriNet]: 479 programPoint places, -114 predicate places. [2025-02-06 09:31:03,018 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 369 transitions, 772 flow [2025-02-06 09:31:03,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:03,018 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:03,018 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:31:03,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 09:31:03,019 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err49ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 224 more)] === [2025-02-06 09:31:03,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:03,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1219434866, now seen corresponding path program 1 times [2025-02-06 09:31:03,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:03,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082554080] [2025-02-06 09:31:03,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:03,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:03,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-02-06 09:31:03,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-02-06 09:31:03,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:03,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:03,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:31:03,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:03,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082554080] [2025-02-06 09:31:03,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082554080] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:03,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:03,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:31:03,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376579103] [2025-02-06 09:31:03,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:03,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:31:03,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:03,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:31:03,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:31:03,066 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 391 out of 512 [2025-02-06 09:31:03,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 369 transitions, 772 flow. Second operand has 3 states, 3 states have (on average 392.0) internal successors, (1176), 3 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:03,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:03,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 512 [2025-02-06 09:31:03,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:03,164 INFO L124 PetriNetUnfolderBase]: 154/758 cut-off events. [2025-02-06 09:31:03,164 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2025-02-06 09:31:03,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1028 conditions, 758 events. 154/758 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2272 event pairs, 22 based on Foata normal form. 0/644 useless extension candidates. Maximal degree in co-relation 962. Up to 177 conditions per place. [2025-02-06 09:31:03,171 INFO L140 encePairwiseOnDemand]: 510/512 looper letters, 20 selfloop transitions, 1 changer transitions 0/368 dead transitions. [2025-02-06 09:31:03,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 368 transitions, 812 flow [2025-02-06 09:31:03,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:31:03,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:31:03,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1191 transitions. [2025-02-06 09:31:03,178 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.775390625 [2025-02-06 09:31:03,178 INFO L175 Difference]: Start difference. First operand has 365 places, 369 transitions, 772 flow. Second operand 3 states and 1191 transitions. [2025-02-06 09:31:03,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 368 transitions, 812 flow [2025-02-06 09:31:03,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 368 transitions, 808 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:31:03,183 INFO L231 Difference]: Finished difference. Result has 364 places, 368 transitions, 768 flow [2025-02-06 09:31:03,183 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=512, PETRI_DIFFERENCE_MINUEND_FLOW=766, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=768, PETRI_PLACES=364, PETRI_TRANSITIONS=368} [2025-02-06 09:31:03,184 INFO L279 CegarLoopForPetriNet]: 479 programPoint places, -115 predicate places. [2025-02-06 09:31:03,184 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 368 transitions, 768 flow [2025-02-06 09:31:03,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 392.0) internal successors, (1176), 3 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:03,184 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:03,185 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] [2025-02-06 09:31:03,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 09:31:03,185 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err49ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 224 more)] === [2025-02-06 09:31:03,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:03,186 INFO L85 PathProgramCache]: Analyzing trace with hash -756047509, now seen corresponding path program 1 times [2025-02-06 09:31:03,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:03,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818832914] [2025-02-06 09:31:03,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:03,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:03,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-02-06 09:31:03,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-02-06 09:31:03,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:03,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:03,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:31:03,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:03,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818832914] [2025-02-06 09:31:03,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818832914] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:03,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:03,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:31:03,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702718797] [2025-02-06 09:31:03,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:03,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:31:03,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:03,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:31:03,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:31:03,239 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 512 [2025-02-06 09:31:03,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 368 transitions, 768 flow. Second operand has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:03,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:03,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 512 [2025-02-06 09:31:03,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:03,350 INFO L124 PetriNetUnfolderBase]: 154/757 cut-off events. [2025-02-06 09:31:03,351 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2025-02-06 09:31:03,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1028 conditions, 757 events. 154/757 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2261 event pairs, 22 based on Foata normal form. 0/644 useless extension candidates. Maximal degree in co-relation 961. Up to 179 conditions per place. [2025-02-06 09:31:03,356 INFO L140 encePairwiseOnDemand]: 509/512 looper letters, 21 selfloop transitions, 2 changer transitions 0/367 dead transitions. [2025-02-06 09:31:03,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 367 transitions, 812 flow [2025-02-06 09:31:03,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:31:03,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:31:03,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1184 transitions. [2025-02-06 09:31:03,359 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7708333333333334 [2025-02-06 09:31:03,359 INFO L175 Difference]: Start difference. First operand has 364 places, 368 transitions, 768 flow. Second operand 3 states and 1184 transitions. [2025-02-06 09:31:03,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 367 transitions, 812 flow [2025-02-06 09:31:03,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 367 transitions, 811 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:31:03,395 INFO L231 Difference]: Finished difference. Result has 364 places, 367 transitions, 769 flow [2025-02-06 09:31:03,396 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=512, PETRI_DIFFERENCE_MINUEND_FLOW=765, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=769, PETRI_PLACES=364, PETRI_TRANSITIONS=367} [2025-02-06 09:31:03,396 INFO L279 CegarLoopForPetriNet]: 479 programPoint places, -115 predicate places. [2025-02-06 09:31:03,396 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 367 transitions, 769 flow [2025-02-06 09:31:03,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:03,396 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:03,396 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] [2025-02-06 09:31:03,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 09:31:03,397 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err49ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 224 more)] === [2025-02-06 09:31:03,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:03,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1963278440, now seen corresponding path program 1 times [2025-02-06 09:31:03,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:03,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053287232] [2025-02-06 09:31:03,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:03,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:03,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-02-06 09:31:03,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-02-06 09:31:03,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:03,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:03,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:31:03,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:03,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053287232] [2025-02-06 09:31:03,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053287232] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:03,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:03,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:31:03,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946522460] [2025-02-06 09:31:03,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:03,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:31:03,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:03,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:31:03,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:31:03,451 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 512 [2025-02-06 09:31:03,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 367 transitions, 769 flow. Second operand has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:03,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:03,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 512 [2025-02-06 09:31:03,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:03,554 INFO L124 PetriNetUnfolderBase]: 154/756 cut-off events. [2025-02-06 09:31:03,554 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2025-02-06 09:31:03,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1029 conditions, 756 events. 154/756 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2269 event pairs, 22 based on Foata normal form. 0/644 useless extension candidates. Maximal degree in co-relation 962. Up to 179 conditions per place. [2025-02-06 09:31:03,561 INFO L140 encePairwiseOnDemand]: 509/512 looper letters, 21 selfloop transitions, 2 changer transitions 0/366 dead transitions. [2025-02-06 09:31:03,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 366 transitions, 813 flow [2025-02-06 09:31:03,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:31:03,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:31:03,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1184 transitions. [2025-02-06 09:31:03,564 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7708333333333334 [2025-02-06 09:31:03,564 INFO L175 Difference]: Start difference. First operand has 364 places, 367 transitions, 769 flow. Second operand 3 states and 1184 transitions. [2025-02-06 09:31:03,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 366 transitions, 813 flow [2025-02-06 09:31:03,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 366 transitions, 809 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:31:03,568 INFO L231 Difference]: Finished difference. Result has 363 places, 366 transitions, 767 flow [2025-02-06 09:31:03,568 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=512, PETRI_DIFFERENCE_MINUEND_FLOW=763, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=767, PETRI_PLACES=363, PETRI_TRANSITIONS=366} [2025-02-06 09:31:03,569 INFO L279 CegarLoopForPetriNet]: 479 programPoint places, -116 predicate places. [2025-02-06 09:31:03,569 INFO L471 AbstractCegarLoop]: Abstraction has has 363 places, 366 transitions, 767 flow [2025-02-06 09:31:03,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:03,569 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:03,570 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] [2025-02-06 09:31:03,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 09:31:03,570 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err49ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 224 more)] === [2025-02-06 09:31:03,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:03,571 INFO L85 PathProgramCache]: Analyzing trace with hash 998658120, now seen corresponding path program 1 times [2025-02-06 09:31:03,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:03,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614921524] [2025-02-06 09:31:03,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:03,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:03,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-02-06 09:31:03,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-02-06 09:31:03,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:03,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:03,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:31:03,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:03,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614921524] [2025-02-06 09:31:03,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614921524] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:03,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:03,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:31:03,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951277682] [2025-02-06 09:31:03,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:03,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:31:03,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:03,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:31:03,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:31:03,625 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 512 [2025-02-06 09:31:03,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 366 transitions, 767 flow. Second operand has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:03,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:03,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 512 [2025-02-06 09:31:03,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:03,729 INFO L124 PetriNetUnfolderBase]: 154/755 cut-off events. [2025-02-06 09:31:03,729 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2025-02-06 09:31:03,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1028 conditions, 755 events. 154/755 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2270 event pairs, 22 based on Foata normal form. 0/644 useless extension candidates. Maximal degree in co-relation 961. Up to 179 conditions per place. [2025-02-06 09:31:03,734 INFO L140 encePairwiseOnDemand]: 509/512 looper letters, 21 selfloop transitions, 2 changer transitions 0/365 dead transitions. [2025-02-06 09:31:03,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 365 transitions, 811 flow [2025-02-06 09:31:03,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:31:03,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:31:03,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1184 transitions. [2025-02-06 09:31:03,737 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7708333333333334 [2025-02-06 09:31:03,737 INFO L175 Difference]: Start difference. First operand has 363 places, 366 transitions, 767 flow. Second operand 3 states and 1184 transitions. [2025-02-06 09:31:03,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 365 transitions, 811 flow [2025-02-06 09:31:03,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 365 transitions, 807 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:31:03,741 INFO L231 Difference]: Finished difference. Result has 362 places, 365 transitions, 765 flow [2025-02-06 09:31:03,741 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=512, PETRI_DIFFERENCE_MINUEND_FLOW=761, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=765, PETRI_PLACES=362, PETRI_TRANSITIONS=365} [2025-02-06 09:31:03,741 INFO L279 CegarLoopForPetriNet]: 479 programPoint places, -117 predicate places. [2025-02-06 09:31:03,741 INFO L471 AbstractCegarLoop]: Abstraction has has 362 places, 365 transitions, 765 flow [2025-02-06 09:31:03,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:03,742 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:03,742 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] [2025-02-06 09:31:03,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 09:31:03,742 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err49ASSERT_VIOLATIONDATA_RACE === [thread1Err49ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 224 more)] === [2025-02-06 09:31:03,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:03,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1216218723, now seen corresponding path program 1 times [2025-02-06 09:31:03,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:03,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022328800] [2025-02-06 09:31:03,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:03,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:03,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-02-06 09:31:03,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-02-06 09:31:03,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:03,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:03,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:31:03,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:03,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022328800] [2025-02-06 09:31:03,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022328800] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:03,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:03,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:31:03,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107841652] [2025-02-06 09:31:03,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:03,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:31:03,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:03,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:31:03,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:31:03,809 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 383 out of 512 [2025-02-06 09:31:03,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 365 transitions, 765 flow. Second operand has 3 states, 3 states have (on average 384.0) internal successors, (1152), 3 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:03,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:03,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 383 of 512 [2025-02-06 09:31:03,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:04,096 INFO L124 PetriNetUnfolderBase]: 612/2074 cut-off events. [2025-02-06 09:31:04,096 INFO L125 PetriNetUnfolderBase]: For 272/272 co-relation queries the response was YES. [2025-02-06 09:31:04,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3140 conditions, 2074 events. 612/2074 cut-off events. For 272/272 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 12578 event pairs, 88 based on Foata normal form. 0/1697 useless extension candidates. Maximal degree in co-relation 3074. Up to 566 conditions per place. [2025-02-06 09:31:04,116 INFO L140 encePairwiseOnDemand]: 503/512 looper letters, 31 selfloop transitions, 7 changer transitions 0/373 dead transitions. [2025-02-06 09:31:04,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 373 transitions, 870 flow [2025-02-06 09:31:04,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:31:04,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:31:04,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1185 transitions. [2025-02-06 09:31:04,119 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.771484375 [2025-02-06 09:31:04,119 INFO L175 Difference]: Start difference. First operand has 362 places, 365 transitions, 765 flow. Second operand 3 states and 1185 transitions. [2025-02-06 09:31:04,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 373 transitions, 870 flow [2025-02-06 09:31:04,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 373 transitions, 866 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:31:04,123 INFO L231 Difference]: Finished difference. Result has 359 places, 362 transitions, 778 flow [2025-02-06 09:31:04,123 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=512, PETRI_DIFFERENCE_MINUEND_FLOW=753, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=778, PETRI_PLACES=359, PETRI_TRANSITIONS=362} [2025-02-06 09:31:04,124 INFO L279 CegarLoopForPetriNet]: 479 programPoint places, -120 predicate places. [2025-02-06 09:31:04,124 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 362 transitions, 778 flow [2025-02-06 09:31:04,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 384.0) internal successors, (1152), 3 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:04,125 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:04,125 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:31:04,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 09:31:04,125 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err24ASSERT_VIOLATIONDATA_RACE === [thread1Err49ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 224 more)] === [2025-02-06 09:31:04,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:04,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1713809333, now seen corresponding path program 1 times [2025-02-06 09:31:04,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:04,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918007823] [2025-02-06 09:31:04,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:04,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:04,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-02-06 09:31:04,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-02-06 09:31:04,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:04,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:04,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:31:04,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:04,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918007823] [2025-02-06 09:31:04,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918007823] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:04,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:04,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:31:04,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236110624] [2025-02-06 09:31:04,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:04,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:31:04,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:04,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:31:04,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:31:04,187 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 389 out of 512 [2025-02-06 09:31:04,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 362 transitions, 778 flow. Second operand has 3 states, 3 states have (on average 390.3333333333333) internal successors, (1171), 3 states have internal predecessors, (1171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:04,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:04,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 389 of 512 [2025-02-06 09:31:04,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:04,672 INFO L124 PetriNetUnfolderBase]: 750/2321 cut-off events. [2025-02-06 09:31:04,672 INFO L125 PetriNetUnfolderBase]: For 1396/1478 co-relation queries the response was YES. [2025-02-06 09:31:04,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3829 conditions, 2321 events. 750/2321 cut-off events. For 1396/1478 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 14000 event pairs, 86 based on Foata normal form. 0/1950 useless extension candidates. Maximal degree in co-relation 3763. Up to 668 conditions per place. [2025-02-06 09:31:04,692 INFO L140 encePairwiseOnDemand]: 507/512 looper letters, 32 selfloop transitions, 4 changer transitions 0/374 dead transitions. [2025-02-06 09:31:04,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 374 transitions, 908 flow [2025-02-06 09:31:04,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:31:04,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:31:04,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1198 transitions. [2025-02-06 09:31:04,695 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7799479166666666 [2025-02-06 09:31:04,695 INFO L175 Difference]: Start difference. First operand has 359 places, 362 transitions, 778 flow. Second operand 3 states and 1198 transitions. [2025-02-06 09:31:04,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 374 transitions, 908 flow [2025-02-06 09:31:04,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 374 transitions, 895 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:31:04,701 INFO L231 Difference]: Finished difference. Result has 359 places, 361 transitions, 783 flow [2025-02-06 09:31:04,701 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=512, PETRI_DIFFERENCE_MINUEND_FLOW=767, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=356, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=783, PETRI_PLACES=359, PETRI_TRANSITIONS=361} [2025-02-06 09:31:04,701 INFO L279 CegarLoopForPetriNet]: 479 programPoint places, -120 predicate places. [2025-02-06 09:31:04,702 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 361 transitions, 783 flow [2025-02-06 09:31:04,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 390.3333333333333) internal successors, (1171), 3 states have internal predecessors, (1171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:04,702 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:04,702 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:31:04,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-06 09:31:04,702 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread3Err24ASSERT_VIOLATIONDATA_RACE === [thread1Err49ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 224 more)] === [2025-02-06 09:31:04,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:04,703 INFO L85 PathProgramCache]: Analyzing trace with hash -629340540, now seen corresponding path program 1 times [2025-02-06 09:31:04,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:04,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503470568] [2025-02-06 09:31:04,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:04,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:04,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 243 statements into 1 equivalence classes. [2025-02-06 09:31:04,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 243 of 243 statements. [2025-02-06 09:31:04,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:04,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:04,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:31:04,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:04,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503470568] [2025-02-06 09:31:04,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503470568] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:04,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:04,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:31:04,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127242116] [2025-02-06 09:31:04,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:04,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:31:04,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:04,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:31:04,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:31:04,778 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 389 out of 512 [2025-02-06 09:31:04,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 361 transitions, 783 flow. Second operand has 3 states, 3 states have (on average 390.6666666666667) internal successors, (1172), 3 states have internal predecessors, (1172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:04,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:04,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 389 of 512 [2025-02-06 09:31:04,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:05,106 INFO L124 PetriNetUnfolderBase]: 794/2505 cut-off events. [2025-02-06 09:31:05,107 INFO L125 PetriNetUnfolderBase]: For 1794/1826 co-relation queries the response was YES. [2025-02-06 09:31:05,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4380 conditions, 2505 events. 794/2505 cut-off events. For 1794/1826 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 16581 event pairs, 42 based on Foata normal form. 4/2162 useless extension candidates. Maximal degree in co-relation 4313. Up to 824 conditions per place. [2025-02-06 09:31:05,128 INFO L140 encePairwiseOnDemand]: 507/512 looper letters, 31 selfloop transitions, 4 changer transitions 0/372 dead transitions. [2025-02-06 09:31:05,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 372 transitions, 911 flow [2025-02-06 09:31:05,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:31:05,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:31:05,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1197 transitions. [2025-02-06 09:31:05,131 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.779296875 [2025-02-06 09:31:05,131 INFO L175 Difference]: Start difference. First operand has 359 places, 361 transitions, 783 flow. Second operand 3 states and 1197 transitions. [2025-02-06 09:31:05,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 372 transitions, 911 flow [2025-02-06 09:31:05,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 372 transitions, 904 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:31:05,136 INFO L231 Difference]: Finished difference. Result has 359 places, 360 transitions, 791 flow [2025-02-06 09:31:05,137 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=512, PETRI_DIFFERENCE_MINUEND_FLOW=775, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=791, PETRI_PLACES=359, PETRI_TRANSITIONS=360} [2025-02-06 09:31:05,137 INFO L279 CegarLoopForPetriNet]: 479 programPoint places, -120 predicate places. [2025-02-06 09:31:05,137 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 360 transitions, 791 flow [2025-02-06 09:31:05,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 390.6666666666667) internal successors, (1172), 3 states have internal predecessors, (1172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:05,142 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:05,142 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:31:05,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-06 09:31:05,142 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err49ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 224 more)] === [2025-02-06 09:31:05,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:05,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1633831262, now seen corresponding path program 1 times [2025-02-06 09:31:05,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:05,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136571017] [2025-02-06 09:31:05,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:05,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:05,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-02-06 09:31:05,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-02-06 09:31:05,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:05,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:05,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:31:05,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:05,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136571017] [2025-02-06 09:31:05,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136571017] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:05,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:05,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:31:05,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794385813] [2025-02-06 09:31:05,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:05,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:31:05,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:05,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:31:05,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:31:05,213 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 391 out of 512 [2025-02-06 09:31:05,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 360 transitions, 791 flow. Second operand has 3 states, 3 states have (on average 394.0) internal successors, (1182), 3 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:05,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:05,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 512 [2025-02-06 09:31:05,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:05,387 INFO L124 PetriNetUnfolderBase]: 243/1290 cut-off events. [2025-02-06 09:31:05,388 INFO L125 PetriNetUnfolderBase]: For 774/806 co-relation queries the response was YES. [2025-02-06 09:31:05,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2118 conditions, 1290 events. 243/1290 cut-off events. For 774/806 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 6530 event pairs, 42 based on Foata normal form. 64/1189 useless extension candidates. Maximal degree in co-relation 2049. Up to 345 conditions per place. [2025-02-06 09:31:05,401 INFO L140 encePairwiseOnDemand]: 510/512 looper letters, 0 selfloop transitions, 0 changer transitions 359/359 dead transitions. [2025-02-06 09:31:05,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 359 transitions, 829 flow [2025-02-06 09:31:05,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:31:05,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:31:05,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1190 transitions. [2025-02-06 09:31:05,404 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7747395833333334 [2025-02-06 09:31:05,404 INFO L175 Difference]: Start difference. First operand has 359 places, 360 transitions, 791 flow. Second operand 3 states and 1190 transitions. [2025-02-06 09:31:05,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 359 transitions, 829 flow [2025-02-06 09:31:05,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 359 transitions, 825 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:31:05,408 INFO L231 Difference]: Finished difference. Result has 359 places, 0 transitions, 0 flow [2025-02-06 09:31:05,409 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=512, PETRI_DIFFERENCE_MINUEND_FLOW=785, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=359, PETRI_TRANSITIONS=0} [2025-02-06 09:31:05,409 INFO L279 CegarLoopForPetriNet]: 479 programPoint places, -120 predicate places. [2025-02-06 09:31:05,410 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 0 transitions, 0 flow [2025-02-06 09:31:05,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 394.0) internal successors, (1182), 3 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:05,412 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err49ASSERT_VIOLATIONDATA_RACE (227 of 228 remaining) [2025-02-06 09:31:05,412 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (226 of 228 remaining) [2025-02-06 09:31:05,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (225 of 228 remaining) [2025-02-06 09:31:05,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (224 of 228 remaining) [2025-02-06 09:31:05,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (223 of 228 remaining) [2025-02-06 09:31:05,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (222 of 228 remaining) [2025-02-06 09:31:05,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (221 of 228 remaining) [2025-02-06 09:31:05,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (220 of 228 remaining) [2025-02-06 09:31:05,414 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (219 of 228 remaining) [2025-02-06 09:31:05,414 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (218 of 228 remaining) [2025-02-06 09:31:05,414 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (217 of 228 remaining) [2025-02-06 09:31:05,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (216 of 228 remaining) [2025-02-06 09:31:05,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (215 of 228 remaining) [2025-02-06 09:31:05,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (214 of 228 remaining) [2025-02-06 09:31:05,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err48ASSERT_VIOLATIONDATA_RACE (213 of 228 remaining) [2025-02-06 09:31:05,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (212 of 228 remaining) [2025-02-06 09:31:05,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (211 of 228 remaining) [2025-02-06 09:31:05,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (210 of 228 remaining) [2025-02-06 09:31:05,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (209 of 228 remaining) [2025-02-06 09:31:05,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (208 of 228 remaining) [2025-02-06 09:31:05,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (207 of 228 remaining) [2025-02-06 09:31:05,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (206 of 228 remaining) [2025-02-06 09:31:05,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (205 of 228 remaining) [2025-02-06 09:31:05,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (204 of 228 remaining) [2025-02-06 09:31:05,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (203 of 228 remaining) [2025-02-06 09:31:05,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err47ASSERT_VIOLATIONDATA_RACE (202 of 228 remaining) [2025-02-06 09:31:05,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err35ASSERT_VIOLATIONDATA_RACE (201 of 228 remaining) [2025-02-06 09:31:05,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err34ASSERT_VIOLATIONDATA_RACE (200 of 228 remaining) [2025-02-06 09:31:05,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err33ASSERT_VIOLATIONDATA_RACE (199 of 228 remaining) [2025-02-06 09:31:05,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err32ASSERT_VIOLATIONDATA_RACE (198 of 228 remaining) [2025-02-06 09:31:05,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err31ASSERT_VIOLATIONDATA_RACE (197 of 228 remaining) [2025-02-06 09:31:05,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err30ASSERT_VIOLATIONDATA_RACE (196 of 228 remaining) [2025-02-06 09:31:05,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (195 of 228 remaining) [2025-02-06 09:31:05,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (194 of 228 remaining) [2025-02-06 09:31:05,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (193 of 228 remaining) [2025-02-06 09:31:05,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (192 of 228 remaining) [2025-02-06 09:31:05,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (191 of 228 remaining) [2025-02-06 09:31:05,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (190 of 228 remaining) [2025-02-06 09:31:05,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (189 of 228 remaining) [2025-02-06 09:31:05,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err46ASSERT_VIOLATIONDATA_RACE (188 of 228 remaining) [2025-02-06 09:31:05,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err45ASSERT_VIOLATIONDATA_RACE (187 of 228 remaining) [2025-02-06 09:31:05,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err44ASSERT_VIOLATIONDATA_RACE (186 of 228 remaining) [2025-02-06 09:31:05,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err43ASSERT_VIOLATIONDATA_RACE (185 of 228 remaining) [2025-02-06 09:31:05,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err42ASSERT_VIOLATIONDATA_RACE (184 of 228 remaining) [2025-02-06 09:31:05,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err41ASSERT_VIOLATIONDATA_RACE (183 of 228 remaining) [2025-02-06 09:31:05,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err40ASSERT_VIOLATIONDATA_RACE (182 of 228 remaining) [2025-02-06 09:31:05,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err39ASSERT_VIOLATIONDATA_RACE (181 of 228 remaining) [2025-02-06 09:31:05,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err38ASSERT_VIOLATIONDATA_RACE (180 of 228 remaining) [2025-02-06 09:31:05,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err37ASSERT_VIOLATIONDATA_RACE (179 of 228 remaining) [2025-02-06 09:31:05,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err36ASSERT_VIOLATIONDATA_RACE (178 of 228 remaining) [2025-02-06 09:31:05,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (177 of 228 remaining) [2025-02-06 09:31:05,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (176 of 228 remaining) [2025-02-06 09:31:05,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (175 of 228 remaining) [2025-02-06 09:31:05,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (174 of 228 remaining) [2025-02-06 09:31:05,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (173 of 228 remaining) [2025-02-06 09:31:05,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (172 of 228 remaining) [2025-02-06 09:31:05,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (171 of 228 remaining) [2025-02-06 09:31:05,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (170 of 228 remaining) [2025-02-06 09:31:05,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (169 of 228 remaining) [2025-02-06 09:31:05,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (168 of 228 remaining) [2025-02-06 09:31:05,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (167 of 228 remaining) [2025-02-06 09:31:05,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (166 of 228 remaining) [2025-02-06 09:31:05,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (165 of 228 remaining) [2025-02-06 09:31:05,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (164 of 228 remaining) [2025-02-06 09:31:05,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (163 of 228 remaining) [2025-02-06 09:31:05,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (162 of 228 remaining) [2025-02-06 09:31:05,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (161 of 228 remaining) [2025-02-06 09:31:05,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (160 of 228 remaining) [2025-02-06 09:31:05,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (159 of 228 remaining) [2025-02-06 09:31:05,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (158 of 228 remaining) [2025-02-06 09:31:05,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (157 of 228 remaining) [2025-02-06 09:31:05,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (156 of 228 remaining) [2025-02-06 09:31:05,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (155 of 228 remaining) [2025-02-06 09:31:05,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (154 of 228 remaining) [2025-02-06 09:31:05,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (153 of 228 remaining) [2025-02-06 09:31:05,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err24ASSERT_VIOLATIONDATA_RACE (152 of 228 remaining) [2025-02-06 09:31:05,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (151 of 228 remaining) [2025-02-06 09:31:05,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (150 of 228 remaining) [2025-02-06 09:31:05,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (149 of 228 remaining) [2025-02-06 09:31:05,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (148 of 228 remaining) [2025-02-06 09:31:05,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (147 of 228 remaining) [2025-02-06 09:31:05,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (146 of 228 remaining) [2025-02-06 09:31:05,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (145 of 228 remaining) [2025-02-06 09:31:05,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (144 of 228 remaining) [2025-02-06 09:31:05,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (143 of 228 remaining) [2025-02-06 09:31:05,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (142 of 228 remaining) [2025-02-06 09:31:05,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err23ASSERT_VIOLATIONDATA_RACE (141 of 228 remaining) [2025-02-06 09:31:05,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err22ASSERT_VIOLATIONDATA_RACE (140 of 228 remaining) [2025-02-06 09:31:05,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err21ASSERT_VIOLATIONDATA_RACE (139 of 228 remaining) [2025-02-06 09:31:05,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err20ASSERT_VIOLATIONDATA_RACE (138 of 228 remaining) [2025-02-06 09:31:05,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (137 of 228 remaining) [2025-02-06 09:31:05,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (136 of 228 remaining) [2025-02-06 09:31:05,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (135 of 228 remaining) [2025-02-06 09:31:05,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (134 of 228 remaining) [2025-02-06 09:31:05,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (133 of 228 remaining) [2025-02-06 09:31:05,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (132 of 228 remaining) [2025-02-06 09:31:05,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (131 of 228 remaining) [2025-02-06 09:31:05,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (130 of 228 remaining) [2025-02-06 09:31:05,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (129 of 228 remaining) [2025-02-06 09:31:05,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (128 of 228 remaining) [2025-02-06 09:31:05,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (127 of 228 remaining) [2025-02-06 09:31:05,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (126 of 228 remaining) [2025-02-06 09:31:05,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (125 of 228 remaining) [2025-02-06 09:31:05,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (124 of 228 remaining) [2025-02-06 09:31:05,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (123 of 228 remaining) [2025-02-06 09:31:05,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (122 of 228 remaining) [2025-02-06 09:31:05,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (121 of 228 remaining) [2025-02-06 09:31:05,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (120 of 228 remaining) [2025-02-06 09:31:05,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (119 of 228 remaining) [2025-02-06 09:31:05,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (118 of 228 remaining) [2025-02-06 09:31:05,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (117 of 228 remaining) [2025-02-06 09:31:05,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (116 of 228 remaining) [2025-02-06 09:31:05,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (115 of 228 remaining) [2025-02-06 09:31:05,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (114 of 228 remaining) [2025-02-06 09:31:05,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (113 of 228 remaining) [2025-02-06 09:31:05,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (112 of 228 remaining) [2025-02-06 09:31:05,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (111 of 228 remaining) [2025-02-06 09:31:05,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (110 of 228 remaining) [2025-02-06 09:31:05,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (109 of 228 remaining) [2025-02-06 09:31:05,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (108 of 228 remaining) [2025-02-06 09:31:05,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (107 of 228 remaining) [2025-02-06 09:31:05,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (106 of 228 remaining) [2025-02-06 09:31:05,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (105 of 228 remaining) [2025-02-06 09:31:05,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (104 of 228 remaining) [2025-02-06 09:31:05,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (103 of 228 remaining) [2025-02-06 09:31:05,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (102 of 228 remaining) [2025-02-06 09:31:05,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (101 of 228 remaining) [2025-02-06 09:31:05,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (100 of 228 remaining) [2025-02-06 09:31:05,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err49ASSERT_VIOLATIONDATA_RACE (99 of 228 remaining) [2025-02-06 09:31:05,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (98 of 228 remaining) [2025-02-06 09:31:05,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (97 of 228 remaining) [2025-02-06 09:31:05,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (96 of 228 remaining) [2025-02-06 09:31:05,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (95 of 228 remaining) [2025-02-06 09:31:05,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (94 of 228 remaining) [2025-02-06 09:31:05,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (93 of 228 remaining) [2025-02-06 09:31:05,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (92 of 228 remaining) [2025-02-06 09:31:05,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (91 of 228 remaining) [2025-02-06 09:31:05,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (90 of 228 remaining) [2025-02-06 09:31:05,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (89 of 228 remaining) [2025-02-06 09:31:05,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (88 of 228 remaining) [2025-02-06 09:31:05,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (87 of 228 remaining) [2025-02-06 09:31:05,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (86 of 228 remaining) [2025-02-06 09:31:05,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err48ASSERT_VIOLATIONDATA_RACE (85 of 228 remaining) [2025-02-06 09:31:05,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (84 of 228 remaining) [2025-02-06 09:31:05,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (83 of 228 remaining) [2025-02-06 09:31:05,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (82 of 228 remaining) [2025-02-06 09:31:05,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (81 of 228 remaining) [2025-02-06 09:31:05,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (80 of 228 remaining) [2025-02-06 09:31:05,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (79 of 228 remaining) [2025-02-06 09:31:05,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (78 of 228 remaining) [2025-02-06 09:31:05,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (77 of 228 remaining) [2025-02-06 09:31:05,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (76 of 228 remaining) [2025-02-06 09:31:05,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (75 of 228 remaining) [2025-02-06 09:31:05,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err47ASSERT_VIOLATIONDATA_RACE (74 of 228 remaining) [2025-02-06 09:31:05,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err35ASSERT_VIOLATIONDATA_RACE (73 of 228 remaining) [2025-02-06 09:31:05,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err34ASSERT_VIOLATIONDATA_RACE (72 of 228 remaining) [2025-02-06 09:31:05,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err33ASSERT_VIOLATIONDATA_RACE (71 of 228 remaining) [2025-02-06 09:31:05,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err32ASSERT_VIOLATIONDATA_RACE (70 of 228 remaining) [2025-02-06 09:31:05,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err31ASSERT_VIOLATIONDATA_RACE (69 of 228 remaining) [2025-02-06 09:31:05,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err30ASSERT_VIOLATIONDATA_RACE (68 of 228 remaining) [2025-02-06 09:31:05,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (67 of 228 remaining) [2025-02-06 09:31:05,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (66 of 228 remaining) [2025-02-06 09:31:05,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (65 of 228 remaining) [2025-02-06 09:31:05,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (64 of 228 remaining) [2025-02-06 09:31:05,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (63 of 228 remaining) [2025-02-06 09:31:05,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (62 of 228 remaining) [2025-02-06 09:31:05,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (61 of 228 remaining) [2025-02-06 09:31:05,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err46ASSERT_VIOLATIONDATA_RACE (60 of 228 remaining) [2025-02-06 09:31:05,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err45ASSERT_VIOLATIONDATA_RACE (59 of 228 remaining) [2025-02-06 09:31:05,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err44ASSERT_VIOLATIONDATA_RACE (58 of 228 remaining) [2025-02-06 09:31:05,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err43ASSERT_VIOLATIONDATA_RACE (57 of 228 remaining) [2025-02-06 09:31:05,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err42ASSERT_VIOLATIONDATA_RACE (56 of 228 remaining) [2025-02-06 09:31:05,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err41ASSERT_VIOLATIONDATA_RACE (55 of 228 remaining) [2025-02-06 09:31:05,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err40ASSERT_VIOLATIONDATA_RACE (54 of 228 remaining) [2025-02-06 09:31:05,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err39ASSERT_VIOLATIONDATA_RACE (53 of 228 remaining) [2025-02-06 09:31:05,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err38ASSERT_VIOLATIONDATA_RACE (52 of 228 remaining) [2025-02-06 09:31:05,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err37ASSERT_VIOLATIONDATA_RACE (51 of 228 remaining) [2025-02-06 09:31:05,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err36ASSERT_VIOLATIONDATA_RACE (50 of 228 remaining) [2025-02-06 09:31:05,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (49 of 228 remaining) [2025-02-06 09:31:05,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (48 of 228 remaining) [2025-02-06 09:31:05,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (47 of 228 remaining) [2025-02-06 09:31:05,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (46 of 228 remaining) [2025-02-06 09:31:05,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (45 of 228 remaining) [2025-02-06 09:31:05,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (44 of 228 remaining) [2025-02-06 09:31:05,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (43 of 228 remaining) [2025-02-06 09:31:05,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (42 of 228 remaining) [2025-02-06 09:31:05,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (41 of 228 remaining) [2025-02-06 09:31:05,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (40 of 228 remaining) [2025-02-06 09:31:05,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (39 of 228 remaining) [2025-02-06 09:31:05,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (38 of 228 remaining) [2025-02-06 09:31:05,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (37 of 228 remaining) [2025-02-06 09:31:05,426 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (36 of 228 remaining) [2025-02-06 09:31:05,426 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (35 of 228 remaining) [2025-02-06 09:31:05,426 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (34 of 228 remaining) [2025-02-06 09:31:05,426 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (33 of 228 remaining) [2025-02-06 09:31:05,426 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (32 of 228 remaining) [2025-02-06 09:31:05,426 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (31 of 228 remaining) [2025-02-06 09:31:05,426 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (30 of 228 remaining) [2025-02-06 09:31:05,426 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (29 of 228 remaining) [2025-02-06 09:31:05,426 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (28 of 228 remaining) [2025-02-06 09:31:05,427 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (27 of 228 remaining) [2025-02-06 09:31:05,427 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (26 of 228 remaining) [2025-02-06 09:31:05,427 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (25 of 228 remaining) [2025-02-06 09:31:05,427 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err24ASSERT_VIOLATIONDATA_RACE (24 of 228 remaining) [2025-02-06 09:31:05,427 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (23 of 228 remaining) [2025-02-06 09:31:05,427 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (22 of 228 remaining) [2025-02-06 09:31:05,427 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (21 of 228 remaining) [2025-02-06 09:31:05,427 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (20 of 228 remaining) [2025-02-06 09:31:05,427 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (19 of 228 remaining) [2025-02-06 09:31:05,427 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (18 of 228 remaining) [2025-02-06 09:31:05,427 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (17 of 228 remaining) [2025-02-06 09:31:05,427 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (16 of 228 remaining) [2025-02-06 09:31:05,427 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (15 of 228 remaining) [2025-02-06 09:31:05,427 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (14 of 228 remaining) [2025-02-06 09:31:05,427 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err23ASSERT_VIOLATIONDATA_RACE (13 of 228 remaining) [2025-02-06 09:31:05,428 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err22ASSERT_VIOLATIONDATA_RACE (12 of 228 remaining) [2025-02-06 09:31:05,428 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err21ASSERT_VIOLATIONDATA_RACE (11 of 228 remaining) [2025-02-06 09:31:05,428 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err20ASSERT_VIOLATIONDATA_RACE (10 of 228 remaining) [2025-02-06 09:31:05,428 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (9 of 228 remaining) [2025-02-06 09:31:05,428 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (8 of 228 remaining) [2025-02-06 09:31:05,428 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (7 of 228 remaining) [2025-02-06 09:31:05,428 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (6 of 228 remaining) [2025-02-06 09:31:05,428 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (5 of 228 remaining) [2025-02-06 09:31:05,428 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (4 of 228 remaining) [2025-02-06 09:31:05,428 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (3 of 228 remaining) [2025-02-06 09:31:05,428 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (2 of 228 remaining) [2025-02-06 09:31:05,428 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (1 of 228 remaining) [2025-02-06 09:31:05,428 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (0 of 228 remaining) [2025-02-06 09:31:05,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-06 09:31:05,429 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:31:05,436 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 09:31:05,436 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 09:31:05,445 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 09:31:05 BasicIcfg [2025-02-06 09:31:05,446 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 09:31:05,446 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 09:31:05,446 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 09:31:05,446 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 09:31:05,450 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:30:58" (3/4) ... [2025-02-06 09:31:05,455 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 09:31:05,458 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-06 09:31:05,458 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-06 09:31:05,458 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-06 09:31:05,465 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2025-02-06 09:31:05,467 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-06 09:31:05,467 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-06 09:31:05,468 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 09:31:05,549 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 09:31:05,550 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 09:31:05,550 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 09:31:05,551 INFO L158 Benchmark]: Toolchain (without parser) took 8973.35ms. Allocated memory was 167.8MB in the beginning and 595.6MB in the end (delta: 427.8MB). Free memory was 123.8MB in the beginning and 242.7MB in the end (delta: -119.0MB). Peak memory consumption was 304.3MB. Max. memory is 16.1GB. [2025-02-06 09:31:05,551 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:31:05,552 INFO L158 Benchmark]: CACSL2BoogieTranslator took 239.33ms. Allocated memory is still 167.8MB. Free memory was 123.8MB in the beginning and 109.4MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 09:31:05,553 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.19ms. Allocated memory is still 167.8MB. Free memory was 109.4MB in the beginning and 105.3MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:31:05,555 INFO L158 Benchmark]: Boogie Preprocessor took 44.41ms. Allocated memory is still 167.8MB. Free memory was 105.3MB in the beginning and 101.8MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 09:31:05,555 INFO L158 Benchmark]: IcfgBuilder took 1328.70ms. Allocated memory is still 167.8MB. Free memory was 101.8MB in the beginning and 91.7MB in the end (delta: 10.0MB). Peak memory consumption was 78.8MB. Max. memory is 16.1GB. [2025-02-06 09:31:05,555 INFO L158 Benchmark]: TraceAbstraction took 7211.58ms. Allocated memory was 167.8MB in the beginning and 595.6MB in the end (delta: 427.8MB). Free memory was 90.9MB in the beginning and 251.1MB in the end (delta: -160.2MB). Peak memory consumption was 271.8MB. Max. memory is 16.1GB. [2025-02-06 09:31:05,555 INFO L158 Benchmark]: Witness Printer took 103.83ms. Allocated memory is still 595.6MB. Free memory was 251.1MB in the beginning and 242.7MB in the end (delta: 8.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:31:05,556 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.17ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 239.33ms. Allocated memory is still 167.8MB. Free memory was 123.8MB in the beginning and 109.4MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.19ms. Allocated memory is still 167.8MB. Free memory was 109.4MB in the beginning and 105.3MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 44.41ms. Allocated memory is still 167.8MB. Free memory was 105.3MB in the beginning and 101.8MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1328.70ms. Allocated memory is still 167.8MB. Free memory was 101.8MB in the beginning and 91.7MB in the end (delta: 10.0MB). Peak memory consumption was 78.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7211.58ms. Allocated memory was 167.8MB in the beginning and 595.6MB in the end (delta: 427.8MB). Free memory was 90.9MB in the beginning and 251.1MB in the end (delta: -160.2MB). Peak memory consumption was 271.8MB. Max. memory is 16.1GB. * Witness Printer took 103.83ms. Allocated memory is still 595.6MB. Free memory was 251.1MB in the beginning and 242.7MB in the end (delta: 8.4MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 52]: 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: 55]: 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: 55]: 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: 57]: 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: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 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: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: 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: 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: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: 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: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 110]: 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: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: 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: 119]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 119]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 119]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 119]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 119]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 120]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 120]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 120]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 120]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 120]: 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: 122]: 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: 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: 173]: 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: 140]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 141]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 141]: 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: 143]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 173]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 143]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 145]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 146]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 146]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 147]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 148]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 173]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 148]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 150]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 151]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 161]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 648 locations, 228 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: 7.0s, OverallIterations: 26, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 443 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 216 mSDsluCounter, 80 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 104 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1141 IncrementalHoareTripleChecker+Invalid, 1245 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 104 mSolverCounterUnsat, 80 mSDtfsCounter, 1141 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1002occurred in iteration=0, InterpolantAutomatonStates: 81, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 3565 NumberOfCodeBlocks, 3565 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 3539 ConstructedInterpolants, 0 QuantifiedInterpolants, 3704 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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 125 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-06 09:31:05,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE