./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_20-callback_racefree.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_20-callback_racefree.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 4e91816f101a416d37c086dd7185cfb4e2bfa63eb286e4a418cb94db27cf2f6f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:27:09,311 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:27:09,365 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:09,368 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:27:09,369 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:27:09,386 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:27:09,387 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:27:09,387 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:27:09,387 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:27:09,388 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:27:09,388 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:27:09,389 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:27:09,389 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:27:09,389 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:27:09,389 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:27:09,389 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:27:09,389 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:27:09,389 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:27:09,389 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:27:09,389 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:27:09,389 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:27:09,389 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:27:09,389 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:27:09,389 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:27:09,389 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:27:09,389 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:27:09,389 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:27:09,389 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:27:09,390 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:27:09,390 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:27:09,390 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:27:09,390 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:27:09,390 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:27:09,390 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:27:09,390 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:27:09,390 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:27:09,390 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:27:09,390 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:27:09,390 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:27:09,390 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:27:09,390 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:27:09,390 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:27:09,390 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:27:09,390 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:27:09,391 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:27:09,391 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:27:09,391 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 -> 4e91816f101a416d37c086dd7185cfb4e2bfa63eb286e4a418cb94db27cf2f6f [2025-01-09 21:27:09,616 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:27:09,625 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:27:09,627 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:27:09,627 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:27:09,628 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:27:09,628 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_20-callback_racefree.i [2025-01-09 21:27:11,396 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dff3023a4/65e183c16c4144e6b102c58d3b311dde/FLAGbe213f546 [2025-01-09 21:27:11,681 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:27:11,682 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_20-callback_racefree.i [2025-01-09 21:27:11,690 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dff3023a4/65e183c16c4144e6b102c58d3b311dde/FLAGbe213f546 [2025-01-09 21:27:11,984 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dff3023a4/65e183c16c4144e6b102c58d3b311dde [2025-01-09 21:27:11,986 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:27:11,987 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:27:11,988 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:27:11,988 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:27:11,991 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:27:11,991 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:27:11" (1/1) ... [2025-01-09 21:27:11,992 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2130992a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:11, skipping insertion in model container [2025-01-09 21:27:11,992 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:27:11" (1/1) ... [2025-01-09 21:27:12,013 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:27:12,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:27:12,271 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:27:12,310 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:27:12,340 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:27:12,341 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:12 WrapperNode [2025-01-09 21:27:12,342 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:27:12,344 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:27:12,344 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:27:12,344 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:27:12,349 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:12" (1/1) ... [2025-01-09 21:27:12,368 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:12" (1/1) ... [2025-01-09 21:27:12,401 INFO L138 Inliner]: procedures = 174, calls = 39, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 209 [2025-01-09 21:27:12,402 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:27:12,403 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:27:12,403 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:27:12,403 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:27:12,411 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:12" (1/1) ... [2025-01-09 21:27:12,411 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:12" (1/1) ... [2025-01-09 21:27:12,416 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:12" (1/1) ... [2025-01-09 21:27:12,417 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:12" (1/1) ... [2025-01-09 21:27:12,423 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:12" (1/1) ... [2025-01-09 21:27:12,424 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:12" (1/1) ... [2025-01-09 21:27:12,426 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:12" (1/1) ... [2025-01-09 21:27:12,428 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:12" (1/1) ... [2025-01-09 21:27:12,428 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:12" (1/1) ... [2025-01-09 21:27:12,430 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:27:12,431 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:27:12,431 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:27:12,431 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:27:12,432 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:12" (1/1) ... [2025-01-09 21:27:12,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:27:12,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:27:12,463 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:12,466 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:12,481 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:27:12,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:27:12,482 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 21:27:12,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:27:12,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 21:27:12,482 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-09 21:27:12,482 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-09 21:27:12,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 21:27:12,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:27:12,483 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 21:27:12,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:27:12,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:27:12,484 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:12,606 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:27:12,608 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:27:12,844 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:27:12,844 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:27:12,866 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:27:12,866 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-01-09 21:27:12,867 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:27:12 BoogieIcfgContainer [2025-01-09 21:27:12,867 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:27:12,869 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:27:12,869 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:27:12,872 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:27:12,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:27:11" (1/3) ... [2025-01-09 21:27:12,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f825166 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:27:12, skipping insertion in model container [2025-01-09 21:27:12,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:12" (2/3) ... [2025-01-09 21:27:12,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f825166 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:27:12, skipping insertion in model container [2025-01-09 21:27:12,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:27:12" (3/3) ... [2025-01-09 21:27:12,874 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_20-callback_racefree.i [2025-01-09 21:27:12,883 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:27:12,885 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_20-callback_racefree.i that has 2 procedures, 215 locations, 1 initial locations, 7 loop locations, and 7 error locations. [2025-01-09 21:27:12,885 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:27:12,936 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-09 21:27:12,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 218 places, 228 transitions, 463 flow [2025-01-09 21:27:13,053 INFO L124 PetriNetUnfolderBase]: 21/335 cut-off events. [2025-01-09 21:27:13,055 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:27:13,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 340 conditions, 335 events. 21/335 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 962 event pairs, 0 based on Foata normal form. 0/298 useless extension candidates. Maximal degree in co-relation 189. Up to 6 conditions per place. [2025-01-09 21:27:13,060 INFO L82 GeneralOperation]: Start removeDead. Operand has 218 places, 228 transitions, 463 flow [2025-01-09 21:27:13,065 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 218 places, 228 transitions, 463 flow [2025-01-09 21:27:13,073 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:27:13,084 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;@68a9c26e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:27:13,085 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-01-09 21:27:13,101 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:27:13,101 INFO L124 PetriNetUnfolderBase]: 0/106 cut-off events. [2025-01-09 21:27:13,102 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:27:13,102 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:27:13,102 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:27:13,103 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-01-09 21:27:13,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:27:13,110 INFO L85 PathProgramCache]: Analyzing trace with hash 520264248, now seen corresponding path program 1 times [2025-01-09 21:27:13,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:27:13,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122609302] [2025-01-09 21:27:13,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:27:13,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:27:13,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 21:27:13,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 21:27:13,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:13,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:27:13,904 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:27:13,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:27:13,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122609302] [2025-01-09 21:27:13,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122609302] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:27:13,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:27:13,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:27:13,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140145185] [2025-01-09 21:27:13,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:27:13,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:27:13,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:27:13,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:27:13,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:27:14,012 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 228 [2025-01-09 21:27:14,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 228 transitions, 463 flow. Second operand has 6 states, 6 states have (on average 188.5) internal successors, (1131), 6 states have internal predecessors, (1131), 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:27:14,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:27:14,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 228 [2025-01-09 21:27:14,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:27:14,189 INFO L124 PetriNetUnfolderBase]: 93/805 cut-off events. [2025-01-09 21:27:14,189 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 21:27:14,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1019 conditions, 805 events. 93/805 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 4165 event pairs, 33 based on Foata normal form. 83/832 useless extension candidates. Maximal degree in co-relation 798. Up to 154 conditions per place. [2025-01-09 21:27:14,194 INFO L140 encePairwiseOnDemand]: 212/228 looper letters, 40 selfloop transitions, 5 changer transitions 0/231 dead transitions. [2025-01-09 21:27:14,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 231 transitions, 559 flow [2025-01-09 21:27:14,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:27:14,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:27:14,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1194 transitions. [2025-01-09 21:27:14,206 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8728070175438597 [2025-01-09 21:27:14,207 INFO L175 Difference]: Start difference. First operand has 218 places, 228 transitions, 463 flow. Second operand 6 states and 1194 transitions. [2025-01-09 21:27:14,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 231 transitions, 559 flow [2025-01-09 21:27:14,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 231 transitions, 559 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:27:14,214 INFO L231 Difference]: Finished difference. Result has 220 places, 215 transitions, 447 flow [2025-01-09 21:27:14,216 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=447, PETRI_PLACES=220, PETRI_TRANSITIONS=215} [2025-01-09 21:27:14,218 INFO L279 CegarLoopForPetriNet]: 218 programPoint places, 2 predicate places. [2025-01-09 21:27:14,218 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 215 transitions, 447 flow [2025-01-09 21:27:14,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 188.5) internal successors, (1131), 6 states have internal predecessors, (1131), 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:27:14,219 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:27:14,219 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:27:14,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:27:14,219 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-01-09 21:27:14,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:27:14,220 INFO L85 PathProgramCache]: Analyzing trace with hash 90543856, now seen corresponding path program 1 times [2025-01-09 21:27:14,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:27:14,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813815275] [2025-01-09 21:27:14,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:27:14,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:27:14,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 21:27:14,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 21:27:14,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:14,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:27:14,288 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:27:14,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:27:14,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813815275] [2025-01-09 21:27:14,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813815275] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:27:14,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:27:14,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:27:14,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245648131] [2025-01-09 21:27:14,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:27:14,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:27:14,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:27:14,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:27:14,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:27:14,319 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 228 [2025-01-09 21:27:14,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 215 transitions, 447 flow. Second operand has 3 states, 3 states have (on average 200.33333333333334) internal successors, (601), 3 states have internal predecessors, (601), 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:27:14,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:27:14,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 228 [2025-01-09 21:27:14,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:27:14,414 INFO L124 PetriNetUnfolderBase]: 50/674 cut-off events. [2025-01-09 21:27:14,415 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-01-09 21:27:14,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 801 conditions, 674 events. 50/674 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3061 event pairs, 18 based on Foata normal form. 1/628 useless extension candidates. Maximal degree in co-relation 669. Up to 94 conditions per place. [2025-01-09 21:27:14,420 INFO L140 encePairwiseOnDemand]: 225/228 looper letters, 20 selfloop transitions, 2 changer transitions 0/219 dead transitions. [2025-01-09 21:27:14,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 219 transitions, 499 flow [2025-01-09 21:27:14,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:27:14,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:27:14,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 620 transitions. [2025-01-09 21:27:14,449 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9064327485380117 [2025-01-09 21:27:14,449 INFO L175 Difference]: Start difference. First operand has 220 places, 215 transitions, 447 flow. Second operand 3 states and 620 transitions. [2025-01-09 21:27:14,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 219 transitions, 499 flow [2025-01-09 21:27:14,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 219 transitions, 489 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:27:14,454 INFO L231 Difference]: Finished difference. Result has 218 places, 215 transitions, 445 flow [2025-01-09 21:27:14,454 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=445, PETRI_PLACES=218, PETRI_TRANSITIONS=215} [2025-01-09 21:27:14,455 INFO L279 CegarLoopForPetriNet]: 218 programPoint places, 0 predicate places. [2025-01-09 21:27:14,455 INFO L471 AbstractCegarLoop]: Abstraction has has 218 places, 215 transitions, 445 flow [2025-01-09 21:27:14,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 200.33333333333334) internal successors, (601), 3 states have internal predecessors, (601), 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:27:14,455 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:27:14,455 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:27:14,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:27:14,456 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-01-09 21:27:14,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:27:14,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1403987935, now seen corresponding path program 1 times [2025-01-09 21:27:14,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:27:14,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895050518] [2025-01-09 21:27:14,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:27:14,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:27:14,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 21:27:14,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 21:27:14,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:14,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:27:14,526 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:27:14,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:27:14,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895050518] [2025-01-09 21:27:14,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895050518] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:27:14,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:27:14,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:27:14,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893119453] [2025-01-09 21:27:14,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:27:14,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:27:14,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:27:14,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:27:14,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:27:14,547 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 228 [2025-01-09 21:27:14,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 215 transitions, 445 flow. Second operand has 3 states, 3 states have (on average 195.66666666666666) internal successors, (587), 3 states have internal predecessors, (587), 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:27:14,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:27:14,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 228 [2025-01-09 21:27:14,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:27:14,677 INFO L124 PetriNetUnfolderBase]: 110/904 cut-off events. [2025-01-09 21:27:14,678 INFO L125 PetriNetUnfolderBase]: For 14/20 co-relation queries the response was YES. [2025-01-09 21:27:14,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1158 conditions, 904 events. 110/904 cut-off events. For 14/20 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 4320 event pairs, 34 based on Foata normal form. 1/833 useless extension candidates. Maximal degree in co-relation 1052. Up to 133 conditions per place. [2025-01-09 21:27:14,681 INFO L140 encePairwiseOnDemand]: 219/228 looper letters, 30 selfloop transitions, 6 changer transitions 0/228 dead transitions. [2025-01-09 21:27:14,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 228 transitions, 546 flow [2025-01-09 21:27:14,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:27:14,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:27:14,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 621 transitions. [2025-01-09 21:27:14,685 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9078947368421053 [2025-01-09 21:27:14,686 INFO L175 Difference]: Start difference. First operand has 218 places, 215 transitions, 445 flow. Second operand 3 states and 621 transitions. [2025-01-09 21:27:14,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 228 transitions, 546 flow [2025-01-09 21:27:14,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 228 transitions, 542 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:27:14,691 INFO L231 Difference]: Finished difference. Result has 218 places, 217 transitions, 479 flow [2025-01-09 21:27:14,692 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=479, PETRI_PLACES=218, PETRI_TRANSITIONS=217} [2025-01-09 21:27:14,693 INFO L279 CegarLoopForPetriNet]: 218 programPoint places, 0 predicate places. [2025-01-09 21:27:14,693 INFO L471 AbstractCegarLoop]: Abstraction has has 218 places, 217 transitions, 479 flow [2025-01-09 21:27:14,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 195.66666666666666) internal successors, (587), 3 states have internal predecessors, (587), 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:27:14,694 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:27:14,694 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:14,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:27:14,694 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-01-09 21:27:14,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:27:14,695 INFO L85 PathProgramCache]: Analyzing trace with hash -615440164, now seen corresponding path program 1 times [2025-01-09 21:27:14,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:27:14,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266287244] [2025-01-09 21:27:14,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:27:14,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:27:14,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 21:27:14,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 21:27:14,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:14,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:27:14,731 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:27:14,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 21:27:14,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 21:27:14,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:14,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:27:14,784 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:27:14,784 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:27:14,785 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2025-01-09 21:27:14,787 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2025-01-09 21:27:14,787 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2025-01-09 21:27:14,787 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2025-01-09 21:27:14,788 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2025-01-09 21:27:14,788 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2025-01-09 21:27:14,788 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2025-01-09 21:27:14,788 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2025-01-09 21:27:14,788 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2025-01-09 21:27:14,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:27:14,789 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:27:14,790 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:27:14,790 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-09 21:27:14,813 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 21:27:14,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 247 places, 260 transitions, 536 flow [2025-01-09 21:27:14,885 INFO L124 PetriNetUnfolderBase]: 35/501 cut-off events. [2025-01-09 21:27:14,885 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:27:14,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 513 conditions, 501 events. 35/501 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1821 event pairs, 0 based on Foata normal form. 0/441 useless extension candidates. Maximal degree in co-relation 337. Up to 9 conditions per place. [2025-01-09 21:27:14,887 INFO L82 GeneralOperation]: Start removeDead. Operand has 247 places, 260 transitions, 536 flow [2025-01-09 21:27:14,891 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 247 places, 260 transitions, 536 flow [2025-01-09 21:27:14,891 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:27:14,894 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;@68a9c26e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:27:14,894 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-01-09 21:27:14,901 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:27:14,902 INFO L124 PetriNetUnfolderBase]: 0/106 cut-off events. [2025-01-09 21:27:14,902 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:27:14,902 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:27:14,902 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:27:14,902 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-01-09 21:27:14,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:27:14,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1876618952, now seen corresponding path program 1 times [2025-01-09 21:27:14,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:27:14,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725819087] [2025-01-09 21:27:14,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:27:14,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:27:14,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 21:27:14,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 21:27:14,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:14,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:27:15,241 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:27:15,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:27:15,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725819087] [2025-01-09 21:27:15,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725819087] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:27:15,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:27:15,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:27:15,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137061612] [2025-01-09 21:27:15,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:27:15,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:27:15,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:27:15,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:27:15,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:27:15,348 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 260 [2025-01-09 21:27:15,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 260 transitions, 536 flow. Second operand has 6 states, 6 states have (on average 209.5) internal successors, (1257), 6 states have internal predecessors, (1257), 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:27:15,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:27:15,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 260 [2025-01-09 21:27:15,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:27:15,875 INFO L124 PetriNetUnfolderBase]: 1001/4650 cut-off events. [2025-01-09 21:27:15,875 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-01-09 21:27:15,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6309 conditions, 4650 events. 1001/4650 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 43074 event pairs, 108 based on Foata normal form. 817/5134 useless extension candidates. Maximal degree in co-relation 1068. Up to 1202 conditions per place. [2025-01-09 21:27:15,894 INFO L140 encePairwiseOnDemand]: 240/260 looper letters, 62 selfloop transitions, 5 changer transitions 0/273 dead transitions. [2025-01-09 21:27:15,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 273 transitions, 696 flow [2025-01-09 21:27:15,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:27:15,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:27:15,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1362 transitions. [2025-01-09 21:27:15,898 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8730769230769231 [2025-01-09 21:27:15,898 INFO L175 Difference]: Start difference. First operand has 247 places, 260 transitions, 536 flow. Second operand 6 states and 1362 transitions. [2025-01-09 21:27:15,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 273 transitions, 696 flow [2025-01-09 21:27:15,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 273 transitions, 696 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:27:15,903 INFO L231 Difference]: Finished difference. Result has 247 places, 241 transitions, 508 flow [2025-01-09 21:27:15,904 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=498, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=508, PETRI_PLACES=247, PETRI_TRANSITIONS=241} [2025-01-09 21:27:15,905 INFO L279 CegarLoopForPetriNet]: 247 programPoint places, 0 predicate places. [2025-01-09 21:27:15,905 INFO L471 AbstractCegarLoop]: Abstraction has has 247 places, 241 transitions, 508 flow [2025-01-09 21:27:15,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 209.5) internal successors, (1257), 6 states have internal predecessors, (1257), 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:27:15,906 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:27:15,908 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:27:15,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:27:15,908 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-01-09 21:27:15,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:27:15,908 INFO L85 PathProgramCache]: Analyzing trace with hash 152883184, now seen corresponding path program 1 times [2025-01-09 21:27:15,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:27:15,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514362190] [2025-01-09 21:27:15,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:27:15,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:27:15,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 21:27:15,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 21:27:15,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:15,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:27:15,965 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:27:15,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:27:15,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514362190] [2025-01-09 21:27:15,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514362190] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:27:15,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:27:15,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:27:15,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549049117] [2025-01-09 21:27:15,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:27:15,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:27:15,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:27:15,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:27:15,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:27:15,990 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 260 [2025-01-09 21:27:15,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 241 transitions, 508 flow. Second operand has 3 states, 3 states have (on average 221.33333333333334) internal successors, (664), 3 states have internal predecessors, (664), 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:27:15,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:27:15,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 260 [2025-01-09 21:27:15,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:27:16,254 INFO L124 PetriNetUnfolderBase]: 494/2832 cut-off events. [2025-01-09 21:27:16,255 INFO L125 PetriNetUnfolderBase]: For 92/99 co-relation queries the response was YES. [2025-01-09 21:27:16,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3746 conditions, 2832 events. 494/2832 cut-off events. For 92/99 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 24166 event pairs, 338 based on Foata normal form. 1/2589 useless extension candidates. Maximal degree in co-relation 1671. Up to 817 conditions per place. [2025-01-09 21:27:16,267 INFO L140 encePairwiseOnDemand]: 257/260 looper letters, 27 selfloop transitions, 2 changer transitions 0/246 dead transitions. [2025-01-09 21:27:16,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 246 transitions, 578 flow [2025-01-09 21:27:16,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:27:16,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:27:16,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 690 transitions. [2025-01-09 21:27:16,269 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8846153846153846 [2025-01-09 21:27:16,269 INFO L175 Difference]: Start difference. First operand has 247 places, 241 transitions, 508 flow. Second operand 3 states and 690 transitions. [2025-01-09 21:27:16,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 246 transitions, 578 flow [2025-01-09 21:27:16,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 246 transitions, 566 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:27:16,274 INFO L231 Difference]: Finished difference. Result has 245 places, 242 transitions, 510 flow [2025-01-09 21:27:16,275 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=498, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=510, PETRI_PLACES=245, PETRI_TRANSITIONS=242} [2025-01-09 21:27:16,276 INFO L279 CegarLoopForPetriNet]: 247 programPoint places, -2 predicate places. [2025-01-09 21:27:16,276 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 242 transitions, 510 flow [2025-01-09 21:27:16,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 221.33333333333334) internal successors, (664), 3 states have internal predecessors, (664), 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:27:16,277 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:27:16,277 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:27:16,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:27:16,277 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-01-09 21:27:16,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:27:16,278 INFO L85 PathProgramCache]: Analyzing trace with hash -2083937535, now seen corresponding path program 1 times [2025-01-09 21:27:16,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:27:16,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200360336] [2025-01-09 21:27:16,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:27:16,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:27:16,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 21:27:16,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 21:27:16,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:16,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:27:16,318 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:27:16,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:27:16,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200360336] [2025-01-09 21:27:16,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200360336] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:27:16,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:27:16,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:27:16,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086870957] [2025-01-09 21:27:16,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:27:16,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:27:16,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:27:16,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:27:16,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:27:16,337 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 260 [2025-01-09 21:27:16,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 242 transitions, 510 flow. Second operand has 3 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 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:27:16,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:27:16,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 260 [2025-01-09 21:27:16,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:27:17,158 INFO L124 PetriNetUnfolderBase]: 2100/8616 cut-off events. [2025-01-09 21:27:17,159 INFO L125 PetriNetUnfolderBase]: For 280/415 co-relation queries the response was YES. [2025-01-09 21:27:17,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12121 conditions, 8616 events. 2100/8616 cut-off events. For 280/415 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 85190 event pairs, 755 based on Foata normal form. 8/7826 useless extension candidates. Maximal degree in co-relation 12014. Up to 2123 conditions per place. [2025-01-09 21:27:17,189 INFO L140 encePairwiseOnDemand]: 248/260 looper letters, 45 selfloop transitions, 8 changer transitions 0/263 dead transitions. [2025-01-09 21:27:17,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 263 transitions, 669 flow [2025-01-09 21:27:17,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:27:17,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:27:17,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 693 transitions. [2025-01-09 21:27:17,191 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8884615384615384 [2025-01-09 21:27:17,191 INFO L175 Difference]: Start difference. First operand has 245 places, 242 transitions, 510 flow. Second operand 3 states and 693 transitions. [2025-01-09 21:27:17,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 263 transitions, 669 flow [2025-01-09 21:27:17,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 263 transitions, 667 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:27:17,194 INFO L231 Difference]: Finished difference. Result has 246 places, 246 transitions, 564 flow [2025-01-09 21:27:17,195 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=564, PETRI_PLACES=246, PETRI_TRANSITIONS=246} [2025-01-09 21:27:17,195 INFO L279 CegarLoopForPetriNet]: 247 programPoint places, -1 predicate places. [2025-01-09 21:27:17,195 INFO L471 AbstractCegarLoop]: Abstraction has has 246 places, 246 transitions, 564 flow [2025-01-09 21:27:17,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 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:27:17,196 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:27:17,196 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:27:17,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:27:17,196 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-01-09 21:27:17,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:27:17,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1505640521, now seen corresponding path program 1 times [2025-01-09 21:27:17,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:27:17,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878030856] [2025-01-09 21:27:17,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:27:17,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:27:17,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 21:27:17,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 21:27:17,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:17,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:27:17,271 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:27:17,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:27:17,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878030856] [2025-01-09 21:27:17,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878030856] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:27:17,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:27:17,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:27:17,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804131182] [2025-01-09 21:27:17,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:27:17,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:27:17,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:27:17,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:27:17,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:27:17,316 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 260 [2025-01-09 21:27:17,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 246 transitions, 564 flow. Second operand has 5 states, 5 states have (on average 219.6) internal successors, (1098), 5 states have internal predecessors, (1098), 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:27:17,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:27:17,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 260 [2025-01-09 21:27:17,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:27:18,122 INFO L124 PetriNetUnfolderBase]: 1393/8631 cut-off events. [2025-01-09 21:27:18,122 INFO L125 PetriNetUnfolderBase]: For 381/393 co-relation queries the response was YES. [2025-01-09 21:27:18,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11451 conditions, 8631 events. 1393/8631 cut-off events. For 381/393 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 89602 event pairs, 415 based on Foata normal form. 5/7929 useless extension candidates. Maximal degree in co-relation 5199. Up to 1757 conditions per place. [2025-01-09 21:27:18,151 INFO L140 encePairwiseOnDemand]: 255/260 looper letters, 44 selfloop transitions, 5 changer transitions 0/268 dead transitions. [2025-01-09 21:27:18,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 268 transitions, 706 flow [2025-01-09 21:27:18,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:27:18,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:27:18,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1358 transitions. [2025-01-09 21:27:18,158 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8705128205128205 [2025-01-09 21:27:18,158 INFO L175 Difference]: Start difference. First operand has 246 places, 246 transitions, 564 flow. Second operand 6 states and 1358 transitions. [2025-01-09 21:27:18,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 268 transitions, 706 flow [2025-01-09 21:27:18,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 268 transitions, 690 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:27:18,163 INFO L231 Difference]: Finished difference. Result has 252 places, 248 transitions, 574 flow [2025-01-09 21:27:18,163 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=574, PETRI_PLACES=252, PETRI_TRANSITIONS=248} [2025-01-09 21:27:18,163 INFO L279 CegarLoopForPetriNet]: 247 programPoint places, 5 predicate places. [2025-01-09 21:27:18,164 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 248 transitions, 574 flow [2025-01-09 21:27:18,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 219.6) internal successors, (1098), 5 states have internal predecessors, (1098), 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:27:18,164 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:27:18,164 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:18,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:27:18,165 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-01-09 21:27:18,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:27:18,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1648558364, now seen corresponding path program 1 times [2025-01-09 21:27:18,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:27:18,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047716769] [2025-01-09 21:27:18,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:27:18,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:27:18,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 21:27:18,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 21:27:18,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:18,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:27:18,187 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:27:18,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 21:27:18,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 21:27:18,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:18,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:27:18,215 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:27:18,215 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:27:18,215 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-01-09 21:27:18,215 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2025-01-09 21:27:18,215 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2025-01-09 21:27:18,215 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2025-01-09 21:27:18,215 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2025-01-09 21:27:18,215 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2025-01-09 21:27:18,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2025-01-09 21:27:18,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2025-01-09 21:27:18,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2025-01-09 21:27:18,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2025-01-09 21:27:18,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:27:18,216 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-01-09 21:27:18,216 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:27:18,217 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-09 21:27:18,234 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 21:27:18,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 276 places, 292 transitions, 611 flow [2025-01-09 21:27:18,276 INFO L124 PetriNetUnfolderBase]: 52/710 cut-off events. [2025-01-09 21:27:18,277 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-01-09 21:27:18,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 735 conditions, 710 events. 52/710 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2917 event pairs, 1 based on Foata normal form. 0/623 useless extension candidates. Maximal degree in co-relation 509. Up to 12 conditions per place. [2025-01-09 21:27:18,279 INFO L82 GeneralOperation]: Start removeDead. Operand has 276 places, 292 transitions, 611 flow [2025-01-09 21:27:18,281 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 276 places, 292 transitions, 611 flow [2025-01-09 21:27:18,282 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:27:18,282 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;@68a9c26e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:27:18,282 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-01-09 21:27:18,286 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:27:18,286 INFO L124 PetriNetUnfolderBase]: 0/106 cut-off events. [2025-01-09 21:27:18,286 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:27:18,286 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:27:18,286 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:27:18,286 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-01-09 21:27:18,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:27:18,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1595064264, now seen corresponding path program 1 times [2025-01-09 21:27:18,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:27:18,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838739623] [2025-01-09 21:27:18,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:27:18,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:27:18,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 21:27:18,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 21:27:18,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:18,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:27:18,819 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:27:18,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:27:18,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838739623] [2025-01-09 21:27:18,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838739623] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:27:18,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:27:18,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:27:18,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003374619] [2025-01-09 21:27:18,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:27:18,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:27:18,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:27:18,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:27:18,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:27:18,891 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 292 [2025-01-09 21:27:18,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 292 transitions, 611 flow. Second operand has 6 states, 6 states have (on average 230.5) internal successors, (1383), 6 states have internal predecessors, (1383), 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:27:18,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:27:18,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 292 [2025-01-09 21:27:18,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:27:21,508 INFO L124 PetriNetUnfolderBase]: 8120/27179 cut-off events. [2025-01-09 21:27:21,509 INFO L125 PetriNetUnfolderBase]: For 557/557 co-relation queries the response was YES. [2025-01-09 21:27:21,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38914 conditions, 27179 events. 8120/27179 cut-off events. For 557/557 co-relation queries the response was YES. Maximal size of possible extension queue 749. Compared 327988 event pairs, 710 based on Foata normal form. 6291/31670 useless extension candidates. Maximal degree in co-relation 6339. Up to 8631 conditions per place. [2025-01-09 21:27:21,623 INFO L140 encePairwiseOnDemand]: 268/292 looper letters, 84 selfloop transitions, 5 changer transitions 0/315 dead transitions. [2025-01-09 21:27:21,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 315 transitions, 835 flow [2025-01-09 21:27:21,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:27:21,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:27:21,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1530 transitions. [2025-01-09 21:27:21,629 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8732876712328768 [2025-01-09 21:27:21,629 INFO L175 Difference]: Start difference. First operand has 276 places, 292 transitions, 611 flow. Second operand 6 states and 1530 transitions. [2025-01-09 21:27:21,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 315 transitions, 835 flow [2025-01-09 21:27:21,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 315 transitions, 835 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:27:21,633 INFO L231 Difference]: Finished difference. Result has 274 places, 267 transitions, 571 flow [2025-01-09 21:27:21,633 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=292, PETRI_DIFFERENCE_MINUEND_FLOW=561, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=571, PETRI_PLACES=274, PETRI_TRANSITIONS=267} [2025-01-09 21:27:21,634 INFO L279 CegarLoopForPetriNet]: 276 programPoint places, -2 predicate places. [2025-01-09 21:27:21,634 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 267 transitions, 571 flow [2025-01-09 21:27:21,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 230.5) internal successors, (1383), 6 states have internal predecessors, (1383), 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:27:21,634 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:27:21,634 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:27:21,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:27:21,635 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-01-09 21:27:21,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:27:21,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1351729185, now seen corresponding path program 1 times [2025-01-09 21:27:21,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:27:21,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464293689] [2025-01-09 21:27:21,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:27:21,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:27:21,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 21:27:21,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 21:27:21,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:21,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:27:21,668 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:27:21,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:27:21,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464293689] [2025-01-09 21:27:21,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464293689] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:27:21,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:27:21,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:27:21,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299925321] [2025-01-09 21:27:21,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:27:21,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:27:21,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:27:21,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:27:21,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:27:21,690 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 292 [2025-01-09 21:27:21,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 267 transitions, 571 flow. Second operand has 3 states, 3 states have (on average 231.66666666666666) internal successors, (695), 3 states have internal predecessors, (695), 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:27:21,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:27:21,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 292 [2025-01-09 21:27:21,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:27:29,778 INFO L124 PetriNetUnfolderBase]: 27267/82271 cut-off events. [2025-01-09 21:27:29,779 INFO L125 PetriNetUnfolderBase]: For 3065/4966 co-relation queries the response was YES. [2025-01-09 21:27:29,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121909 conditions, 82271 events. 27267/82271 cut-off events. For 3065/4966 co-relation queries the response was YES. Maximal size of possible extension queue 1773. Compared 1094421 event pairs, 10774 based on Foata normal form. 32/74598 useless extension candidates. Maximal degree in co-relation 109328. Up to 25188 conditions per place. [2025-01-09 21:27:30,311 INFO L140 encePairwiseOnDemand]: 277/292 looper letters, 60 selfloop transitions, 10 changer transitions 0/296 dead transitions. [2025-01-09 21:27:30,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 296 transitions, 790 flow [2025-01-09 21:27:30,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:27:30,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:27:30,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 765 transitions. [2025-01-09 21:27:30,313 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8732876712328768 [2025-01-09 21:27:30,313 INFO L175 Difference]: Start difference. First operand has 274 places, 267 transitions, 571 flow. Second operand 3 states and 765 transitions. [2025-01-09 21:27:30,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 296 transitions, 790 flow [2025-01-09 21:27:30,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 296 transitions, 780 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:27:30,322 INFO L231 Difference]: Finished difference. Result has 271 places, 273 transitions, 635 flow [2025-01-09 21:27:30,323 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=292, PETRI_DIFFERENCE_MINUEND_FLOW=557, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=635, PETRI_PLACES=271, PETRI_TRANSITIONS=273} [2025-01-09 21:27:30,323 INFO L279 CegarLoopForPetriNet]: 276 programPoint places, -5 predicate places. [2025-01-09 21:27:30,323 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 273 transitions, 635 flow [2025-01-09 21:27:30,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.66666666666666) internal successors, (695), 3 states have internal predecessors, (695), 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:27:30,324 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:27:30,324 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:27:30,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:27:30,324 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-01-09 21:27:30,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:27:30,324 INFO L85 PathProgramCache]: Analyzing trace with hash 949735664, now seen corresponding path program 1 times [2025-01-09 21:27:30,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:27:30,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147187873] [2025-01-09 21:27:30,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:27:30,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:27:30,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 21:27:30,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 21:27:30,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:30,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:27:30,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:27:30,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:27:30,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147187873] [2025-01-09 21:27:30,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147187873] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:27:30,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:27:30,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:27:30,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520552380] [2025-01-09 21:27:30,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:27:30,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:27:30,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:27:30,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:27:30,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:27:30,381 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 292 [2025-01-09 21:27:30,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 273 transitions, 635 flow. Second operand has 3 states, 3 states have (on average 242.33333333333334) internal successors, (727), 3 states have internal predecessors, (727), 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:27:30,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:27:30,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 292 [2025-01-09 21:27:30,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:27:36,545 INFO L124 PetriNetUnfolderBase]: 16115/65598 cut-off events. [2025-01-09 21:27:36,545 INFO L125 PetriNetUnfolderBase]: For 4280/5638 co-relation queries the response was YES. [2025-01-09 21:27:36,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94577 conditions, 65598 events. 16115/65598 cut-off events. For 4280/5638 co-relation queries the response was YES. Maximal size of possible extension queue 1313. Compared 935450 event pairs, 9055 based on Foata normal form. 1/59281 useless extension candidates. Maximal degree in co-relation 41123. Up to 19175 conditions per place. [2025-01-09 21:27:36,898 INFO L140 encePairwiseOnDemand]: 289/292 looper letters, 33 selfloop transitions, 2 changer transitions 0/278 dead transitions. [2025-01-09 21:27:36,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 278 transitions, 715 flow [2025-01-09 21:27:36,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:27:36,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:27:36,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 759 transitions. [2025-01-09 21:27:36,900 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8664383561643836 [2025-01-09 21:27:36,900 INFO L175 Difference]: Start difference. First operand has 271 places, 273 transitions, 635 flow. Second operand 3 states and 759 transitions. [2025-01-09 21:27:36,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 278 transitions, 715 flow [2025-01-09 21:27:36,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 278 transitions, 695 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:27:36,934 INFO L231 Difference]: Finished difference. Result has 272 places, 274 transitions, 627 flow [2025-01-09 21:27:36,935 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=292, PETRI_DIFFERENCE_MINUEND_FLOW=615, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=627, PETRI_PLACES=272, PETRI_TRANSITIONS=274} [2025-01-09 21:27:36,936 INFO L279 CegarLoopForPetriNet]: 276 programPoint places, -4 predicate places. [2025-01-09 21:27:36,936 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 274 transitions, 627 flow [2025-01-09 21:27:36,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 242.33333333333334) internal successors, (727), 3 states have internal predecessors, (727), 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:27:36,936 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:27:36,937 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:27:36,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:27:36,937 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-01-09 21:27:36,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:27:36,941 INFO L85 PathProgramCache]: Analyzing trace with hash -2144944277, now seen corresponding path program 1 times [2025-01-09 21:27:36,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:27:36,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829809360] [2025-01-09 21:27:36,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:27:36,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:27:36,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 21:27:36,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 21:27:36,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:36,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:27:37,014 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:27:37,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:27:37,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829809360] [2025-01-09 21:27:37,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829809360] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:27:37,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:27:37,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:27:37,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491250748] [2025-01-09 21:27:37,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:27:37,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:27:37,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:27:37,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:27:37,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:27:37,039 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 239 out of 292 [2025-01-09 21:27:37,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 274 transitions, 627 flow. Second operand has 5 states, 5 states have (on average 240.6) internal successors, (1203), 5 states have internal predecessors, (1203), 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:27:37,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:27:37,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 239 of 292 [2025-01-09 21:27:37,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:27:44,468 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1135] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= |v_t_funThread2of3ForFork0_#t~ret18#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread2of3ForFork0_#t~ret18#1=|v_t_funThread2of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of3ForFork0_#t~ret18#1][178], [Black: 285#true, 111#L715-12true, 277#true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 294#true, 102#L715-5true, 290#true, 97#L715-12true, 275#true, 105#L708-3true, 273#true]) [2025-01-09 21:27:44,468 INFO L294 olderBase$Statistics]: this new event has 232 ancestors and is cut-off event [2025-01-09 21:27:44,468 INFO L297 olderBase$Statistics]: existing Event has 232 ancestors and is cut-off event [2025-01-09 21:27:44,468 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2025-01-09 21:27:44,468 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2025-01-09 21:27:44,469 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1165] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][239], [Black: 285#true, 277#true, 156#L715-5true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 294#true, 290#true, 97#L715-12true, 275#true, 105#L708-3true, 273#true, 158#L715-12true]) [2025-01-09 21:27:44,469 INFO L294 olderBase$Statistics]: this new event has 232 ancestors and is cut-off event [2025-01-09 21:27:44,469 INFO L297 olderBase$Statistics]: existing Event has 232 ancestors and is cut-off event [2025-01-09 21:27:44,469 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2025-01-09 21:27:44,469 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2025-01-09 21:27:44,469 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1165] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][239], [Black: 285#true, 277#true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 294#true, 213#L715-6true, 290#true, 97#L715-12true, 275#true, 105#L708-3true, 273#true, 158#L715-12true]) [2025-01-09 21:27:44,469 INFO L294 olderBase$Statistics]: this new event has 233 ancestors and is cut-off event [2025-01-09 21:27:44,469 INFO L297 olderBase$Statistics]: existing Event has 233 ancestors and is cut-off event [2025-01-09 21:27:44,469 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2025-01-09 21:27:44,469 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2025-01-09 21:27:44,531 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1135] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= |v_t_funThread2of3ForFork0_#t~ret18#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread2of3ForFork0_#t~ret18#1=|v_t_funThread2of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of3ForFork0_#t~ret18#1][178], [214#ULTIMATE.startFINALtrue, Black: 285#true, 111#L715-12true, 277#true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 294#true, 102#L715-5true, 290#true, 97#L715-12true, 275#true, 273#true]) [2025-01-09 21:27:44,531 INFO L294 olderBase$Statistics]: this new event has 233 ancestors and is cut-off event [2025-01-09 21:27:44,531 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2025-01-09 21:27:44,532 INFO L297 olderBase$Statistics]: existing Event has 233 ancestors and is cut-off event [2025-01-09 21:27:44,532 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2025-01-09 21:27:44,532 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1165] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][239], [214#ULTIMATE.startFINALtrue, Black: 285#true, 277#true, 156#L715-5true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 294#true, 290#true, 97#L715-12true, 275#true, 273#true, 158#L715-12true]) [2025-01-09 21:27:44,532 INFO L294 olderBase$Statistics]: this new event has 233 ancestors and is cut-off event [2025-01-09 21:27:44,532 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2025-01-09 21:27:44,532 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2025-01-09 21:27:44,532 INFO L297 olderBase$Statistics]: existing Event has 233 ancestors and is cut-off event [2025-01-09 21:27:44,532 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1165] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][239], [Black: 285#true, 214#ULTIMATE.startFINALtrue, 277#true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 294#true, 213#L715-6true, 290#true, 97#L715-12true, 275#true, 273#true, 158#L715-12true]) [2025-01-09 21:27:44,532 INFO L294 olderBase$Statistics]: this new event has 234 ancestors and is cut-off event [2025-01-09 21:27:44,532 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2025-01-09 21:27:44,532 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2025-01-09 21:27:44,532 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-01-09 21:27:44,633 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1135] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= |v_t_funThread2of3ForFork0_#t~ret18#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread2of3ForFork0_#t~ret18#1=|v_t_funThread2of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of3ForFork0_#t~ret18#1][178], [Black: 285#true, 111#L715-12true, 277#true, 154#L716-2true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 294#true, 102#L715-5true, 290#true, 105#L708-3true, 275#true, 273#true]) [2025-01-09 21:27:44,633 INFO L294 olderBase$Statistics]: this new event has 235 ancestors and is cut-off event [2025-01-09 21:27:44,633 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-01-09 21:27:44,633 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is cut-off event [2025-01-09 21:27:44,633 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is cut-off event [2025-01-09 21:27:44,633 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1165] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][239], [Black: 285#true, 277#true, 154#L716-2true, 156#L715-5true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 294#true, 290#true, 105#L708-3true, 275#true, 273#true, 158#L715-12true]) [2025-01-09 21:27:44,633 INFO L294 olderBase$Statistics]: this new event has 235 ancestors and is cut-off event [2025-01-09 21:27:44,633 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-01-09 21:27:44,633 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is cut-off event [2025-01-09 21:27:44,633 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is cut-off event [2025-01-09 21:27:44,634 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1165] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][239], [Black: 285#true, 277#true, 154#L716-2true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 294#true, 213#L715-6true, 290#true, 105#L708-3true, 275#true, 273#true, 158#L715-12true]) [2025-01-09 21:27:44,634 INFO L294 olderBase$Statistics]: this new event has 236 ancestors and is cut-off event [2025-01-09 21:27:44,634 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2025-01-09 21:27:44,634 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2025-01-09 21:27:44,634 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2025-01-09 21:27:44,640 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1135] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= |v_t_funThread2of3ForFork0_#t~ret18#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread2of3ForFork0_#t~ret18#1=|v_t_funThread2of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of3ForFork0_#t~ret18#1][178], [Black: 285#true, 111#L715-12true, 277#true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 294#true, 102#L715-5true, 290#true, 118#L709-3true, 97#L715-12true, 275#true, 273#true]) [2025-01-09 21:27:44,640 INFO L294 olderBase$Statistics]: this new event has 235 ancestors and is cut-off event [2025-01-09 21:27:44,640 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is cut-off event [2025-01-09 21:27:44,640 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is cut-off event [2025-01-09 21:27:44,640 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-01-09 21:27:44,640 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1165] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][239], [Black: 285#true, 277#true, 156#L715-5true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 294#true, 290#true, 118#L709-3true, 97#L715-12true, 275#true, 273#true, 158#L715-12true]) [2025-01-09 21:27:44,640 INFO L294 olderBase$Statistics]: this new event has 235 ancestors and is cut-off event [2025-01-09 21:27:44,640 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is cut-off event [2025-01-09 21:27:44,640 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is cut-off event [2025-01-09 21:27:44,640 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-01-09 21:27:44,640 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1165] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][239], [Black: 285#true, 277#true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 294#true, 213#L715-6true, 290#true, 118#L709-3true, 97#L715-12true, 275#true, 273#true, 158#L715-12true]) [2025-01-09 21:27:44,640 INFO L294 olderBase$Statistics]: this new event has 236 ancestors and is cut-off event [2025-01-09 21:27:44,641 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2025-01-09 21:27:44,641 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2025-01-09 21:27:44,641 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2025-01-09 21:27:44,678 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1135] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= |v_t_funThread2of3ForFork0_#t~ret18#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread2of3ForFork0_#t~ret18#1=|v_t_funThread2of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of3ForFork0_#t~ret18#1][178], [Black: 285#true, 214#ULTIMATE.startFINALtrue, 111#L715-12true, 277#true, 154#L716-2true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 294#true, 102#L715-5true, 290#true, 275#true, 273#true]) [2025-01-09 21:27:44,678 INFO L294 olderBase$Statistics]: this new event has 236 ancestors and is cut-off event [2025-01-09 21:27:44,678 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2025-01-09 21:27:44,678 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2025-01-09 21:27:44,678 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2025-01-09 21:27:44,678 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1165] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][239], [214#ULTIMATE.startFINALtrue, Black: 285#true, 277#true, 154#L716-2true, 156#L715-5true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 294#true, 290#true, 275#true, 273#true, 158#L715-12true]) [2025-01-09 21:27:44,678 INFO L294 olderBase$Statistics]: this new event has 236 ancestors and is cut-off event [2025-01-09 21:27:44,679 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2025-01-09 21:27:44,679 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2025-01-09 21:27:44,679 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2025-01-09 21:27:44,679 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1165] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][239], [Black: 285#true, 214#ULTIMATE.startFINALtrue, 277#true, 154#L716-2true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 294#true, 213#L715-6true, 290#true, 275#true, 273#true, 158#L715-12true]) [2025-01-09 21:27:44,679 INFO L294 olderBase$Statistics]: this new event has 237 ancestors and is cut-off event [2025-01-09 21:27:44,679 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2025-01-09 21:27:44,679 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2025-01-09 21:27:44,679 INFO L297 olderBase$Statistics]: existing Event has 237 ancestors and is cut-off event [2025-01-09 21:27:44,686 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([927] L709-4-->L709-5: Formula: (= |v_#race~glob~0_1| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_1|} AuxVars[] AssignedVars[#race~glob~0][242], [Black: 285#true, 277#true, 189#L709-5true, 61#L715-6true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 294#true, 213#L715-6true, 290#true, 97#L715-12true, 275#true, 273#true]) [2025-01-09 21:27:44,686 INFO L294 olderBase$Statistics]: this new event has 231 ancestors and is cut-off event [2025-01-09 21:27:44,687 INFO L297 olderBase$Statistics]: existing Event has 174 ancestors and is cut-off event [2025-01-09 21:27:44,687 INFO L297 olderBase$Statistics]: existing Event has 231 ancestors and is cut-off event [2025-01-09 21:27:44,687 INFO L297 olderBase$Statistics]: existing Event has 174 ancestors and is cut-off event [2025-01-09 21:27:44,687 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([927] L709-4-->L709-5: Formula: (= |v_#race~glob~0_1| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_1|} AuxVars[] AssignedVars[#race~glob~0][242], [Black: 285#true, 277#true, 189#L709-5true, 156#L715-5true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 294#true, 102#L715-5true, 290#true, 97#L715-12true, 275#true, 273#true]) [2025-01-09 21:27:44,687 INFO L294 olderBase$Statistics]: this new event has 229 ancestors and is cut-off event [2025-01-09 21:27:44,687 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is cut-off event [2025-01-09 21:27:44,687 INFO L297 olderBase$Statistics]: existing Event has 229 ancestors and is cut-off event [2025-01-09 21:27:44,687 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is cut-off event [2025-01-09 21:27:44,687 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([927] L709-4-->L709-5: Formula: (= |v_#race~glob~0_1| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_1|} AuxVars[] AssignedVars[#race~glob~0][242], [Black: 285#true, 277#true, 189#L709-5true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 294#true, 102#L715-5true, 213#L715-6true, 290#true, 97#L715-12true, 275#true, 273#true]) [2025-01-09 21:27:44,687 INFO L294 olderBase$Statistics]: this new event has 230 ancestors and is cut-off event [2025-01-09 21:27:44,687 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2025-01-09 21:27:44,687 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2025-01-09 21:27:44,687 INFO L297 olderBase$Statistics]: existing Event has 230 ancestors and is cut-off event [2025-01-09 21:27:44,687 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([927] L709-4-->L709-5: Formula: (= |v_#race~glob~0_1| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_1|} AuxVars[] AssignedVars[#race~glob~0][242], [Black: 285#true, 277#true, 189#L709-5true, 156#L715-5true, 61#L715-6true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 294#true, 290#true, 97#L715-12true, 275#true, 273#true]) [2025-01-09 21:27:44,687 INFO L294 olderBase$Statistics]: this new event has 230 ancestors and is cut-off event [2025-01-09 21:27:44,687 INFO L297 olderBase$Statistics]: existing Event has 230 ancestors and is cut-off event [2025-01-09 21:27:44,687 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2025-01-09 21:27:44,687 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2025-01-09 21:27:44,760 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1135] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= |v_t_funThread2of3ForFork0_#t~ret18#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread2of3ForFork0_#t~ret18#1=|v_t_funThread2of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of3ForFork0_#t~ret18#1][178], [Black: 285#true, 111#L715-12true, 277#true, 154#L716-2true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 294#true, 102#L715-5true, 290#true, 118#L709-3true, 275#true, 273#true]) [2025-01-09 21:27:44,760 INFO L294 olderBase$Statistics]: this new event has 238 ancestors and is cut-off event [2025-01-09 21:27:44,760 INFO L297 olderBase$Statistics]: existing Event has 181 ancestors and is cut-off event [2025-01-09 21:27:44,760 INFO L297 olderBase$Statistics]: existing Event has 181 ancestors and is cut-off event [2025-01-09 21:27:44,760 INFO L297 olderBase$Statistics]: existing Event has 238 ancestors and is cut-off event [2025-01-09 21:27:44,760 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1165] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][239], [Black: 285#true, 277#true, 154#L716-2true, 156#L715-5true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 294#true, 290#true, 118#L709-3true, 275#true, 273#true, 158#L715-12true]) [2025-01-09 21:27:44,760 INFO L294 olderBase$Statistics]: this new event has 238 ancestors and is cut-off event [2025-01-09 21:27:44,760 INFO L297 olderBase$Statistics]: existing Event has 238 ancestors and is cut-off event [2025-01-09 21:27:44,760 INFO L297 olderBase$Statistics]: existing Event has 181 ancestors and is cut-off event [2025-01-09 21:27:44,760 INFO L297 olderBase$Statistics]: existing Event has 181 ancestors and is cut-off event [2025-01-09 21:27:44,761 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1165] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][239], [Black: 285#true, 277#true, 154#L716-2true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 294#true, 213#L715-6true, 290#true, 118#L709-3true, 275#true, 273#true, 158#L715-12true]) [2025-01-09 21:27:44,761 INFO L294 olderBase$Statistics]: this new event has 239 ancestors and is cut-off event [2025-01-09 21:27:44,761 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2025-01-09 21:27:44,761 INFO L297 olderBase$Statistics]: existing Event has 182 ancestors and is cut-off event [2025-01-09 21:27:44,761 INFO L297 olderBase$Statistics]: existing Event has 182 ancestors and is cut-off event [2025-01-09 21:27:44,794 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([927] L709-4-->L709-5: Formula: (= |v_#race~glob~0_1| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_1|} AuxVars[] AssignedVars[#race~glob~0][242], [Black: 285#true, 277#true, 189#L709-5true, 154#L716-2true, 61#L715-6true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 294#true, 213#L715-6true, 290#true, 275#true, 273#true]) [2025-01-09 21:27:44,794 INFO L294 olderBase$Statistics]: this new event has 234 ancestors and is cut-off event [2025-01-09 21:27:44,794 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2025-01-09 21:27:44,794 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-01-09 21:27:44,794 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2025-01-09 21:27:44,794 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([927] L709-4-->L709-5: Formula: (= |v_#race~glob~0_1| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_1|} AuxVars[] AssignedVars[#race~glob~0][242], [Black: 285#true, 277#true, 189#L709-5true, 154#L716-2true, 156#L715-5true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 294#true, 102#L715-5true, 290#true, 275#true, 273#true]) [2025-01-09 21:27:44,794 INFO L294 olderBase$Statistics]: this new event has 232 ancestors and is cut-off event [2025-01-09 21:27:44,795 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2025-01-09 21:27:44,795 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2025-01-09 21:27:44,795 INFO L297 olderBase$Statistics]: existing Event has 232 ancestors and is cut-off event [2025-01-09 21:27:44,795 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([927] L709-4-->L709-5: Formula: (= |v_#race~glob~0_1| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_1|} AuxVars[] AssignedVars[#race~glob~0][242], [Black: 285#true, 277#true, 154#L716-2true, 189#L709-5true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 294#true, 102#L715-5true, 213#L715-6true, 290#true, 275#true, 273#true]) [2025-01-09 21:27:44,795 INFO L294 olderBase$Statistics]: this new event has 233 ancestors and is cut-off event [2025-01-09 21:27:44,795 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2025-01-09 21:27:44,795 INFO L297 olderBase$Statistics]: existing Event has 233 ancestors and is cut-off event [2025-01-09 21:27:44,795 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2025-01-09 21:27:44,795 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([927] L709-4-->L709-5: Formula: (= |v_#race~glob~0_1| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_1|} AuxVars[] AssignedVars[#race~glob~0][242], [Black: 285#true, 277#true, 154#L716-2true, 189#L709-5true, 156#L715-5true, 61#L715-6true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 294#true, 290#true, 275#true, 273#true]) [2025-01-09 21:27:44,795 INFO L294 olderBase$Statistics]: this new event has 233 ancestors and is cut-off event [2025-01-09 21:27:44,795 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2025-01-09 21:27:44,795 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2025-01-09 21:27:44,795 INFO L297 olderBase$Statistics]: existing Event has 233 ancestors and is cut-off event [2025-01-09 21:27:44,826 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1135] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= |v_t_funThread2of3ForFork0_#t~ret18#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread2of3ForFork0_#t~ret18#1=|v_t_funThread2of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of3ForFork0_#t~ret18#1][178], [Black: 285#true, 111#L715-12true, 277#true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 294#true, 102#L715-5true, 290#true, 275#true, 52#L722-9true, 272#true]) [2025-01-09 21:27:44,826 INFO L294 olderBase$Statistics]: this new event has 240 ancestors and is cut-off event [2025-01-09 21:27:44,826 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2025-01-09 21:27:44,826 INFO L297 olderBase$Statistics]: existing Event has 240 ancestors and is cut-off event [2025-01-09 21:27:44,827 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2025-01-09 21:27:44,827 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1165] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][239], [Black: 285#true, 277#true, 156#L715-5true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 294#true, 290#true, 275#true, 52#L722-9true, 272#true, 158#L715-12true]) [2025-01-09 21:27:44,827 INFO L294 olderBase$Statistics]: this new event has 240 ancestors and is cut-off event [2025-01-09 21:27:44,827 INFO L297 olderBase$Statistics]: existing Event has 240 ancestors and is cut-off event [2025-01-09 21:27:44,827 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2025-01-09 21:27:44,827 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2025-01-09 21:27:44,827 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1165] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][239], [Black: 285#true, 277#true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 294#true, 213#L715-6true, 290#true, 275#true, 52#L722-9true, 272#true, 158#L715-12true]) [2025-01-09 21:27:44,827 INFO L294 olderBase$Statistics]: this new event has 241 ancestors and is cut-off event [2025-01-09 21:27:44,827 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is cut-off event [2025-01-09 21:27:44,827 INFO L297 olderBase$Statistics]: existing Event has 241 ancestors and is cut-off event [2025-01-09 21:27:44,827 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is cut-off event [2025-01-09 21:27:45,093 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1135] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= |v_t_funThread2of3ForFork0_#t~ret18#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread2of3ForFork0_#t~ret18#1=|v_t_funThread2of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of3ForFork0_#t~ret18#1][178], [214#ULTIMATE.startFINALtrue, Black: 285#true, 111#L715-12true, 277#true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 294#true, 102#L715-5true, 290#true, 275#true, 272#true]) [2025-01-09 21:27:45,093 INFO L294 olderBase$Statistics]: this new event has 250 ancestors and is cut-off event [2025-01-09 21:27:45,093 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is cut-off event [2025-01-09 21:27:45,093 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is cut-off event [2025-01-09 21:27:45,093 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-01-09 21:27:45,093 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1165] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][239], [214#ULTIMATE.startFINALtrue, Black: 285#true, 277#true, 156#L715-5true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 294#true, 290#true, 275#true, 272#true, 158#L715-12true]) [2025-01-09 21:27:45,093 INFO L294 olderBase$Statistics]: this new event has 250 ancestors and is cut-off event [2025-01-09 21:27:45,093 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is cut-off event [2025-01-09 21:27:45,093 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is cut-off event [2025-01-09 21:27:45,093 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-01-09 21:27:45,094 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1165] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][239], [Black: 285#true, 214#ULTIMATE.startFINALtrue, 277#true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 294#true, 213#L715-6true, 290#true, 275#true, 272#true, 158#L715-12true]) [2025-01-09 21:27:45,094 INFO L294 olderBase$Statistics]: this new event has 251 ancestors and is cut-off event [2025-01-09 21:27:45,094 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is cut-off event [2025-01-09 21:27:45,094 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is cut-off event [2025-01-09 21:27:45,094 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2025-01-09 21:27:45,387 INFO L124 PetriNetUnfolderBase]: 17529/83461 cut-off events. [2025-01-09 21:27:45,388 INFO L125 PetriNetUnfolderBase]: For 2184/2258 co-relation queries the response was YES. [2025-01-09 21:27:45,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111282 conditions, 83461 events. 17529/83461 cut-off events. For 2184/2258 co-relation queries the response was YES. Maximal size of possible extension queue 1338. Compared 1258648 event pairs, 6187 based on Foata normal form. 5/75544 useless extension candidates. Maximal degree in co-relation 97077. Up to 20381 conditions per place. [2025-01-09 21:27:45,797 INFO L140 encePairwiseOnDemand]: 287/292 looper letters, 52 selfloop transitions, 5 changer transitions 0/298 dead transitions. [2025-01-09 21:27:45,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 298 transitions, 791 flow [2025-01-09 21:27:45,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:27:45,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:27:45,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1492 transitions. [2025-01-09 21:27:45,800 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8515981735159818 [2025-01-09 21:27:45,800 INFO L175 Difference]: Start difference. First operand has 272 places, 274 transitions, 627 flow. Second operand 6 states and 1492 transitions. [2025-01-09 21:27:45,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 298 transitions, 791 flow [2025-01-09 21:27:45,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 298 transitions, 789 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:27:45,805 INFO L231 Difference]: Finished difference. Result has 279 places, 277 transitions, 657 flow [2025-01-09 21:27:45,805 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=292, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=657, PETRI_PLACES=279, PETRI_TRANSITIONS=277} [2025-01-09 21:27:45,805 INFO L279 CegarLoopForPetriNet]: 276 programPoint places, 3 predicate places. [2025-01-09 21:27:45,805 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 277 transitions, 657 flow [2025-01-09 21:27:45,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 240.6) internal successors, (1203), 5 states have internal predecessors, (1203), 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:27:45,806 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:27:45,806 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:45,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:27:45,807 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-01-09 21:27:45,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:27:45,807 INFO L85 PathProgramCache]: Analyzing trace with hash 2112550213, now seen corresponding path program 1 times [2025-01-09 21:27:45,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:27:45,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520510707] [2025-01-09 21:27:45,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:27:45,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:27:45,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 21:27:45,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 21:27:45,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:45,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:27:45,845 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:27:45,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:27:45,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520510707] [2025-01-09 21:27:45,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520510707] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:27:45,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:27:45,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:27:45,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237634995] [2025-01-09 21:27:45,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:27:45,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:27:45,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:27:45,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:27:45,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:27:45,853 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 292 [2025-01-09 21:27:45,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 277 transitions, 657 flow. Second operand has 3 states, 3 states have (on average 243.33333333333334) internal successors, (730), 3 states have internal predecessors, (730), 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:27:45,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:27:45,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 292 [2025-01-09 21:27:45,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand