./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_61-invariant_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_61-invariant_racing.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b4399e58ed3ca9c75e2a61372e91a4308548a0e79a3eb4428d85990bd71242f7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:27:57,281 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:27:57,332 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:27:57,337 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:27:57,339 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:27:57,356 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:27:57,357 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:27:57,357 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:27:57,357 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:27:57,357 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:27:57,357 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:27:57,357 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:27:57,358 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:27:57,358 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:27:57,358 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:27:57,358 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:27:57,358 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:27:57,358 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:27:57,358 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:27:57,358 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:27:57,359 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:27:57,359 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:27:57,359 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:27:57,359 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:27:57,359 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:27:57,359 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:27:57,359 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:27:57,359 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:27:57,359 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:27:57,359 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:27:57,360 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:27:57,360 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:27:57,360 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:27:57,360 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:27:57,360 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:27:57,360 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:27:57,360 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:27:57,360 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:27:57,360 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:27:57,361 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:27:57,361 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:27:57,361 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:27:57,361 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:27:57,361 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:27:57,361 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:27:57,361 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:27:57,361 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b4399e58ed3ca9c75e2a61372e91a4308548a0e79a3eb4428d85990bd71242f7 [2025-01-09 21:27:57,553 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:27:57,561 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:27:57,562 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:27:57,564 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:27:57,565 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:27:57,566 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_61-invariant_racing.i [2025-01-09 21:27:58,787 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/05dd30d9e/8199a7193bcd45eeb83a8c5136739179/FLAG119c3d6bb [2025-01-09 21:27:59,124 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:27:59,125 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_61-invariant_racing.i [2025-01-09 21:27:59,139 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/05dd30d9e/8199a7193bcd45eeb83a8c5136739179/FLAG119c3d6bb [2025-01-09 21:27:59,155 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/05dd30d9e/8199a7193bcd45eeb83a8c5136739179 [2025-01-09 21:27:59,157 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:27:59,158 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:27:59,160 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:27:59,160 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:27:59,163 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:27:59,164 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:27:59" (1/1) ... [2025-01-09 21:27:59,164 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2aadf523 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:59, skipping insertion in model container [2025-01-09 21:27:59,164 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:27:59" (1/1) ... [2025-01-09 21:27:59,197 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:27:59,428 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:27:59,445 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:27:59,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:27:59,506 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:27:59,508 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:59 WrapperNode [2025-01-09 21:27:59,508 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:27:59,509 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:27:59,509 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:27:59,509 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:27:59,514 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:59" (1/1) ... [2025-01-09 21:27:59,526 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:59" (1/1) ... [2025-01-09 21:27:59,547 INFO L138 Inliner]: procedures = 171, calls = 44, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 123 [2025-01-09 21:27:59,550 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:27:59,551 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:27:59,551 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:27:59,551 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:27:59,557 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:59" (1/1) ... [2025-01-09 21:27:59,557 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:59" (1/1) ... [2025-01-09 21:27:59,559 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:59" (1/1) ... [2025-01-09 21:27:59,562 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:59" (1/1) ... [2025-01-09 21:27:59,571 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:59" (1/1) ... [2025-01-09 21:27:59,572 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:59" (1/1) ... [2025-01-09 21:27:59,578 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:59" (1/1) ... [2025-01-09 21:27:59,579 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:59" (1/1) ... [2025-01-09 21:27:59,579 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:59" (1/1) ... [2025-01-09 21:27:59,581 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:27:59,582 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:27:59,582 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:27:59,582 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:27:59,582 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:59" (1/1) ... [2025-01-09 21:27:59,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:27:59,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:27:59,618 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 21:27:59,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 21:27:59,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:27:59,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:27:59,644 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 21:27:59,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:27:59,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 21:27:59,644 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-09 21:27:59,644 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-09 21:27:59,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 21:27:59,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:27:59,644 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 21:27:59,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:27:59,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:27:59,645 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:27:59,749 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:27:59,751 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:27:59,999 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:27:59,999 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:28:00,033 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:28:00,033 INFO L312 CfgBuilder]: Removed 7 assume(true) statements. [2025-01-09 21:28:00,033 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:28:00 BoogieIcfgContainer [2025-01-09 21:28:00,033 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:28:00,035 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:28:00,035 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:28:00,038 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:28:00,038 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:27:59" (1/3) ... [2025-01-09 21:28:00,039 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e2dd923 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:28:00, skipping insertion in model container [2025-01-09 21:28:00,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:59" (2/3) ... [2025-01-09 21:28:00,039 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e2dd923 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:28:00, skipping insertion in model container [2025-01-09 21:28:00,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:28:00" (3/3) ... [2025-01-09 21:28:00,040 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_61-invariant_racing.i [2025-01-09 21:28:00,049 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:28:00,051 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_61-invariant_racing.i that has 2 procedures, 173 locations, 1 initial locations, 9 loop locations, and 12 error locations. [2025-01-09 21:28:00,051 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:28:00,099 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-09 21:28:00,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 176 places, 191 transitions, 389 flow [2025-01-09 21:28:00,226 INFO L124 PetriNetUnfolderBase]: 28/288 cut-off events. [2025-01-09 21:28:00,228 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:28:00,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 293 conditions, 288 events. 28/288 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1105 event pairs, 0 based on Foata normal form. 0/238 useless extension candidates. Maximal degree in co-relation 160. Up to 6 conditions per place. [2025-01-09 21:28:00,242 INFO L82 GeneralOperation]: Start removeDead. Operand has 176 places, 191 transitions, 389 flow [2025-01-09 21:28:00,247 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 176 places, 191 transitions, 389 flow [2025-01-09 21:28:00,254 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:28:00,262 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6075fda0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:28:00,262 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-01-09 21:28:00,274 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:28:00,275 INFO L124 PetriNetUnfolderBase]: 2/51 cut-off events. [2025-01-09 21:28:00,275 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:28:00,275 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:28:00,276 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:28:00,276 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-01-09 21:28:00,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:28:00,280 INFO L85 PathProgramCache]: Analyzing trace with hash -64797787, now seen corresponding path program 1 times [2025-01-09 21:28:00,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:28:00,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214458404] [2025-01-09 21:28:00,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:28:00,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:28:00,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 21:28:00,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 21:28:00,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:28:00,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:28:00,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:28:00,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:28:00,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214458404] [2025-01-09 21:28:00,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214458404] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:28:00,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:28:00,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:28:00,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790719300] [2025-01-09 21:28:00,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:28:00,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:28:00,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:28:00,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:28:00,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:28:00,552 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 191 [2025-01-09 21:28:00,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 191 transitions, 389 flow. Second operand has 3 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:28:00,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:28:00,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 191 [2025-01-09 21:28:00,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:28:00,702 INFO L124 PetriNetUnfolderBase]: 122/1132 cut-off events. [2025-01-09 21:28:00,702 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:28:00,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1405 conditions, 1132 events. 122/1132 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 7208 event pairs, 88 based on Foata normal form. 129/1147 useless extension candidates. Maximal degree in co-relation 1334. Up to 256 conditions per place. [2025-01-09 21:28:00,709 INFO L140 encePairwiseOnDemand]: 172/191 looper letters, 34 selfloop transitions, 2 changer transitions 0/183 dead transitions. [2025-01-09 21:28:00,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 183 transitions, 445 flow [2025-01-09 21:28:00,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:28:00,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:28:00,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 503 transitions. [2025-01-09 21:28:00,719 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8778359511343804 [2025-01-09 21:28:00,720 INFO L175 Difference]: Start difference. First operand has 176 places, 191 transitions, 389 flow. Second operand 3 states and 503 transitions. [2025-01-09 21:28:00,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 183 transitions, 445 flow [2025-01-09 21:28:00,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 183 transitions, 445 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:28:00,729 INFO L231 Difference]: Finished difference. Result has 177 places, 173 transitions, 361 flow [2025-01-09 21:28:00,731 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=361, PETRI_PLACES=177, PETRI_TRANSITIONS=173} [2025-01-09 21:28:00,733 INFO L279 CegarLoopForPetriNet]: 176 programPoint places, 1 predicate places. [2025-01-09 21:28:00,734 INFO L471 AbstractCegarLoop]: Abstraction has has 177 places, 173 transitions, 361 flow [2025-01-09 21:28:00,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:28:00,735 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:28:00,735 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:28:00,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:28:00,735 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-01-09 21:28:00,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:28:00,737 INFO L85 PathProgramCache]: Analyzing trace with hash -2069486533, now seen corresponding path program 1 times [2025-01-09 21:28:00,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:28:00,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702355791] [2025-01-09 21:28:00,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:28:00,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:28:00,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 21:28:00,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 21:28:00,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:28:00,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:28:01,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:28:01,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:28:01,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702355791] [2025-01-09 21:28:01,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702355791] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:28:01,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:28:01,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:28:01,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124398004] [2025-01-09 21:28:01,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:28:01,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:28:01,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:28:01,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:28:01,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:28:01,282 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 191 [2025-01-09 21:28:01,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 173 transitions, 361 flow. Second operand has 6 states, 6 states have (on average 137.5) internal successors, (825), 6 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:28:01,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:28:01,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 191 [2025-01-09 21:28:01,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:28:01,527 INFO L124 PetriNetUnfolderBase]: 225/1386 cut-off events. [2025-01-09 21:28:01,528 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-01-09 21:28:01,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1909 conditions, 1386 events. 225/1386 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 9458 event pairs, 138 based on Foata normal form. 0/1266 useless extension candidates. Maximal degree in co-relation 1824. Up to 369 conditions per place. [2025-01-09 21:28:01,533 INFO L140 encePairwiseOnDemand]: 185/191 looper letters, 72 selfloop transitions, 5 changer transitions 0/212 dead transitions. [2025-01-09 21:28:01,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 212 transitions, 593 flow [2025-01-09 21:28:01,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:28:01,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:28:01,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 894 transitions. [2025-01-09 21:28:01,536 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7801047120418848 [2025-01-09 21:28:01,536 INFO L175 Difference]: Start difference. First operand has 177 places, 173 transitions, 361 flow. Second operand 6 states and 894 transitions. [2025-01-09 21:28:01,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 212 transitions, 593 flow [2025-01-09 21:28:01,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 212 transitions, 589 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:28:01,539 INFO L231 Difference]: Finished difference. Result has 179 places, 172 transitions, 365 flow [2025-01-09 21:28:01,539 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=365, PETRI_PLACES=179, PETRI_TRANSITIONS=172} [2025-01-09 21:28:01,540 INFO L279 CegarLoopForPetriNet]: 176 programPoint places, 3 predicate places. [2025-01-09 21:28:01,540 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 172 transitions, 365 flow [2025-01-09 21:28:01,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 137.5) internal successors, (825), 6 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:28:01,540 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:28:01,540 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] [2025-01-09 21:28:01,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:28:01,541 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-01-09 21:28:01,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:28:01,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1211471806, now seen corresponding path program 1 times [2025-01-09 21:28:01,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:28:01,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436927615] [2025-01-09 21:28:01,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:28:01,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:28:01,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 21:28:01,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 21:28:01,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:28:01,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:28:01,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:28:01,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:28:01,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436927615] [2025-01-09 21:28:01,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436927615] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:28:01,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:28:01,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:28:01,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879119106] [2025-01-09 21:28:01,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:28:01,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:28:01,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:28:01,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:28:01,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:28:01,605 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 191 [2025-01-09 21:28:01,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 172 transitions, 365 flow. Second operand has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:28:01,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:28:01,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 191 [2025-01-09 21:28:01,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:28:01,857 INFO L124 PetriNetUnfolderBase]: 423/2416 cut-off events. [2025-01-09 21:28:01,858 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-01-09 21:28:01,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3362 conditions, 2416 events. 423/2416 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 18571 event pairs, 160 based on Foata normal form. 0/2200 useless extension candidates. Maximal degree in co-relation 3300. Up to 544 conditions per place. [2025-01-09 21:28:01,865 INFO L140 encePairwiseOnDemand]: 169/191 looper letters, 61 selfloop transitions, 16 changer transitions 0/207 dead transitions. [2025-01-09 21:28:01,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 207 transitions, 592 flow [2025-01-09 21:28:01,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:28:01,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:28:01,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 479 transitions. [2025-01-09 21:28:01,867 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8359511343804538 [2025-01-09 21:28:01,867 INFO L175 Difference]: Start difference. First operand has 179 places, 172 transitions, 365 flow. Second operand 3 states and 479 transitions. [2025-01-09 21:28:01,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 207 transitions, 592 flow [2025-01-09 21:28:01,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 207 transitions, 582 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:28:01,870 INFO L231 Difference]: Finished difference. Result has 178 places, 188 transitions, 495 flow [2025-01-09 21:28:01,870 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=495, PETRI_PLACES=178, PETRI_TRANSITIONS=188} [2025-01-09 21:28:01,874 INFO L279 CegarLoopForPetriNet]: 176 programPoint places, 2 predicate places. [2025-01-09 21:28:01,875 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 188 transitions, 495 flow [2025-01-09 21:28:01,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:28:01,875 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:28:01,875 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:28:01,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:28:01,875 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-01-09 21:28:01,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:28:01,876 INFO L85 PathProgramCache]: Analyzing trace with hash 438380164, now seen corresponding path program 1 times [2025-01-09 21:28:01,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:28:01,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751033274] [2025-01-09 21:28:01,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:28:01,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:28:01,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 21:28:01,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 21:28:01,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:28:01,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:28:01,905 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:28:01,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 21:28:01,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 21:28:01,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:28:01,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:28:01,939 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:28:01,940 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:28:01,941 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining) [2025-01-09 21:28:01,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining) [2025-01-09 21:28:01,944 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining) [2025-01-09 21:28:01,945 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining) [2025-01-09 21:28:01,945 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining) [2025-01-09 21:28:01,945 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining) [2025-01-09 21:28:01,945 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining) [2025-01-09 21:28:01,945 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining) [2025-01-09 21:28:01,945 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining) [2025-01-09 21:28:01,945 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining) [2025-01-09 21:28:01,945 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining) [2025-01-09 21:28:01,945 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining) [2025-01-09 21:28:01,945 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining) [2025-01-09 21:28:01,945 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining) [2025-01-09 21:28:01,945 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining) [2025-01-09 21:28:01,945 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining) [2025-01-09 21:28:01,945 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining) [2025-01-09 21:28:01,945 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining) [2025-01-09 21:28:01,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:28:01,946 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:28:01,950 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:28:01,950 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-09 21:28:01,982 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 21:28:01,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 232 places, 253 transitions, 522 flow [2025-01-09 21:28:02,024 INFO L124 PetriNetUnfolderBase]: 47/474 cut-off events. [2025-01-09 21:28:02,025 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:28:02,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 486 conditions, 474 events. 47/474 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2086 event pairs, 0 based on Foata normal form. 0/391 useless extension candidates. Maximal degree in co-relation 290. Up to 9 conditions per place. [2025-01-09 21:28:02,028 INFO L82 GeneralOperation]: Start removeDead. Operand has 232 places, 253 transitions, 522 flow [2025-01-09 21:28:02,031 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 232 places, 253 transitions, 522 flow [2025-01-09 21:28:02,033 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:28:02,037 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6075fda0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:28:02,037 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-01-09 21:28:02,040 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:28:02,042 INFO L124 PetriNetUnfolderBase]: 2/51 cut-off events. [2025-01-09 21:28:02,043 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:28:02,043 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:28:02,043 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:28:02,043 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:28:02,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:28:02,043 INFO L85 PathProgramCache]: Analyzing trace with hash -727941723, now seen corresponding path program 1 times [2025-01-09 21:28:02,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:28:02,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007081742] [2025-01-09 21:28:02,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:28:02,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:28:02,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 21:28:02,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 21:28:02,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:28:02,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:28:02,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:28:02,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:28:02,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007081742] [2025-01-09 21:28:02,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007081742] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:28:02,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:28:02,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:28:02,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804660131] [2025-01-09 21:28:02,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:28:02,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:28:02,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:28:02,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:28:02,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:28:02,122 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 253 [2025-01-09 21:28:02,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 253 transitions, 522 flow. Second operand has 3 states, 3 states have (on average 193.66666666666666) internal successors, (581), 3 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:28:02,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:28:02,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 253 [2025-01-09 21:28:02,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:28:03,352 INFO L124 PetriNetUnfolderBase]: 3074/12520 cut-off events. [2025-01-09 21:28:03,352 INFO L125 PetriNetUnfolderBase]: For 109/109 co-relation queries the response was YES. [2025-01-09 21:28:03,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17237 conditions, 12520 events. 3074/12520 cut-off events. For 109/109 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 137250 event pairs, 2580 based on Foata normal form. 2083/13329 useless extension candidates. Maximal degree in co-relation 12801. Up to 4643 conditions per place. [2025-01-09 21:28:03,418 INFO L140 encePairwiseOnDemand]: 228/253 looper letters, 47 selfloop transitions, 2 changer transitions 0/240 dead transitions. [2025-01-09 21:28:03,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 240 transitions, 594 flow [2025-01-09 21:28:03,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:28:03,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:28:03,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 654 transitions. [2025-01-09 21:28:03,420 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8616600790513834 [2025-01-09 21:28:03,420 INFO L175 Difference]: Start difference. First operand has 232 places, 253 transitions, 522 flow. Second operand 3 states and 654 transitions. [2025-01-09 21:28:03,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 240 transitions, 594 flow [2025-01-09 21:28:03,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 240 transitions, 594 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:28:03,423 INFO L231 Difference]: Finished difference. Result has 233 places, 230 transitions, 486 flow [2025-01-09 21:28:03,423 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=486, PETRI_PLACES=233, PETRI_TRANSITIONS=230} [2025-01-09 21:28:03,424 INFO L279 CegarLoopForPetriNet]: 232 programPoint places, 1 predicate places. [2025-01-09 21:28:03,424 INFO L471 AbstractCegarLoop]: Abstraction has has 233 places, 230 transitions, 486 flow [2025-01-09 21:28:03,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 193.66666666666666) internal successors, (581), 3 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:28:03,424 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:28:03,424 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:28:03,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:28:03,425 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:28:03,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:28:03,425 INFO L85 PathProgramCache]: Analyzing trace with hash -940671080, now seen corresponding path program 1 times [2025-01-09 21:28:03,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:28:03,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331195617] [2025-01-09 21:28:03,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:28:03,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:28:03,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 21:28:03,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 21:28:03,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:28:03,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:28:03,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:28:03,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:28:03,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331195617] [2025-01-09 21:28:03,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331195617] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:28:03,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:28:03,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:28:03,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519997381] [2025-01-09 21:28:03,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:28:03,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:28:03,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:28:03,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:28:03,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:28:03,745 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 253 [2025-01-09 21:28:03,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 230 transitions, 486 flow. Second operand has 6 states, 6 states have (on average 181.5) internal successors, (1089), 6 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:28:03,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:28:03,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 253 [2025-01-09 21:28:03,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:28:05,456 INFO L124 PetriNetUnfolderBase]: 5301/19094 cut-off events. [2025-01-09 21:28:05,457 INFO L125 PetriNetUnfolderBase]: For 271/271 co-relation queries the response was YES. [2025-01-09 21:28:05,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27848 conditions, 19094 events. 5301/19094 cut-off events. For 271/271 co-relation queries the response was YES. Maximal size of possible extension queue 390. Compared 222697 event pairs, 500 based on Foata normal form. 0/17641 useless extension candidates. Maximal degree in co-relation 9436. Up to 6346 conditions per place. [2025-01-09 21:28:05,537 INFO L140 encePairwiseOnDemand]: 247/253 looper letters, 124 selfloop transitions, 6 changer transitions 0/309 dead transitions. [2025-01-09 21:28:05,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 309 transitions, 904 flow [2025-01-09 21:28:05,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:28:05,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:28:05,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1210 transitions. [2025-01-09 21:28:05,543 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7971014492753623 [2025-01-09 21:28:05,543 INFO L175 Difference]: Start difference. First operand has 233 places, 230 transitions, 486 flow. Second operand 6 states and 1210 transitions. [2025-01-09 21:28:05,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 309 transitions, 904 flow [2025-01-09 21:28:05,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 309 transitions, 902 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:28:05,548 INFO L231 Difference]: Finished difference. Result has 236 places, 229 transitions, 494 flow [2025-01-09 21:28:05,549 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=482, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=494, PETRI_PLACES=236, PETRI_TRANSITIONS=229} [2025-01-09 21:28:05,550 INFO L279 CegarLoopForPetriNet]: 232 programPoint places, 4 predicate places. [2025-01-09 21:28:05,550 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 229 transitions, 494 flow [2025-01-09 21:28:05,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 181.5) internal successors, (1089), 6 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:28:05,551 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:28:05,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] [2025-01-09 21:28:05,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:28:05,551 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:28:05,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:28:05,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1801103715, now seen corresponding path program 1 times [2025-01-09 21:28:05,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:28:05,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848976432] [2025-01-09 21:28:05,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:28:05,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:28:05,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 21:28:05,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 21:28:05,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:28:05,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:28:05,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:28:05,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:28:05,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848976432] [2025-01-09 21:28:05,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848976432] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:28:05,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:28:05,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:28:05,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748638080] [2025-01-09 21:28:05,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:28:05,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:28:05,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:28:05,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:28:05,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:28:05,648 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 253 [2025-01-09 21:28:05,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 229 transitions, 494 flow. Second operand has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:28:05,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:28:05,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 253 [2025-01-09 21:28:05,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:28:10,792 INFO L124 PetriNetUnfolderBase]: 23170/71525 cut-off events. [2025-01-09 21:28:10,792 INFO L125 PetriNetUnfolderBase]: For 513/513 co-relation queries the response was YES. [2025-01-09 21:28:10,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108836 conditions, 71525 events. 23170/71525 cut-off events. For 513/513 co-relation queries the response was YES. Maximal size of possible extension queue 1225. Compared 935719 event pairs, 8859 based on Foata normal form. 0/64652 useless extension candidates. Maximal degree in co-relation 88379. Up to 22148 conditions per place. [2025-01-09 21:28:11,140 INFO L140 encePairwiseOnDemand]: 220/253 looper letters, 96 selfloop transitions, 24 changer transitions 0/284 dead transitions. [2025-01-09 21:28:11,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 284 transitions, 855 flow [2025-01-09 21:28:11,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:28:11,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:28:11,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 624 transitions. [2025-01-09 21:28:11,143 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8221343873517787 [2025-01-09 21:28:11,143 INFO L175 Difference]: Start difference. First operand has 236 places, 229 transitions, 494 flow. Second operand 3 states and 624 transitions. [2025-01-09 21:28:11,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 284 transitions, 855 flow [2025-01-09 21:28:11,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 284 transitions, 843 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:28:11,149 INFO L231 Difference]: Finished difference. Result has 235 places, 253 transitions, 692 flow [2025-01-09 21:28:11,149 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=482, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=692, PETRI_PLACES=235, PETRI_TRANSITIONS=253} [2025-01-09 21:28:11,151 INFO L279 CegarLoopForPetriNet]: 232 programPoint places, 3 predicate places. [2025-01-09 21:28:11,152 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 253 transitions, 692 flow [2025-01-09 21:28:11,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:28:11,152 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:28:11,152 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:28:11,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:28:11,152 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:28:11,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:28:11,153 INFO L85 PathProgramCache]: Analyzing trace with hash 821953492, now seen corresponding path program 1 times [2025-01-09 21:28:11,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:28:11,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721144017] [2025-01-09 21:28:11,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:28:11,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:28:11,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 21:28:11,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 21:28:11,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:28:11,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:28:11,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:28:11,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:28:11,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721144017] [2025-01-09 21:28:11,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721144017] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:28:11,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:28:11,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:28:11,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414498903] [2025-01-09 21:28:11,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:28:11,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:28:11,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:28:11,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:28:11,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:28:11,251 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 253 [2025-01-09 21:28:11,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 253 transitions, 692 flow. Second operand has 5 states, 5 states have (on average 191.8) internal successors, (959), 5 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:28:11,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:28:11,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 253 [2025-01-09 21:28:11,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:28:12,483 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([651] L714-4-->L714-5: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][138], [247#(= |#race~x~0| 0), 231#true, 233#true, 79#L708-25true, 250#true, 80#L708-5true, Black: 245#true, 202#L714-5true, Black: 237#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2025-01-09 21:28:12,484 INFO L294 olderBase$Statistics]: this new event has 105 ancestors and is cut-off event [2025-01-09 21:28:12,484 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2025-01-09 21:28:12,484 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2025-01-09 21:28:12,484 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2025-01-09 21:28:12,539 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([651] L714-4-->L714-5: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][138], [247#(= |#race~x~0| 0), 83#L708-26true, 231#true, 233#true, 250#true, 80#L708-5true, Black: 245#true, Black: 237#(= |ULTIMATE.start_main_~i~0#1| 0), 202#L714-5true]) [2025-01-09 21:28:12,539 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2025-01-09 21:28:12,540 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2025-01-09 21:28:12,540 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2025-01-09 21:28:12,540 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2025-01-09 21:28:12,591 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([651] L714-4-->L714-5: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][138], [247#(= |#race~x~0| 0), 231#true, 233#true, 79#L708-25true, 250#true, Black: 245#true, 134#L708-6true, 202#L714-5true, Black: 237#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2025-01-09 21:28:12,592 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2025-01-09 21:28:12,592 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2025-01-09 21:28:12,592 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2025-01-09 21:28:12,592 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2025-01-09 21:28:12,645 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([651] L714-4-->L714-5: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][138], [83#L708-26true, 247#(= |#race~x~0| 0), 231#true, 233#true, 250#true, Black: 245#true, 134#L708-6true, 202#L714-5true, Black: 237#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2025-01-09 21:28:12,645 INFO L294 olderBase$Statistics]: this new event has 107 ancestors and is cut-off event [2025-01-09 21:28:12,645 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-01-09 21:28:12,645 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-01-09 21:28:12,645 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-01-09 21:28:12,704 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([838] L708-13-->L708-16: Formula: (and (= (store |v_#pthreadsMutex_146| |v_~#__global_lock~0.base_54| (store (select |v_#pthreadsMutex_146| |v_~#__global_lock~0.base_54|) |v_~#__global_lock~0.offset_54| 0)) |v_#pthreadsMutex_145|) (= |v_t_funThread1of2ForFork0_#t~ret12_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_146|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_54|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_54|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_145|, t_funThread1of2ForFork0_#t~ret12=|v_t_funThread1of2ForFork0_#t~ret12_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_54|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_54|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of2ForFork0_#t~ret12][193], [34#L708-16true, 231#true, 233#true, 250#true, 79#L708-25true, Black: 247#(= |#race~x~0| 0), 245#true, 153#L713-16true, Black: 237#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2025-01-09 21:28:12,705 INFO L294 olderBase$Statistics]: this new event has 108 ancestors and is cut-off event [2025-01-09 21:28:12,705 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2025-01-09 21:28:12,705 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2025-01-09 21:28:12,705 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2025-01-09 21:28:12,706 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([899] L708-33-->L708-36: Formula: (and (= (store |v_#pthreadsMutex_162| |v_~#__global_lock~0.base_62| (store (select |v_#pthreadsMutex_162| |v_~#__global_lock~0.base_62|) |v_~#__global_lock~0.offset_62| 0)) |v_#pthreadsMutex_161|) (= 0 |v_t_funThread2of2ForFork0_#t~ret16_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_162|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_62|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_62|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_161|, t_funThread2of2ForFork0_#t~ret16=|v_t_funThread2of2ForFork0_#t~ret16_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_62|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_62|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of2ForFork0_#t~ret16][253], [231#true, 193#L708-36true, 233#true, Black: 247#(= |#race~x~0| 0), 250#true, 80#L708-5true, 245#true, 153#L713-16true, Black: 237#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2025-01-09 21:28:12,706 INFO L294 olderBase$Statistics]: this new event has 108 ancestors and is cut-off event [2025-01-09 21:28:12,706 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2025-01-09 21:28:12,706 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2025-01-09 21:28:12,706 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2025-01-09 21:28:12,759 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([651] L714-4-->L714-5: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][114], [69#L708-10true, 247#(= |#race~x~0| 0), 231#true, 233#true, 250#true, 79#L708-25true, Black: 245#true, 202#L714-5true, Black: 237#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2025-01-09 21:28:12,759 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2025-01-09 21:28:12,759 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-01-09 21:28:12,759 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-01-09 21:28:12,759 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-01-09 21:28:12,760 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([838] L708-13-->L708-16: Formula: (and (= (store |v_#pthreadsMutex_146| |v_~#__global_lock~0.base_54| (store (select |v_#pthreadsMutex_146| |v_~#__global_lock~0.base_54|) |v_~#__global_lock~0.offset_54| 0)) |v_#pthreadsMutex_145|) (= |v_t_funThread1of2ForFork0_#t~ret12_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_146|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_54|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_54|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_145|, t_funThread1of2ForFork0_#t~ret12=|v_t_funThread1of2ForFork0_#t~ret12_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_54|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_54|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of2ForFork0_#t~ret12][193], [34#L708-16true, 231#true, 233#true, 250#true, Black: 247#(= |#race~x~0| 0), 79#L708-25true, 245#true, 92#L713-17true, Black: 237#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2025-01-09 21:28:12,760 INFO L294 olderBase$Statistics]: this new event has 109 ancestors and is cut-off event [2025-01-09 21:28:12,760 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-01-09 21:28:12,760 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-01-09 21:28:12,760 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-01-09 21:28:12,760 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([838] L708-13-->L708-16: Formula: (and (= (store |v_#pthreadsMutex_146| |v_~#__global_lock~0.base_54| (store (select |v_#pthreadsMutex_146| |v_~#__global_lock~0.base_54|) |v_~#__global_lock~0.offset_54| 0)) |v_#pthreadsMutex_145|) (= |v_t_funThread1of2ForFork0_#t~ret12_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_146|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_54|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_54|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_145|, t_funThread1of2ForFork0_#t~ret12=|v_t_funThread1of2ForFork0_#t~ret12_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_54|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_54|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of2ForFork0_#t~ret12][193], [34#L708-16true, 83#L708-26true, 231#true, 233#true, 250#true, Black: 247#(= |#race~x~0| 0), 245#true, 153#L713-16true, Black: 237#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2025-01-09 21:28:12,760 INFO L294 olderBase$Statistics]: this new event has 109 ancestors and is cut-off event [2025-01-09 21:28:12,760 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-01-09 21:28:12,760 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-01-09 21:28:12,761 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-01-09 21:28:12,761 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([899] L708-33-->L708-36: Formula: (and (= (store |v_#pthreadsMutex_162| |v_~#__global_lock~0.base_62| (store (select |v_#pthreadsMutex_162| |v_~#__global_lock~0.base_62|) |v_~#__global_lock~0.offset_62| 0)) |v_#pthreadsMutex_161|) (= 0 |v_t_funThread2of2ForFork0_#t~ret16_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_162|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_62|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_62|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_161|, t_funThread2of2ForFork0_#t~ret16=|v_t_funThread2of2ForFork0_#t~ret16_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_62|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_62|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of2ForFork0_#t~ret16][253], [231#true, 193#L708-36true, 233#true, Black: 247#(= |#race~x~0| 0), 250#true, 134#L708-6true, 245#true, 153#L713-16true, Black: 237#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2025-01-09 21:28:12,761 INFO L294 olderBase$Statistics]: this new event has 109 ancestors and is cut-off event [2025-01-09 21:28:12,761 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-01-09 21:28:12,761 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-01-09 21:28:12,761 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-01-09 21:28:12,762 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([899] L708-33-->L708-36: Formula: (and (= (store |v_#pthreadsMutex_162| |v_~#__global_lock~0.base_62| (store (select |v_#pthreadsMutex_162| |v_~#__global_lock~0.base_62|) |v_~#__global_lock~0.offset_62| 0)) |v_#pthreadsMutex_161|) (= 0 |v_t_funThread2of2ForFork0_#t~ret16_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_162|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_62|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_62|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_161|, t_funThread2of2ForFork0_#t~ret16=|v_t_funThread2of2ForFork0_#t~ret16_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_62|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_62|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of2ForFork0_#t~ret16][253], [231#true, 193#L708-36true, 233#true, 250#true, Black: 247#(= |#race~x~0| 0), 80#L708-5true, 245#true, 92#L713-17true, Black: 237#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2025-01-09 21:28:12,762 INFO L294 olderBase$Statistics]: this new event has 109 ancestors and is cut-off event [2025-01-09 21:28:12,762 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-01-09 21:28:12,762 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-01-09 21:28:12,762 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-01-09 21:28:12,815 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([838] L708-13-->L708-16: Formula: (and (= (store |v_#pthreadsMutex_146| |v_~#__global_lock~0.base_54| (store (select |v_#pthreadsMutex_146| |v_~#__global_lock~0.base_54|) |v_~#__global_lock~0.offset_54| 0)) |v_#pthreadsMutex_145|) (= |v_t_funThread1of2ForFork0_#t~ret12_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_146|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_54|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_54|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_145|, t_funThread1of2ForFork0_#t~ret12=|v_t_funThread1of2ForFork0_#t~ret12_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_54|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_54|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of2ForFork0_#t~ret12][193], [34#L708-16true, 231#true, 233#true, 79#L708-25true, 250#true, Black: 247#(= |#race~x~0| 0), 166#L714-41true, 245#true, Black: 237#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2025-01-09 21:28:12,815 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2025-01-09 21:28:12,815 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-01-09 21:28:12,815 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-01-09 21:28:12,816 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-01-09 21:28:12,816 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([838] L708-13-->L708-16: Formula: (and (= (store |v_#pthreadsMutex_146| |v_~#__global_lock~0.base_54| (store (select |v_#pthreadsMutex_146| |v_~#__global_lock~0.base_54|) |v_~#__global_lock~0.offset_54| 0)) |v_#pthreadsMutex_145|) (= |v_t_funThread1of2ForFork0_#t~ret12_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_146|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_54|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_54|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_145|, t_funThread1of2ForFork0_#t~ret12=|v_t_funThread1of2ForFork0_#t~ret12_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_54|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_54|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of2ForFork0_#t~ret12][193], [34#L708-16true, 83#L708-26true, 231#true, 233#true, 250#true, Black: 247#(= |#race~x~0| 0), 245#true, 92#L713-17true, Black: 237#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2025-01-09 21:28:12,816 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2025-01-09 21:28:12,816 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-01-09 21:28:12,816 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-01-09 21:28:12,816 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-01-09 21:28:12,816 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([899] L708-33-->L708-36: Formula: (and (= (store |v_#pthreadsMutex_162| |v_~#__global_lock~0.base_62| (store (select |v_#pthreadsMutex_162| |v_~#__global_lock~0.base_62|) |v_~#__global_lock~0.offset_62| 0)) |v_#pthreadsMutex_161|) (= 0 |v_t_funThread2of2ForFork0_#t~ret16_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_162|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_62|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_62|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_161|, t_funThread2of2ForFork0_#t~ret16=|v_t_funThread2of2ForFork0_#t~ret16_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_62|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_62|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of2ForFork0_#t~ret16][253], [231#true, 193#L708-36true, 233#true, 250#true, Black: 247#(= |#race~x~0| 0), 134#L708-6true, 245#true, 92#L713-17true, Black: 237#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2025-01-09 21:28:12,816 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2025-01-09 21:28:12,816 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-01-09 21:28:12,817 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-01-09 21:28:12,817 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-01-09 21:28:12,817 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([651] L714-4-->L714-5: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][138], [247#(= |#race~x~0| 0), 231#true, 233#true, 122#L708-30true, 250#true, Black: 245#true, 134#L708-6true, 202#L714-5true, Black: 237#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2025-01-09 21:28:12,817 INFO L294 olderBase$Statistics]: this new event has 111 ancestors and is cut-off event [2025-01-09 21:28:12,817 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-01-09 21:28:12,817 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-01-09 21:28:12,817 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-01-09 21:28:12,817 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([899] L708-33-->L708-36: Formula: (and (= (store |v_#pthreadsMutex_162| |v_~#__global_lock~0.base_62| (store (select |v_#pthreadsMutex_162| |v_~#__global_lock~0.base_62|) |v_~#__global_lock~0.offset_62| 0)) |v_#pthreadsMutex_161|) (= 0 |v_t_funThread2of2ForFork0_#t~ret16_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_162|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_62|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_62|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_161|, t_funThread2of2ForFork0_#t~ret16=|v_t_funThread2of2ForFork0_#t~ret16_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_62|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_62|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of2ForFork0_#t~ret16][253], [231#true, 193#L708-36true, 233#true, 250#true, Black: 247#(= |#race~x~0| 0), 80#L708-5true, 166#L714-41true, 245#true, Black: 237#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2025-01-09 21:28:12,817 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2025-01-09 21:28:12,818 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-01-09 21:28:12,818 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-01-09 21:28:12,818 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-01-09 21:28:12,859 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([651] L714-4-->L714-5: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][114], [69#L708-10true, 247#(= |#race~x~0| 0), 83#L708-26true, 231#true, 233#true, 250#true, Black: 245#true, 202#L714-5true, Black: 237#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2025-01-09 21:28:12,859 INFO L294 olderBase$Statistics]: this new event has 111 ancestors and is cut-off event [2025-01-09 21:28:12,860 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-01-09 21:28:12,860 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-01-09 21:28:12,860 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-01-09 21:28:12,869 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([651] L714-4-->L714-5: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][114], [247#(= |#race~x~0| 0), 231#true, 233#true, 122#L708-30true, 250#true, 80#L708-5true, Black: 245#true, 202#L714-5true, Black: 237#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2025-01-09 21:28:12,869 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is not cut-off event [2025-01-09 21:28:12,869 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is not cut-off event [2025-01-09 21:28:12,869 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is not cut-off event [2025-01-09 21:28:12,870 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is not cut-off event [2025-01-09 21:28:12,875 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([838] L708-13-->L708-16: Formula: (and (= (store |v_#pthreadsMutex_146| |v_~#__global_lock~0.base_54| (store (select |v_#pthreadsMutex_146| |v_~#__global_lock~0.base_54|) |v_~#__global_lock~0.offset_54| 0)) |v_#pthreadsMutex_145|) (= |v_t_funThread1of2ForFork0_#t~ret12_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_146|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_54|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_54|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_145|, t_funThread1of2ForFork0_#t~ret12=|v_t_funThread1of2ForFork0_#t~ret12_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_54|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_54|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of2ForFork0_#t~ret12][193], [34#L708-16true, 83#L708-26true, 231#true, 233#true, Black: 247#(= |#race~x~0| 0), 250#true, 166#L714-41true, 245#true, Black: 237#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2025-01-09 21:28:12,875 INFO L294 olderBase$Statistics]: this new event has 111 ancestors and is cut-off event [2025-01-09 21:28:12,875 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-01-09 21:28:12,876 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-01-09 21:28:12,876 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-01-09 21:28:12,876 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([899] L708-33-->L708-36: Formula: (and (= (store |v_#pthreadsMutex_162| |v_~#__global_lock~0.base_62| (store (select |v_#pthreadsMutex_162| |v_~#__global_lock~0.base_62|) |v_~#__global_lock~0.offset_62| 0)) |v_#pthreadsMutex_161|) (= 0 |v_t_funThread2of2ForFork0_#t~ret16_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_162|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_62|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_62|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_161|, t_funThread2of2ForFork0_#t~ret16=|v_t_funThread2of2ForFork0_#t~ret16_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_62|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_62|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of2ForFork0_#t~ret16][253], [231#true, 193#L708-36true, 233#true, 250#true, Black: 247#(= |#race~x~0| 0), 166#L714-41true, 134#L708-6true, 245#true, Black: 237#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2025-01-09 21:28:12,876 INFO L294 olderBase$Statistics]: this new event has 111 ancestors and is cut-off event [2025-01-09 21:28:12,876 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-01-09 21:28:12,876 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-01-09 21:28:12,876 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-01-09 21:28:12,916 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([651] L714-4-->L714-5: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][114], [69#L708-10true, 247#(= |#race~x~0| 0), 231#true, 233#true, 250#true, Black: 245#true, 202#L714-5true, 188#t_funErr3ASSERT_VIOLATIONDATA_RACEtrue, Black: 237#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2025-01-09 21:28:12,916 INFO L294 olderBase$Statistics]: this new event has 111 ancestors and is not cut-off event [2025-01-09 21:28:12,916 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is not cut-off event [2025-01-09 21:28:12,916 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is not cut-off event [2025-01-09 21:28:12,916 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is not cut-off event [2025-01-09 21:28:12,923 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([651] L714-4-->L714-5: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][114], [247#(= |#race~x~0| 0), 231#true, 233#true, 122#L708-30true, 250#true, Black: 245#true, 134#L708-6true, 202#L714-5true, Black: 237#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2025-01-09 21:28:12,923 INFO L294 olderBase$Statistics]: this new event has 111 ancestors and is not cut-off event [2025-01-09 21:28:12,923 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is not cut-off event [2025-01-09 21:28:12,923 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is not cut-off event [2025-01-09 21:28:12,923 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is not cut-off event [2025-01-09 21:28:12,927 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([651] L714-4-->L714-5: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][114], [247#(= |#race~x~0| 0), 231#true, 233#true, 122#L708-30true, 250#true, Black: 245#true, 98#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 202#L714-5true, Black: 237#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2025-01-09 21:28:12,927 INFO L294 olderBase$Statistics]: this new event has 111 ancestors and is not cut-off event [2025-01-09 21:28:12,927 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is not cut-off event [2025-01-09 21:28:12,927 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is not cut-off event [2025-01-09 21:28:12,927 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is not cut-off event [2025-01-09 21:28:12,934 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([838] L708-13-->L708-16: Formula: (and (= (store |v_#pthreadsMutex_146| |v_~#__global_lock~0.base_54| (store (select |v_#pthreadsMutex_146| |v_~#__global_lock~0.base_54|) |v_~#__global_lock~0.offset_54| 0)) |v_#pthreadsMutex_145|) (= |v_t_funThread1of2ForFork0_#t~ret12_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_146|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_54|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_54|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_145|, t_funThread1of2ForFork0_#t~ret12=|v_t_funThread1of2ForFork0_#t~ret12_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_54|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_54|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of2ForFork0_#t~ret12][193], [34#L708-16true, 231#true, 233#true, Black: 247#(= |#race~x~0| 0), 79#L708-25true, 3#L714-3true, 250#true, 245#true, Black: 237#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2025-01-09 21:28:12,935 INFO L294 olderBase$Statistics]: this new event has 112 ancestors and is cut-off event [2025-01-09 21:28:12,935 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-01-09 21:28:12,935 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-01-09 21:28:12,935 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-01-09 21:28:12,936 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([899] L708-33-->L708-36: Formula: (and (= (store |v_#pthreadsMutex_162| |v_~#__global_lock~0.base_62| (store (select |v_#pthreadsMutex_162| |v_~#__global_lock~0.base_62|) |v_~#__global_lock~0.offset_62| 0)) |v_#pthreadsMutex_161|) (= 0 |v_t_funThread2of2ForFork0_#t~ret16_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_162|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_62|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_62|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_161|, t_funThread2of2ForFork0_#t~ret16=|v_t_funThread2of2ForFork0_#t~ret16_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_62|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_62|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of2ForFork0_#t~ret16][253], [231#true, 193#L708-36true, 233#true, Black: 247#(= |#race~x~0| 0), 250#true, 80#L708-5true, 3#L714-3true, 245#true, Black: 237#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2025-01-09 21:28:12,936 INFO L294 olderBase$Statistics]: this new event has 112 ancestors and is cut-off event [2025-01-09 21:28:12,936 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-01-09 21:28:12,936 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-01-09 21:28:12,936 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-01-09 21:28:12,991 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([838] L708-13-->L708-16: Formula: (and (= (store |v_#pthreadsMutex_146| |v_~#__global_lock~0.base_54| (store (select |v_#pthreadsMutex_146| |v_~#__global_lock~0.base_54|) |v_~#__global_lock~0.offset_54| 0)) |v_#pthreadsMutex_145|) (= |v_t_funThread1of2ForFork0_#t~ret12_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_146|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_54|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_54|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_145|, t_funThread1of2ForFork0_#t~ret12=|v_t_funThread1of2ForFork0_#t~ret12_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_54|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_54|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of2ForFork0_#t~ret12][193], [34#L708-16true, 83#L708-26true, 231#true, 233#true, 250#true, Black: 247#(= |#race~x~0| 0), 3#L714-3true, 245#true, Black: 237#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2025-01-09 21:28:12,992 INFO L294 olderBase$Statistics]: this new event has 113 ancestors and is cut-off event [2025-01-09 21:28:12,992 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-01-09 21:28:12,992 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-01-09 21:28:12,992 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-01-09 21:28:12,992 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([899] L708-33-->L708-36: Formula: (and (= (store |v_#pthreadsMutex_162| |v_~#__global_lock~0.base_62| (store (select |v_#pthreadsMutex_162| |v_~#__global_lock~0.base_62|) |v_~#__global_lock~0.offset_62| 0)) |v_#pthreadsMutex_161|) (= 0 |v_t_funThread2of2ForFork0_#t~ret16_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_162|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_62|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_62|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_161|, t_funThread2of2ForFork0_#t~ret16=|v_t_funThread2of2ForFork0_#t~ret16_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_62|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_62|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of2ForFork0_#t~ret16][253], [231#true, 193#L708-36true, 233#true, 250#true, Black: 247#(= |#race~x~0| 0), 3#L714-3true, 134#L708-6true, 245#true, Black: 237#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2025-01-09 21:28:12,992 INFO L294 olderBase$Statistics]: this new event has 113 ancestors and is cut-off event [2025-01-09 21:28:12,993 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-01-09 21:28:12,993 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-01-09 21:28:12,993 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-01-09 21:28:13,328 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([651] L714-4-->L714-5: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][114], [69#L708-10true, 247#(= |#race~x~0| 0), 231#true, 233#true, 122#L708-30true, 250#true, Black: 245#true, Black: 237#(= |ULTIMATE.start_main_~i~0#1| 0), 202#L714-5true]) [2025-01-09 21:28:13,328 INFO L294 olderBase$Statistics]: this new event has 115 ancestors and is not cut-off event [2025-01-09 21:28:13,328 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is not cut-off event [2025-01-09 21:28:13,328 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is not cut-off event [2025-01-09 21:28:13,328 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is not cut-off event [2025-01-09 21:28:15,919 INFO L124 PetriNetUnfolderBase]: 14268/61155 cut-off events. [2025-01-09 21:28:15,919 INFO L125 PetriNetUnfolderBase]: For 4477/4865 co-relation queries the response was YES. [2025-01-09 21:28:16,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93607 conditions, 61155 events. 14268/61155 cut-off events. For 4477/4865 co-relation queries the response was YES. Maximal size of possible extension queue 1084. Compared 868373 event pairs, 6138 based on Foata normal form. 11/55446 useless extension candidates. Maximal degree in co-relation 84537. Up to 15201 conditions per place. [2025-01-09 21:28:16,182 INFO L140 encePairwiseOnDemand]: 248/253 looper letters, 88 selfloop transitions, 5 changer transitions 0/305 dead transitions. [2025-01-09 21:28:16,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 305 transitions, 982 flow [2025-01-09 21:28:16,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:28:16,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:28:16,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1234 transitions. [2025-01-09 21:28:16,185 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8129117259552042 [2025-01-09 21:28:16,185 INFO L175 Difference]: Start difference. First operand has 235 places, 253 transitions, 692 flow. Second operand 6 states and 1234 transitions. [2025-01-09 21:28:16,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 305 transitions, 982 flow [2025-01-09 21:28:16,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 305 transitions, 934 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:28:16,220 INFO L231 Difference]: Finished difference. Result has 241 places, 255 transitions, 670 flow [2025-01-09 21:28:16,220 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=644, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=670, PETRI_PLACES=241, PETRI_TRANSITIONS=255} [2025-01-09 21:28:16,221 INFO L279 CegarLoopForPetriNet]: 232 programPoint places, 9 predicate places. [2025-01-09 21:28:16,221 INFO L471 AbstractCegarLoop]: Abstraction has has 241 places, 255 transitions, 670 flow [2025-01-09 21:28:16,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 191.8) internal successors, (959), 5 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:28:16,222 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:28:16,222 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] [2025-01-09 21:28:16,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:28:16,222 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:28:16,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:28:16,222 INFO L85 PathProgramCache]: Analyzing trace with hash -859524247, now seen corresponding path program 1 times [2025-01-09 21:28:16,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:28:16,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467423903] [2025-01-09 21:28:16,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:28:16,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:28:16,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 21:28:16,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 21:28:16,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:28:16,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:28:16,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:28:16,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:28:16,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467423903] [2025-01-09 21:28:16,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467423903] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:28:16,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:28:16,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:28:16,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152015446] [2025-01-09 21:28:16,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:28:16,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:28:16,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:28:16,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:28:16,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:28:16,283 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 253 [2025-01-09 21:28:16,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 255 transitions, 670 flow. Second operand has 3 states, 3 states have (on average 190.0) internal successors, (570), 3 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:28:16,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:28:16,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 253 [2025-01-09 21:28:16,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:28:21,321 INFO L124 PetriNetUnfolderBase]: 17540/66414 cut-off events. [2025-01-09 21:28:21,322 INFO L125 PetriNetUnfolderBase]: For 719/1541 co-relation queries the response was YES. [2025-01-09 21:28:21,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100204 conditions, 66414 events. 17540/66414 cut-off events. For 719/1541 co-relation queries the response was YES. Maximal size of possible extension queue 1336. Compared 938375 event pairs, 8624 based on Foata normal form. 24/59306 useless extension candidates. Maximal degree in co-relation 100081. Up to 17636 conditions per place. [2025-01-09 21:28:21,667 INFO L140 encePairwiseOnDemand]: 242/253 looper letters, 70 selfloop transitions, 9 changer transitions 0/289 dead transitions. [2025-01-09 21:28:21,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 289 transitions, 898 flow [2025-01-09 21:28:21,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:28:21,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:28:21,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 642 transitions. [2025-01-09 21:28:21,669 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8458498023715415 [2025-01-09 21:28:21,669 INFO L175 Difference]: Start difference. First operand has 241 places, 255 transitions, 670 flow. Second operand 3 states and 642 transitions. [2025-01-09 21:28:21,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 289 transitions, 898 flow [2025-01-09 21:28:21,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 289 transitions, 892 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-09 21:28:21,675 INFO L231 Difference]: Finished difference. Result has 242 places, 260 transitions, 724 flow [2025-01-09 21:28:21,675 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=656, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=724, PETRI_PLACES=242, PETRI_TRANSITIONS=260} [2025-01-09 21:28:21,676 INFO L279 CegarLoopForPetriNet]: 232 programPoint places, 10 predicate places. [2025-01-09 21:28:21,676 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 260 transitions, 724 flow [2025-01-09 21:28:21,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 190.0) internal successors, (570), 3 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:28:21,676 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:28:21,677 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:28:21,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:28:21,677 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:28:21,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:28:21,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1907911976, now seen corresponding path program 1 times [2025-01-09 21:28:21,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:28:21,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735165532] [2025-01-09 21:28:21,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:28:21,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:28:21,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 21:28:21,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 21:28:21,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:28:21,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:28:21,693 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:28:21,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 21:28:21,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 21:28:21,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:28:21,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:28:21,712 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:28:21,713 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:28:21,713 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 23 remaining) [2025-01-09 21:28:21,713 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (21 of 23 remaining) [2025-01-09 21:28:21,713 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (20 of 23 remaining) [2025-01-09 21:28:21,713 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (19 of 23 remaining) [2025-01-09 21:28:21,713 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (18 of 23 remaining) [2025-01-09 21:28:21,713 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (17 of 23 remaining) [2025-01-09 21:28:21,713 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (16 of 23 remaining) [2025-01-09 21:28:21,713 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (15 of 23 remaining) [2025-01-09 21:28:21,713 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (14 of 23 remaining) [2025-01-09 21:28:21,713 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (13 of 23 remaining) [2025-01-09 21:28:21,713 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (12 of 23 remaining) [2025-01-09 21:28:21,713 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (11 of 23 remaining) [2025-01-09 21:28:21,713 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (10 of 23 remaining) [2025-01-09 21:28:21,713 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (9 of 23 remaining) [2025-01-09 21:28:21,713 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (8 of 23 remaining) [2025-01-09 21:28:21,713 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 23 remaining) [2025-01-09 21:28:21,713 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 23 remaining) [2025-01-09 21:28:21,713 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (5 of 23 remaining) [2025-01-09 21:28:21,713 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 23 remaining) [2025-01-09 21:28:21,713 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (3 of 23 remaining) [2025-01-09 21:28:21,713 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (2 of 23 remaining) [2025-01-09 21:28:21,713 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 23 remaining) [2025-01-09 21:28:21,713 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (0 of 23 remaining) [2025-01-09 21:28:21,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:28:21,713 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-01-09 21:28:21,714 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:28:21,714 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-09 21:28:21,747 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 21:28:21,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 288 places, 315 transitions, 657 flow [2025-01-09 21:28:21,788 INFO L124 PetriNetUnfolderBase]: 69/703 cut-off events. [2025-01-09 21:28:21,789 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-01-09 21:28:21,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 728 conditions, 703 events. 69/703 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3233 event pairs, 1 based on Foata normal form. 0/583 useless extension candidates. Maximal degree in co-relation 482. Up to 12 conditions per place. [2025-01-09 21:28:21,793 INFO L82 GeneralOperation]: Start removeDead. Operand has 288 places, 315 transitions, 657 flow [2025-01-09 21:28:21,796 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 288 places, 315 transitions, 657 flow [2025-01-09 21:28:21,797 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:28:21,797 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6075fda0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:28:21,797 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2025-01-09 21:28:21,799 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:28:21,799 INFO L124 PetriNetUnfolderBase]: 2/51 cut-off events. [2025-01-09 21:28:21,799 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:28:21,799 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:28:21,799 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:28:21,799 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-01-09 21:28:21,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:28:21,799 INFO L85 PathProgramCache]: Analyzing trace with hash 2113254309, now seen corresponding path program 1 times [2025-01-09 21:28:21,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:28:21,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286590249] [2025-01-09 21:28:21,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:28:21,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:28:21,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 21:28:21,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 21:28:21,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:28:21,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:28:21,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:28:21,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:28:21,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286590249] [2025-01-09 21:28:21,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286590249] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:28:21,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:28:21,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:28:21,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958284784] [2025-01-09 21:28:21,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:28:21,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:28:21,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:28:21,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:28:21,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:28:21,843 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 315 [2025-01-09 21:28:21,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 315 transitions, 657 flow. Second operand has 3 states, 3 states have (on average 237.66666666666666) internal successors, (713), 3 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:28:21,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:28:21,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 315 [2025-01-09 21:28:21,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:28:36,166 INFO L124 PetriNetUnfolderBase]: 52130/156540 cut-off events. [2025-01-09 21:28:36,166 INFO L125 PetriNetUnfolderBase]: For 2131/2131 co-relation queries the response was YES. [2025-01-09 21:28:36,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 227376 conditions, 156540 events. 52130/156540 cut-off events. For 2131/2131 co-relation queries the response was YES. Maximal size of possible extension queue 2961. Compared 2296863 event pairs, 46479 based on Foata normal form. 30460/172560 useless extension candidates. Maximal degree in co-relation 168843. Up to 69847 conditions per place. [2025-01-09 21:28:37,422 INFO L140 encePairwiseOnDemand]: 284/315 looper letters, 59 selfloop transitions, 2 changer transitions 0/296 dead transitions. [2025-01-09 21:28:37,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 296 transitions, 741 flow [2025-01-09 21:28:37,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:28:37,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:28:37,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 804 transitions. [2025-01-09 21:28:37,425 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8507936507936508 [2025-01-09 21:28:37,425 INFO L175 Difference]: Start difference. First operand has 288 places, 315 transitions, 657 flow. Second operand 3 states and 804 transitions. [2025-01-09 21:28:37,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 296 transitions, 741 flow [2025-01-09 21:28:37,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 296 transitions, 741 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:28:37,436 INFO L231 Difference]: Finished difference. Result has 289 places, 286 transitions, 609 flow [2025-01-09 21:28:37,436 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=597, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=609, PETRI_PLACES=289, PETRI_TRANSITIONS=286} [2025-01-09 21:28:37,437 INFO L279 CegarLoopForPetriNet]: 288 programPoint places, 1 predicate places. [2025-01-09 21:28:37,437 INFO L471 AbstractCegarLoop]: Abstraction has has 289 places, 286 transitions, 609 flow [2025-01-09 21:28:37,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 237.66666666666666) internal successors, (713), 3 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:28:37,438 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:28:37,439 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:28:37,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:28:37,439 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-01-09 21:28:37,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:28:37,439 INFO L85 PathProgramCache]: Analyzing trace with hash 210128755, now seen corresponding path program 1 times [2025-01-09 21:28:37,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:28:37,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541207676] [2025-01-09 21:28:37,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:28:37,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:28:37,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 21:28:37,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 21:28:37,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:28:37,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:28:37,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:28:37,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:28:37,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541207676] [2025-01-09 21:28:37,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541207676] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:28:37,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:28:37,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:28:37,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338876126] [2025-01-09 21:28:37,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:28:37,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:28:37,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:28:37,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:28:37,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:28:37,769 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 315 [2025-01-09 21:28:37,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 286 transitions, 609 flow. Second operand has 6 states, 6 states have (on average 225.5) internal successors, (1353), 6 states have internal predecessors, (1353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:28:37,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:28:37,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 315 [2025-01-09 21:28:37,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand