./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eaba04057472de7e0abee59642faf365bd5be09903096cb87fd907eb76891380 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:10:24,177 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:10:24,218 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-04-29 11:10:24,223 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:10:24,223 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:10:24,242 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:10:24,244 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:10:24,244 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:10:24,244 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:10:24,244 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:10:24,245 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:10:24,245 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:10:24,245 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:10:24,246 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:10:24,246 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 11:10:24,246 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:10:24,246 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:10:24,246 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:10:24,246 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:10:24,246 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 11:10:24,246 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:10:24,247 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 11:10:24,247 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-29 11:10:24,247 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:10:24,247 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:10:24,247 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 11:10:24,247 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:10:24,247 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:10:24,247 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:10:24,247 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:10:24,247 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:10:24,247 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:10:24,248 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:10:24,248 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:10:24,248 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:10:24,248 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:10:24,248 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:10:24,248 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:10:24,249 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 11:10:24,249 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 11:10:24,249 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:10:24,249 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:10:24,249 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:10:24,249 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:10:24,249 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:10:24,249 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> eaba04057472de7e0abee59642faf365bd5be09903096cb87fd907eb76891380 [2025-04-29 11:10:24,459 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:10:24,469 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:10:24,471 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:10:24,472 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:10:24,472 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:10:24,473 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.c [2025-04-29 11:10:25,788 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0374f9911/f2e314bb0e6148a98239d64a621a1091/FLAGc73f64a26 [2025-04-29 11:10:25,994 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:10:25,994 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.c [2025-04-29 11:10:25,995 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:10:25,995 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:10:26,016 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0374f9911/f2e314bb0e6148a98239d64a621a1091/FLAGc73f64a26 [2025-04-29 11:10:26,788 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0374f9911/f2e314bb0e6148a98239d64a621a1091 [2025-04-29 11:10:26,790 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:10:26,791 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:10:26,792 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:10:26,792 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:10:26,796 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:10:26,797 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:10:26" (1/1) ... [2025-04-29 11:10:26,797 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@272db19e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:26, skipping insertion in model container [2025-04-29 11:10:26,797 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:10:26" (1/1) ... [2025-04-29 11:10:26,808 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:10:26,984 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:10:26,994 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:10:27,029 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:10:27,040 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:10:27,041 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:27 WrapperNode [2025-04-29 11:10:27,041 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:10:27,042 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:10:27,042 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:10:27,042 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:10:27,046 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:27" (1/1) ... [2025-04-29 11:10:27,056 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:27" (1/1) ... [2025-04-29 11:10:27,078 INFO L138 Inliner]: procedures = 17, calls = 27, calls flagged for inlining = 8, calls inlined = 9, statements flattened = 161 [2025-04-29 11:10:27,083 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:10:27,083 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:10:27,083 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:10:27,083 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:10:27,090 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:27" (1/1) ... [2025-04-29 11:10:27,091 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:27" (1/1) ... [2025-04-29 11:10:27,094 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:27" (1/1) ... [2025-04-29 11:10:27,095 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:27" (1/1) ... [2025-04-29 11:10:27,107 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:27" (1/1) ... [2025-04-29 11:10:27,108 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:27" (1/1) ... [2025-04-29 11:10:27,110 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:27" (1/1) ... [2025-04-29 11:10:27,111 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:27" (1/1) ... [2025-04-29 11:10:27,112 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:27" (1/1) ... [2025-04-29 11:10:27,116 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:10:27,117 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:10:27,117 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:10:27,117 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:10:27,118 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:27" (1/1) ... [2025-04-29 11:10:27,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:10:27,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:10:27,147 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-29 11:10:27,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-29 11:10:27,167 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-29 11:10:27,167 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-29 11:10:27,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-29 11:10:27,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-29 11:10:27,167 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-29 11:10:27,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:10:27,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:10:27,167 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-29 11:10:27,167 INFO L130 BoogieDeclarations]: Found specification of procedure worker [2025-04-29 11:10:27,167 INFO L138 BoogieDeclarations]: Found implementation of procedure worker [2025-04-29 11:10:27,168 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-29 11:10:27,236 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:10:27,237 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:10:27,493 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 11:10:27,494 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:10:27,517 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:10:27,517 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-04-29 11:10:27,517 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:10:27 BoogieIcfgContainer [2025-04-29 11:10:27,517 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:10:27,519 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:10:27,519 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:10:27,524 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:10:27,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:10:26" (1/3) ... [2025-04-29 11:10:27,524 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7015ee4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:10:27, skipping insertion in model container [2025-04-29 11:10:27,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:27" (2/3) ... [2025-04-29 11:10:27,525 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7015ee4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:10:27, skipping insertion in model container [2025-04-29 11:10:27,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:10:27" (3/3) ... [2025-04-29 11:10:27,525 INFO L128 eAbstractionObserver]: Analyzing ICFG 13-privatized_68-pfscan_protected_loop_minimal_interval_true.c [2025-04-29 11:10:27,538 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:10:27,539 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 13-privatized_68-pfscan_protected_loop_minimal_interval_true.c that has 2 procedures, 183 locations, 189 edges, 1 initial locations, 3 loop locations, and 10 error locations. [2025-04-29 11:10:27,540 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 11:10:27,616 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-29 11:10:27,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 186 places, 190 transitions, 384 flow [2025-04-29 11:10:27,708 INFO L116 PetriNetUnfolderBase]: 8/189 cut-off events. [2025-04-29 11:10:27,710 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:10:27,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 189 events. 8/189 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 366 event pairs, 0 based on Foata normal form. 0/171 useless extension candidates. Maximal degree in co-relation 153. Up to 2 conditions per place. [2025-04-29 11:10:27,717 INFO L82 GeneralOperation]: Start removeDead. Operand has 186 places, 190 transitions, 384 flow [2025-04-29 11:10:27,721 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 185 places, 189 transitions, 381 flow [2025-04-29 11:10:27,727 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:10:27,740 INFO L340 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;@7dd49483, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:10:27,740 INFO L341 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-04-29 11:10:27,745 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:10:27,746 INFO L116 PetriNetUnfolderBase]: 0/22 cut-off events. [2025-04-29 11:10:27,747 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:10:27,747 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:27,748 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:10:27,748 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-04-29 11:10:27,752 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:27,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1497424666, now seen corresponding path program 1 times [2025-04-29 11:10:27,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:27,757 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505078936] [2025-04-29 11:10:27,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:27,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:27,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-29 11:10:27,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-29 11:10:27,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:27,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:28,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:10:28,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:28,234 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505078936] [2025-04-29 11:10:28,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505078936] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:28,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:28,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:10:28,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939272596] [2025-04-29 11:10:28,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:28,241 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:10:28,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:28,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:10:28,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:10:28,618 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 190 [2025-04-29 11:10:28,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 189 transitions, 381 flow. Second operand has 6 states, 6 states have (on average 132.33333333333334) internal successors, (794), 6 states have internal predecessors, (794), 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-04-29 11:10:28,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:28,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 190 [2025-04-29 11:10:28,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:28,896 INFO L116 PetriNetUnfolderBase]: 479/1946 cut-off events. [2025-04-29 11:10:28,896 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:10:28,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2832 conditions, 1946 events. 479/1946 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 13675 event pairs, 378 based on Foata normal form. 78/1830 useless extension candidates. Maximal degree in co-relation 2781. Up to 877 conditions per place. [2025-04-29 11:10:28,911 INFO L140 encePairwiseOnDemand]: 180/190 looper letters, 47 selfloop transitions, 5 changer transitions 0/180 dead transitions. [2025-04-29 11:10:28,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 180 transitions, 467 flow [2025-04-29 11:10:28,913 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:10:28,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:10:28,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 843 transitions. [2025-04-29 11:10:28,931 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7394736842105263 [2025-04-29 11:10:28,932 INFO L175 Difference]: Start difference. First operand has 185 places, 189 transitions, 381 flow. Second operand 6 states and 843 transitions. [2025-04-29 11:10:28,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 180 transitions, 467 flow [2025-04-29 11:10:28,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 180 transitions, 466 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:10:28,940 INFO L231 Difference]: Finished difference. Result has 183 places, 180 transitions, 372 flow [2025-04-29 11:10:28,942 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=190, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=372, PETRI_PLACES=183, PETRI_TRANSITIONS=180} [2025-04-29 11:10:28,946 INFO L279 CegarLoopForPetriNet]: 185 programPoint places, -2 predicate places. [2025-04-29 11:10:28,947 INFO L485 AbstractCegarLoop]: Abstraction has has 183 places, 180 transitions, 372 flow [2025-04-29 11:10:28,948 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 132.33333333333334) internal successors, (794), 6 states have internal predecessors, (794), 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-04-29 11:10:28,949 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:28,949 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] [2025-04-29 11:10:28,949 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:10:28,949 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting workerErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-04-29 11:10:28,950 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:28,950 INFO L85 PathProgramCache]: Analyzing trace with hash -327856066, now seen corresponding path program 1 times [2025-04-29 11:10:28,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:28,951 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751172204] [2025-04-29 11:10:28,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:28,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:28,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-29 11:10:28,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-29 11:10:28,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:28,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:29,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:10:29,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:29,286 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751172204] [2025-04-29 11:10:29,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751172204] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:29,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:29,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:10:29,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755928608] [2025-04-29 11:10:29,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:29,287 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:10:29,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:29,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:10:29,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:10:29,579 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 190 [2025-04-29 11:10:29,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 180 transitions, 372 flow. Second operand has 6 states, 6 states have (on average 134.16666666666666) internal successors, (805), 6 states have internal predecessors, (805), 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-04-29 11:10:29,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:29,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 190 [2025-04-29 11:10:29,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:29,972 INFO L116 PetriNetUnfolderBase]: 592/2724 cut-off events. [2025-04-29 11:10:29,972 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:10:29,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3839 conditions, 2724 events. 592/2724 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 21605 event pairs, 78 based on Foata normal form. 0/2494 useless extension candidates. Maximal degree in co-relation 3803. Up to 653 conditions per place. [2025-04-29 11:10:29,988 INFO L140 encePairwiseOnDemand]: 154/190 looper letters, 76 selfloop transitions, 43 changer transitions 0/247 dead transitions. [2025-04-29 11:10:29,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 247 transitions, 744 flow [2025-04-29 11:10:29,989 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:10:29,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:10:29,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 916 transitions. [2025-04-29 11:10:29,991 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8035087719298246 [2025-04-29 11:10:29,992 INFO L175 Difference]: Start difference. First operand has 183 places, 180 transitions, 372 flow. Second operand 6 states and 916 transitions. [2025-04-29 11:10:29,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 247 transitions, 744 flow [2025-04-29 11:10:29,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 247 transitions, 734 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:10:30,000 INFO L231 Difference]: Finished difference. Result has 188 places, 223 transitions, 692 flow [2025-04-29 11:10:30,001 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=190, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=692, PETRI_PLACES=188, PETRI_TRANSITIONS=223} [2025-04-29 11:10:30,001 INFO L279 CegarLoopForPetriNet]: 185 programPoint places, 3 predicate places. [2025-04-29 11:10:30,001 INFO L485 AbstractCegarLoop]: Abstraction has has 188 places, 223 transitions, 692 flow [2025-04-29 11:10:30,002 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 134.16666666666666) internal successors, (805), 6 states have internal predecessors, (805), 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-04-29 11:10:30,002 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:30,002 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-04-29 11:10:30,002 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:10:30,002 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-04-29 11:10:30,003 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:30,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1490781154, now seen corresponding path program 1 times [2025-04-29 11:10:30,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:30,003 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443022612] [2025-04-29 11:10:30,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:30,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:30,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-29 11:10:30,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-29 11:10:30,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:30,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:30,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:10:30,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:30,242 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443022612] [2025-04-29 11:10:30,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443022612] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:30,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:30,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:10:30,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736753981] [2025-04-29 11:10:30,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:30,244 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:10:30,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:30,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:10:30,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:10:30,535 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 190 [2025-04-29 11:10:30,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 223 transitions, 692 flow. Second operand has 6 states, 6 states have (on average 152.16666666666666) internal successors, (913), 6 states have internal predecessors, (913), 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-04-29 11:10:30,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:30,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 190 [2025-04-29 11:10:30,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:30,883 INFO L116 PetriNetUnfolderBase]: 621/3556 cut-off events. [2025-04-29 11:10:30,883 INFO L117 PetriNetUnfolderBase]: For 631/730 co-relation queries the response was YES. [2025-04-29 11:10:30,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6059 conditions, 3556 events. 621/3556 cut-off events. For 631/730 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 28775 event pairs, 81 based on Foata normal form. 20/3372 useless extension candidates. Maximal degree in co-relation 6010. Up to 760 conditions per place. [2025-04-29 11:10:30,896 INFO L140 encePairwiseOnDemand]: 172/190 looper letters, 66 selfloop transitions, 36 changer transitions 0/274 dead transitions. [2025-04-29 11:10:30,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 274 transitions, 1040 flow [2025-04-29 11:10:30,897 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:10:30,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:10:30,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 979 transitions. [2025-04-29 11:10:30,901 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8587719298245614 [2025-04-29 11:10:30,902 INFO L175 Difference]: Start difference. First operand has 188 places, 223 transitions, 692 flow. Second operand 6 states and 979 transitions. [2025-04-29 11:10:30,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 274 transitions, 1040 flow [2025-04-29 11:10:30,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 274 transitions, 1040 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:10:30,912 INFO L231 Difference]: Finished difference. Result has 198 places, 258 transitions, 992 flow [2025-04-29 11:10:30,913 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=190, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=992, PETRI_PLACES=198, PETRI_TRANSITIONS=258} [2025-04-29 11:10:30,914 INFO L279 CegarLoopForPetriNet]: 185 programPoint places, 13 predicate places. [2025-04-29 11:10:30,914 INFO L485 AbstractCegarLoop]: Abstraction has has 198 places, 258 transitions, 992 flow [2025-04-29 11:10:30,914 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 152.16666666666666) internal successors, (913), 6 states have internal predecessors, (913), 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-04-29 11:10:30,915 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:30,915 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] [2025-04-29 11:10:30,915 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:10:30,915 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-04-29 11:10:30,915 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:30,916 INFO L85 PathProgramCache]: Analyzing trace with hash 735419875, now seen corresponding path program 1 times [2025-04-29 11:10:30,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:30,916 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744036568] [2025-04-29 11:10:30,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:30,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:30,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-04-29 11:10:30,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-29 11:10:30,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:30,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:31,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:10:31,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:31,163 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744036568] [2025-04-29 11:10:31,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744036568] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:31,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:31,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:10:31,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680859360] [2025-04-29 11:10:31,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:31,163 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:10:31,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:31,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:10:31,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:10:31,313 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 190 [2025-04-29 11:10:31,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 258 transitions, 992 flow. Second operand has 6 states, 6 states have (on average 134.0) internal successors, (804), 6 states have internal predecessors, (804), 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-04-29 11:10:31,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:31,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 190 [2025-04-29 11:10:31,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:32,237 INFO L116 PetriNetUnfolderBase]: 2543/8238 cut-off events. [2025-04-29 11:10:32,238 INFO L117 PetriNetUnfolderBase]: For 4737/5035 co-relation queries the response was YES. [2025-04-29 11:10:32,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18999 conditions, 8238 events. 2543/8238 cut-off events. For 4737/5035 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 69322 event pairs, 840 based on Foata normal form. 115/7886 useless extension candidates. Maximal degree in co-relation 18945. Up to 4332 conditions per place. [2025-04-29 11:10:32,272 INFO L140 encePairwiseOnDemand]: 159/190 looper letters, 129 selfloop transitions, 153 changer transitions 0/414 dead transitions. [2025-04-29 11:10:32,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 414 transitions, 2252 flow [2025-04-29 11:10:32,273 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:10:32,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:10:32,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 949 transitions. [2025-04-29 11:10:32,275 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8324561403508772 [2025-04-29 11:10:32,275 INFO L175 Difference]: Start difference. First operand has 198 places, 258 transitions, 992 flow. Second operand 6 states and 949 transitions. [2025-04-29 11:10:32,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 414 transitions, 2252 flow [2025-04-29 11:10:32,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 414 transitions, 2252 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:10:32,300 INFO L231 Difference]: Finished difference. Result has 208 places, 401 transitions, 2382 flow [2025-04-29 11:10:32,301 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=190, PETRI_DIFFERENCE_MINUEND_FLOW=992, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2382, PETRI_PLACES=208, PETRI_TRANSITIONS=401} [2025-04-29 11:10:32,302 INFO L279 CegarLoopForPetriNet]: 185 programPoint places, 23 predicate places. [2025-04-29 11:10:32,302 INFO L485 AbstractCegarLoop]: Abstraction has has 208 places, 401 transitions, 2382 flow [2025-04-29 11:10:32,303 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 134.0) internal successors, (804), 6 states have internal predecessors, (804), 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-04-29 11:10:32,303 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:32,303 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-29 11:10:32,303 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:10:32,303 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting workerErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-04-29 11:10:32,304 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:32,304 INFO L85 PathProgramCache]: Analyzing trace with hash -2145671846, now seen corresponding path program 1 times [2025-04-29 11:10:32,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:32,304 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788891390] [2025-04-29 11:10:32,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:32,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:32,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-04-29 11:10:32,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-04-29 11:10:32,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:32,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:32,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:10:32,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:32,765 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788891390] [2025-04-29 11:10:32,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788891390] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:32,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:32,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-29 11:10:32,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430627168] [2025-04-29 11:10:32,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:32,766 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:10:32,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:32,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:10:32,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:10:33,215 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 190 [2025-04-29 11:10:33,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 401 transitions, 2382 flow. Second operand has 8 states, 8 states have (on average 167.375) internal successors, (1339), 8 states have internal predecessors, (1339), 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-04-29 11:10:33,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:33,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 190 [2025-04-29 11:10:33,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:34,181 INFO L116 PetriNetUnfolderBase]: 2156/9377 cut-off events. [2025-04-29 11:10:34,181 INFO L117 PetriNetUnfolderBase]: For 8510/9586 co-relation queries the response was YES. [2025-04-29 11:10:34,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22537 conditions, 9377 events. 2156/9377 cut-off events. For 8510/9586 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 95222 event pairs, 121 based on Foata normal form. 40/8975 useless extension candidates. Maximal degree in co-relation 22480. Up to 2016 conditions per place. [2025-04-29 11:10:34,232 INFO L140 encePairwiseOnDemand]: 177/190 looper letters, 46 selfloop transitions, 18 changer transitions 0/444 dead transitions. [2025-04-29 11:10:34,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 444 transitions, 2658 flow [2025-04-29 11:10:34,233 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:10:34,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-29 11:10:34,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1381 transitions. [2025-04-29 11:10:34,235 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9085526315789474 [2025-04-29 11:10:34,235 INFO L175 Difference]: Start difference. First operand has 208 places, 401 transitions, 2382 flow. Second operand 8 states and 1381 transitions. [2025-04-29 11:10:34,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 444 transitions, 2658 flow [2025-04-29 11:10:34,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 444 transitions, 2518 flow, removed 70 selfloop flow, removed 0 redundant places. [2025-04-29 11:10:34,266 INFO L231 Difference]: Finished difference. Result has 219 places, 413 transitions, 2363 flow [2025-04-29 11:10:34,267 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=190, PETRI_DIFFERENCE_MINUEND_FLOW=2250, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=388, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2363, PETRI_PLACES=219, PETRI_TRANSITIONS=413} [2025-04-29 11:10:34,267 INFO L279 CegarLoopForPetriNet]: 185 programPoint places, 34 predicate places. [2025-04-29 11:10:34,267 INFO L485 AbstractCegarLoop]: Abstraction has has 219 places, 413 transitions, 2363 flow [2025-04-29 11:10:34,268 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 167.375) internal successors, (1339), 8 states have internal predecessors, (1339), 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-04-29 11:10:34,268 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:34,268 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] [2025-04-29 11:10:34,268 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:10:34,268 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting workerErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-04-29 11:10:34,269 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:34,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1658617310, now seen corresponding path program 2 times [2025-04-29 11:10:34,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:34,269 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653393918] [2025-04-29 11:10:34,269 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:10:34,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:34,282 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-04-29 11:10:34,292 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 76 of 77 statements. [2025-04-29 11:10:34,292 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:10:34,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:34,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:10:34,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:34,641 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653393918] [2025-04-29 11:10:34,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653393918] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:34,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:34,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-29 11:10:34,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450329483] [2025-04-29 11:10:34,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:34,641 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:10:34,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:34,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:10:34,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:10:35,052 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 190 [2025-04-29 11:10:35,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 413 transitions, 2363 flow. Second operand has 8 states, 8 states have (on average 167.375) internal successors, (1339), 8 states have internal predecessors, (1339), 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-04-29 11:10:35,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:35,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 190 [2025-04-29 11:10:35,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:36,067 INFO L116 PetriNetUnfolderBase]: 2881/12099 cut-off events. [2025-04-29 11:10:36,067 INFO L117 PetriNetUnfolderBase]: For 12272/13759 co-relation queries the response was YES. [2025-04-29 11:10:36,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30542 conditions, 12099 events. 2881/12099 cut-off events. For 12272/13759 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 130000 event pairs, 156 based on Foata normal form. 126/11684 useless extension candidates. Maximal degree in co-relation 30479. Up to 2596 conditions per place. [2025-04-29 11:10:36,129 INFO L140 encePairwiseOnDemand]: 177/190 looper letters, 61 selfloop transitions, 25 changer transitions 0/466 dead transitions. [2025-04-29 11:10:36,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 466 transitions, 2820 flow [2025-04-29 11:10:36,130 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:10:36,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-29 11:10:36,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1383 transitions. [2025-04-29 11:10:36,132 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9098684210526315 [2025-04-29 11:10:36,132 INFO L175 Difference]: Start difference. First operand has 219 places, 413 transitions, 2363 flow. Second operand 8 states and 1383 transitions. [2025-04-29 11:10:36,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 466 transitions, 2820 flow [2025-04-29 11:10:36,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 466 transitions, 2790 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-29 11:10:36,174 INFO L231 Difference]: Finished difference. Result has 228 places, 430 transitions, 2553 flow [2025-04-29 11:10:36,175 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=190, PETRI_DIFFERENCE_MINUEND_FLOW=2352, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=392, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2553, PETRI_PLACES=228, PETRI_TRANSITIONS=430} [2025-04-29 11:10:36,177 INFO L279 CegarLoopForPetriNet]: 185 programPoint places, 43 predicate places. [2025-04-29 11:10:36,178 INFO L485 AbstractCegarLoop]: Abstraction has has 228 places, 430 transitions, 2553 flow [2025-04-29 11:10:36,179 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 167.375) internal successors, (1339), 8 states have internal predecessors, (1339), 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-04-29 11:10:36,179 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:36,179 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] [2025-04-29 11:10:36,179 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:10:36,179 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting workerErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-04-29 11:10:36,179 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:36,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1517790686, now seen corresponding path program 3 times [2025-04-29 11:10:36,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:36,181 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070743518] [2025-04-29 11:10:36,181 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:10:36,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:36,194 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 77 statements into 2 equivalence classes. [2025-04-29 11:10:36,207 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 76 of 77 statements. [2025-04-29 11:10:36,207 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-29 11:10:36,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:36,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:10:36,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:36,589 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070743518] [2025-04-29 11:10:36,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070743518] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:36,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:36,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-29 11:10:36,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040794748] [2025-04-29 11:10:36,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:36,590 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:10:36,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:36,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:10:36,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:10:37,096 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 190 [2025-04-29 11:10:37,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 430 transitions, 2553 flow. Second operand has 8 states, 8 states have (on average 167.375) internal successors, (1339), 8 states have internal predecessors, (1339), 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-04-29 11:10:37,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:37,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 190 [2025-04-29 11:10:37,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:38,392 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([454] L43-1-->L43-2: Formula: (= (store |v_#race_42| |v_workerThread1of1ForFork0_pqueue_get_~qp#1.base_11| (store (select |v_#race_42| |v_workerThread1of1ForFork0_pqueue_get_~qp#1.base_11|) |v_workerThread1of1ForFork0_pqueue_get_~qp#1.offset_11| 0)) |v_#race_41|) InVars {#race=|v_#race_42|, workerThread1of1ForFork0_pqueue_get_~qp#1.base=|v_workerThread1of1ForFork0_pqueue_get_~qp#1.base_11|, workerThread1of1ForFork0_pqueue_get_~qp#1.offset=|v_workerThread1of1ForFork0_pqueue_get_~qp#1.offset_11|} OutVars{#race=|v_#race_41|, workerThread1of1ForFork0_pqueue_get_~qp#1.base=|v_workerThread1of1ForFork0_pqueue_get_~qp#1.base_11|, workerThread1of1ForFork0_pqueue_get_~qp#1.offset=|v_workerThread1of1ForFork0_pqueue_get_~qp#1.offset_11|} AuxVars[] AssignedVars[#race][170], [Black: 200#(and (= (select (select |#race| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (+ |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 1)) 0) (= (select (select |#race| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (+ |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 2)) 0) (= (select (select |#race| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0) (= (select (select |#race| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (+ |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 3)) 0)), 251#(and (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |~#pqb~0.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| 0)), Black: 208#(= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) 0), 187#true, 237#(and (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |~#pqb~0.offset| 0) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| 0)), Black: 257#(and (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |~#pqb~0.offset| 0) (= |ULTIMATE.start_pqueue_put_#in~qp#1.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| 0)), Black: 210#(and (= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) (+ |ULTIMATE.start_pqueue_put_~qp#1.offset| 2)) 0) (= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) (+ |ULTIMATE.start_pqueue_put_~qp#1.offset| 1)) 0)), Black: 222#(and (= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) (+ |ULTIMATE.start_pqueue_put_~qp#1.offset| 3)) |ULTIMATE.start_pqueue_put_#t~nondet5#1|) (= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) (+ |ULTIMATE.start_pqueue_put_~qp#1.offset| 1)) |ULTIMATE.start_pqueue_put_#t~nondet5#1|) (= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~nondet5#1|) (= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) (+ |ULTIMATE.start_pqueue_put_~qp#1.offset| 2)) |ULTIMATE.start_pqueue_put_#t~nondet5#1|)), Black: 241#(and (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |~#pqb~0.offset| 0) (= |ULTIMATE.start_pqueue_put_#in~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= (select (select |#pthreadsMutex| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) 4) 1) (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| 0)), Black: 243#(and (= |ULTIMATE.start_pqueue_put_~qp#1.offset| 0) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |~#pqb~0.offset| 0) (= |ULTIMATE.start_pqueue_put_#in~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= (select (select |#pthreadsMutex| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) 4) 1) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| 0)), Black: 219#(= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~nondet5#1|), 272#(and (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |~#pqb~0.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| 0)), Black: 220#(and (= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) (+ |ULTIMATE.start_pqueue_put_~qp#1.offset| 1)) |ULTIMATE.start_pqueue_put_#t~nondet5#1|) (= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~nondet5#1|)), Black: 198#(and (= (select (select |#race| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (+ |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 1)) 0) (= (select (select |#race| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)), Black: 195#true, 172#L43-2true, Black: 221#(and (= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) (+ |ULTIMATE.start_pqueue_put_~qp#1.offset| 1)) |ULTIMATE.start_pqueue_put_#t~nondet5#1|) (= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~nondet5#1|) (= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) (+ |ULTIMATE.start_pqueue_put_~qp#1.offset| 2)) |ULTIMATE.start_pqueue_put_#t~nondet5#1|)), Black: 259#(and (= |ULTIMATE.start_pqueue_put_~qp#1.offset| 0) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |~#pqb~0.offset| 0) (= |ULTIMATE.start_pqueue_put_#in~qp#1.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| 0)), Black: 239#(and (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |~#pqb~0.offset| 0) (= |ULTIMATE.start_pqueue_put_#in~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| 0)), Black: 263#(and (= |ULTIMATE.start_pqueue_put_~qp#1.offset| 0) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |~#pqb~0.offset| 0) (= (select (select |#pthreadsMutex| |ULTIMATE.start_pqueue_put_~qp#1.base|) 4) 1) (= |ULTIMATE.start_pqueue_put_#in~qp#1.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| 0)), 217#true, 197#(= (select (select |#race| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0), Black: 199#(and (= (select (select |#race| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (+ |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 1)) 0) (= (select (select |#race| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (+ |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 2)) 0) (= (select (select |#race| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)), Black: 261#(and (= |ULTIMATE.start_pqueue_put_~qp#1.offset| 0) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |~#pqb~0.offset| 0) (= (select (select |#pthreadsMutex| |ULTIMATE.start_pqueue_put_~qp#1.base|) 4) 1) (= |ULTIMATE.start_pqueue_put_#in~qp#1.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| 0)), 206#true, Black: 209#(and (= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) (+ |ULTIMATE.start_pqueue_put_~qp#1.offset| 1)) 0)), 163#L34-11true, Black: 211#(and (= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) (+ |ULTIMATE.start_pqueue_put_~qp#1.offset| 2)) 0) (= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) (+ |ULTIMATE.start_pqueue_put_~qp#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) (+ |ULTIMATE.start_pqueue_put_~qp#1.offset| 1)) 0))]) [2025-04-29 11:10:38,393 INFO L286 olderBase$Statistics]: this new event has 118 ancestors and is cut-off event [2025-04-29 11:10:38,393 INFO L289 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2025-04-29 11:10:38,393 INFO L289 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2025-04-29 11:10:38,393 INFO L289 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2025-04-29 11:10:38,399 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([454] L43-1-->L43-2: Formula: (= (store |v_#race_42| |v_workerThread1of1ForFork0_pqueue_get_~qp#1.base_11| (store (select |v_#race_42| |v_workerThread1of1ForFork0_pqueue_get_~qp#1.base_11|) |v_workerThread1of1ForFork0_pqueue_get_~qp#1.offset_11| 0)) |v_#race_41|) InVars {#race=|v_#race_42|, workerThread1of1ForFork0_pqueue_get_~qp#1.base=|v_workerThread1of1ForFork0_pqueue_get_~qp#1.base_11|, workerThread1of1ForFork0_pqueue_get_~qp#1.offset=|v_workerThread1of1ForFork0_pqueue_get_~qp#1.offset_11|} OutVars{#race=|v_#race_41|, workerThread1of1ForFork0_pqueue_get_~qp#1.base=|v_workerThread1of1ForFork0_pqueue_get_~qp#1.base_11|, workerThread1of1ForFork0_pqueue_get_~qp#1.offset=|v_workerThread1of1ForFork0_pqueue_get_~qp#1.offset_11|} AuxVars[] AssignedVars[#race][174], [Black: 200#(and (= (select (select |#race| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (+ |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 1)) 0) (= (select (select |#race| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (+ |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 2)) 0) (= (select (select |#race| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0) (= (select (select |#race| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (+ |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 3)) 0)), 251#(and (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |~#pqb~0.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| 0)), Black: 208#(= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) 0), 187#true, 237#(and (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |~#pqb~0.offset| 0) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| 0)), Black: 257#(and (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |~#pqb~0.offset| 0) (= |ULTIMATE.start_pqueue_put_#in~qp#1.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| 0)), Black: 210#(and (= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) (+ |ULTIMATE.start_pqueue_put_~qp#1.offset| 2)) 0) (= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) (+ |ULTIMATE.start_pqueue_put_~qp#1.offset| 1)) 0)), Black: 222#(and (= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) (+ |ULTIMATE.start_pqueue_put_~qp#1.offset| 3)) |ULTIMATE.start_pqueue_put_#t~nondet5#1|) (= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) (+ |ULTIMATE.start_pqueue_put_~qp#1.offset| 1)) |ULTIMATE.start_pqueue_put_#t~nondet5#1|) (= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~nondet5#1|) (= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) (+ |ULTIMATE.start_pqueue_put_~qp#1.offset| 2)) |ULTIMATE.start_pqueue_put_#t~nondet5#1|)), 138#L34-12true, Black: 241#(and (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |~#pqb~0.offset| 0) (= |ULTIMATE.start_pqueue_put_#in~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= (select (select |#pthreadsMutex| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) 4) 1) (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| 0)), Black: 243#(and (= |ULTIMATE.start_pqueue_put_~qp#1.offset| 0) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |~#pqb~0.offset| 0) (= |ULTIMATE.start_pqueue_put_#in~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= (select (select |#pthreadsMutex| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) 4) 1) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| 0)), Black: 219#(= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~nondet5#1|), 272#(and (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |~#pqb~0.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| 0)), Black: 220#(and (= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) (+ |ULTIMATE.start_pqueue_put_~qp#1.offset| 1)) |ULTIMATE.start_pqueue_put_#t~nondet5#1|) (= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~nondet5#1|)), Black: 198#(and (= (select (select |#race| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (+ |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 1)) 0) (= (select (select |#race| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)), Black: 195#true, 172#L43-2true, Black: 221#(and (= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) (+ |ULTIMATE.start_pqueue_put_~qp#1.offset| 1)) |ULTIMATE.start_pqueue_put_#t~nondet5#1|) (= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~nondet5#1|) (= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) (+ |ULTIMATE.start_pqueue_put_~qp#1.offset| 2)) |ULTIMATE.start_pqueue_put_#t~nondet5#1|)), Black: 259#(and (= |ULTIMATE.start_pqueue_put_~qp#1.offset| 0) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |~#pqb~0.offset| 0) (= |ULTIMATE.start_pqueue_put_#in~qp#1.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| 0)), Black: 239#(and (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |~#pqb~0.offset| 0) (= |ULTIMATE.start_pqueue_put_#in~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| 0)), Black: 263#(and (= |ULTIMATE.start_pqueue_put_~qp#1.offset| 0) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |~#pqb~0.offset| 0) (= (select (select |#pthreadsMutex| |ULTIMATE.start_pqueue_put_~qp#1.base|) 4) 1) (= |ULTIMATE.start_pqueue_put_#in~qp#1.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| 0)), 217#true, 197#(= (select (select |#race| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0), Black: 199#(and (= (select (select |#race| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (+ |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 1)) 0) (= (select (select |#race| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (+ |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 2)) 0) (= (select (select |#race| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)), Black: 261#(and (= |ULTIMATE.start_pqueue_put_~qp#1.offset| 0) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |~#pqb~0.offset| 0) (= (select (select |#pthreadsMutex| |ULTIMATE.start_pqueue_put_~qp#1.base|) 4) 1) (= |ULTIMATE.start_pqueue_put_#in~qp#1.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| 0)), 206#true, Black: 209#(and (= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) (+ |ULTIMATE.start_pqueue_put_~qp#1.offset| 1)) 0)), Black: 211#(and (= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) (+ |ULTIMATE.start_pqueue_put_~qp#1.offset| 2)) 0) (= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) (+ |ULTIMATE.start_pqueue_put_~qp#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) (+ |ULTIMATE.start_pqueue_put_~qp#1.offset| 1)) 0))]) [2025-04-29 11:10:38,399 INFO L286 olderBase$Statistics]: this new event has 119 ancestors and is cut-off event [2025-04-29 11:10:38,399 INFO L289 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2025-04-29 11:10:38,399 INFO L289 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-04-29 11:10:38,399 INFO L289 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2025-04-29 11:10:38,405 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([454] L43-1-->L43-2: Formula: (= (store |v_#race_42| |v_workerThread1of1ForFork0_pqueue_get_~qp#1.base_11| (store (select |v_#race_42| |v_workerThread1of1ForFork0_pqueue_get_~qp#1.base_11|) |v_workerThread1of1ForFork0_pqueue_get_~qp#1.offset_11| 0)) |v_#race_41|) InVars {#race=|v_#race_42|, workerThread1of1ForFork0_pqueue_get_~qp#1.base=|v_workerThread1of1ForFork0_pqueue_get_~qp#1.base_11|, workerThread1of1ForFork0_pqueue_get_~qp#1.offset=|v_workerThread1of1ForFork0_pqueue_get_~qp#1.offset_11|} OutVars{#race=|v_#race_41|, workerThread1of1ForFork0_pqueue_get_~qp#1.base=|v_workerThread1of1ForFork0_pqueue_get_~qp#1.base_11|, workerThread1of1ForFork0_pqueue_get_~qp#1.offset=|v_workerThread1of1ForFork0_pqueue_get_~qp#1.offset_11|} AuxVars[] AssignedVars[#race][179], [Black: 200#(and (= (select (select |#race| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (+ |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 1)) 0) (= (select (select |#race| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (+ |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 2)) 0) (= (select (select |#race| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0) (= (select (select |#race| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (+ |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 3)) 0)), 251#(and (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |~#pqb~0.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| 0)), Black: 208#(= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) 0), 187#true, 237#(and (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |~#pqb~0.offset| 0) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| 0)), Black: 257#(and (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |~#pqb~0.offset| 0) (= |ULTIMATE.start_pqueue_put_#in~qp#1.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| 0)), Black: 210#(and (= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) (+ |ULTIMATE.start_pqueue_put_~qp#1.offset| 2)) 0) (= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) (+ |ULTIMATE.start_pqueue_put_~qp#1.offset| 1)) 0)), Black: 222#(and (= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) (+ |ULTIMATE.start_pqueue_put_~qp#1.offset| 3)) |ULTIMATE.start_pqueue_put_#t~nondet5#1|) (= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) (+ |ULTIMATE.start_pqueue_put_~qp#1.offset| 1)) |ULTIMATE.start_pqueue_put_#t~nondet5#1|) (= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~nondet5#1|) (= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) (+ |ULTIMATE.start_pqueue_put_~qp#1.offset| 2)) |ULTIMATE.start_pqueue_put_#t~nondet5#1|)), Black: 241#(and (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |~#pqb~0.offset| 0) (= |ULTIMATE.start_pqueue_put_#in~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= (select (select |#pthreadsMutex| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) 4) 1) (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| 0)), 103#L34-13true, Black: 243#(and (= |ULTIMATE.start_pqueue_put_~qp#1.offset| 0) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |~#pqb~0.offset| 0) (= |ULTIMATE.start_pqueue_put_#in~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= (select (select |#pthreadsMutex| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) 4) 1) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| 0)), Black: 219#(= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~nondet5#1|), Black: 220#(and (= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) (+ |ULTIMATE.start_pqueue_put_~qp#1.offset| 1)) |ULTIMATE.start_pqueue_put_#t~nondet5#1|) (= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~nondet5#1|)), 272#(and (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |~#pqb~0.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| 0)), Black: 195#true, Black: 198#(and (= (select (select |#race| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (+ |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 1)) 0) (= (select (select |#race| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)), 172#L43-2true, Black: 221#(and (= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) (+ |ULTIMATE.start_pqueue_put_~qp#1.offset| 1)) |ULTIMATE.start_pqueue_put_#t~nondet5#1|) (= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~nondet5#1|) (= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) (+ |ULTIMATE.start_pqueue_put_~qp#1.offset| 2)) |ULTIMATE.start_pqueue_put_#t~nondet5#1|)), Black: 259#(and (= |ULTIMATE.start_pqueue_put_~qp#1.offset| 0) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |~#pqb~0.offset| 0) (= |ULTIMATE.start_pqueue_put_#in~qp#1.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| 0)), Black: 239#(and (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |~#pqb~0.offset| 0) (= |ULTIMATE.start_pqueue_put_#in~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| 0)), Black: 263#(and (= |ULTIMATE.start_pqueue_put_~qp#1.offset| 0) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |~#pqb~0.offset| 0) (= (select (select |#pthreadsMutex| |ULTIMATE.start_pqueue_put_~qp#1.base|) 4) 1) (= |ULTIMATE.start_pqueue_put_#in~qp#1.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| 0)), 217#true, 197#(= (select (select |#race| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0), Black: 199#(and (= (select (select |#race| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (+ |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 1)) 0) (= (select (select |#race| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (+ |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 2)) 0) (= (select (select |#race| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)), Black: 261#(and (= |ULTIMATE.start_pqueue_put_~qp#1.offset| 0) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |~#pqb~0.offset| 0) (= (select (select |#pthreadsMutex| |ULTIMATE.start_pqueue_put_~qp#1.base|) 4) 1) (= |ULTIMATE.start_pqueue_put_#in~qp#1.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| 0)), 206#true, Black: 209#(and (= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) (+ |ULTIMATE.start_pqueue_put_~qp#1.offset| 1)) 0)), Black: 211#(and (= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) (+ |ULTIMATE.start_pqueue_put_~qp#1.offset| 2)) 0) (= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) (+ |ULTIMATE.start_pqueue_put_~qp#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) (+ |ULTIMATE.start_pqueue_put_~qp#1.offset| 1)) 0))]) [2025-04-29 11:10:38,405 INFO L286 olderBase$Statistics]: this new event has 120 ancestors and is cut-off event [2025-04-29 11:10:38,405 INFO L289 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-04-29 11:10:38,405 INFO L289 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2025-04-29 11:10:38,405 INFO L289 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2025-04-29 11:10:38,405 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([454] L43-1-->L43-2: Formula: (= (store |v_#race_42| |v_workerThread1of1ForFork0_pqueue_get_~qp#1.base_11| (store (select |v_#race_42| |v_workerThread1of1ForFork0_pqueue_get_~qp#1.base_11|) |v_workerThread1of1ForFork0_pqueue_get_~qp#1.offset_11| 0)) |v_#race_41|) InVars {#race=|v_#race_42|, workerThread1of1ForFork0_pqueue_get_~qp#1.base=|v_workerThread1of1ForFork0_pqueue_get_~qp#1.base_11|, workerThread1of1ForFork0_pqueue_get_~qp#1.offset=|v_workerThread1of1ForFork0_pqueue_get_~qp#1.offset_11|} OutVars{#race=|v_#race_41|, workerThread1of1ForFork0_pqueue_get_~qp#1.base=|v_workerThread1of1ForFork0_pqueue_get_~qp#1.base_11|, workerThread1of1ForFork0_pqueue_get_~qp#1.offset=|v_workerThread1of1ForFork0_pqueue_get_~qp#1.offset_11|} AuxVars[] AssignedVars[#race][179], [Black: 200#(and (= (select (select |#race| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (+ |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 1)) 0) (= (select (select |#race| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (+ |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 2)) 0) (= (select (select |#race| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0) (= (select (select |#race| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (+ |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 3)) 0)), 251#(and (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |~#pqb~0.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| 0)), Black: 208#(= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) 0), 187#true, 237#(and (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |~#pqb~0.offset| 0) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| 0)), Black: 257#(and (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |~#pqb~0.offset| 0) (= |ULTIMATE.start_pqueue_put_#in~qp#1.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| 0)), Black: 210#(and (= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) (+ |ULTIMATE.start_pqueue_put_~qp#1.offset| 2)) 0) (= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) (+ |ULTIMATE.start_pqueue_put_~qp#1.offset| 1)) 0)), Black: 222#(and (= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) (+ |ULTIMATE.start_pqueue_put_~qp#1.offset| 3)) |ULTIMATE.start_pqueue_put_#t~nondet5#1|) (= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) (+ |ULTIMATE.start_pqueue_put_~qp#1.offset| 1)) |ULTIMATE.start_pqueue_put_#t~nondet5#1|) (= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~nondet5#1|) (= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) (+ |ULTIMATE.start_pqueue_put_~qp#1.offset| 2)) |ULTIMATE.start_pqueue_put_#t~nondet5#1|)), Black: 241#(and (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |~#pqb~0.offset| 0) (= |ULTIMATE.start_pqueue_put_#in~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= (select (select |#pthreadsMutex| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) 4) 1) (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| 0)), Black: 243#(and (= |ULTIMATE.start_pqueue_put_~qp#1.offset| 0) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |~#pqb~0.offset| 0) (= |ULTIMATE.start_pqueue_put_#in~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= (select (select |#pthreadsMutex| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) 4) 1) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| 0)), Black: 219#(= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~nondet5#1|), Black: 220#(and (= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) (+ |ULTIMATE.start_pqueue_put_~qp#1.offset| 1)) |ULTIMATE.start_pqueue_put_#t~nondet5#1|) (= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~nondet5#1|)), 272#(and (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |~#pqb~0.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| 0)), Black: 195#true, Black: 198#(and (= (select (select |#race| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (+ |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 1)) 0) (= (select (select |#race| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)), 172#L43-2true, Black: 221#(and (= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) (+ |ULTIMATE.start_pqueue_put_~qp#1.offset| 1)) |ULTIMATE.start_pqueue_put_#t~nondet5#1|) (= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~nondet5#1|) (= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) (+ |ULTIMATE.start_pqueue_put_~qp#1.offset| 2)) |ULTIMATE.start_pqueue_put_#t~nondet5#1|)), Black: 259#(and (= |ULTIMATE.start_pqueue_put_~qp#1.offset| 0) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |~#pqb~0.offset| 0) (= |ULTIMATE.start_pqueue_put_#in~qp#1.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| 0)), Black: 239#(and (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |~#pqb~0.offset| 0) (= |ULTIMATE.start_pqueue_put_#in~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| 0)), Black: 263#(and (= |ULTIMATE.start_pqueue_put_~qp#1.offset| 0) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |~#pqb~0.offset| 0) (= (select (select |#pthreadsMutex| |ULTIMATE.start_pqueue_put_~qp#1.base|) 4) 1) (= |ULTIMATE.start_pqueue_put_#in~qp#1.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| 0)), 217#true, 197#(= (select (select |#race| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0), Black: 199#(and (= (select (select |#race| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (+ |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 1)) 0) (= (select (select |#race| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (+ |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 2)) 0) (= (select (select |#race| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)), Black: 261#(and (= |ULTIMATE.start_pqueue_put_~qp#1.offset| 0) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |~#pqb~0.offset| 0) (= (select (select |#pthreadsMutex| |ULTIMATE.start_pqueue_put_~qp#1.base|) 4) 1) (= |ULTIMATE.start_pqueue_put_#in~qp#1.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| 0)), 76#L33-10true, 206#true, Black: 209#(and (= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) (+ |ULTIMATE.start_pqueue_put_~qp#1.offset| 1)) 0)), Black: 211#(and (= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) (+ |ULTIMATE.start_pqueue_put_~qp#1.offset| 2)) 0) (= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) (+ |ULTIMATE.start_pqueue_put_~qp#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_pqueue_put_~qp#1.base|) (+ |ULTIMATE.start_pqueue_put_~qp#1.offset| 1)) 0))]) [2025-04-29 11:10:38,406 INFO L286 olderBase$Statistics]: this new event has 121 ancestors and is cut-off event [2025-04-29 11:10:38,406 INFO L289 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-04-29 11:10:38,406 INFO L289 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2025-04-29 11:10:38,406 INFO L289 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-04-29 11:10:38,474 INFO L116 PetriNetUnfolderBase]: 2870/12451 cut-off events. [2025-04-29 11:10:38,474 INFO L117 PetriNetUnfolderBase]: For 17981/19595 co-relation queries the response was YES. [2025-04-29 11:10:38,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33070 conditions, 12451 events. 2870/12451 cut-off events. For 17981/19595 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 135702 event pairs, 147 based on Foata normal form. 186/12085 useless extension candidates. Maximal degree in co-relation 33002. Up to 2728 conditions per place. [2025-04-29 11:10:38,530 INFO L140 encePairwiseOnDemand]: 177/190 looper letters, 66 selfloop transitions, 26 changer transitions 0/472 dead transitions. [2025-04-29 11:10:38,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 472 transitions, 3053 flow [2025-04-29 11:10:38,531 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:10:38,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-29 11:10:38,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1387 transitions. [2025-04-29 11:10:38,533 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9125 [2025-04-29 11:10:38,533 INFO L175 Difference]: Start difference. First operand has 228 places, 430 transitions, 2553 flow. Second operand 8 states and 1387 transitions. [2025-04-29 11:10:38,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 472 transitions, 3053 flow [2025-04-29 11:10:38,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 472 transitions, 3036 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-04-29 11:10:38,584 INFO L231 Difference]: Finished difference. Result has 237 places, 444 transitions, 2764 flow [2025-04-29 11:10:38,584 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=190, PETRI_DIFFERENCE_MINUEND_FLOW=2540, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=430, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2764, PETRI_PLACES=237, PETRI_TRANSITIONS=444} [2025-04-29 11:10:38,585 INFO L279 CegarLoopForPetriNet]: 185 programPoint places, 52 predicate places. [2025-04-29 11:10:38,585 INFO L485 AbstractCegarLoop]: Abstraction has has 237 places, 444 transitions, 2764 flow [2025-04-29 11:10:38,586 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 167.375) internal successors, (1339), 8 states have internal predecessors, (1339), 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-04-29 11:10:38,587 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:38,587 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] [2025-04-29 11:10:38,587 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:10:38,587 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting workerErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-04-29 11:10:38,588 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:38,588 INFO L85 PathProgramCache]: Analyzing trace with hash 59312890, now seen corresponding path program 4 times [2025-04-29 11:10:38,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:38,589 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120281629] [2025-04-29 11:10:38,589 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 11:10:38,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:38,602 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 77 statements into 2 equivalence classes. [2025-04-29 11:10:38,611 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 75 of 77 statements. [2025-04-29 11:10:38,614 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-29 11:10:38,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:38,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:10:38,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:38,823 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120281629] [2025-04-29 11:10:38,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120281629] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:38,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:38,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-29 11:10:38,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190714606] [2025-04-29 11:10:38,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:38,823 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:10:38,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:38,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:10:38,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:10:39,263 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 190 [2025-04-29 11:10:39,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 444 transitions, 2764 flow. Second operand has 8 states, 8 states have (on average 167.375) internal successors, (1339), 8 states have internal predecessors, (1339), 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-04-29 11:10:39,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:39,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 190 [2025-04-29 11:10:39,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:40,593 INFO L116 PetriNetUnfolderBase]: 3549/14399 cut-off events. [2025-04-29 11:10:40,594 INFO L117 PetriNetUnfolderBase]: For 25212/27334 co-relation queries the response was YES. [2025-04-29 11:10:40,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39828 conditions, 14399 events. 3549/14399 cut-off events. For 25212/27334 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 153314 event pairs, 162 based on Foata normal form. 355/14125 useless extension candidates. Maximal degree in co-relation 39756. Up to 3066 conditions per place. [2025-04-29 11:10:40,665 INFO L140 encePairwiseOnDemand]: 178/190 looper letters, 74 selfloop transitions, 39 changer transitions 0/493 dead transitions. [2025-04-29 11:10:40,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 493 transitions, 3394 flow [2025-04-29 11:10:40,666 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:10:40,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-29 11:10:40,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1376 transitions. [2025-04-29 11:10:40,668 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9052631578947369 [2025-04-29 11:10:40,668 INFO L175 Difference]: Start difference. First operand has 237 places, 444 transitions, 2764 flow. Second operand 8 states and 1376 transitions. [2025-04-29 11:10:40,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 493 transitions, 3394 flow [2025-04-29 11:10:40,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 493 transitions, 3326 flow, removed 20 selfloop flow, removed 3 redundant places. [2025-04-29 11:10:40,735 INFO L231 Difference]: Finished difference. Result has 244 places, 451 transitions, 2887 flow [2025-04-29 11:10:40,735 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=190, PETRI_DIFFERENCE_MINUEND_FLOW=2716, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=444, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=407, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2887, PETRI_PLACES=244, PETRI_TRANSITIONS=451} [2025-04-29 11:10:40,737 INFO L279 CegarLoopForPetriNet]: 185 programPoint places, 59 predicate places. [2025-04-29 11:10:40,738 INFO L485 AbstractCegarLoop]: Abstraction has has 244 places, 451 transitions, 2887 flow [2025-04-29 11:10:40,738 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 167.375) internal successors, (1339), 8 states have internal predecessors, (1339), 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-04-29 11:10:40,738 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:40,738 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] [2025-04-29 11:10:40,738 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:10:40,738 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting workerErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-04-29 11:10:40,739 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:40,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1307491426, now seen corresponding path program 5 times [2025-04-29 11:10:40,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:40,739 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643875231] [2025-04-29 11:10:40,739 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-29 11:10:40,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:40,752 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-04-29 11:10:40,760 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-04-29 11:10:40,760 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:10:40,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:41,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:10:41,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:41,075 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643875231] [2025-04-29 11:10:41,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643875231] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:41,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:41,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-29 11:10:41,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660204877] [2025-04-29 11:10:41,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:41,075 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:10:41,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:41,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:10:41,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:10:41,791 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 190 [2025-04-29 11:10:41,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 451 transitions, 2887 flow. Second operand has 10 states, 10 states have (on average 162.6) internal successors, (1626), 10 states have internal predecessors, (1626), 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-04-29 11:10:41,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:41,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 190 [2025-04-29 11:10:41,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:43,647 INFO L116 PetriNetUnfolderBase]: 3536/14831 cut-off events. [2025-04-29 11:10:43,647 INFO L117 PetriNetUnfolderBase]: For 30313/32357 co-relation queries the response was YES. [2025-04-29 11:10:43,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42187 conditions, 14831 events. 3536/14831 cut-off events. For 30313/32357 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 160759 event pairs, 160 based on Foata normal form. 194/14382 useless extension candidates. Maximal degree in co-relation 42107. Up to 3188 conditions per place. [2025-04-29 11:10:43,771 INFO L140 encePairwiseOnDemand]: 172/190 looper letters, 76 selfloop transitions, 39 changer transitions 0/490 dead transitions. [2025-04-29 11:10:43,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 490 transitions, 3523 flow [2025-04-29 11:10:43,771 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:10:43,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-29 11:10:43,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1676 transitions. [2025-04-29 11:10:43,774 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8821052631578947 [2025-04-29 11:10:43,774 INFO L175 Difference]: Start difference. First operand has 244 places, 451 transitions, 2887 flow. Second operand 10 states and 1676 transitions. [2025-04-29 11:10:43,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 490 transitions, 3523 flow [2025-04-29 11:10:43,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 490 transitions, 3453 flow, removed 12 selfloop flow, removed 3 redundant places. [2025-04-29 11:10:43,868 INFO L231 Difference]: Finished difference. Result has 253 places, 467 transitions, 3150 flow [2025-04-29 11:10:43,869 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=190, PETRI_DIFFERENCE_MINUEND_FLOW=2833, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=451, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3150, PETRI_PLACES=253, PETRI_TRANSITIONS=467} [2025-04-29 11:10:43,869 INFO L279 CegarLoopForPetriNet]: 185 programPoint places, 68 predicate places. [2025-04-29 11:10:43,869 INFO L485 AbstractCegarLoop]: Abstraction has has 253 places, 467 transitions, 3150 flow [2025-04-29 11:10:43,870 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 162.6) internal successors, (1626), 10 states have internal predecessors, (1626), 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-04-29 11:10:43,870 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:43,870 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] [2025-04-29 11:10:43,870 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:10:43,870 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting workerErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-04-29 11:10:43,871 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:43,871 INFO L85 PathProgramCache]: Analyzing trace with hash -53051610, now seen corresponding path program 6 times [2025-04-29 11:10:43,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:43,871 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277992259] [2025-04-29 11:10:43,871 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-29 11:10:43,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:43,882 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 77 statements into 2 equivalence classes. [2025-04-29 11:10:43,888 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 76 of 77 statements. [2025-04-29 11:10:43,888 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-29 11:10:43,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:44,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:10:44,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:44,152 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277992259] [2025-04-29 11:10:44,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277992259] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:44,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:44,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-29 11:10:44,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373231153] [2025-04-29 11:10:44,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:44,153 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:10:44,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:44,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:10:44,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:10:44,579 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 190 [2025-04-29 11:10:44,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 467 transitions, 3150 flow. Second operand has 8 states, 8 states have (on average 167.375) internal successors, (1339), 8 states have internal predecessors, (1339), 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-04-29 11:10:44,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:44,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 190 [2025-04-29 11:10:44,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:46,147 INFO L116 PetriNetUnfolderBase]: 4234/17269 cut-off events. [2025-04-29 11:10:46,147 INFO L117 PetriNetUnfolderBase]: For 40852/43433 co-relation queries the response was YES. [2025-04-29 11:10:46,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49838 conditions, 17269 events. 4234/17269 cut-off events. For 40852/43433 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 193143 event pairs, 178 based on Foata normal form. 276/16801 useless extension candidates. Maximal degree in co-relation 49756. Up to 3724 conditions per place. [2025-04-29 11:10:46,281 INFO L140 encePairwiseOnDemand]: 176/190 looper letters, 94 selfloop transitions, 53 changer transitions 0/527 dead transitions. [2025-04-29 11:10:46,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 527 transitions, 4025 flow [2025-04-29 11:10:46,282 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:10:46,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-29 11:10:46,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1382 transitions. [2025-04-29 11:10:46,284 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9092105263157895 [2025-04-29 11:10:46,284 INFO L175 Difference]: Start difference. First operand has 253 places, 467 transitions, 3150 flow. Second operand 8 states and 1382 transitions. [2025-04-29 11:10:46,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 527 transitions, 4025 flow [2025-04-29 11:10:46,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 527 transitions, 3960 flow, removed 5 selfloop flow, removed 6 redundant places. [2025-04-29 11:10:46,386 INFO L231 Difference]: Finished difference. Result has 258 places, 491 transitions, 3525 flow [2025-04-29 11:10:46,387 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=190, PETRI_DIFFERENCE_MINUEND_FLOW=3098, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=467, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=425, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3525, PETRI_PLACES=258, PETRI_TRANSITIONS=491} [2025-04-29 11:10:46,387 INFO L279 CegarLoopForPetriNet]: 185 programPoint places, 73 predicate places. [2025-04-29 11:10:46,387 INFO L485 AbstractCegarLoop]: Abstraction has has 258 places, 491 transitions, 3525 flow [2025-04-29 11:10:46,387 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 167.375) internal successors, (1339), 8 states have internal predecessors, (1339), 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-04-29 11:10:46,387 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:46,388 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] [2025-04-29 11:10:46,388 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:10:46,388 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting workerErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-04-29 11:10:46,388 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:46,388 INFO L85 PathProgramCache]: Analyzing trace with hash 243892626, now seen corresponding path program 7 times [2025-04-29 11:10:46,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:46,388 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216611433] [2025-04-29 11:10:46,388 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-29 11:10:46,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:46,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-04-29 11:10:46,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-04-29 11:10:46,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:46,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:46,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:10:46,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:46,581 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216611433] [2025-04-29 11:10:46,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216611433] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:46,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:46,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-29 11:10:46,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377187700] [2025-04-29 11:10:46,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:46,582 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:10:46,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:46,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:10:46,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:10:46,997 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 190 [2025-04-29 11:10:46,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 491 transitions, 3525 flow. Second operand has 8 states, 8 states have (on average 167.375) internal successors, (1339), 8 states have internal predecessors, (1339), 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-04-29 11:10:46,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:46,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 190 [2025-04-29 11:10:46,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:48,339 INFO L116 PetriNetUnfolderBase]: 3549/14948 cut-off events. [2025-04-29 11:10:48,339 INFO L117 PetriNetUnfolderBase]: For 41759/44010 co-relation queries the response was YES. [2025-04-29 11:10:48,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44361 conditions, 14948 events. 3549/14948 cut-off events. For 41759/44010 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 162061 event pairs, 147 based on Foata normal form. 214/14517 useless extension candidates. Maximal degree in co-relation 44279. Up to 3195 conditions per place. [2025-04-29 11:10:48,470 INFO L140 encePairwiseOnDemand]: 176/190 looper letters, 100 selfloop transitions, 46 changer transitions 0/526 dead transitions. [2025-04-29 11:10:48,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 526 transitions, 4232 flow [2025-04-29 11:10:48,471 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:10:48,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-29 11:10:48,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1385 transitions. [2025-04-29 11:10:48,477 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9111842105263158 [2025-04-29 11:10:48,477 INFO L175 Difference]: Start difference. First operand has 258 places, 491 transitions, 3525 flow. Second operand 8 states and 1385 transitions. [2025-04-29 11:10:48,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 526 transitions, 4232 flow [2025-04-29 11:10:48,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 526 transitions, 4064 flow, removed 55 selfloop flow, removed 3 redundant places. [2025-04-29 11:10:48,590 INFO L231 Difference]: Finished difference. Result has 265 places, 504 transitions, 3719 flow [2025-04-29 11:10:48,590 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=190, PETRI_DIFFERENCE_MINUEND_FLOW=3340, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=488, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=450, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3719, PETRI_PLACES=265, PETRI_TRANSITIONS=504} [2025-04-29 11:10:48,591 INFO L279 CegarLoopForPetriNet]: 185 programPoint places, 80 predicate places. [2025-04-29 11:10:48,591 INFO L485 AbstractCegarLoop]: Abstraction has has 265 places, 504 transitions, 3719 flow [2025-04-29 11:10:48,591 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 167.375) internal successors, (1339), 8 states have internal predecessors, (1339), 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-04-29 11:10:48,591 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:48,591 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] [2025-04-29 11:10:48,591 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-29 11:10:48,591 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting workerErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-04-29 11:10:48,592 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:48,592 INFO L85 PathProgramCache]: Analyzing trace with hash -683533842, now seen corresponding path program 8 times [2025-04-29 11:10:48,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:48,593 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769896133] [2025-04-29 11:10:48,593 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:10:48,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:48,603 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-04-29 11:10:48,608 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 76 of 77 statements. [2025-04-29 11:10:48,608 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:10:48,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:48,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:10:48,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:48,788 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769896133] [2025-04-29 11:10:48,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769896133] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:48,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:48,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-29 11:10:48,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688341608] [2025-04-29 11:10:48,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:48,789 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:10:48,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:48,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:10:48,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:10:49,257 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 190 [2025-04-29 11:10:49,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 504 transitions, 3719 flow. Second operand has 8 states, 8 states have (on average 167.375) internal successors, (1339), 8 states have internal predecessors, (1339), 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-04-29 11:10:49,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:49,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 190 [2025-04-29 11:10:49,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:50,717 INFO L116 PetriNetUnfolderBase]: 3612/15273 cut-off events. [2025-04-29 11:10:50,717 INFO L117 PetriNetUnfolderBase]: For 39944/42213 co-relation queries the response was YES. [2025-04-29 11:10:50,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44373 conditions, 15273 events. 3612/15273 cut-off events. For 39944/42213 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 166697 event pairs, 133 based on Foata normal form. 332/14929 useless extension candidates. Maximal degree in co-relation 44288. Up to 3292 conditions per place. [2025-04-29 11:10:50,841 INFO L140 encePairwiseOnDemand]: 177/190 looper letters, 124 selfloop transitions, 43 changer transitions 0/547 dead transitions. [2025-04-29 11:10:50,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 547 transitions, 4518 flow [2025-04-29 11:10:50,842 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:10:50,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-29 11:10:50,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1384 transitions. [2025-04-29 11:10:50,843 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9105263157894737 [2025-04-29 11:10:50,843 INFO L175 Difference]: Start difference. First operand has 265 places, 504 transitions, 3719 flow. Second operand 8 states and 1384 transitions. [2025-04-29 11:10:50,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 547 transitions, 4518 flow [2025-04-29 11:10:50,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 547 transitions, 4421 flow, removed 22 selfloop flow, removed 4 redundant places. [2025-04-29 11:10:50,954 INFO L231 Difference]: Finished difference. Result has 273 places, 520 transitions, 3993 flow [2025-04-29 11:10:50,954 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=190, PETRI_DIFFERENCE_MINUEND_FLOW=3626, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=504, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=466, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3993, PETRI_PLACES=273, PETRI_TRANSITIONS=520} [2025-04-29 11:10:50,955 INFO L279 CegarLoopForPetriNet]: 185 programPoint places, 88 predicate places. [2025-04-29 11:10:50,955 INFO L485 AbstractCegarLoop]: Abstraction has has 273 places, 520 transitions, 3993 flow [2025-04-29 11:10:50,955 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 167.375) internal successors, (1339), 8 states have internal predecessors, (1339), 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-04-29 11:10:50,955 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:50,955 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] [2025-04-29 11:10:50,955 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-29 11:10:50,955 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting workerErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-04-29 11:10:50,956 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:50,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1283639398, now seen corresponding path program 9 times [2025-04-29 11:10:50,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:50,956 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36124841] [2025-04-29 11:10:50,956 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:10:50,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:50,963 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 77 statements into 2 equivalence classes. [2025-04-29 11:10:50,968 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 76 of 77 statements. [2025-04-29 11:10:50,968 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-29 11:10:50,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:51,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:10:51,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:51,136 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36124841] [2025-04-29 11:10:51,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36124841] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:51,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:51,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-29 11:10:51,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354559520] [2025-04-29 11:10:51,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:51,137 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:10:51,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:51,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:10:51,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:10:51,503 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 190 [2025-04-29 11:10:51,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 520 transitions, 3993 flow. Second operand has 8 states, 8 states have (on average 167.375) internal successors, (1339), 8 states have internal predecessors, (1339), 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-04-29 11:10:51,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:51,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 190 [2025-04-29 11:10:51,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:53,066 INFO L116 PetriNetUnfolderBase]: 3694/15509 cut-off events. [2025-04-29 11:10:53,066 INFO L117 PetriNetUnfolderBase]: For 47457/50107 co-relation queries the response was YES. [2025-04-29 11:10:53,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45974 conditions, 15509 events. 3694/15509 cut-off events. For 47457/50107 co-relation queries the response was YES. Maximal size of possible extension queue 328. Compared 167289 event pairs, 132 based on Foata normal form. 504/15313 useless extension candidates. Maximal degree in co-relation 45884. Up to 3318 conditions per place. [2025-04-29 11:10:53,198 INFO L140 encePairwiseOnDemand]: 178/190 looper letters, 99 selfloop transitions, 81 changer transitions 0/560 dead transitions. [2025-04-29 11:10:53,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 560 transitions, 4921 flow [2025-04-29 11:10:53,199 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:10:53,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-29 11:10:53,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1376 transitions. [2025-04-29 11:10:53,200 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9052631578947369 [2025-04-29 11:10:53,200 INFO L175 Difference]: Start difference. First operand has 273 places, 520 transitions, 3993 flow. Second operand 8 states and 1376 transitions. [2025-04-29 11:10:53,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 560 transitions, 4921 flow [2025-04-29 11:10:53,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 560 transitions, 4816 flow, removed 45 selfloop flow, removed 2 redundant places. [2025-04-29 11:10:53,339 INFO L231 Difference]: Finished difference. Result has 281 places, 528 transitions, 4257 flow [2025-04-29 11:10:53,339 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=190, PETRI_DIFFERENCE_MINUEND_FLOW=3889, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=520, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=443, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4257, PETRI_PLACES=281, PETRI_TRANSITIONS=528} [2025-04-29 11:10:53,340 INFO L279 CegarLoopForPetriNet]: 185 programPoint places, 96 predicate places. [2025-04-29 11:10:53,340 INFO L485 AbstractCegarLoop]: Abstraction has has 281 places, 528 transitions, 4257 flow [2025-04-29 11:10:53,340 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 167.375) internal successors, (1339), 8 states have internal predecessors, (1339), 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-04-29 11:10:53,340 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:53,340 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] [2025-04-29 11:10:53,340 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-29 11:10:53,340 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting workerErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-04-29 11:10:53,341 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:53,341 INFO L85 PathProgramCache]: Analyzing trace with hash -2029789150, now seen corresponding path program 10 times [2025-04-29 11:10:53,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:53,341 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533001802] [2025-04-29 11:10:53,341 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 11:10:53,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:53,348 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 77 statements into 2 equivalence classes. [2025-04-29 11:10:53,351 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 75 of 77 statements. [2025-04-29 11:10:53,352 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-29 11:10:53,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:53,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:10:53,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:53,521 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533001802] [2025-04-29 11:10:53,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533001802] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:53,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:53,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-29 11:10:53,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239765462] [2025-04-29 11:10:53,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:53,521 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:10:53,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:53,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:10:53,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:10:53,912 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 190 [2025-04-29 11:10:53,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 528 transitions, 4257 flow. Second operand has 8 states, 8 states have (on average 167.375) internal successors, (1339), 8 states have internal predecessors, (1339), 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-04-29 11:10:53,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:53,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 190 [2025-04-29 11:10:53,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:55,363 INFO L116 PetriNetUnfolderBase]: 3113/13721 cut-off events. [2025-04-29 11:10:55,363 INFO L117 PetriNetUnfolderBase]: For 46974/49597 co-relation queries the response was YES. [2025-04-29 11:10:55,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41366 conditions, 13721 events. 3113/13721 cut-off events. For 46974/49597 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 144575 event pairs, 118 based on Foata normal form. 332/13437 useless extension candidates. Maximal degree in co-relation 41273. Up to 2878 conditions per place. [2025-04-29 11:10:55,469 INFO L140 encePairwiseOnDemand]: 176/190 looper letters, 121 selfloop transitions, 62 changer transitions 0/563 dead transitions. [2025-04-29 11:10:55,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 563 transitions, 5091 flow [2025-04-29 11:10:55,470 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:10:55,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-29 11:10:55,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1381 transitions. [2025-04-29 11:10:55,471 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9085526315789474 [2025-04-29 11:10:55,471 INFO L175 Difference]: Start difference. First operand has 281 places, 528 transitions, 4257 flow. Second operand 8 states and 1381 transitions. [2025-04-29 11:10:55,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 563 transitions, 5091 flow [2025-04-29 11:10:55,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 563 transitions, 4934 flow, removed 52 selfloop flow, removed 3 redundant places. [2025-04-29 11:10:55,584 INFO L231 Difference]: Finished difference. Result has 288 places, 541 transitions, 4482 flow [2025-04-29 11:10:55,584 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=190, PETRI_DIFFERENCE_MINUEND_FLOW=4066, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=525, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=470, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4482, PETRI_PLACES=288, PETRI_TRANSITIONS=541} [2025-04-29 11:10:55,585 INFO L279 CegarLoopForPetriNet]: 185 programPoint places, 103 predicate places. [2025-04-29 11:10:55,585 INFO L485 AbstractCegarLoop]: Abstraction has has 288 places, 541 transitions, 4482 flow [2025-04-29 11:10:55,585 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 167.375) internal successors, (1339), 8 states have internal predecessors, (1339), 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-04-29 11:10:55,585 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:55,585 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] [2025-04-29 11:10:55,585 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-29 11:10:55,586 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting workerErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-04-29 11:10:55,586 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:55,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1053807422, now seen corresponding path program 11 times [2025-04-29 11:10:55,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:55,586 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105190159] [2025-04-29 11:10:55,586 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-29 11:10:55,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:55,597 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-04-29 11:10:55,601 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-04-29 11:10:55,601 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:10:55,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:55,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:10:55,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:55,842 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105190159] [2025-04-29 11:10:55,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105190159] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:55,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:55,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-29 11:10:55,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139530970] [2025-04-29 11:10:55,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:55,843 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:10:55,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:55,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:10:55,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:10:56,264 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 190 [2025-04-29 11:10:56,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 541 transitions, 4482 flow. Second operand has 10 states, 10 states have (on average 162.6) internal successors, (1626), 10 states have internal predecessors, (1626), 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-04-29 11:10:56,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:56,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 190 [2025-04-29 11:10:56,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:57,795 INFO L116 PetriNetUnfolderBase]: 3113/13690 cut-off events. [2025-04-29 11:10:57,796 INFO L117 PetriNetUnfolderBase]: For 52917/55647 co-relation queries the response was YES. [2025-04-29 11:10:57,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41969 conditions, 13690 events. 3113/13690 cut-off events. For 52917/55647 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 143984 event pairs, 109 based on Foata normal form. 308/13389 useless extension candidates. Maximal degree in co-relation 41868. Up to 2853 conditions per place. [2025-04-29 11:10:57,907 INFO L140 encePairwiseOnDemand]: 173/190 looper letters, 163 selfloop transitions, 37 changer transitions 0/575 dead transitions. [2025-04-29 11:10:57,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 575 transitions, 5347 flow [2025-04-29 11:10:57,907 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:10:57,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-29 11:10:57,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1674 transitions. [2025-04-29 11:10:57,909 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8810526315789474 [2025-04-29 11:10:57,909 INFO L175 Difference]: Start difference. First operand has 288 places, 541 transitions, 4482 flow. Second operand 10 states and 1674 transitions. [2025-04-29 11:10:57,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 575 transitions, 5347 flow [2025-04-29 11:10:58,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 575 transitions, 5250 flow, removed 24 selfloop flow, removed 3 redundant places. [2025-04-29 11:10:58,050 INFO L231 Difference]: Finished difference. Result has 298 places, 551 transitions, 4644 flow [2025-04-29 11:10:58,050 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=190, PETRI_DIFFERENCE_MINUEND_FLOW=4397, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=541, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=507, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4644, PETRI_PLACES=298, PETRI_TRANSITIONS=551} [2025-04-29 11:10:58,051 INFO L279 CegarLoopForPetriNet]: 185 programPoint places, 113 predicate places. [2025-04-29 11:10:58,051 INFO L485 AbstractCegarLoop]: Abstraction has has 298 places, 551 transitions, 4644 flow [2025-04-29 11:10:58,051 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 162.6) internal successors, (1626), 10 states have internal predecessors, (1626), 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-04-29 11:10:58,051 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:58,051 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] [2025-04-29 11:10:58,051 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-29 11:10:58,051 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting workerErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-04-29 11:10:58,052 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:58,052 INFO L85 PathProgramCache]: Analyzing trace with hash -62504916, now seen corresponding path program 12 times [2025-04-29 11:10:58,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:58,052 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480473022] [2025-04-29 11:10:58,052 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-29 11:10:58,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:58,059 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 77 statements into 2 equivalence classes. [2025-04-29 11:10:58,063 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 76 of 77 statements. [2025-04-29 11:10:58,063 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-29 11:10:58,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:58,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:10:58,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:58,214 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480473022] [2025-04-29 11:10:58,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480473022] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:58,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:58,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-29 11:10:58,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651333172] [2025-04-29 11:10:58,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:58,214 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:10:58,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:58,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:10:58,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:10:58,626 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 190 [2025-04-29 11:10:58,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 551 transitions, 4644 flow. Second operand has 8 states, 8 states have (on average 167.375) internal successors, (1339), 8 states have internal predecessors, (1339), 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-04-29 11:10:58,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:58,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 190 [2025-04-29 11:10:58,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:00,182 INFO L116 PetriNetUnfolderBase]: 3143/14045 cut-off events. [2025-04-29 11:11:00,182 INFO L117 PetriNetUnfolderBase]: For 52038/54726 co-relation queries the response was YES. [2025-04-29 11:11:00,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42995 conditions, 14045 events. 3143/14045 cut-off events. For 52038/54726 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 149086 event pairs, 116 based on Foata normal form. 282/13700 useless extension candidates. Maximal degree in co-relation 42891. Up to 2928 conditions per place. [2025-04-29 11:11:00,308 INFO L140 encePairwiseOnDemand]: 176/190 looper letters, 157 selfloop transitions, 48 changer transitions 0/585 dead transitions. [2025-04-29 11:11:00,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 585 transitions, 5558 flow [2025-04-29 11:11:00,308 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:11:00,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-29 11:11:00,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1386 transitions. [2025-04-29 11:11:00,309 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9118421052631579 [2025-04-29 11:11:00,309 INFO L175 Difference]: Start difference. First operand has 298 places, 551 transitions, 4644 flow. Second operand 8 states and 1386 transitions. [2025-04-29 11:11:00,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 585 transitions, 5558 flow [2025-04-29 11:11:00,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 585 transitions, 5460 flow, removed 29 selfloop flow, removed 5 redundant places. [2025-04-29 11:11:00,458 INFO L231 Difference]: Finished difference. Result has 303 places, 567 transitions, 4978 flow [2025-04-29 11:11:00,458 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=190, PETRI_DIFFERENCE_MINUEND_FLOW=4574, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=551, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=510, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4978, PETRI_PLACES=303, PETRI_TRANSITIONS=567} [2025-04-29 11:11:00,459 INFO L279 CegarLoopForPetriNet]: 185 programPoint places, 118 predicate places. [2025-04-29 11:11:00,459 INFO L485 AbstractCegarLoop]: Abstraction has has 303 places, 567 transitions, 4978 flow [2025-04-29 11:11:00,459 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 167.375) internal successors, (1339), 8 states have internal predecessors, (1339), 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-04-29 11:11:00,459 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:00,459 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] [2025-04-29 11:11:00,459 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-29 11:11:00,459 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting workerErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-04-29 11:11:00,460 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:00,460 INFO L85 PathProgramCache]: Analyzing trace with hash 616689188, now seen corresponding path program 13 times [2025-04-29 11:11:00,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:00,460 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687180250] [2025-04-29 11:11:00,460 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-29 11:11:00,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:00,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-04-29 11:11:00,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-04-29 11:11:00,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:00,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:00,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:11:00,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:00,611 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687180250] [2025-04-29 11:11:00,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687180250] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:00,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:00,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-29 11:11:00,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847945160] [2025-04-29 11:11:00,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:00,611 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:11:00,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:00,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:11:00,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:11:01,004 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 190 [2025-04-29 11:11:01,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 567 transitions, 4978 flow. Second operand has 8 states, 8 states have (on average 167.375) internal successors, (1339), 8 states have internal predecessors, (1339), 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-04-29 11:11:01,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:01,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 190 [2025-04-29 11:11:01,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:02,332 INFO L116 PetriNetUnfolderBase]: 2487/11825 cut-off events. [2025-04-29 11:11:02,332 INFO L117 PetriNetUnfolderBase]: For 44046/46294 co-relation queries the response was YES. [2025-04-29 11:11:02,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35918 conditions, 11825 events. 2487/11825 cut-off events. For 44046/46294 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 121916 event pairs, 95 based on Foata normal form. 228/11506 useless extension candidates. Maximal degree in co-relation 35815. Up to 2447 conditions per place. [2025-04-29 11:11:02,439 INFO L140 encePairwiseOnDemand]: 176/190 looper letters, 161 selfloop transitions, 50 changer transitions 0/591 dead transitions. [2025-04-29 11:11:02,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 591 transitions, 5780 flow [2025-04-29 11:11:02,441 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:11:02,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-29 11:11:02,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1389 transitions. [2025-04-29 11:11:02,442 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9138157894736842 [2025-04-29 11:11:02,442 INFO L175 Difference]: Start difference. First operand has 303 places, 567 transitions, 4978 flow. Second operand 8 states and 1389 transitions. [2025-04-29 11:11:02,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 591 transitions, 5780 flow [2025-04-29 11:11:02,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 591 transitions, 5661 flow, removed 30 selfloop flow, removed 4 redundant places. [2025-04-29 11:11:02,565 INFO L231 Difference]: Finished difference. Result has 309 places, 580 transitions, 5261 flow [2025-04-29 11:11:02,565 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=190, PETRI_DIFFERENCE_MINUEND_FLOW=4818, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=564, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=522, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5261, PETRI_PLACES=309, PETRI_TRANSITIONS=580} [2025-04-29 11:11:02,566 INFO L279 CegarLoopForPetriNet]: 185 programPoint places, 124 predicate places. [2025-04-29 11:11:02,566 INFO L485 AbstractCegarLoop]: Abstraction has has 309 places, 580 transitions, 5261 flow [2025-04-29 11:11:02,566 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 167.375) internal successors, (1339), 8 states have internal predecessors, (1339), 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-04-29 11:11:02,566 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:02,566 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] [2025-04-29 11:11:02,566 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-29 11:11:02,566 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting workerErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-04-29 11:11:02,567 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:02,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1488918538, now seen corresponding path program 14 times [2025-04-29 11:11:02,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:02,567 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255335380] [2025-04-29 11:11:02,567 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:11:02,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:02,576 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-04-29 11:11:02,580 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 76 of 77 statements. [2025-04-29 11:11:02,580 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:11:02,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:02,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:11:02,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:02,717 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255335380] [2025-04-29 11:11:02,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255335380] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:02,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:02,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-29 11:11:02,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676077851] [2025-04-29 11:11:02,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:02,717 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:11:02,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:02,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:11:02,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:11:03,035 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 190 [2025-04-29 11:11:03,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 580 transitions, 5261 flow. Second operand has 8 states, 8 states have (on average 167.375) internal successors, (1339), 8 states have internal predecessors, (1339), 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-04-29 11:11:03,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:03,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 190 [2025-04-29 11:11:03,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:03,478 INFO L116 PetriNetUnfolderBase]: 370/3780 cut-off events. [2025-04-29 11:11:03,478 INFO L117 PetriNetUnfolderBase]: For 15685/15930 co-relation queries the response was YES. [2025-04-29 11:11:03,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10924 conditions, 3780 events. 370/3780 cut-off events. For 15685/15930 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 34780 event pairs, 15 based on Foata normal form. 76/3678 useless extension candidates. Maximal degree in co-relation 10818. Up to 738 conditions per place. [2025-04-29 11:11:03,504 INFO L140 encePairwiseOnDemand]: 179/190 looper letters, 118 selfloop transitions, 82 changer transitions 0/361 dead transitions. [2025-04-29 11:11:03,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 361 transitions, 3968 flow [2025-04-29 11:11:03,504 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:11:03,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-29 11:11:03,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1379 transitions. [2025-04-29 11:11:03,505 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9072368421052631 [2025-04-29 11:11:03,505 INFO L175 Difference]: Start difference. First operand has 309 places, 580 transitions, 5261 flow. Second operand 8 states and 1379 transitions. [2025-04-29 11:11:03,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 361 transitions, 3968 flow [2025-04-29 11:11:03,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 361 transitions, 3479 flow, removed 119 selfloop flow, removed 18 redundant places. [2025-04-29 11:11:03,550 INFO L231 Difference]: Finished difference. Result has 293 places, 357 transitions, 3268 flow [2025-04-29 11:11:03,550 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=190, PETRI_DIFFERENCE_MINUEND_FLOW=2993, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3268, PETRI_PLACES=293, PETRI_TRANSITIONS=357} [2025-04-29 11:11:03,550 INFO L279 CegarLoopForPetriNet]: 185 programPoint places, 108 predicate places. [2025-04-29 11:11:03,550 INFO L485 AbstractCegarLoop]: Abstraction has has 293 places, 357 transitions, 3268 flow [2025-04-29 11:11:03,551 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 167.375) internal successors, (1339), 8 states have internal predecessors, (1339), 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-04-29 11:11:03,551 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:03,551 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-04-29 11:11:03,551 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-29 11:11:03,551 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting workerErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-04-29 11:11:03,552 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:03,552 INFO L85 PathProgramCache]: Analyzing trace with hash -607071512, now seen corresponding path program 1 times [2025-04-29 11:11:03,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:03,552 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413858960] [2025-04-29 11:11:03,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:03,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:03,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-04-29 11:11:03,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-04-29 11:11:03,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:03,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:03,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:11:03,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:03,673 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413858960] [2025-04-29 11:11:03,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413858960] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:03,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:03,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:11:03,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093141288] [2025-04-29 11:11:03,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:03,674 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:11:03,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:03,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:11:03,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:11:04,018 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 190 [2025-04-29 11:11:04,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 357 transitions, 3268 flow. Second operand has 9 states, 9 states have (on average 161.0) internal successors, (1449), 9 states have internal predecessors, (1449), 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-04-29 11:11:04,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:04,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 190 [2025-04-29 11:11:04,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:04,486 INFO L116 PetriNetUnfolderBase]: 420/4498 cut-off events. [2025-04-29 11:11:04,487 INFO L117 PetriNetUnfolderBase]: For 15691/15869 co-relation queries the response was YES. [2025-04-29 11:11:04,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10570 conditions, 4498 events. 420/4498 cut-off events. For 15691/15869 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 39444 event pairs, 11 based on Foata normal form. 124/4439 useless extension candidates. Maximal degree in co-relation 10461. Up to 567 conditions per place. [2025-04-29 11:11:04,515 INFO L140 encePairwiseOnDemand]: 179/190 looper letters, 157 selfloop transitions, 22 changer transitions 12/412 dead transitions. [2025-04-29 11:11:04,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 412 transitions, 4402 flow [2025-04-29 11:11:04,515 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:11:04,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-29 11:11:04,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1313 transitions. [2025-04-29 11:11:04,516 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8638157894736842 [2025-04-29 11:11:04,516 INFO L175 Difference]: Start difference. First operand has 293 places, 357 transitions, 3268 flow. Second operand 8 states and 1313 transitions. [2025-04-29 11:11:04,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 412 transitions, 4402 flow [2025-04-29 11:11:04,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 412 transitions, 4142 flow, removed 40 selfloop flow, removed 6 redundant places. [2025-04-29 11:11:04,556 INFO L231 Difference]: Finished difference. Result has 298 places, 374 transitions, 3408 flow [2025-04-29 11:11:04,557 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=190, PETRI_DIFFERENCE_MINUEND_FLOW=3046, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3408, PETRI_PLACES=298, PETRI_TRANSITIONS=374} [2025-04-29 11:11:04,557 INFO L279 CegarLoopForPetriNet]: 185 programPoint places, 113 predicate places. [2025-04-29 11:11:04,557 INFO L485 AbstractCegarLoop]: Abstraction has has 298 places, 374 transitions, 3408 flow [2025-04-29 11:11:04,557 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 161.0) internal successors, (1449), 9 states have internal predecessors, (1449), 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-04-29 11:11:04,557 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:04,558 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-29 11:11:04,558 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-29 11:11:04,558 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting workerErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-04-29 11:11:04,558 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:04,558 INFO L85 PathProgramCache]: Analyzing trace with hash 361057751, now seen corresponding path program 1 times [2025-04-29 11:11:04,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:04,558 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328699122] [2025-04-29 11:11:04,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:04,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:04,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-04-29 11:11:04,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-04-29 11:11:04,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:04,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:04,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:11:04,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:04,748 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328699122] [2025-04-29 11:11:04,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328699122] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:04,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:04,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:11:04,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312906420] [2025-04-29 11:11:04,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:04,749 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:11:04,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:04,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:11:04,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:11:04,899 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 190 [2025-04-29 11:11:04,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 374 transitions, 3408 flow. Second operand has 6 states, 6 states have (on average 134.0) internal successors, (804), 6 states have internal predecessors, (804), 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-04-29 11:11:04,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:04,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 190 [2025-04-29 11:11:04,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:05,494 INFO L116 PetriNetUnfolderBase]: 686/4421 cut-off events. [2025-04-29 11:11:05,494 INFO L117 PetriNetUnfolderBase]: For 25811/26272 co-relation queries the response was YES. [2025-04-29 11:11:05,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13144 conditions, 4421 events. 686/4421 cut-off events. For 25811/26272 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 36553 event pairs, 158 based on Foata normal form. 418/4694 useless extension candidates. Maximal degree in co-relation 13030. Up to 2034 conditions per place. [2025-04-29 11:11:05,512 INFO L140 encePairwiseOnDemand]: 184/190 looper letters, 0 selfloop transitions, 0 changer transitions 373/373 dead transitions. [2025-04-29 11:11:05,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 373 transitions, 3754 flow [2025-04-29 11:11:05,512 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:11:05,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:11:05,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 814 transitions. [2025-04-29 11:11:05,513 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7140350877192982 [2025-04-29 11:11:05,513 INFO L175 Difference]: Start difference. First operand has 298 places, 374 transitions, 3408 flow. Second operand 6 states and 814 transitions. [2025-04-29 11:11:05,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 373 transitions, 3754 flow [2025-04-29 11:11:05,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 373 transitions, 3732 flow, removed 8 selfloop flow, removed 3 redundant places. [2025-04-29 11:11:05,552 INFO L231 Difference]: Finished difference. Result has 298 places, 0 transitions, 0 flow [2025-04-29 11:11:05,552 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=190, PETRI_DIFFERENCE_MINUEND_FLOW=3384, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=298, PETRI_TRANSITIONS=0} [2025-04-29 11:11:05,552 INFO L279 CegarLoopForPetriNet]: 185 programPoint places, 113 predicate places. [2025-04-29 11:11:05,552 INFO L485 AbstractCegarLoop]: Abstraction has has 298 places, 0 transitions, 0 flow [2025-04-29 11:11:05,553 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 134.0) internal successors, (804), 6 states have internal predecessors, (804), 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-04-29 11:11:05,554 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 17 remaining) [2025-04-29 11:11:05,555 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (15 of 17 remaining) [2025-04-29 11:11:05,555 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (14 of 17 remaining) [2025-04-29 11:11:05,555 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (13 of 17 remaining) [2025-04-29 11:11:05,555 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 17 remaining) [2025-04-29 11:11:05,555 INFO L790 garLoopResultBuilder]: Registering result SAFE for location workerErr0ASSERT_VIOLATIONDATA_RACE (11 of 17 remaining) [2025-04-29 11:11:05,555 INFO L790 garLoopResultBuilder]: Registering result SAFE for location workerErr2ASSERT_VIOLATIONDATA_RACE (10 of 17 remaining) [2025-04-29 11:11:05,555 INFO L790 garLoopResultBuilder]: Registering result SAFE for location workerErr1ASSERT_VIOLATIONDATA_RACE (9 of 17 remaining) [2025-04-29 11:11:05,555 INFO L790 garLoopResultBuilder]: Registering result SAFE for location workerErr3ASSERT_VIOLATIONDATA_RACE (8 of 17 remaining) [2025-04-29 11:11:05,555 INFO L790 garLoopResultBuilder]: Registering result SAFE for location workerErr4ASSERT_VIOLATIONDATA_RACE (7 of 17 remaining) [2025-04-29 11:11:05,555 INFO L790 garLoopResultBuilder]: Registering result SAFE for location workerErr5ASSERT_VIOLATIONDATA_RACE (6 of 17 remaining) [2025-04-29 11:11:05,555 INFO L790 garLoopResultBuilder]: Registering result SAFE for location workerErr0ASSERT_VIOLATIONDATA_RACE (5 of 17 remaining) [2025-04-29 11:11:05,555 INFO L790 garLoopResultBuilder]: Registering result SAFE for location workerErr2ASSERT_VIOLATIONDATA_RACE (4 of 17 remaining) [2025-04-29 11:11:05,555 INFO L790 garLoopResultBuilder]: Registering result SAFE for location workerErr1ASSERT_VIOLATIONDATA_RACE (3 of 17 remaining) [2025-04-29 11:11:05,555 INFO L790 garLoopResultBuilder]: Registering result SAFE for location workerErr3ASSERT_VIOLATIONDATA_RACE (2 of 17 remaining) [2025-04-29 11:11:05,555 INFO L790 garLoopResultBuilder]: Registering result SAFE for location workerErr4ASSERT_VIOLATIONDATA_RACE (1 of 17 remaining) [2025-04-29 11:11:05,555 INFO L790 garLoopResultBuilder]: Registering result SAFE for location workerErr5ASSERT_VIOLATIONDATA_RACE (0 of 17 remaining) [2025-04-29 11:11:05,556 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-29 11:11:05,556 INFO L422 BasicCegarLoop]: Path program histogram: [14, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:05,559 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-29 11:11:05,559 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 11:11:05,562 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 11:11:05 BasicIcfg [2025-04-29 11:11:05,563 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 11:11:05,563 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 11:11:05,563 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 11:11:05,563 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 11:11:05,564 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:10:27" (3/4) ... [2025-04-29 11:11:05,565 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-04-29 11:11:05,567 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure worker [2025-04-29 11:11:05,569 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-04-29 11:11:05,569 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-04-29 11:11:05,569 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-04-29 11:11:05,627 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-29 11:11:05,627 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-29 11:11:05,627 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 11:11:05,628 INFO L158 Benchmark]: Toolchain (without parser) took 38836.66ms. Allocated memory was 142.6MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 112.0MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 543.2MB. Max. memory is 16.1GB. [2025-04-29 11:11:05,628 INFO L158 Benchmark]: CDTParser took 1.16ms. Allocated memory is still 201.3MB. Free memory is still 128.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:11:05,629 INFO L158 Benchmark]: CACSL2BoogieTranslator took 249.01ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 97.4MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:11:05,629 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.03ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 94.1MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:11:05,629 INFO L158 Benchmark]: Boogie Preprocessor took 32.93ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 92.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:11:05,630 INFO L158 Benchmark]: RCFGBuilder took 400.60ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 69.7MB in the end (delta: 22.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-04-29 11:11:05,630 INFO L158 Benchmark]: TraceAbstraction took 38043.74ms. Allocated memory was 142.6MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 69.7MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2025-04-29 11:11:05,630 INFO L158 Benchmark]: Witness Printer took 64.12ms. Allocated memory is still 2.0GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:11:05,632 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.16ms. Allocated memory is still 201.3MB. Free memory is still 128.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 249.01ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 97.4MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.03ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 94.1MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.93ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 92.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 400.60ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 69.7MB in the end (delta: 22.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 38043.74ms. Allocated memory was 142.6MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 69.7MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. * Witness Printer took 64.12ms. Allocated memory is still 2.0GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 25]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 33]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 34]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 34]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 277 locations, 289 edges, 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: 37.9s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 14, EmptinessCheckTime: 0.0s, AutomataDifference: 32.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9708 SdHoareTripleChecker+Valid, 8.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7558 mSDsluCounter, 10882 SdHoareTripleChecker+Invalid, 7.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10542 mSDsCounter, 282 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18713 IncrementalHoareTripleChecker+Invalid, 18995 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 282 mSolverCounterUnsat, 340 mSDtfsCounter, 18713 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 234 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5261occurred in iteration=17, InterpolantAutomatonStates: 154, 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.2s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 1473 NumberOfCodeBlocks, 1462 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1453 ConstructedInterpolants, 0 QuantifiedInterpolants, 5762 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 18/18 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-29 11:11:05,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE