./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-nondet/nondet-loop-bound-variant-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 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/pthread-nondet/nondet-loop-bound-variant-2.i -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 dc1a8bd7c922f93873ec39bdce92396c491017d4a5984ae9a59a0e03f4bb08ec --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:21:30,695 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:21:30,771 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:21:30,778 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:21:30,778 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:21:30,810 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:21:30,811 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:21:30,811 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:21:30,812 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:21:30,812 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:21:30,813 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:21:30,813 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:21:30,813 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:21:30,813 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:21:30,814 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:21:30,814 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:21:30,814 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:21:30,814 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:21:30,814 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:21:30,815 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:21:30,815 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:21:30,815 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:21:30,815 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:21:30,815 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:21:30,815 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:21:30,815 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:21:30,815 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:21:30,815 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:21:30,816 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:21:30,816 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:21:30,816 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:21:30,816 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:21:30,816 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:21:30,816 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:21:30,816 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:21:30,816 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:21:30,817 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:21:30,817 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:21:30,817 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:21:30,817 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:21:30,817 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:21:30,817 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:21:30,817 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:21:30,818 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:21:30,818 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:21:30,818 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:21:30,818 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 -> dc1a8bd7c922f93873ec39bdce92396c491017d4a5984ae9a59a0e03f4bb08ec [2025-01-09 21:21:31,095 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:21:31,104 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:21:31,106 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:21:31,107 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:21:31,107 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:21:31,108 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-nondet/nondet-loop-bound-variant-2.i [2025-01-09 21:21:32,421 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c4b2fbb13/2e24b56efff2436db65ef80c0c55886f/FLAG1a37e0d93 [2025-01-09 21:21:32,767 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:21:32,770 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-nondet/nondet-loop-bound-variant-2.i [2025-01-09 21:21:32,787 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c4b2fbb13/2e24b56efff2436db65ef80c0c55886f/FLAG1a37e0d93 [2025-01-09 21:21:32,806 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c4b2fbb13/2e24b56efff2436db65ef80c0c55886f [2025-01-09 21:21:32,808 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:21:32,810 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:21:32,812 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:21:32,813 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:21:32,816 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:21:32,817 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:21:32" (1/1) ... [2025-01-09 21:21:32,818 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10c06ec0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:21:32, skipping insertion in model container [2025-01-09 21:21:32,818 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:21:32" (1/1) ... [2025-01-09 21:21:32,856 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:21:33,184 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:21:33,203 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:21:33,252 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:21:33,292 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:21:33,294 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:21:33 WrapperNode [2025-01-09 21:21:33,295 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:21:33,297 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:21:33,297 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:21:33,297 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:21:33,303 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:21:33" (1/1) ... [2025-01-09 21:21:33,319 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:21:33" (1/1) ... [2025-01-09 21:21:33,345 INFO L138 Inliner]: procedures = 171, calls = 20, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 107 [2025-01-09 21:21:33,346 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:21:33,347 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:21:33,347 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:21:33,348 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:21:33,354 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:21:33" (1/1) ... [2025-01-09 21:21:33,355 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:21:33" (1/1) ... [2025-01-09 21:21:33,358 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:21:33" (1/1) ... [2025-01-09 21:21:33,360 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:21:33" (1/1) ... [2025-01-09 21:21:33,369 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:21:33" (1/1) ... [2025-01-09 21:21:33,370 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:21:33" (1/1) ... [2025-01-09 21:21:33,376 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:21:33" (1/1) ... [2025-01-09 21:21:33,380 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:21:33" (1/1) ... [2025-01-09 21:21:33,381 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:21:33" (1/1) ... [2025-01-09 21:21:33,387 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:21:33,388 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:21:33,388 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:21:33,388 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:21:33,389 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:21:33" (1/1) ... [2025-01-09 21:21:33,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:21:33,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:21:33,424 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-01-09 21:21:33,428 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-01-09 21:21:33,452 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2025-01-09 21:21:33,452 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2025-01-09 21:21:33,452 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-01-09 21:21:33,452 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-01-09 21:21:33,452 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 21:21:33,452 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:21:33,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:21:33,453 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 21:21:33,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:21:33,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:21:33,455 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:21:33,590 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:21:33,592 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:21:33,841 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:21:33,841 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:21:33,868 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:21:33,869 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 21:21:33,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:21:33 BoogieIcfgContainer [2025-01-09 21:21:33,871 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:21:33,873 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:21:33,874 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:21:33,877 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:21:33,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:21:32" (1/3) ... [2025-01-09 21:21:33,879 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fda823 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:21:33, skipping insertion in model container [2025-01-09 21:21:33,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:21:33" (2/3) ... [2025-01-09 21:21:33,880 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fda823 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:21:33, skipping insertion in model container [2025-01-09 21:21:33,880 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:21:33" (3/3) ... [2025-01-09 21:21:33,882 INFO L128 eAbstractionObserver]: Analyzing ICFG nondet-loop-bound-variant-2.i [2025-01-09 21:21:33,897 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:21:33,899 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG nondet-loop-bound-variant-2.i that has 3 procedures, 131 locations, 1 initial locations, 1 loop locations, and 10 error locations. [2025-01-09 21:21:33,899 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:21:33,970 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:21:34,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 138 transitions, 284 flow [2025-01-09 21:21:34,064 INFO L124 PetriNetUnfolderBase]: 8/152 cut-off events. [2025-01-09 21:21:34,066 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:21:34,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 152 events. 8/152 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 194 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 99. Up to 4 conditions per place. [2025-01-09 21:21:34,071 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 138 transitions, 284 flow [2025-01-09 21:21:34,079 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 137 transitions, 281 flow [2025-01-09 21:21:34,088 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:21:34,098 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;@2caa47bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:21:34,098 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-01-09 21:21:34,105 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:21:34,105 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2025-01-09 21:21:34,106 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:21:34,106 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:21:34,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] [2025-01-09 21:21:34,107 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:21:34,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:21:34,114 INFO L85 PathProgramCache]: Analyzing trace with hash 354889181, now seen corresponding path program 1 times [2025-01-09 21:21:34,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:21:34,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030874071] [2025-01-09 21:21:34,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:21:34,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:21:34,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 21:21:34,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 21:21:34,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:21:34,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:21:34,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-01-09 21:21:34,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:21:34,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030874071] [2025-01-09 21:21:34,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030874071] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:21:34,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:21:34,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:21:34,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132504211] [2025-01-09 21:21:34,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:21:34,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:21:34,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:21:34,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:21:34,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:21:34,360 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 138 [2025-01-09 21:21:34,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 137 transitions, 281 flow. Second operand has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 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-01-09 21:21:34,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:21:34,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 138 [2025-01-09 21:21:34,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:21:34,478 INFO L124 PetriNetUnfolderBase]: 23/314 cut-off events. [2025-01-09 21:21:34,478 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 21:21:34,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 372 conditions, 314 events. 23/314 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1244 event pairs, 19 based on Foata normal form. 38/300 useless extension candidates. Maximal degree in co-relation 304. Up to 47 conditions per place. [2025-01-09 21:21:34,482 INFO L140 encePairwiseOnDemand]: 130/138 looper letters, 11 selfloop transitions, 2 changer transitions 1/129 dead transitions. [2025-01-09 21:21:34,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 129 transitions, 291 flow [2025-01-09 21:21:34,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:21:34,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:21:34,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 373 transitions. [2025-01-09 21:21:34,498 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9009661835748792 [2025-01-09 21:21:34,499 INFO L175 Difference]: Start difference. First operand has 136 places, 137 transitions, 281 flow. Second operand 3 states and 373 transitions. [2025-01-09 21:21:34,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 129 transitions, 291 flow [2025-01-09 21:21:34,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 129 transitions, 290 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:21:34,511 INFO L231 Difference]: Finished difference. Result has 134 places, 128 transitions, 266 flow [2025-01-09 21:21:34,515 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=266, PETRI_PLACES=134, PETRI_TRANSITIONS=128} [2025-01-09 21:21:34,521 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -2 predicate places. [2025-01-09 21:21:34,522 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 128 transitions, 266 flow [2025-01-09 21:21:34,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 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-01-09 21:21:34,522 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:21:34,522 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:21:34,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:21:34,523 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:21:34,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:21:34,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1455007423, now seen corresponding path program 1 times [2025-01-09 21:21:34,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:21:34,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933984626] [2025-01-09 21:21:34,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:21:34,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:21:34,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 21:21:34,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 21:21:34,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:21:34,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:21:34,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:21:34,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:21:34,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933984626] [2025-01-09 21:21:34,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933984626] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:21:34,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:21:34,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:21:34,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056979252] [2025-01-09 21:21:34,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:21:34,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:21:34,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:21:34,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:21:34,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:21:34,693 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 138 [2025-01-09 21:21:34,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 128 transitions, 266 flow. Second operand has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 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-01-09 21:21:34,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:21:34,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 138 [2025-01-09 21:21:34,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:21:34,762 INFO L124 PetriNetUnfolderBase]: 28/394 cut-off events. [2025-01-09 21:21:34,762 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:21:34,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 469 conditions, 394 events. 28/394 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1719 event pairs, 26 based on Foata normal form. 0/334 useless extension candidates. Maximal degree in co-relation 436. Up to 62 conditions per place. [2025-01-09 21:21:34,767 INFO L140 encePairwiseOnDemand]: 135/138 looper letters, 13 selfloop transitions, 2 changer transitions 0/127 dead transitions. [2025-01-09 21:21:34,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 127 transitions, 294 flow [2025-01-09 21:21:34,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:21:34,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:21:34,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 364 transitions. [2025-01-09 21:21:34,773 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8792270531400966 [2025-01-09 21:21:34,773 INFO L175 Difference]: Start difference. First operand has 134 places, 128 transitions, 266 flow. Second operand 3 states and 364 transitions. [2025-01-09 21:21:34,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 127 transitions, 294 flow [2025-01-09 21:21:34,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 127 transitions, 290 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:21:34,777 INFO L231 Difference]: Finished difference. Result has 132 places, 127 transitions, 264 flow [2025-01-09 21:21:34,777 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=264, PETRI_PLACES=132, PETRI_TRANSITIONS=127} [2025-01-09 21:21:34,778 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -4 predicate places. [2025-01-09 21:21:34,778 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 127 transitions, 264 flow [2025-01-09 21:21:34,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 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-01-09 21:21:34,779 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:21:34,779 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:21:34,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:21:34,779 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:21:34,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:21:34,781 INFO L85 PathProgramCache]: Analyzing trace with hash -2140821955, now seen corresponding path program 1 times [2025-01-09 21:21:34,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:21:34,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495122669] [2025-01-09 21:21:34,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:21:34,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:21:34,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 21:21:34,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 21:21:34,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:21:34,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:21:34,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:21:34,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:21:34,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495122669] [2025-01-09 21:21:34,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495122669] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:21:34,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:21:34,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:21:34,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061152624] [2025-01-09 21:21:34,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:21:34,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:21:34,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:21:34,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:21:34,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:21:34,887 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 138 [2025-01-09 21:21:34,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 127 transitions, 264 flow. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 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-01-09 21:21:34,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:21:34,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 138 [2025-01-09 21:21:34,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:21:34,970 INFO L124 PetriNetUnfolderBase]: 68/518 cut-off events. [2025-01-09 21:21:34,970 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:21:34,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 649 conditions, 518 events. 68/518 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2771 event pairs, 58 based on Foata normal form. 0/464 useless extension candidates. Maximal degree in co-relation 609. Up to 116 conditions per place. [2025-01-09 21:21:34,976 INFO L140 encePairwiseOnDemand]: 132/138 looper letters, 14 selfloop transitions, 1 changer transitions 0/122 dead transitions. [2025-01-09 21:21:34,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 122 transitions, 284 flow [2025-01-09 21:21:34,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:21:34,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:21:34,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2025-01-09 21:21:34,979 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8599033816425121 [2025-01-09 21:21:34,979 INFO L175 Difference]: Start difference. First operand has 132 places, 127 transitions, 264 flow. Second operand 3 states and 356 transitions. [2025-01-09 21:21:34,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 122 transitions, 284 flow [2025-01-09 21:21:34,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 122 transitions, 280 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:21:34,983 INFO L231 Difference]: Finished difference. Result has 127 places, 122 transitions, 252 flow [2025-01-09 21:21:34,983 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=252, PETRI_PLACES=127, PETRI_TRANSITIONS=122} [2025-01-09 21:21:34,984 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -9 predicate places. [2025-01-09 21:21:34,984 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 122 transitions, 252 flow [2025-01-09 21:21:34,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 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-01-09 21:21:34,985 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:21:34,986 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] [2025-01-09 21:21:34,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:21:34,986 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:21:34,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:21:34,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1955982752, now seen corresponding path program 1 times [2025-01-09 21:21:34,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:21:34,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588094671] [2025-01-09 21:21:34,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:21:34,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:21:35,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 21:21:35,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 21:21:35,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:21:35,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:21:35,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:21:35,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:21:35,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588094671] [2025-01-09 21:21:35,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588094671] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:21:35,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:21:35,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:21:35,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502820414] [2025-01-09 21:21:35,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:21:35,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:21:35,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:21:35,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:21:35,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:21:35,110 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 138 [2025-01-09 21:21:35,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 122 transitions, 252 flow. Second operand has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 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-01-09 21:21:35,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:21:35,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 138 [2025-01-09 21:21:35,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:21:35,161 INFO L124 PetriNetUnfolderBase]: 17/278 cut-off events. [2025-01-09 21:21:35,161 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 21:21:35,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 336 conditions, 278 events. 17/278 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 885 event pairs, 6 based on Foata normal form. 0/255 useless extension candidates. Maximal degree in co-relation 296. Up to 32 conditions per place. [2025-01-09 21:21:35,163 INFO L140 encePairwiseOnDemand]: 132/138 looper letters, 13 selfloop transitions, 4 changer transitions 0/127 dead transitions. [2025-01-09 21:21:35,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 127 transitions, 299 flow [2025-01-09 21:21:35,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:21:35,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:21:35,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 379 transitions. [2025-01-09 21:21:35,165 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9154589371980676 [2025-01-09 21:21:35,165 INFO L175 Difference]: Start difference. First operand has 127 places, 122 transitions, 252 flow. Second operand 3 states and 379 transitions. [2025-01-09 21:21:35,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 127 transitions, 299 flow [2025-01-09 21:21:35,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 127 transitions, 298 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:21:35,168 INFO L231 Difference]: Finished difference. Result has 129 places, 124 transitions, 279 flow [2025-01-09 21:21:35,168 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=279, PETRI_PLACES=129, PETRI_TRANSITIONS=124} [2025-01-09 21:21:35,169 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -7 predicate places. [2025-01-09 21:21:35,169 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 124 transitions, 279 flow [2025-01-09 21:21:35,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 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-01-09 21:21:35,169 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:21:35,169 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:21:35,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:21:35,170 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:21:35,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:21:35,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1217702170, now seen corresponding path program 1 times [2025-01-09 21:21:35,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:21:35,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484105329] [2025-01-09 21:21:35,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:21:35,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:21:35,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 21:21:35,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 21:21:35,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:21:35,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:21:35,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:21:35,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:21:35,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484105329] [2025-01-09 21:21:35,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484105329] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:21:35,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:21:35,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:21:35,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644967480] [2025-01-09 21:21:35,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:21:35,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:21:35,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:21:35,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:21:35,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:21:35,399 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 138 [2025-01-09 21:21:35,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 124 transitions, 279 flow. Second operand has 5 states, 5 states have (on average 116.4) internal successors, (582), 5 states have internal predecessors, (582), 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-01-09 21:21:35,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:21:35,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 138 [2025-01-09 21:21:35,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:21:35,475 INFO L124 PetriNetUnfolderBase]: 12/280 cut-off events. [2025-01-09 21:21:35,475 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-01-09 21:21:35,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 366 conditions, 280 events. 12/280 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 910 event pairs, 8 based on Foata normal form. 1/258 useless extension candidates. Maximal degree in co-relation 325. Up to 34 conditions per place. [2025-01-09 21:21:35,477 INFO L140 encePairwiseOnDemand]: 134/138 looper letters, 16 selfloop transitions, 0 changer transitions 4/127 dead transitions. [2025-01-09 21:21:35,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 127 transitions, 325 flow [2025-01-09 21:21:35,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:21:35,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:21:35,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 591 transitions. [2025-01-09 21:21:35,481 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8565217391304348 [2025-01-09 21:21:35,482 INFO L175 Difference]: Start difference. First operand has 129 places, 124 transitions, 279 flow. Second operand 5 states and 591 transitions. [2025-01-09 21:21:35,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 127 transitions, 325 flow [2025-01-09 21:21:35,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 127 transitions, 317 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:21:35,486 INFO L231 Difference]: Finished difference. Result has 134 places, 123 transitions, 275 flow [2025-01-09 21:21:35,486 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=275, PETRI_PLACES=134, PETRI_TRANSITIONS=123} [2025-01-09 21:21:35,486 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -2 predicate places. [2025-01-09 21:21:35,487 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 123 transitions, 275 flow [2025-01-09 21:21:35,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.4) internal successors, (582), 5 states have internal predecessors, (582), 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-01-09 21:21:35,487 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:21:35,487 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:21:35,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:21:35,488 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:21:35,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:21:35,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1120237794, now seen corresponding path program 1 times [2025-01-09 21:21:35,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:21:35,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722922615] [2025-01-09 21:21:35,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:21:35,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:21:35,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 21:21:35,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 21:21:35,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:21:35,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:21:35,506 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:21:35,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 21:21:35,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 21:21:35,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:21:35,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:21:35,558 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:21:35,559 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:21:35,559 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 17 remaining) [2025-01-09 21:21:35,562 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (15 of 17 remaining) [2025-01-09 21:21:35,563 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (14 of 17 remaining) [2025-01-09 21:21:35,564 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (13 of 17 remaining) [2025-01-09 21:21:35,564 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (12 of 17 remaining) [2025-01-09 21:21:35,564 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (11 of 17 remaining) [2025-01-09 21:21:35,564 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 17 remaining) [2025-01-09 21:21:35,564 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 17 remaining) [2025-01-09 21:21:35,564 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 17 remaining) [2025-01-09 21:21:35,564 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 17 remaining) [2025-01-09 21:21:35,564 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (6 of 17 remaining) [2025-01-09 21:21:35,565 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 17 remaining) [2025-01-09 21:21:35,565 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (4 of 17 remaining) [2025-01-09 21:21:35,565 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (3 of 17 remaining) [2025-01-09 21:21:35,566 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (2 of 17 remaining) [2025-01-09 21:21:35,566 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (1 of 17 remaining) [2025-01-09 21:21:35,566 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 17 remaining) [2025-01-09 21:21:35,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:21:35,566 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-01-09 21:21:35,569 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:21:35,569 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-09 21:21:35,609 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:21:35,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 193 places, 194 transitions, 408 flow [2025-01-09 21:21:35,637 INFO L124 PetriNetUnfolderBase]: 11/206 cut-off events. [2025-01-09 21:21:35,637 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:21:35,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 206 events. 11/206 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 361 event pairs, 0 based on Foata normal form. 0/177 useless extension candidates. Maximal degree in co-relation 213. Up to 6 conditions per place. [2025-01-09 21:21:35,639 INFO L82 GeneralOperation]: Start removeDead. Operand has 193 places, 194 transitions, 408 flow [2025-01-09 21:21:35,642 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 170 places, 171 transitions, 355 flow [2025-01-09 21:21:35,643 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:21:35,644 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;@2caa47bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:21:35,644 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-01-09 21:21:35,647 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:21:35,647 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2025-01-09 21:21:35,647 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:21:35,648 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:21:35,648 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] [2025-01-09 21:21:35,648 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-01-09 21:21:35,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:21:35,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1448834145, now seen corresponding path program 1 times [2025-01-09 21:21:35,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:21:35,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493941298] [2025-01-09 21:21:35,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:21:35,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:21:35,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 21:21:35,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 21:21:35,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:21:35,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:21:35,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:21:35,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:21:35,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493941298] [2025-01-09 21:21:35,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493941298] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:21:35,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:21:35,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:21:35,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38975396] [2025-01-09 21:21:35,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:21:35,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:21:35,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:21:35,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:21:35,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:21:35,720 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 194 [2025-01-09 21:21:35,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 171 transitions, 355 flow. Second operand has 3 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 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-01-09 21:21:35,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:21:35,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 194 [2025-01-09 21:21:35,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:21:35,878 INFO L124 PetriNetUnfolderBase]: 216/1072 cut-off events. [2025-01-09 21:21:35,878 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-01-09 21:21:35,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1431 conditions, 1072 events. 216/1072 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 7386 event pairs, 189 based on Foata normal form. 226/1128 useless extension candidates. Maximal degree in co-relation 1362. Up to 317 conditions per place. [2025-01-09 21:21:35,888 INFO L140 encePairwiseOnDemand]: 185/194 looper letters, 16 selfloop transitions, 2 changer transitions 1/162 dead transitions. [2025-01-09 21:21:35,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 162 transitions, 373 flow [2025-01-09 21:21:35,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:21:35,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:21:35,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 514 transitions. [2025-01-09 21:21:35,893 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8831615120274914 [2025-01-09 21:21:35,893 INFO L175 Difference]: Start difference. First operand has 170 places, 171 transitions, 355 flow. Second operand 3 states and 514 transitions. [2025-01-09 21:21:35,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 162 transitions, 373 flow [2025-01-09 21:21:35,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 162 transitions, 372 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:21:35,896 INFO L231 Difference]: Finished difference. Result has 168 places, 161 transitions, 338 flow [2025-01-09 21:21:35,896 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=338, PETRI_PLACES=168, PETRI_TRANSITIONS=161} [2025-01-09 21:21:35,897 INFO L279 CegarLoopForPetriNet]: 170 programPoint places, -2 predicate places. [2025-01-09 21:21:35,898 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 161 transitions, 338 flow [2025-01-09 21:21:35,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 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-01-09 21:21:35,898 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:21:35,898 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:21:35,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:21:35,899 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-01-09 21:21:35,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:21:35,899 INFO L85 PathProgramCache]: Analyzing trace with hash -376749119, now seen corresponding path program 1 times [2025-01-09 21:21:35,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:21:35,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137608540] [2025-01-09 21:21:35,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:21:35,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:21:35,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 21:21:35,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 21:21:35,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:21:35,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:21:35,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:21:35,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:21:35,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137608540] [2025-01-09 21:21:35,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137608540] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:21:35,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:21:35,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:21:35,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513951518] [2025-01-09 21:21:35,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:21:35,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:21:35,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:21:35,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:21:35,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:21:35,987 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 194 [2025-01-09 21:21:35,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 161 transitions, 338 flow. Second operand has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 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-01-09 21:21:35,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:21:35,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 194 [2025-01-09 21:21:35,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:21:36,188 INFO L124 PetriNetUnfolderBase]: 200/1574 cut-off events. [2025-01-09 21:21:36,189 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2025-01-09 21:21:36,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1938 conditions, 1574 events. 200/1574 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 12207 event pairs, 194 based on Foata normal form. 0/1326 useless extension candidates. Maximal degree in co-relation 1904. Up to 326 conditions per place. [2025-01-09 21:21:36,203 INFO L140 encePairwiseOnDemand]: 191/194 looper letters, 17 selfloop transitions, 2 changer transitions 0/160 dead transitions. [2025-01-09 21:21:36,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 160 transitions, 374 flow [2025-01-09 21:21:36,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:21:36,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:21:36,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 506 transitions. [2025-01-09 21:21:36,205 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8694158075601375 [2025-01-09 21:21:36,206 INFO L175 Difference]: Start difference. First operand has 168 places, 161 transitions, 338 flow. Second operand 3 states and 506 transitions. [2025-01-09 21:21:36,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 160 transitions, 374 flow [2025-01-09 21:21:36,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 160 transitions, 370 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:21:36,209 INFO L231 Difference]: Finished difference. Result has 166 places, 160 transitions, 336 flow [2025-01-09 21:21:36,209 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=336, PETRI_PLACES=166, PETRI_TRANSITIONS=160} [2025-01-09 21:21:36,210 INFO L279 CegarLoopForPetriNet]: 170 programPoint places, -4 predicate places. [2025-01-09 21:21:36,210 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 160 transitions, 336 flow [2025-01-09 21:21:36,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 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-01-09 21:21:36,211 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:21:36,211 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:21:36,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:21:36,211 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-01-09 21:21:36,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:21:36,213 INFO L85 PathProgramCache]: Analyzing trace with hash -409464129, now seen corresponding path program 1 times [2025-01-09 21:21:36,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:21:36,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418707309] [2025-01-09 21:21:36,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:21:36,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:21:36,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 21:21:36,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 21:21:36,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:21:36,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:21:36,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:21:36,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:21:36,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418707309] [2025-01-09 21:21:36,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418707309] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:21:36,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:21:36,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:21:36,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140448253] [2025-01-09 21:21:36,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:21:36,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:21:36,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:21:36,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:21:36,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:21:36,283 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 194 [2025-01-09 21:21:36,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 160 transitions, 336 flow. Second operand has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 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-01-09 21:21:36,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:21:36,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 194 [2025-01-09 21:21:36,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:21:36,596 INFO L124 PetriNetUnfolderBase]: 590/2525 cut-off events. [2025-01-09 21:21:36,596 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2025-01-09 21:21:36,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3377 conditions, 2525 events. 590/2525 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 21305 event pairs, 508 based on Foata normal form. 0/2204 useless extension candidates. Maximal degree in co-relation 3336. Up to 791 conditions per place. [2025-01-09 21:21:36,621 INFO L140 encePairwiseOnDemand]: 187/194 looper letters, 19 selfloop transitions, 1 changer transitions 0/154 dead transitions. [2025-01-09 21:21:36,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 154 transitions, 364 flow [2025-01-09 21:21:36,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:21:36,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:21:36,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 488 transitions. [2025-01-09 21:21:36,623 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8384879725085911 [2025-01-09 21:21:36,623 INFO L175 Difference]: Start difference. First operand has 166 places, 160 transitions, 336 flow. Second operand 3 states and 488 transitions. [2025-01-09 21:21:36,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 154 transitions, 364 flow [2025-01-09 21:21:36,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 154 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:21:36,628 INFO L231 Difference]: Finished difference. Result has 160 places, 154 transitions, 322 flow [2025-01-09 21:21:36,628 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=322, PETRI_PLACES=160, PETRI_TRANSITIONS=154} [2025-01-09 21:21:36,628 INFO L279 CegarLoopForPetriNet]: 170 programPoint places, -10 predicate places. [2025-01-09 21:21:36,630 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 154 transitions, 322 flow [2025-01-09 21:21:36,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 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-01-09 21:21:36,630 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:21:36,630 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] [2025-01-09 21:21:36,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:21:36,631 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-01-09 21:21:36,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:21:36,631 INFO L85 PathProgramCache]: Analyzing trace with hash 346003596, now seen corresponding path program 1 times [2025-01-09 21:21:36,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:21:36,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648763320] [2025-01-09 21:21:36,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:21:36,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:21:36,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 21:21:36,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 21:21:36,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:21:36,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:21:36,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:21:36,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:21:36,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648763320] [2025-01-09 21:21:36,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648763320] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:21:36,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:21:36,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:21:36,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070266862] [2025-01-09 21:21:36,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:21:36,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:21:36,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:21:36,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:21:36,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:21:36,709 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 194 [2025-01-09 21:21:36,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 154 transitions, 322 flow. Second operand has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 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-01-09 21:21:36,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:21:36,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 194 [2025-01-09 21:21:36,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:21:36,922 INFO L124 PetriNetUnfolderBase]: 347/1375 cut-off events. [2025-01-09 21:21:36,923 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2025-01-09 21:21:36,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2057 conditions, 1375 events. 347/1375 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 9650 event pairs, 117 based on Foata normal form. 0/1210 useless extension candidates. Maximal degree in co-relation 2016. Up to 382 conditions per place. [2025-01-09 21:21:36,939 INFO L140 encePairwiseOnDemand]: 183/194 looper letters, 25 selfloop transitions, 8 changer transitions 0/168 dead transitions. [2025-01-09 21:21:36,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 168 transitions, 424 flow [2025-01-09 21:21:36,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:21:36,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:21:36,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 519 transitions. [2025-01-09 21:21:36,942 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8917525773195877 [2025-01-09 21:21:36,942 INFO L175 Difference]: Start difference. First operand has 160 places, 154 transitions, 322 flow. Second operand 3 states and 519 transitions. [2025-01-09 21:21:36,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 168 transitions, 424 flow [2025-01-09 21:21:36,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 168 transitions, 423 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:21:36,946 INFO L231 Difference]: Finished difference. Result has 163 places, 162 transitions, 391 flow [2025-01-09 21:21:36,946 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=391, PETRI_PLACES=163, PETRI_TRANSITIONS=162} [2025-01-09 21:21:36,947 INFO L279 CegarLoopForPetriNet]: 170 programPoint places, -7 predicate places. [2025-01-09 21:21:36,947 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 162 transitions, 391 flow [2025-01-09 21:21:36,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 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-01-09 21:21:36,947 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:21:36,947 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:21:36,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:21:36,948 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr2Err2ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-01-09 21:21:36,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:21:36,948 INFO L85 PathProgramCache]: Analyzing trace with hash -706906415, now seen corresponding path program 1 times [2025-01-09 21:21:36,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:21:36,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640213759] [2025-01-09 21:21:36,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:21:36,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:21:36,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 21:21:36,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 21:21:36,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:21:36,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:21:37,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:21:37,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:21:37,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640213759] [2025-01-09 21:21:37,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640213759] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:21:37,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:21:37,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:21:37,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034120401] [2025-01-09 21:21:37,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:21:37,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:21:37,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:21:37,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:21:37,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:21:37,064 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 194 [2025-01-09 21:21:37,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 162 transitions, 391 flow. Second operand has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 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-01-09 21:21:37,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:21:37,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 194 [2025-01-09 21:21:37,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:21:37,355 INFO L124 PetriNetUnfolderBase]: 447/1925 cut-off events. [2025-01-09 21:21:37,356 INFO L125 PetriNetUnfolderBase]: For 614/634 co-relation queries the response was YES. [2025-01-09 21:21:37,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3363 conditions, 1925 events. 447/1925 cut-off events. For 614/634 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 15412 event pairs, 158 based on Foata normal form. 2/1715 useless extension candidates. Maximal degree in co-relation 3321. Up to 585 conditions per place. [2025-01-09 21:21:37,373 INFO L140 encePairwiseOnDemand]: 187/194 looper letters, 23 selfloop transitions, 10 changer transitions 0/173 dead transitions. [2025-01-09 21:21:37,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 173 transitions, 502 flow [2025-01-09 21:21:37,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:21:37,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:21:37,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 521 transitions. [2025-01-09 21:21:37,376 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8951890034364262 [2025-01-09 21:21:37,376 INFO L175 Difference]: Start difference. First operand has 163 places, 162 transitions, 391 flow. Second operand 3 states and 521 transitions. [2025-01-09 21:21:37,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 173 transitions, 502 flow [2025-01-09 21:21:37,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 173 transitions, 480 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:21:37,380 INFO L231 Difference]: Finished difference. Result has 165 places, 170 transitions, 461 flow [2025-01-09 21:21:37,380 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=461, PETRI_PLACES=165, PETRI_TRANSITIONS=170} [2025-01-09 21:21:37,381 INFO L279 CegarLoopForPetriNet]: 170 programPoint places, -5 predicate places. [2025-01-09 21:21:37,381 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 170 transitions, 461 flow [2025-01-09 21:21:37,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 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-01-09 21:21:37,382 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:21:37,382 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:21:37,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:21:37,382 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-01-09 21:21:37,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:21:37,383 INFO L85 PathProgramCache]: Analyzing trace with hash 580989303, now seen corresponding path program 1 times [2025-01-09 21:21:37,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:21:37,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954328612] [2025-01-09 21:21:37,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:21:37,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:21:37,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 21:21:37,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 21:21:37,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:21:37,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:21:37,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:21:37,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:21:37,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954328612] [2025-01-09 21:21:37,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954328612] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:21:37,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:21:37,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:21:37,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128467439] [2025-01-09 21:21:37,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:21:37,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:21:37,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:21:37,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:21:37,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:21:37,550 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 194 [2025-01-09 21:21:37,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 170 transitions, 461 flow. Second operand has 5 states, 5 states have (on average 164.6) internal successors, (823), 5 states have internal predecessors, (823), 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-01-09 21:21:37,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:21:37,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 194 [2025-01-09 21:21:37,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:21:37,873 INFO L124 PetriNetUnfolderBase]: 538/2944 cut-off events. [2025-01-09 21:21:37,874 INFO L125 PetriNetUnfolderBase]: For 549/789 co-relation queries the response was YES. [2025-01-09 21:21:37,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4723 conditions, 2944 events. 538/2944 cut-off events. For 549/789 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 27524 event pairs, 212 based on Foata normal form. 1/2583 useless extension candidates. Maximal degree in co-relation 4680. Up to 439 conditions per place. [2025-01-09 21:21:37,904 INFO L140 encePairwiseOnDemand]: 190/194 looper letters, 19 selfloop transitions, 0 changer transitions 4/173 dead transitions. [2025-01-09 21:21:37,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 173 transitions, 513 flow [2025-01-09 21:21:37,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:21:37,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:21:37,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 834 transitions. [2025-01-09 21:21:37,910 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8597938144329897 [2025-01-09 21:21:37,910 INFO L175 Difference]: Start difference. First operand has 165 places, 170 transitions, 461 flow. Second operand 5 states and 834 transitions. [2025-01-09 21:21:37,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 173 transitions, 513 flow [2025-01-09 21:21:37,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 173 transitions, 493 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:21:37,918 INFO L231 Difference]: Finished difference. Result has 170 places, 169 transitions, 445 flow [2025-01-09 21:21:37,918 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=445, PETRI_PLACES=170, PETRI_TRANSITIONS=169} [2025-01-09 21:21:37,919 INFO L279 CegarLoopForPetriNet]: 170 programPoint places, 0 predicate places. [2025-01-09 21:21:37,919 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 169 transitions, 445 flow [2025-01-09 21:21:37,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 164.6) internal successors, (823), 5 states have internal predecessors, (823), 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-01-09 21:21:37,920 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:21:37,921 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:21:37,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:21:37,921 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-01-09 21:21:37,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:21:37,922 INFO L85 PathProgramCache]: Analyzing trace with hash -2074259023, now seen corresponding path program 1 times [2025-01-09 21:21:37,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:21:37,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800298053] [2025-01-09 21:21:37,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:21:37,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:21:37,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-09 21:21:37,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-09 21:21:37,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:21:37,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:21:37,942 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:21:37,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-09 21:21:37,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-09 21:21:37,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:21:37,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:21:37,973 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:21:37,974 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:21:37,974 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 22 remaining) [2025-01-09 21:21:37,974 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining) [2025-01-09 21:21:37,974 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining) [2025-01-09 21:21:37,974 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining) [2025-01-09 21:21:37,975 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining) [2025-01-09 21:21:37,975 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining) [2025-01-09 21:21:37,975 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining) [2025-01-09 21:21:37,975 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining) [2025-01-09 21:21:37,975 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (13 of 22 remaining) [2025-01-09 21:21:37,975 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 22 remaining) [2025-01-09 21:21:37,975 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (11 of 22 remaining) [2025-01-09 21:21:37,976 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 22 remaining) [2025-01-09 21:21:37,976 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (9 of 22 remaining) [2025-01-09 21:21:37,976 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (8 of 22 remaining) [2025-01-09 21:21:37,976 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining) [2025-01-09 21:21:37,976 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining) [2025-01-09 21:21:37,976 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining) [2025-01-09 21:21:37,976 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining) [2025-01-09 21:21:37,976 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining) [2025-01-09 21:21:37,976 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining) [2025-01-09 21:21:37,977 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining) [2025-01-09 21:21:37,977 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining) [2025-01-09 21:21:37,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:21:37,977 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:21:37,978 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:21:37,978 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-09 21:21:38,025 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:21:38,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 249 places, 250 transitions, 536 flow [2025-01-09 21:21:38,057 INFO L124 PetriNetUnfolderBase]: 14/260 cut-off events. [2025-01-09 21:21:38,058 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-09 21:21:38,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 260 events. 14/260 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 543 event pairs, 0 based on Foata normal form. 0/223 useless extension candidates. Maximal degree in co-relation 271. Up to 8 conditions per place. [2025-01-09 21:21:38,060 INFO L82 GeneralOperation]: Start removeDead. Operand has 249 places, 250 transitions, 536 flow [2025-01-09 21:21:38,064 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 204 places, 205 transitions, 431 flow [2025-01-09 21:21:38,064 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:21:38,065 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;@2caa47bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:21:38,078 INFO L334 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2025-01-09 21:21:38,080 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:21:38,080 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2025-01-09 21:21:38,080 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:21:38,080 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:21:38,081 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:21:38,081 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-01-09 21:21:38,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:21:38,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1672975769, now seen corresponding path program 1 times [2025-01-09 21:21:38,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:21:38,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397210045] [2025-01-09 21:21:38,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:21:38,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:21:38,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 21:21:38,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 21:21:38,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:21:38,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:21:38,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:21:38,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:21:38,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397210045] [2025-01-09 21:21:38,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397210045] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:21:38,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:21:38,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:21:38,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851949112] [2025-01-09 21:21:38,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:21:38,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:21:38,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:21:38,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:21:38,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:21:38,151 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 250 [2025-01-09 21:21:38,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 205 transitions, 431 flow. Second operand has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 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-01-09 21:21:38,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:21:38,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 250 [2025-01-09 21:21:38,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:21:38,777 INFO L124 PetriNetUnfolderBase]: 1589/4910 cut-off events. [2025-01-09 21:21:38,777 INFO L125 PetriNetUnfolderBase]: For 336/336 co-relation queries the response was YES. [2025-01-09 21:21:38,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7220 conditions, 4910 events. 1589/4910 cut-off events. For 336/336 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 44503 event pairs, 1439 based on Foata normal form. 1274/5496 useless extension candidates. Maximal degree in co-relation 7150. Up to 2067 conditions per place. [2025-01-09 21:21:38,831 INFO L140 encePairwiseOnDemand]: 240/250 looper letters, 21 selfloop transitions, 2 changer transitions 1/195 dead transitions. [2025-01-09 21:21:38,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 195 transitions, 457 flow [2025-01-09 21:21:38,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:21:38,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:21:38,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 655 transitions. [2025-01-09 21:21:38,833 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8733333333333333 [2025-01-09 21:21:38,833 INFO L175 Difference]: Start difference. First operand has 204 places, 205 transitions, 431 flow. Second operand 3 states and 655 transitions. [2025-01-09 21:21:38,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 195 transitions, 457 flow [2025-01-09 21:21:38,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 195 transitions, 454 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-09 21:21:38,838 INFO L231 Difference]: Finished difference. Result has 202 places, 194 transitions, 410 flow [2025-01-09 21:21:38,838 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=410, PETRI_PLACES=202, PETRI_TRANSITIONS=194} [2025-01-09 21:21:38,839 INFO L279 CegarLoopForPetriNet]: 204 programPoint places, -2 predicate places. [2025-01-09 21:21:38,840 INFO L471 AbstractCegarLoop]: Abstraction has has 202 places, 194 transitions, 410 flow [2025-01-09 21:21:38,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 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-01-09 21:21:38,840 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:21:38,841 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:21:38,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:21:38,841 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-01-09 21:21:38,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:21:38,841 INFO L85 PathProgramCache]: Analyzing trace with hash 52254715, now seen corresponding path program 1 times [2025-01-09 21:21:38,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:21:38,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094457969] [2025-01-09 21:21:38,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:21:38,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:21:38,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 21:21:38,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 21:21:38,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:21:38,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:21:38,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:21:38,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:21:38,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094457969] [2025-01-09 21:21:38,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094457969] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:21:38,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:21:38,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:21:38,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153957238] [2025-01-09 21:21:38,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:21:38,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:21:38,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:21:38,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:21:38,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:21:38,918 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 250 [2025-01-09 21:21:38,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 194 transitions, 410 flow. Second operand has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 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-01-09 21:21:38,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:21:38,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 250 [2025-01-09 21:21:38,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:21:39,702 INFO L124 PetriNetUnfolderBase]: 1197/5332 cut-off events. [2025-01-09 21:21:39,702 INFO L125 PetriNetUnfolderBase]: For 506/506 co-relation queries the response was YES. [2025-01-09 21:21:39,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7137 conditions, 5332 events. 1197/5332 cut-off events. For 506/506 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 52774 event pairs, 1154 based on Foata normal form. 0/4734 useless extension candidates. Maximal degree in co-relation 7102. Up to 1670 conditions per place. [2025-01-09 21:21:39,775 INFO L140 encePairwiseOnDemand]: 247/250 looper letters, 21 selfloop transitions, 2 changer transitions 0/193 dead transitions. [2025-01-09 21:21:39,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 193 transitions, 454 flow [2025-01-09 21:21:39,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:21:39,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:21:39,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 648 transitions. [2025-01-09 21:21:39,778 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.864 [2025-01-09 21:21:39,778 INFO L175 Difference]: Start difference. First operand has 202 places, 194 transitions, 410 flow. Second operand 3 states and 648 transitions. [2025-01-09 21:21:39,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 193 transitions, 454 flow [2025-01-09 21:21:39,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 193 transitions, 450 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:21:39,784 INFO L231 Difference]: Finished difference. Result has 200 places, 193 transitions, 408 flow [2025-01-09 21:21:39,785 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=408, PETRI_PLACES=200, PETRI_TRANSITIONS=193} [2025-01-09 21:21:39,785 INFO L279 CegarLoopForPetriNet]: 204 programPoint places, -4 predicate places. [2025-01-09 21:21:39,785 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 193 transitions, 408 flow [2025-01-09 21:21:39,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 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-01-09 21:21:39,786 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:21:39,786 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:21:39,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:21:39,787 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-01-09 21:21:39,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:21:39,787 INFO L85 PathProgramCache]: Analyzing trace with hash 94824569, now seen corresponding path program 1 times [2025-01-09 21:21:39,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:21:39,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159230013] [2025-01-09 21:21:39,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:21:39,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:21:39,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 21:21:39,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 21:21:39,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:21:39,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:21:39,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:21:39,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:21:39,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159230013] [2025-01-09 21:21:39,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159230013] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:21:39,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:21:39,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:21:39,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747138880] [2025-01-09 21:21:39,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:21:39,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:21:39,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:21:39,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:21:39,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:21:39,856 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 250 [2025-01-09 21:21:39,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 193 transitions, 408 flow. Second operand has 3 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 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-01-09 21:21:39,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:21:39,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 250 [2025-01-09 21:21:39,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:21:41,150 INFO L124 PetriNetUnfolderBase]: 4181/12619 cut-off events. [2025-01-09 21:21:41,150 INFO L125 PetriNetUnfolderBase]: For 517/517 co-relation queries the response was YES. [2025-01-09 21:21:41,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17972 conditions, 12619 events. 4181/12619 cut-off events. For 517/517 co-relation queries the response was YES. Maximal size of possible extension queue 434. Compared 133763 event pairs, 3658 based on Foata normal form. 0/10992 useless extension candidates. Maximal degree in co-relation 17930. Up to 5066 conditions per place. [2025-01-09 21:21:41,248 INFO L140 encePairwiseOnDemand]: 242/250 looper letters, 24 selfloop transitions, 1 changer transitions 0/186 dead transitions. [2025-01-09 21:21:41,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 186 transitions, 444 flow [2025-01-09 21:21:41,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:21:41,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:21:41,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 620 transitions. [2025-01-09 21:21:41,250 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8266666666666667 [2025-01-09 21:21:41,250 INFO L175 Difference]: Start difference. First operand has 200 places, 193 transitions, 408 flow. Second operand 3 states and 620 transitions. [2025-01-09 21:21:41,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 186 transitions, 444 flow [2025-01-09 21:21:41,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 186 transitions, 440 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:21:41,254 INFO L231 Difference]: Finished difference. Result has 193 places, 186 transitions, 392 flow [2025-01-09 21:21:41,254 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=392, PETRI_PLACES=193, PETRI_TRANSITIONS=186} [2025-01-09 21:21:41,255 INFO L279 CegarLoopForPetriNet]: 204 programPoint places, -11 predicate places. [2025-01-09 21:21:41,256 INFO L471 AbstractCegarLoop]: Abstraction has has 193 places, 186 transitions, 392 flow [2025-01-09 21:21:41,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 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-01-09 21:21:41,257 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:21:41,257 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:21:41,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:21:41,257 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-01-09 21:21:41,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:21:41,258 INFO L85 PathProgramCache]: Analyzing trace with hash -400832987, now seen corresponding path program 1 times [2025-01-09 21:21:41,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:21:41,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974760503] [2025-01-09 21:21:41,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:21:41,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:21:41,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 21:21:41,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 21:21:41,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:21:41,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:21:41,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:21:41,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:21:41,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974760503] [2025-01-09 21:21:41,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974760503] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:21:41,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:21:41,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:21:41,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430153034] [2025-01-09 21:21:41,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:21:41,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:21:41,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:21:41,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:21:41,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:21:41,337 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 250 [2025-01-09 21:21:41,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 186 transitions, 392 flow. Second operand has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 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-01-09 21:21:41,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:21:41,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 250 [2025-01-09 21:21:41,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:21:42,779 INFO L124 PetriNetUnfolderBase]: 4747/12923 cut-off events. [2025-01-09 21:21:42,779 INFO L125 PetriNetUnfolderBase]: For 840/840 co-relation queries the response was YES. [2025-01-09 21:21:42,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20480 conditions, 12923 events. 4747/12923 cut-off events. For 840/840 co-relation queries the response was YES. Maximal size of possible extension queue 577. Compared 135031 event pairs, 1658 based on Foata normal form. 0/11283 useless extension candidates. Maximal degree in co-relation 20438. Up to 4100 conditions per place. [2025-01-09 21:21:42,922 INFO L140 encePairwiseOnDemand]: 235/250 looper letters, 35 selfloop transitions, 11 changer transitions 0/206 dead transitions. [2025-01-09 21:21:42,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 206 transitions, 537 flow [2025-01-09 21:21:42,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:21:42,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:21:42,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 656 transitions. [2025-01-09 21:21:42,924 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8746666666666667 [2025-01-09 21:21:42,924 INFO L175 Difference]: Start difference. First operand has 193 places, 186 transitions, 392 flow. Second operand 3 states and 656 transitions. [2025-01-09 21:21:42,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 206 transitions, 537 flow [2025-01-09 21:21:42,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 206 transitions, 536 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:21:42,929 INFO L231 Difference]: Finished difference. Result has 196 places, 197 transitions, 487 flow [2025-01-09 21:21:42,930 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=487, PETRI_PLACES=196, PETRI_TRANSITIONS=197} [2025-01-09 21:21:42,930 INFO L279 CegarLoopForPetriNet]: 204 programPoint places, -8 predicate places. [2025-01-09 21:21:42,930 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 197 transitions, 487 flow [2025-01-09 21:21:42,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 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-01-09 21:21:42,931 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:21:42,931 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:21:42,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:21:42,931 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr2Err2ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-01-09 21:21:42,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:21:42,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1737218883, now seen corresponding path program 1 times [2025-01-09 21:21:42,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:21:42,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109183634] [2025-01-09 21:21:42,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:21:42,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:21:42,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 21:21:42,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 21:21:42,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:21:42,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:21:42,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:21:42,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:21:42,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109183634] [2025-01-09 21:21:42,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109183634] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:21:42,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:21:42,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:21:42,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381653883] [2025-01-09 21:21:42,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:21:42,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:21:42,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:21:42,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:21:42,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:21:43,028 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 250 [2025-01-09 21:21:43,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 197 transitions, 487 flow. Second operand has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 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-01-09 21:21:43,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:21:43,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 250 [2025-01-09 21:21:43,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:21:44,433 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~ret6#1=|v_thr2Thread1of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~ret6#1][122], [248#true, 240#true, 2#L714-3true, 192#L705-2true, Black: 261#true, 102#L700-3true, 56#L705-2true, 266#true, 246#true, 263#(= |#race~x~0| 0), 260#(= |#race~n~0| 0), 200#$Ultimate##0true, 250#true]) [2025-01-09 21:21:44,433 INFO L294 olderBase$Statistics]: this new event has 139 ancestors and is cut-off event [2025-01-09 21:21:44,433 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2025-01-09 21:21:44,433 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2025-01-09 21:21:44,433 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2025-01-09 21:21:44,453 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([851] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread3of3ForFork0_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread3of3ForFork0_#t~ret6#1=|v_thr2Thread3of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork0_#t~ret6#1][185], [248#true, 240#true, 2#L714-3true, 192#L705-2true, Black: 261#true, 102#L700-3true, 56#L705-2true, 266#true, 117#L694-2true, 246#true, 263#(= |#race~x~0| 0), 260#(= |#race~n~0| 0), 250#true]) [2025-01-09 21:21:44,453 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2025-01-09 21:21:44,453 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2025-01-09 21:21:44,453 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2025-01-09 21:21:44,453 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2025-01-09 21:21:44,587 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([851] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread3of3ForFork0_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread3of3ForFork0_#t~ret6#1=|v_thr2Thread3of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork0_#t~ret6#1][213], [201#L703-4true, 248#true, 240#true, 2#L714-3true, 102#L700-3true, Black: 261#true, 210#L694-1true, 56#L705-2true, 246#true, 263#(= |#race~x~0| 0), 260#(= |#race~n~0| 0), 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 250#true]) [2025-01-09 21:21:44,588 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2025-01-09 21:21:44,588 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2025-01-09 21:21:44,588 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2025-01-09 21:21:44,588 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2025-01-09 21:21:44,952 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([851] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread3of3ForFork0_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread3of3ForFork0_#t~ret6#1=|v_thr2Thread3of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork0_#t~ret6#1][185], [248#true, 240#true, 2#L714-3true, 192#L705-2true, Black: 261#true, 56#L705-2true, 266#true, 117#L694-2true, 246#true, 263#(= |#race~x~0| 0), 260#(= |#race~n~0| 0), 250#true, 22#L705-2true]) [2025-01-09 21:21:44,952 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2025-01-09 21:21:44,952 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-01-09 21:21:44,953 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-01-09 21:21:44,953 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-01-09 21:21:45,048 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([818] L702-4-->L705-2: Formula: (and (= |v_thr2Thread2of3ForFork0_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork0_#t~ret6#1=|v_thr2Thread2of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork0_#t~ret6#1][203], [201#L703-4true, 248#true, 240#true, 2#L714-3true, Black: 261#true, 56#L705-2true, 117#L694-2true, 246#true, 263#(= |#race~x~0| 0), 260#(= |#race~n~0| 0), 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 250#true, 22#L705-2true]) [2025-01-09 21:21:45,048 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2025-01-09 21:21:45,048 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2025-01-09 21:21:45,048 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2025-01-09 21:21:45,048 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2025-01-09 21:21:45,086 INFO L124 PetriNetUnfolderBase]: 6575/18065 cut-off events. [2025-01-09 21:21:45,086 INFO L125 PetriNetUnfolderBase]: For 7564/8117 co-relation queries the response was YES. [2025-01-09 21:21:45,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35123 conditions, 18065 events. 6575/18065 cut-off events. For 7564/8117 co-relation queries the response was YES. Maximal size of possible extension queue 801. Compared 203299 event pairs, 2466 based on Foata normal form. 44/15760 useless extension candidates. Maximal degree in co-relation 35080. Up to 7191 conditions per place. [2025-01-09 21:21:45,211 INFO L140 encePairwiseOnDemand]: 241/250 looper letters, 33 selfloop transitions, 14 changer transitions 0/215 dead transitions. [2025-01-09 21:21:45,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 215 transitions, 657 flow [2025-01-09 21:21:45,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:21:45,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:21:45,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 666 transitions. [2025-01-09 21:21:45,213 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.888 [2025-01-09 21:21:45,213 INFO L175 Difference]: Start difference. First operand has 196 places, 197 transitions, 487 flow. Second operand 3 states and 666 transitions. [2025-01-09 21:21:45,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 215 transitions, 657 flow [2025-01-09 21:21:45,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 215 transitions, 625 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:21:45,234 INFO L231 Difference]: Finished difference. Result has 198 places, 209 transitions, 591 flow [2025-01-09 21:21:45,234 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=465, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=591, PETRI_PLACES=198, PETRI_TRANSITIONS=209} [2025-01-09 21:21:45,235 INFO L279 CegarLoopForPetriNet]: 204 programPoint places, -6 predicate places. [2025-01-09 21:21:45,235 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 209 transitions, 591 flow [2025-01-09 21:21:45,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 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-01-09 21:21:45,235 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:21:45,235 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] [2025-01-09 21:21:45,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 21:21:45,236 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-01-09 21:21:45,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:21:45,236 INFO L85 PathProgramCache]: Analyzing trace with hash 908509346, now seen corresponding path program 1 times [2025-01-09 21:21:45,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:21:45,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032263654] [2025-01-09 21:21:45,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:21:45,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:21:45,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 21:21:45,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 21:21:45,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:21:45,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:21:45,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:21:45,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:21:45,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032263654] [2025-01-09 21:21:45,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032263654] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:21:45,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:21:45,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:21:45,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859696526] [2025-01-09 21:21:45,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:21:45,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:21:45,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:21:45,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:21:45,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:21:45,353 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 250 [2025-01-09 21:21:45,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 209 transitions, 591 flow. Second operand has 5 states, 5 states have (on average 212.6) internal successors, (1063), 5 states have internal predecessors, (1063), 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-01-09 21:21:45,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:21:45,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 250 [2025-01-09 21:21:45,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:21:45,563 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([818] L702-4-->L705-2: Formula: (and (= |v_thr2Thread2of3ForFork0_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork0_#t~ret6#1=|v_thr2Thread2of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork0_#t~ret6#1][162], [248#true, 240#true, 2#L714-3true, 192#L705-2true, Black: 261#true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 200#$Ultimate##0true, 22#L705-2true, 249#true]) [2025-01-09 21:21:45,563 INFO L294 olderBase$Statistics]: this new event has 118 ancestors and is cut-off event [2025-01-09 21:21:45,563 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2025-01-09 21:21:45,563 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-01-09 21:21:45,563 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2025-01-09 21:21:45,942 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([851] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread3of3ForFork0_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread3of3ForFork0_#t~ret6#1=|v_thr2Thread3of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork0_#t~ret6#1][185], [248#true, 240#true, 2#L714-3true, 192#L705-2true, Black: 261#true, 56#L705-2true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 200#$Ultimate##0true, 250#true, 28#$Ultimate##0true]) [2025-01-09 21:21:45,942 INFO L294 olderBase$Statistics]: this new event has 130 ancestors and is cut-off event [2025-01-09 21:21:45,942 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2025-01-09 21:21:45,942 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2025-01-09 21:21:45,942 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-01-09 21:21:45,973 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~ret6#1=|v_thr2Thread1of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~ret6#1][125], [248#true, 240#true, 2#L714-3true, 192#L705-2true, Black: 261#true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 197#$Ultimate##0true, 260#(= |#race~n~0| 0), 271#true, 200#$Ultimate##0true, 250#true, 22#L705-2true]) [2025-01-09 21:21:45,973 INFO L294 olderBase$Statistics]: this new event has 130 ancestors and is cut-off event [2025-01-09 21:21:45,973 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-01-09 21:21:45,973 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2025-01-09 21:21:45,973 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2025-01-09 21:21:45,979 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~ret6#1=|v_thr2Thread1of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~ret6#1][125], [248#true, 240#true, 192#L705-2true, Black: 261#true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 200#$Ultimate##0true, 39#L-1-4true, 249#true, 22#L705-2true]) [2025-01-09 21:21:45,979 INFO L294 olderBase$Statistics]: this new event has 130 ancestors and is cut-off event [2025-01-09 21:21:45,979 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2025-01-09 21:21:45,979 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2025-01-09 21:21:45,979 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-01-09 21:21:46,186 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~ret6#1=|v_thr2Thread1of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~ret6#1][125], [248#true, 240#true, 2#L714-3true, Black: 263#(= |#race~x~0| 0), 192#L705-2true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 197#$Ultimate##0true, 260#(= |#race~n~0| 0), 271#true, 200#$Ultimate##0true, 250#true, 22#L705-2true]) [2025-01-09 21:21:46,186 INFO L294 olderBase$Statistics]: this new event has 135 ancestors and is cut-off event [2025-01-09 21:21:46,186 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2025-01-09 21:21:46,186 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2025-01-09 21:21:46,186 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2025-01-09 21:21:46,194 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~ret6#1=|v_thr2Thread1of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~ret6#1][125], [248#true, 240#true, Black: 263#(= |#race~x~0| 0), 192#L705-2true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 200#$Ultimate##0true, 39#L-1-4true, 249#true, 22#L705-2true]) [2025-01-09 21:21:46,194 INFO L294 olderBase$Statistics]: this new event has 135 ancestors and is cut-off event [2025-01-09 21:21:46,194 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2025-01-09 21:21:46,194 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2025-01-09 21:21:46,194 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2025-01-09 21:21:46,491 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([851] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread3of3ForFork0_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread3of3ForFork0_#t~ret6#1=|v_thr2Thread3of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork0_#t~ret6#1][185], [248#true, 240#true, 2#L714-3true, 192#L705-2true, Black: 261#true, 102#L700-3true, 56#L705-2true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 200#$Ultimate##0true, 250#true]) [2025-01-09 21:21:46,491 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2025-01-09 21:21:46,491 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2025-01-09 21:21:46,491 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2025-01-09 21:21:46,491 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2025-01-09 21:21:46,614 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~ret6#1=|v_thr2Thread1of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~ret6#1][125], [248#true, 240#true, Black: 261#true, 192#L705-2true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 197#$Ultimate##0true, 260#(= |#race~n~0| 0), 271#true, 200#$Ultimate##0true, 39#L-1-4true, 250#true, 22#L705-2true]) [2025-01-09 21:21:46,614 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2025-01-09 21:21:46,614 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2025-01-09 21:21:46,614 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2025-01-09 21:21:46,614 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2025-01-09 21:21:46,618 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~ret6#1=|v_thr2Thread1of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~ret6#1][125], [248#true, 240#true, 192#L705-2true, Black: 261#true, 56#L705-2true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 200#$Ultimate##0true, 39#L-1-4true, 250#true, 28#$Ultimate##0true]) [2025-01-09 21:21:46,618 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2025-01-09 21:21:46,618 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2025-01-09 21:21:46,618 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2025-01-09 21:21:46,618 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2025-01-09 21:21:46,621 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~ret6#1=|v_thr2Thread1of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~ret6#1][125], [248#true, 240#true, 2#L714-3true, Black: 261#true, 192#L705-2true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 211#L700-3true, 271#true, 200#$Ultimate##0true, 250#true, 22#L705-2true]) [2025-01-09 21:21:46,621 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2025-01-09 21:21:46,621 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2025-01-09 21:21:46,621 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2025-01-09 21:21:46,621 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2025-01-09 21:21:46,736 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~ret6#1=|v_thr2Thread1of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~ret6#1][125], [248#true, 240#true, 2#L714-3true, 102#L700-3true, 192#L705-2true, Black: 261#true, 210#L694-1true, 56#L705-2true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 250#true]) [2025-01-09 21:21:46,736 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2025-01-09 21:21:46,736 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2025-01-09 21:21:46,736 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-01-09 21:21:46,736 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2025-01-09 21:21:46,960 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~ret6#1=|v_thr2Thread1of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~ret6#1][125], [248#true, 240#true, 2#L714-3true, 102#L700-3true, Black: 261#true, 192#L705-2true, 56#L705-2true, 266#true, 117#L694-2true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 250#true]) [2025-01-09 21:21:46,960 INFO L294 olderBase$Statistics]: this new event has 145 ancestors and is cut-off event [2025-01-09 21:21:46,960 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-01-09 21:21:46,960 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-01-09 21:21:46,960 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-01-09 21:21:47,058 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([808] L701-->L701-1: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][199], [201#L703-4true, 248#true, 240#true, 2#L714-3true, Black: 261#true, 56#L705-2true, 266#true, 117#L694-2true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 250#true, 55#L701-1true]) [2025-01-09 21:21:47,058 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2025-01-09 21:21:47,058 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-01-09 21:21:47,058 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-01-09 21:21:47,058 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-01-09 21:21:47,102 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~ret6#1=|v_thr2Thread1of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~ret6#1][125], [248#true, 240#true, Black: 263#(= |#race~x~0| 0), 192#L705-2true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 197#$Ultimate##0true, 260#(= |#race~n~0| 0), 271#true, 200#$Ultimate##0true, 39#L-1-4true, 250#true, 22#L705-2true]) [2025-01-09 21:21:47,102 INFO L294 olderBase$Statistics]: this new event has 147 ancestors and is cut-off event [2025-01-09 21:21:47,102 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2025-01-09 21:21:47,102 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2025-01-09 21:21:47,102 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2025-01-09 21:21:47,110 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~ret6#1=|v_thr2Thread1of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~ret6#1][125], [248#true, 240#true, 2#L714-3true, Black: 263#(= |#race~x~0| 0), 192#L705-2true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 211#L700-3true, 271#true, 200#$Ultimate##0true, 250#true, 22#L705-2true]) [2025-01-09 21:21:47,110 INFO L294 olderBase$Statistics]: this new event has 147 ancestors and is cut-off event [2025-01-09 21:21:47,110 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2025-01-09 21:21:47,110 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2025-01-09 21:21:47,110 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2025-01-09 21:21:47,233 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~ret6#1=|v_thr2Thread1of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~ret6#1][125], [248#true, 240#true, 2#L714-3true, Black: 263#(= |#race~x~0| 0), 102#L700-3true, 192#L705-2true, 210#L694-1true, 56#L705-2true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 250#true]) [2025-01-09 21:21:47,234 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2025-01-09 21:21:47,234 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-01-09 21:21:47,234 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-01-09 21:21:47,234 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-01-09 21:21:47,271 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~ret6#1=|v_thr2Thread1of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~ret6#1][125], [248#true, 240#true, 2#L714-3true, Black: 263#(= |#race~x~0| 0), 102#L700-3true, 192#L705-2true, 56#L705-2true, 266#true, 117#L694-2true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 250#true]) [2025-01-09 21:21:47,271 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2025-01-09 21:21:47,271 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-01-09 21:21:47,271 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-01-09 21:21:47,271 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-01-09 21:21:47,399 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~ret6#1=|v_thr2Thread1of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~ret6#1][125], [248#true, 240#true, 2#L714-3true, 162#L703-3true, Black: 261#true, 192#L705-2true, 56#L705-2true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 200#$Ultimate##0true, 250#true]) [2025-01-09 21:21:47,400 INFO L294 olderBase$Statistics]: this new event has 152 ancestors and is cut-off event [2025-01-09 21:21:47,400 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2025-01-09 21:21:47,400 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-01-09 21:21:47,400 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-01-09 21:21:47,441 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~ret6#1=|v_thr2Thread1of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~ret6#1][125], [248#true, 240#true, 2#L714-3true, 192#L705-2true, Black: 261#true, 56#L705-2true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 250#true, 22#L705-2true, 19#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue]) [2025-01-09 21:21:47,441 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2025-01-09 21:21:47,441 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-01-09 21:21:47,441 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-01-09 21:21:47,441 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-01-09 21:21:47,626 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~ret6#1=|v_thr2Thread1of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~ret6#1][125], [248#true, 240#true, Black: 261#true, 192#L705-2true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 211#L700-3true, 260#(= |#race~n~0| 0), 271#true, 200#$Ultimate##0true, 39#L-1-4true, 250#true, 22#L705-2true]) [2025-01-09 21:21:47,626 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2025-01-09 21:21:47,626 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-01-09 21:21:47,626 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2025-01-09 21:21:47,626 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-01-09 21:21:47,627 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~ret6#1=|v_thr2Thread1of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~ret6#1][125], [248#true, 240#true, 192#L705-2true, 102#L700-3true, Black: 261#true, 56#L705-2true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 200#$Ultimate##0true, 39#L-1-4true, 250#true]) [2025-01-09 21:21:47,627 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2025-01-09 21:21:47,627 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-01-09 21:21:47,627 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2025-01-09 21:21:47,627 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-01-09 21:21:47,665 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([851] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread3of3ForFork0_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread3of3ForFork0_#t~ret6#1=|v_thr2Thread3of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork0_#t~ret6#1][185], [248#true, 240#true, 2#L714-3true, Black: 261#true, 192#L705-2true, 210#L694-1true, 56#L705-2true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 250#true, 22#L705-2true]) [2025-01-09 21:21:47,665 INFO L294 olderBase$Statistics]: this new event has 157 ancestors and is cut-off event [2025-01-09 21:21:47,665 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2025-01-09 21:21:47,665 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-01-09 21:21:47,665 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-01-09 21:21:47,691 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([851] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread3of3ForFork0_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread3of3ForFork0_#t~ret6#1=|v_thr2Thread3of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork0_#t~ret6#1][185], [248#true, 240#true, 2#L714-3true, Black: 261#true, 192#L705-2true, 56#L705-2true, 117#L694-2true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 250#true, 22#L705-2true]) [2025-01-09 21:21:47,691 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2025-01-09 21:21:47,691 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-01-09 21:21:47,691 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2025-01-09 21:21:47,691 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-01-09 21:21:47,709 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~ret6#1=|v_thr2Thread1of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~ret6#1][125], [248#true, 240#true, Black: 261#true, 192#L705-2true, 56#L705-2true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 200#$Ultimate##0true, 39#L-1-4true, 250#true, 55#L701-1true]) [2025-01-09 21:21:47,709 INFO L294 olderBase$Statistics]: this new event has 156 ancestors and is cut-off event [2025-01-09 21:21:47,709 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2025-01-09 21:21:47,709 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2025-01-09 21:21:47,709 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2025-01-09 21:21:47,751 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~ret6#1=|v_thr2Thread1of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~ret6#1][125], [248#true, 240#true, 2#L714-3true, Black: 263#(= |#race~x~0| 0), 192#L705-2true, 210#L694-1true, 56#L705-2true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 250#true, 22#L705-2true]) [2025-01-09 21:21:47,751 INFO L294 olderBase$Statistics]: this new event has 157 ancestors and is cut-off event [2025-01-09 21:21:47,751 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-01-09 21:21:47,751 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-01-09 21:21:47,751 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2025-01-09 21:21:47,754 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~ret6#1=|v_thr2Thread1of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~ret6#1][125], [42#L701-2true, 248#true, 240#true, 192#L705-2true, Black: 261#true, 56#L705-2true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 200#$Ultimate##0true, 39#L-1-4true, 250#true]) [2025-01-09 21:21:47,754 INFO L294 olderBase$Statistics]: this new event has 157 ancestors and is cut-off event [2025-01-09 21:21:47,754 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-01-09 21:21:47,754 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2025-01-09 21:21:47,754 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2025-01-09 21:21:47,775 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~ret6#1=|v_thr2Thread1of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~ret6#1][125], [248#true, 240#true, 2#L714-3true, Black: 263#(= |#race~x~0| 0), 192#L705-2true, 56#L705-2true, 117#L694-2true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 250#true, 22#L705-2true]) [2025-01-09 21:21:47,775 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2025-01-09 21:21:47,775 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2025-01-09 21:21:47,775 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-01-09 21:21:47,775 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-01-09 21:21:47,777 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([841] L701-->L701-1: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][177], [248#true, 240#true, Black: 261#true, 266#true, 117#L694-2true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 136#L702-4true, 260#(= |#race~n~0| 0), 271#true, 101#L701-1true, 39#L-1-4true, 250#true, 22#L705-2true]) [2025-01-09 21:21:47,777 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2025-01-09 21:21:47,777 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is cut-off event [2025-01-09 21:21:47,777 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is cut-off event [2025-01-09 21:21:47,777 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2025-01-09 21:21:47,800 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([841] L701-->L701-1: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][208], [201#L703-4true, 248#true, 240#true, Black: 261#true, 117#L694-2true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 101#L701-1true, 39#L-1-4true, 250#true, 22#L705-2true]) [2025-01-09 21:21:47,800 INFO L294 olderBase$Statistics]: this new event has 162 ancestors and is cut-off event [2025-01-09 21:21:47,801 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2025-01-09 21:21:47,801 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2025-01-09 21:21:47,801 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2025-01-09 21:21:47,817 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([818] L702-4-->L705-2: Formula: (and (= |v_thr2Thread2of3ForFork0_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork0_#t~ret6#1=|v_thr2Thread2of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork0_#t~ret6#1][162], [248#true, 240#true, Black: 263#(= |#race~x~0| 0), 210#L694-1true, 192#L705-2true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 211#L700-3true, 271#true, 39#L-1-4true, 250#true, 22#L705-2true]) [2025-01-09 21:21:47,817 INFO L294 olderBase$Statistics]: this new event has 161 ancestors and is cut-off event [2025-01-09 21:21:47,817 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2025-01-09 21:21:47,817 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2025-01-09 21:21:47,817 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2025-01-09 21:21:47,837 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~ret6#1=|v_thr2Thread1of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~ret6#1][125], [248#true, 240#true, Black: 263#(= |#race~x~0| 0), 192#L705-2true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 211#L700-3true, 260#(= |#race~n~0| 0), 271#true, 200#$Ultimate##0true, 39#L-1-4true, 250#true, 22#L705-2true]) [2025-01-09 21:21:47,837 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is cut-off event [2025-01-09 21:21:47,837 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2025-01-09 21:21:47,837 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-01-09 21:21:47,837 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-01-09 21:21:47,849 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([818] L702-4-->L705-2: Formula: (and (= |v_thr2Thread2of3ForFork0_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork0_#t~ret6#1=|v_thr2Thread2of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork0_#t~ret6#1][162], [248#true, 240#true, Black: 263#(= |#race~x~0| 0), 192#L705-2true, 117#L694-2true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 211#L700-3true, 271#true, 39#L-1-4true, 250#true, 22#L705-2true]) [2025-01-09 21:21:47,849 INFO L294 olderBase$Statistics]: this new event has 162 ancestors and is cut-off event [2025-01-09 21:21:47,849 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2025-01-09 21:21:47,849 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2025-01-09 21:21:47,849 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2025-01-09 21:21:47,863 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([851] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread3of3ForFork0_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread3of3ForFork0_#t~ret6#1=|v_thr2Thread3of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork0_#t~ret6#1][185], [248#true, 240#true, Black: 261#true, 192#L705-2true, 56#L705-2true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 39#L-1-4true, 250#true, 19#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 55#L701-1true]) [2025-01-09 21:21:47,863 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is not cut-off event [2025-01-09 21:21:47,863 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is not cut-off event [2025-01-09 21:21:47,863 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is not cut-off event [2025-01-09 21:21:47,863 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is not cut-off event [2025-01-09 21:21:47,874 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([851] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread3of3ForFork0_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread3of3ForFork0_#t~ret6#1=|v_thr2Thread3of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork0_#t~ret6#1][185], [248#true, 240#true, 2#L714-3true, Black: 263#(= |#race~x~0| 0), 192#L705-2true, 210#L694-1true, 56#L705-2true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 250#true, 22#L705-2true]) [2025-01-09 21:21:47,875 INFO L294 olderBase$Statistics]: this new event has 162 ancestors and is cut-off event [2025-01-09 21:21:47,875 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-01-09 21:21:47,875 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-01-09 21:21:47,875 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2025-01-09 21:21:47,876 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([841] L701-->L701-1: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][177], [248#true, 240#true, 210#L694-1true, Black: 261#true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 136#L702-4true, 260#(= |#race~n~0| 0), 271#true, 101#L701-1true, 39#L-1-4true, 250#true, 22#L705-2true]) [2025-01-09 21:21:47,876 INFO L294 olderBase$Statistics]: this new event has 162 ancestors and is cut-off event [2025-01-09 21:21:47,876 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2025-01-09 21:21:47,876 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2025-01-09 21:21:47,876 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2025-01-09 21:21:47,876 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([841] L701-->L701-1: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][177], [248#true, 240#true, Black: 261#true, 266#true, 117#L694-2true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 136#L702-4true, 260#(= |#race~n~0| 0), 271#true, 101#L701-1true, 39#L-1-4true, 250#true, 22#L705-2true]) [2025-01-09 21:21:47,876 INFO L294 olderBase$Statistics]: this new event has 163 ancestors and is cut-off event [2025-01-09 21:21:47,876 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is cut-off event [2025-01-09 21:21:47,876 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2025-01-09 21:21:47,876 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is cut-off event [2025-01-09 21:21:47,876 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2025-01-09 21:21:47,892 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([851] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread3of3ForFork0_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread3of3ForFork0_#t~ret6#1=|v_thr2Thread3of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork0_#t~ret6#1][185], [248#true, 240#true, 2#L714-3true, Black: 263#(= |#race~x~0| 0), 192#L705-2true, 56#L705-2true, 266#true, 117#L694-2true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 250#true, 22#L705-2true]) [2025-01-09 21:21:47,892 INFO L294 olderBase$Statistics]: this new event has 163 ancestors and is cut-off event [2025-01-09 21:21:47,892 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-01-09 21:21:47,892 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-01-09 21:21:47,892 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2025-01-09 21:21:47,895 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~ret6#1=|v_thr2Thread1of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~ret6#1][125], [248#true, 240#true, Black: 263#(= |#race~x~0| 0), 102#L700-3true, 192#L705-2true, 210#L694-1true, 56#L705-2true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 39#L-1-4true, 250#true]) [2025-01-09 21:21:47,895 INFO L294 olderBase$Statistics]: this new event has 161 ancestors and is cut-off event [2025-01-09 21:21:47,895 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2025-01-09 21:21:47,895 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2025-01-09 21:21:47,896 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2025-01-09 21:21:47,915 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~ret6#1=|v_thr2Thread1of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~ret6#1][125], [248#true, 240#true, Black: 263#(= |#race~x~0| 0), 102#L700-3true, 192#L705-2true, 56#L705-2true, 266#true, 117#L694-2true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 39#L-1-4true, 250#true]) [2025-01-09 21:21:47,915 INFO L294 olderBase$Statistics]: this new event has 162 ancestors and is cut-off event [2025-01-09 21:21:47,915 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2025-01-09 21:21:47,915 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2025-01-09 21:21:47,915 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2025-01-09 21:21:47,930 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([818] L702-4-->L705-2: Formula: (and (= |v_thr2Thread2of3ForFork0_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork0_#t~ret6#1=|v_thr2Thread2of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork0_#t~ret6#1][162], [248#true, 240#true, Black: 261#true, 56#L705-2true, 246#true, Black: 266#true, 260#(= |#race~n~0| 0), 225#L703-3true, 271#true, 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 200#$Ultimate##0true, 39#L-1-4true, 250#true, 22#L705-2true]) [2025-01-09 21:21:47,930 INFO L294 olderBase$Statistics]: this new event has 164 ancestors and is cut-off event [2025-01-09 21:21:47,930 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2025-01-09 21:21:47,930 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2025-01-09 21:21:47,930 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2025-01-09 21:21:47,976 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([818] L702-4-->L705-2: Formula: (and (= |v_thr2Thread2of3ForFork0_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork0_#t~ret6#1=|v_thr2Thread2of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork0_#t~ret6#1][162], [248#true, 240#true, Black: 261#true, 210#L694-1true, 56#L705-2true, 246#true, Black: 266#true, 260#(= |#race~n~0| 0), 225#L703-3true, 271#true, 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 39#L-1-4true, 250#true, 22#L705-2true]) [2025-01-09 21:21:47,976 INFO L294 olderBase$Statistics]: this new event has 166 ancestors and is cut-off event [2025-01-09 21:21:47,976 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2025-01-09 21:21:47,976 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2025-01-09 21:21:47,976 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2025-01-09 21:21:47,981 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~ret6#1=|v_thr2Thread1of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~ret6#1][125], [248#true, 240#true, 162#L703-3true, Black: 261#true, 192#L705-2true, 56#L705-2true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 200#$Ultimate##0true, 39#L-1-4true, 250#true]) [2025-01-09 21:21:47,981 INFO L294 olderBase$Statistics]: this new event has 164 ancestors and is cut-off event [2025-01-09 21:21:47,981 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2025-01-09 21:21:47,981 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2025-01-09 21:21:47,981 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2025-01-09 21:21:47,988 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([818] L702-4-->L705-2: Formula: (and (= |v_thr2Thread2of3ForFork0_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork0_#t~ret6#1=|v_thr2Thread2of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork0_#t~ret6#1][162], [248#true, 240#true, Black: 261#true, 56#L705-2true, 117#L694-2true, 246#true, Black: 266#true, 260#(= |#race~n~0| 0), 225#L703-3true, 271#true, 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 39#L-1-4true, 250#true, 22#L705-2true]) [2025-01-09 21:21:47,988 INFO L294 olderBase$Statistics]: this new event has 167 ancestors and is cut-off event [2025-01-09 21:21:47,988 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2025-01-09 21:21:47,988 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2025-01-09 21:21:47,988 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-01-09 21:21:47,993 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([818] L702-4-->L705-2: Formula: (and (= |v_thr2Thread2of3ForFork0_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork0_#t~ret6#1=|v_thr2Thread2of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork0_#t~ret6#1][162], [248#true, 240#true, Black: 261#true, 56#L705-2true, 246#true, Black: 266#true, 260#(= |#race~n~0| 0), 225#L703-3true, 271#true, 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 39#L-1-4true, 250#true, 22#L705-2true, 19#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue]) [2025-01-09 21:21:47,993 INFO L294 olderBase$Statistics]: this new event has 167 ancestors and is cut-off event [2025-01-09 21:21:47,993 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2025-01-09 21:21:47,993 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2025-01-09 21:21:47,993 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-01-09 21:21:48,038 INFO L124 PetriNetUnfolderBase]: 7495/26481 cut-off events. [2025-01-09 21:21:48,038 INFO L125 PetriNetUnfolderBase]: For 6293/10999 co-relation queries the response was YES. [2025-01-09 21:21:48,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45842 conditions, 26481 events. 7495/26481 cut-off events. For 6293/10999 co-relation queries the response was YES. Maximal size of possible extension queue 1098. Compared 345817 event pairs, 2967 based on Foata normal form. 10/22479 useless extension candidates. Maximal degree in co-relation 45798. Up to 4933 conditions per place. [2025-01-09 21:21:48,258 INFO L140 encePairwiseOnDemand]: 246/250 looper letters, 22 selfloop transitions, 0 changer transitions 4/212 dead transitions. [2025-01-09 21:21:48,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 212 transitions, 649 flow [2025-01-09 21:21:48,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:21:48,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:21:48,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1077 transitions. [2025-01-09 21:21:48,261 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8616 [2025-01-09 21:21:48,261 INFO L175 Difference]: Start difference. First operand has 198 places, 209 transitions, 591 flow. Second operand 5 states and 1077 transitions. [2025-01-09 21:21:48,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 212 transitions, 649 flow [2025-01-09 21:21:48,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 212 transitions, 621 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:21:48,305 INFO L231 Difference]: Finished difference. Result has 203 places, 208 transitions, 567 flow [2025-01-09 21:21:48,306 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=563, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=567, PETRI_PLACES=203, PETRI_TRANSITIONS=208} [2025-01-09 21:21:48,306 INFO L279 CegarLoopForPetriNet]: 204 programPoint places, -1 predicate places. [2025-01-09 21:21:48,306 INFO L471 AbstractCegarLoop]: Abstraction has has 203 places, 208 transitions, 567 flow [2025-01-09 21:21:48,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 212.6) internal successors, (1063), 5 states have internal predecessors, (1063), 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-01-09 21:21:48,307 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:21:48,307 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] [2025-01-09 21:21:48,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 21:21:48,307 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-01-09 21:21:48,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:21:48,308 INFO L85 PathProgramCache]: Analyzing trace with hash -784884826, now seen corresponding path program 1 times [2025-01-09 21:21:48,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:21:48,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372994711] [2025-01-09 21:21:48,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:21:48,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:21:48,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 21:21:48,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 21:21:48,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:21:48,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:21:48,327 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:21:48,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 21:21:48,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 21:21:48,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:21:48,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:21:48,349 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:21:48,349 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:21:48,350 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location thr1Err0ASSERT_VIOLATIONDATA_RACE (26 of 27 remaining) [2025-01-09 21:21:48,350 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (25 of 27 remaining) [2025-01-09 21:21:48,350 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (24 of 27 remaining) [2025-01-09 21:21:48,350 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (23 of 27 remaining) [2025-01-09 21:21:48,350 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (22 of 27 remaining) [2025-01-09 21:21:48,350 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (21 of 27 remaining) [2025-01-09 21:21:48,350 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (20 of 27 remaining) [2025-01-09 21:21:48,350 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (19 of 27 remaining) [2025-01-09 21:21:48,350 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (18 of 27 remaining) [2025-01-09 21:21:48,351 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (17 of 27 remaining) [2025-01-09 21:21:48,351 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (16 of 27 remaining) [2025-01-09 21:21:48,351 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 27 remaining) [2025-01-09 21:21:48,351 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 27 remaining) [2025-01-09 21:21:48,351 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (13 of 27 remaining) [2025-01-09 21:21:48,351 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (12 of 27 remaining) [2025-01-09 21:21:48,351 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (11 of 27 remaining) [2025-01-09 21:21:48,351 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (10 of 27 remaining) [2025-01-09 21:21:48,351 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (9 of 27 remaining) [2025-01-09 21:21:48,351 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (8 of 27 remaining) [2025-01-09 21:21:48,351 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (7 of 27 remaining) [2025-01-09 21:21:48,352 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (6 of 27 remaining) [2025-01-09 21:21:48,352 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (5 of 27 remaining) [2025-01-09 21:21:48,352 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 27 remaining) [2025-01-09 21:21:48,352 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (3 of 27 remaining) [2025-01-09 21:21:48,352 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (2 of 27 remaining) [2025-01-09 21:21:48,352 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (1 of 27 remaining) [2025-01-09 21:21:48,352 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 27 remaining) [2025-01-09 21:21:48,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 21:21:48,352 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:21:48,450 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 3 thread instances [2025-01-09 21:21:48,451 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:21:48,457 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:21:48 BasicIcfg [2025-01-09 21:21:48,457 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:21:48,458 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:21:48,458 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:21:48,458 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:21:48,459 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:21:33" (3/4) ... [2025-01-09 21:21:48,460 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 21:21:48,545 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 9. [2025-01-09 21:21:48,593 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:21:48,594 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:21:48,594 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:21:48,595 INFO L158 Benchmark]: Toolchain (without parser) took 15784.78ms. Allocated memory was 167.8MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 124.2MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2025-01-09 21:21:48,596 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 201.3MB. Free memory is still 117.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:21:48,596 INFO L158 Benchmark]: CACSL2BoogieTranslator took 483.83ms. Allocated memory is still 167.8MB. Free memory was 124.2MB in the beginning and 103.8MB in the end (delta: 20.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 21:21:48,596 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.23ms. Allocated memory is still 167.8MB. Free memory was 103.8MB in the beginning and 102.4MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:21:48,597 INFO L158 Benchmark]: Boogie Preprocessor took 39.87ms. Allocated memory is still 167.8MB. Free memory was 102.4MB in the beginning and 101.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:21:48,597 INFO L158 Benchmark]: RCFGBuilder took 482.71ms. Allocated memory is still 167.8MB. Free memory was 101.2MB in the beginning and 85.0MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 21:21:48,597 INFO L158 Benchmark]: TraceAbstraction took 14584.07ms. Allocated memory was 167.8MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 84.4MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2025-01-09 21:21:48,597 INFO L158 Benchmark]: Witness Printer took 135.83ms. Allocated memory is still 2.7GB. Free memory was 1.6GB in the beginning and 1.5GB in the end (delta: 37.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 21:21:48,599 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.31ms. Allocated memory is still 201.3MB. Free memory is still 117.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 483.83ms. Allocated memory is still 167.8MB. Free memory was 124.2MB in the beginning and 103.8MB in the end (delta: 20.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.23ms. Allocated memory is still 167.8MB. Free memory was 103.8MB in the beginning and 102.4MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.87ms. Allocated memory is still 167.8MB. Free memory was 102.4MB in the beginning and 101.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 482.71ms. Allocated memory is still 167.8MB. Free memory was 101.2MB in the beginning and 85.0MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 14584.07ms. Allocated memory was 167.8MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 84.4MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 135.83ms. Allocated memory is still 2.7GB. Free memory was 1.6GB in the beginning and 1.5GB in the end (delta: 37.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 694]: Data race detected Data race detected The following path leads to a data race: [L690] 0 volatile int x; VAL [x=0] [L691] 0 volatile int n; VAL [n=0, x=0] [L692] 0 pthread_mutex_t mut = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [mut={3:0}, n=0, x=0] [L708] 0 pthread_t t1, t2; VAL [\old(argc)=52, \old(argv)={50:53}, argc=52, mut={3:0}, n=0, x=0] [L709] 0 x = 0 VAL [\old(argc)=52, \old(argv)={50:53}, argc=52, mut={3:0}, n=0, x=0] [L710] 0 n = __VERIFIER_nondet_uint() VAL [\old(argc)=52, \old(argv)={50:53}, argc=52, mut={3:0}, n=7, x=0] [L711] EXPR 0 n >= (10/2) VAL [\old(argc)=52, \old(argv)={50:53}, argc=52, mut={3:0}, n=7, x=0] [L711] EXPR 0 n >= (10/2) && n < 10 VAL [\old(argc)=52, \old(argv)={50:53}, argc=52, mut={3:0}, n=7, x=0] [L711] EXPR 0 n < 10 VAL [\old(argc)=52, \old(argv)={50:53}, argc=52, mut={3:0}, n=7, x=0] [L711] EXPR 0 n >= (10/2) && n < 10 VAL [\old(argc)=52, \old(argv)={50:53}, argc=52, mut={3:0}, n=7, x=0] [L711] CALL 0 assume_abort_if_not(n >= (10/2) && n < 10) [L687] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, mut={3:0}, n=7, x=0] [L711] RET 0 assume_abort_if_not(n >= (10/2) && n < 10) [L712] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) VAL [\old(argc)=52, \old(argv)={50:53}, argc=52, mut={3:0}, n=7, t1=-1, x=0] [L713] 0 int i = 0; VAL [\old(argc)=52, \old(argv)={50:53}, argc=52, i=0, mut={3:0}, n=7, t1=-1, x=0] [L713] 0 i < n VAL [\old(argc)=52, \old(argv)={50:53}, argc=52, i=0, mut={3:0}, n=7, t1=-1, x=0] [L713] COND TRUE 0 i < n VAL [\old(argc)=52, \old(argv)={50:53}, argc=52, i=0, mut={3:0}, n=7, t1=-1, x=0] [L714] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) VAL [\old(argc)=52, \old(argv)={50:53}, argc=52, i=0, mut={3:0}, n=7, t1=-1, t2=0, x=0] [L697] 2 int t; VAL [\old(arg)={0:0}, arg={0:0}, mut={3:0}, n=7, x=0] [L698] 2 int k = __VERIFIER_nondet_uint(); VAL [\old(arg)={0:0}, arg={0:0}, k=7, mut={3:0}, n=7, x=0] [L699] CALL 2 assume_abort_if_not(k >= (10/2) && k <= 10) [L687] COND FALSE 2 !(!cond) VAL [\old(cond)=1, cond=1, mut={3:0}, n=7, x=0] [L699] RET 2 assume_abort_if_not(k >= (10/2) && k <= 10) [L694] 1 x <= n VAL [\old(arg)={0:0}, arg={0:0}, mut={3:0}, n=7, x=0] [L701] 2 t = x VAL [\old(arg)={0:0}, arg={0:0}, k=7, mut={3:0}, n=7, t=0, x=0] [L702] 2 k == n VAL [\old(arg)={0:0}, arg={0:0}, k=7, mut={3:0}, n=7, t=0, x=0] [L702] COND TRUE 2 k == n VAL [\old(arg)={0:0}, arg={0:0}, k=7, mut={3:0}, n=7, t=0, x=0] [L703] 2 x = t + 1 VAL [\old(arg)={0:0}, arg={0:0}, k=7, mut={3:0}, n=7, t=0, x=1] [L694] 1 x <= n VAL [\old(arg)={0:0}, arg={0:0}, mut={3:0}, n=7, x=1] Now there is a data race on ~x~0 between C: x = t + 1 [703] and C: x <= n [694] - UnprovableResult [Line: 701]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 703]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 694]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 710]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 711]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 711]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 713]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 712]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 185 locations, 17 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: 1.6s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 146 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 44 mSDsluCounter, 78 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 33 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 181 IncrementalHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 45 mSDtfsCounter, 181 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=281occurred in iteration=0, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 285 NumberOfCodeBlocks, 285 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 207 ConstructedInterpolants, 0 QuantifiedInterpolants, 222 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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 - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 7 procedures, 237 locations, 22 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.4s, OverallIterations: 7, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 250 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 92 mSDsluCounter, 76 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 40 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 303 IncrementalHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 36 mSDtfsCounter, 303 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=461occurred in iteration=5, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 390 NumberOfCodeBlocks, 390 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 299 ConstructedInterpolants, 0 QuantifiedInterpolants, 316 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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 - StatisticsResult: Ultimate Automizer benchmark data with 3 thread instances CFG has 9 procedures, 289 locations, 27 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: 10.3s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 370 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 138 mSDsluCounter, 62 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 40 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 392 IncrementalHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 22 mSDtfsCounter, 392 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=591occurred in iteration=5, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 392 NumberOfCodeBlocks, 392 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 300 ConstructedInterpolants, 0 QuantifiedInterpolants, 317 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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 RESULT: Ultimate proved your program to be incorrect! [2025-01-09 21:21:48,622 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(DATA-RACE)