./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 c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/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-?-c00e63d-m [2025-02-06 09:25:26,000 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:25:26,042 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-06 09:25:26,046 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:25:26,046 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:25:26,063 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:25:26,063 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:25:26,063 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:25:26,064 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:25:26,064 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:25:26,064 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:25:26,064 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:25:26,064 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:25:26,064 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:25:26,064 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:25:26,064 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:25:26,064 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:25:26,065 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:25:26,065 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:25:26,065 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:25:26,065 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:25:26,065 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:25:26,065 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 09:25:26,065 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:25:26,065 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:25:26,065 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:25:26,065 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:25:26,065 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:25:26,065 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:25:26,065 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:25:26,065 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:25:26,065 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:25:26,066 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:25:26,066 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:25:26,066 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 09:25:26,066 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 09:25:26,066 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:25:26,066 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:25:26,066 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:25:26,066 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:25:26,066 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:25:26,066 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:25:26,066 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-02-06 09:25:26,261 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:25:26,269 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:25:26,271 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:25:26,271 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:25:26,271 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:25:26,273 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-02-06 09:25:27,464 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/87d3e2efd/a7d51560dfbb45ad89e38469795bf2f8/FLAGf23e63f83 [2025-02-06 09:25:27,744 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:25:27,746 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_20-callback_racefree.i [2025-02-06 09:25:27,758 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/87d3e2efd/a7d51560dfbb45ad89e38469795bf2f8/FLAGf23e63f83 [2025-02-06 09:25:28,026 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/87d3e2efd/a7d51560dfbb45ad89e38469795bf2f8 [2025-02-06 09:25:28,028 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:25:28,029 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:25:28,033 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:25:28,034 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:25:28,036 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:25:28,037 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:25:28" (1/1) ... [2025-02-06 09:25:28,042 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ea32b9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:25:28, skipping insertion in model container [2025-02-06 09:25:28,042 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:25:28" (1/1) ... [2025-02-06 09:25:28,069 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:25:28,285 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:25:28,307 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:25:28,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:25:28,386 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:25:28,387 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:25:28 WrapperNode [2025-02-06 09:25:28,387 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:25:28,388 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:25:28,388 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:25:28,388 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:25:28,392 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:25:28" (1/1) ... [2025-02-06 09:25:28,400 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:25:28" (1/1) ... [2025-02-06 09:25:28,414 INFO L138 Inliner]: procedures = 174, calls = 39, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 209 [2025-02-06 09:25:28,414 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:25:28,415 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:25:28,415 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:25:28,415 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:25:28,420 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:25:28" (1/1) ... [2025-02-06 09:25:28,420 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:25:28" (1/1) ... [2025-02-06 09:25:28,423 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:25:28" (1/1) ... [2025-02-06 09:25:28,423 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:25:28" (1/1) ... [2025-02-06 09:25:28,428 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:25:28" (1/1) ... [2025-02-06 09:25:28,429 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:25:28" (1/1) ... [2025-02-06 09:25:28,430 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:25:28" (1/1) ... [2025-02-06 09:25:28,431 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:25:28" (1/1) ... [2025-02-06 09:25:28,432 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:25:28,433 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:25:28,433 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:25:28,433 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:25:28,434 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:25:28" (1/1) ... [2025-02-06 09:25:28,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:25:28,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:25:28,458 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 09:25:28,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 09:25:28,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 09:25:28,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 09:25:28,480 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 09:25:28,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:25:28,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 09:25:28,480 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-06 09:25:28,480 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-06 09:25:28,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 09:25:28,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 09:25:28,480 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 09:25:28,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:25:28,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:25:28,481 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 09:25:28,577 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:25:28,578 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:25:28,851 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L720: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-02-06 09:25:28,851 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L720-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-02-06 09:25:28,876 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 09:25:28,876 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:25:28,909 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:25:28,910 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:25:28,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:25:28 BoogieIcfgContainer [2025-02-06 09:25:28,911 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:25:28,912 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:25:28,912 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:25:28,915 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:25:28,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:25:28" (1/3) ... [2025-02-06 09:25:28,915 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ca915ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:25:28, skipping insertion in model container [2025-02-06 09:25:28,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:25:28" (2/3) ... [2025-02-06 09:25:28,916 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ca915ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:25:28, skipping insertion in model container [2025-02-06 09:25:28,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:25:28" (3/3) ... [2025-02-06 09:25:28,918 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_20-callback_racefree.i [2025-02-06 09:25:28,928 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:25:28,930 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_20-callback_racefree.i that has 2 procedures, 218 locations, 1 initial locations, 7 loop locations, and 7 error locations. [2025-02-06 09:25:28,931 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 09:25:28,979 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-06 09:25:29,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 221 places, 231 transitions, 469 flow [2025-02-06 09:25:29,103 INFO L124 PetriNetUnfolderBase]: 21/340 cut-off events. [2025-02-06 09:25:29,107 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 09:25:29,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 345 conditions, 340 events. 21/340 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 998 event pairs, 0 based on Foata normal form. 0/303 useless extension candidates. Maximal degree in co-relation 191. Up to 6 conditions per place. [2025-02-06 09:25:29,113 INFO L82 GeneralOperation]: Start removeDead. Operand has 221 places, 231 transitions, 469 flow [2025-02-06 09:25:29,120 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 221 places, 231 transitions, 469 flow [2025-02-06 09:25:29,127 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:25:29,135 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;@38bfe57c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:25:29,136 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-02-06 09:25:29,154 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:25:29,155 INFO L124 PetriNetUnfolderBase]: 0/104 cut-off events. [2025-02-06 09:25:29,156 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:25:29,156 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:25:29,157 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-02-06 09:25:29,157 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 09:25:29,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:25:29,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1096121064, now seen corresponding path program 1 times [2025-02-06 09:25:29,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:25:29,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767950326] [2025-02-06 09:25:29,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:25:29,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:25:29,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-06 09:25:29,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-06 09:25:29,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:29,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:25:30,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:25:30,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:25:30,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767950326] [2025-02-06 09:25:30,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767950326] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:25:30,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:25:30,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:25:30,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183078673] [2025-02-06 09:25:30,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:25:30,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:25:30,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:25:30,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:25:30,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:25:30,145 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 231 [2025-02-06 09:25:30,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 231 transitions, 469 flow. Second operand has 6 states, 6 states have (on average 191.5) internal successors, (1149), 6 states have internal predecessors, (1149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:25:30,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:25:30,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 231 [2025-02-06 09:25:30,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:25:30,353 INFO L124 PetriNetUnfolderBase]: 87/813 cut-off events. [2025-02-06 09:25:30,353 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2025-02-06 09:25:30,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1027 conditions, 813 events. 87/813 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 4310 event pairs, 46 based on Foata normal form. 112/851 useless extension candidates. Maximal degree in co-relation 803. Up to 154 conditions per place. [2025-02-06 09:25:30,359 INFO L140 encePairwiseOnDemand]: 215/231 looper letters, 40 selfloop transitions, 5 changer transitions 0/234 dead transitions. [2025-02-06 09:25:30,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 234 transitions, 565 flow [2025-02-06 09:25:30,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:25:30,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:25:30,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1212 transitions. [2025-02-06 09:25:30,379 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8744588744588745 [2025-02-06 09:25:30,380 INFO L175 Difference]: Start difference. First operand has 221 places, 231 transitions, 469 flow. Second operand 6 states and 1212 transitions. [2025-02-06 09:25:30,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 234 transitions, 565 flow [2025-02-06 09:25:30,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 234 transitions, 565 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:25:30,387 INFO L231 Difference]: Finished difference. Result has 223 places, 218 transitions, 453 flow [2025-02-06 09:25:30,389 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=443, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=453, PETRI_PLACES=223, PETRI_TRANSITIONS=218} [2025-02-06 09:25:30,392 INFO L279 CegarLoopForPetriNet]: 221 programPoint places, 2 predicate places. [2025-02-06 09:25:30,395 INFO L471 AbstractCegarLoop]: Abstraction has has 223 places, 218 transitions, 453 flow [2025-02-06 09:25:30,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 191.5) internal successors, (1149), 6 states have internal predecessors, (1149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:25:30,396 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:25:30,396 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:25:30,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:25:30,397 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 09:25:30,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:25:30,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1458446561, now seen corresponding path program 1 times [2025-02-06 09:25:30,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:25:30,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626614227] [2025-02-06 09:25:30,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:25:30,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:25:30,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-06 09:25:30,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-06 09:25:30,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:30,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:25:30,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:25:30,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:25:30,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626614227] [2025-02-06 09:25:30,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626614227] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:25:30,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:25:30,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:25:30,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529141851] [2025-02-06 09:25:30,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:25:30,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:25:30,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:25:30,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:25:30,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:25:30,563 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 231 [2025-02-06 09:25:30,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 218 transitions, 453 flow. Second operand has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:25:30,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:25:30,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 231 [2025-02-06 09:25:30,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:25:30,642 INFO L124 PetriNetUnfolderBase]: 50/704 cut-off events. [2025-02-06 09:25:30,642 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-02-06 09:25:30,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 827 conditions, 704 events. 50/704 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 3258 event pairs, 27 based on Foata normal form. 1/655 useless extension candidates. Maximal degree in co-relation 696. Up to 94 conditions per place. [2025-02-06 09:25:30,647 INFO L140 encePairwiseOnDemand]: 228/231 looper letters, 20 selfloop transitions, 2 changer transitions 0/222 dead transitions. [2025-02-06 09:25:30,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 222 transitions, 505 flow [2025-02-06 09:25:30,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:25:30,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:25:30,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 629 transitions. [2025-02-06 09:25:30,649 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9076479076479076 [2025-02-06 09:25:30,649 INFO L175 Difference]: Start difference. First operand has 223 places, 218 transitions, 453 flow. Second operand 3 states and 629 transitions. [2025-02-06 09:25:30,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 222 transitions, 505 flow [2025-02-06 09:25:30,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 222 transitions, 495 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:25:30,656 INFO L231 Difference]: Finished difference. Result has 221 places, 218 transitions, 451 flow [2025-02-06 09:25:30,656 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=443, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=451, PETRI_PLACES=221, PETRI_TRANSITIONS=218} [2025-02-06 09:25:30,657 INFO L279 CegarLoopForPetriNet]: 221 programPoint places, 0 predicate places. [2025-02-06 09:25:30,657 INFO L471 AbstractCegarLoop]: Abstraction has has 221 places, 218 transitions, 451 flow [2025-02-06 09:25:30,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:25:30,658 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:25:30,658 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:25:30,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 09:25:30,658 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 09:25:30,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:25:30,659 INFO L85 PathProgramCache]: Analyzing trace with hash -665349415, now seen corresponding path program 1 times [2025-02-06 09:25:30,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:25:30,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20677127] [2025-02-06 09:25:30,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:25:30,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:25:30,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-06 09:25:30,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-06 09:25:30,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:30,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:25:30,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:25:30,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:25:30,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20677127] [2025-02-06 09:25:30,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20677127] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:25:30,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:25:30,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:25:30,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195657181] [2025-02-06 09:25:30,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:25:30,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:25:30,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:25:30,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:25:30,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:25:30,748 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 231 [2025-02-06 09:25:30,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 218 transitions, 451 flow. Second operand has 3 states, 3 states have (on average 198.66666666666666) internal successors, (596), 3 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:25:30,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:25:30,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 231 [2025-02-06 09:25:30,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:25:30,870 INFO L124 PetriNetUnfolderBase]: 110/941 cut-off events. [2025-02-06 09:25:30,870 INFO L125 PetriNetUnfolderBase]: For 14/20 co-relation queries the response was YES. [2025-02-06 09:25:30,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1195 conditions, 941 events. 110/941 cut-off events. For 14/20 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4627 event pairs, 41 based on Foata normal form. 1/869 useless extension candidates. Maximal degree in co-relation 1089. Up to 133 conditions per place. [2025-02-06 09:25:30,875 INFO L140 encePairwiseOnDemand]: 222/231 looper letters, 30 selfloop transitions, 6 changer transitions 0/231 dead transitions. [2025-02-06 09:25:30,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 231 transitions, 552 flow [2025-02-06 09:25:30,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:25:30,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:25:30,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 630 transitions. [2025-02-06 09:25:30,877 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9090909090909091 [2025-02-06 09:25:30,877 INFO L175 Difference]: Start difference. First operand has 221 places, 218 transitions, 451 flow. Second operand 3 states and 630 transitions. [2025-02-06 09:25:30,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 231 transitions, 552 flow [2025-02-06 09:25:30,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 231 transitions, 548 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:25:30,882 INFO L231 Difference]: Finished difference. Result has 221 places, 220 transitions, 485 flow [2025-02-06 09:25:30,882 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=443, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=485, PETRI_PLACES=221, PETRI_TRANSITIONS=220} [2025-02-06 09:25:30,883 INFO L279 CegarLoopForPetriNet]: 221 programPoint places, 0 predicate places. [2025-02-06 09:25:30,883 INFO L471 AbstractCegarLoop]: Abstraction has has 221 places, 220 transitions, 485 flow [2025-02-06 09:25:30,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 198.66666666666666) internal successors, (596), 3 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:25:30,884 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:25:30,884 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-02-06 09:25:30,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:25:30,884 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 09:25:30,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:25:30,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1828994853, now seen corresponding path program 1 times [2025-02-06 09:25:30,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:25:30,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899404407] [2025-02-06 09:25:30,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:25:30,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:25:30,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-06 09:25:30,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-06 09:25:30,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:30,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:25:30,930 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 09:25:30,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-06 09:25:30,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-06 09:25:30,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:30,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:25:30,968 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 09:25:30,968 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 09:25:30,968 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2025-02-06 09:25:30,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2025-02-06 09:25:30,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2025-02-06 09:25:30,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2025-02-06 09:25:30,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2025-02-06 09:25:30,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2025-02-06 09:25:30,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2025-02-06 09:25:30,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2025-02-06 09:25:30,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2025-02-06 09:25:30,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:25:30,971 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-06 09:25:30,972 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 09:25:30,972 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-06 09:25:30,988 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 09:25:30,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 251 places, 264 transitions, 544 flow [2025-02-06 09:25:31,048 INFO L124 PetriNetUnfolderBase]: 35/509 cut-off events. [2025-02-06 09:25:31,048 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-06 09:25:31,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 521 conditions, 509 events. 35/509 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1890 event pairs, 0 based on Foata normal form. 0/449 useless extension candidates. Maximal degree in co-relation 342. Up to 9 conditions per place. [2025-02-06 09:25:31,050 INFO L82 GeneralOperation]: Start removeDead. Operand has 251 places, 264 transitions, 544 flow [2025-02-06 09:25:31,052 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 251 places, 264 transitions, 544 flow [2025-02-06 09:25:31,054 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:25:31,055 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;@38bfe57c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:25:31,055 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-02-06 09:25:31,061 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:25:31,061 INFO L124 PetriNetUnfolderBase]: 0/104 cut-off events. [2025-02-06 09:25:31,061 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:25:31,061 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:25:31,061 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-02-06 09:25:31,061 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-02-06 09:25:31,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:25:31,062 INFO L85 PathProgramCache]: Analyzing trace with hash 644655336, now seen corresponding path program 1 times [2025-02-06 09:25:31,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:25:31,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812877975] [2025-02-06 09:25:31,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:25:31,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:25:31,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-06 09:25:31,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-06 09:25:31,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:31,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:25:31,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:25:31,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:25:31,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812877975] [2025-02-06 09:25:31,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812877975] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:25:31,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:25:31,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:25:31,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448815590] [2025-02-06 09:25:31,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:25:31,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:25:31,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:25:31,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:25:31,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:25:31,492 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 264 [2025-02-06 09:25:31,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 264 transitions, 544 flow. Second operand has 6 states, 6 states have (on average 213.5) internal successors, (1281), 6 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:25:31,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:25:31,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 264 [2025-02-06 09:25:31,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:25:31,962 INFO L124 PetriNetUnfolderBase]: 1001/4728 cut-off events. [2025-02-06 09:25:31,963 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-02-06 09:25:31,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6387 conditions, 4728 events. 1001/4728 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 43835 event pairs, 108 based on Foata normal form. 1118/5513 useless extension candidates. Maximal degree in co-relation 1081. Up to 1202 conditions per place. [2025-02-06 09:25:31,982 INFO L140 encePairwiseOnDemand]: 244/264 looper letters, 62 selfloop transitions, 5 changer transitions 0/277 dead transitions. [2025-02-06 09:25:31,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 277 transitions, 704 flow [2025-02-06 09:25:31,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:25:31,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:25:31,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1386 transitions. [2025-02-06 09:25:31,986 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.875 [2025-02-06 09:25:31,986 INFO L175 Difference]: Start difference. First operand has 251 places, 264 transitions, 544 flow. Second operand 6 states and 1386 transitions. [2025-02-06 09:25:31,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 277 transitions, 704 flow [2025-02-06 09:25:31,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 277 transitions, 704 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:25:31,989 INFO L231 Difference]: Finished difference. Result has 251 places, 245 transitions, 516 flow [2025-02-06 09:25:31,989 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=516, PETRI_PLACES=251, PETRI_TRANSITIONS=245} [2025-02-06 09:25:31,990 INFO L279 CegarLoopForPetriNet]: 251 programPoint places, 0 predicate places. [2025-02-06 09:25:31,990 INFO L471 AbstractCegarLoop]: Abstraction has has 251 places, 245 transitions, 516 flow [2025-02-06 09:25:31,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 213.5) internal successors, (1281), 6 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:25:31,990 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:25:31,991 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-02-06 09:25:31,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:25:31,991 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-02-06 09:25:31,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:25:31,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1987297, now seen corresponding path program 1 times [2025-02-06 09:25:31,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:25:31,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938766683] [2025-02-06 09:25:31,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:25:31,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:25:32,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-06 09:25:32,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-06 09:25:32,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:32,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:25:32,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:25:32,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:25:32,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938766683] [2025-02-06 09:25:32,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938766683] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:25:32,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:25:32,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:25:32,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932874106] [2025-02-06 09:25:32,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:25:32,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:25:32,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:25:32,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:25:32,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:25:32,100 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 264 [2025-02-06 09:25:32,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 245 transitions, 516 flow. Second operand has 3 states, 3 states have (on average 225.33333333333334) internal successors, (676), 3 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:25:32,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:25:32,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 264 [2025-02-06 09:25:32,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:25:32,384 INFO L124 PetriNetUnfolderBase]: 498/3107 cut-off events. [2025-02-06 09:25:32,384 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2025-02-06 09:25:32,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4013 conditions, 3107 events. 498/3107 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 26677 event pairs, 403 based on Foata normal form. 1/2822 useless extension candidates. Maximal degree in co-relation 2498. Up to 817 conditions per place. [2025-02-06 09:25:32,399 INFO L140 encePairwiseOnDemand]: 261/264 looper letters, 27 selfloop transitions, 2 changer transitions 0/250 dead transitions. [2025-02-06 09:25:32,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 250 transitions, 586 flow [2025-02-06 09:25:32,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:25:32,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:25:32,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 702 transitions. [2025-02-06 09:25:32,401 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8863636363636364 [2025-02-06 09:25:32,401 INFO L175 Difference]: Start difference. First operand has 251 places, 245 transitions, 516 flow. Second operand 3 states and 702 transitions. [2025-02-06 09:25:32,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 250 transitions, 586 flow [2025-02-06 09:25:32,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 250 transitions, 574 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:25:32,405 INFO L231 Difference]: Finished difference. Result has 249 places, 246 transitions, 518 flow [2025-02-06 09:25:32,405 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=518, PETRI_PLACES=249, PETRI_TRANSITIONS=246} [2025-02-06 09:25:32,406 INFO L279 CegarLoopForPetriNet]: 251 programPoint places, -2 predicate places. [2025-02-06 09:25:32,406 INFO L471 AbstractCegarLoop]: Abstraction has has 249 places, 246 transitions, 518 flow [2025-02-06 09:25:32,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 225.33333333333334) internal successors, (676), 3 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:25:32,406 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:25:32,406 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:25:32,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 09:25:32,406 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-02-06 09:25:32,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:25:32,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1232540416, now seen corresponding path program 1 times [2025-02-06 09:25:32,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:25:32,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076157669] [2025-02-06 09:25:32,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:25:32,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:25:32,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-06 09:25:32,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-06 09:25:32,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:32,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:25:32,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:25:32,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:25:32,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076157669] [2025-02-06 09:25:32,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076157669] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:25:32,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:25:32,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:25:32,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739107583] [2025-02-06 09:25:32,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:25:32,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:25:32,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:25:32,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:25:32,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:25:32,461 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 264 [2025-02-06 09:25:32,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 246 transitions, 518 flow. Second operand has 3 states, 3 states have (on average 217.66666666666666) internal successors, (653), 3 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:25:32,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:25:32,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 264 [2025-02-06 09:25:32,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:25:33,256 INFO L124 PetriNetUnfolderBase]: 2105/8556 cut-off events. [2025-02-06 09:25:33,256 INFO L125 PetriNetUnfolderBase]: For 215/406 co-relation queries the response was YES. [2025-02-06 09:25:33,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12078 conditions, 8556 events. 2105/8556 cut-off events. For 215/406 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 84204 event pairs, 847 based on Foata normal form. 7/7741 useless extension candidates. Maximal degree in co-relation 11971. Up to 2135 conditions per place. [2025-02-06 09:25:33,296 INFO L140 encePairwiseOnDemand]: 252/264 looper letters, 45 selfloop transitions, 8 changer transitions 0/267 dead transitions. [2025-02-06 09:25:33,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 267 transitions, 677 flow [2025-02-06 09:25:33,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:25:33,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:25:33,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 705 transitions. [2025-02-06 09:25:33,298 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8901515151515151 [2025-02-06 09:25:33,298 INFO L175 Difference]: Start difference. First operand has 249 places, 246 transitions, 518 flow. Second operand 3 states and 705 transitions. [2025-02-06 09:25:33,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 267 transitions, 677 flow [2025-02-06 09:25:33,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 267 transitions, 675 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:25:33,301 INFO L231 Difference]: Finished difference. Result has 250 places, 250 transitions, 572 flow [2025-02-06 09:25:33,302 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=572, PETRI_PLACES=250, PETRI_TRANSITIONS=250} [2025-02-06 09:25:33,302 INFO L279 CegarLoopForPetriNet]: 251 programPoint places, -1 predicate places. [2025-02-06 09:25:33,302 INFO L471 AbstractCegarLoop]: Abstraction has has 250 places, 250 transitions, 572 flow [2025-02-06 09:25:33,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.66666666666666) internal successors, (653), 3 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:25:33,303 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:25:33,303 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:25:33,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 09:25:33,303 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-02-06 09:25:33,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:25:33,304 INFO L85 PathProgramCache]: Analyzing trace with hash 319347086, now seen corresponding path program 1 times [2025-02-06 09:25:33,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:25:33,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318813506] [2025-02-06 09:25:33,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:25:33,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:25:33,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-06 09:25:33,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-06 09:25:33,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:33,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:25:33,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 09:25:33,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:25:33,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318813506] [2025-02-06 09:25:33,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318813506] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:25:33,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:25:33,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:25:33,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090230599] [2025-02-06 09:25:33,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:25:33,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 09:25:33,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:25:33,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 09:25:33,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 09:25:33,488 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 264 [2025-02-06 09:25:33,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 250 transitions, 572 flow. Second operand has 5 states, 5 states have (on average 223.6) internal successors, (1118), 5 states have internal predecessors, (1118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:25:33,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:25:33,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 264 [2025-02-06 09:25:33,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:25:34,143 INFO L124 PetriNetUnfolderBase]: 1347/7958 cut-off events. [2025-02-06 09:25:34,144 INFO L125 PetriNetUnfolderBase]: For 432/473 co-relation queries the response was YES. [2025-02-06 09:25:34,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10883 conditions, 7958 events. 1347/7958 cut-off events. For 432/473 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 80737 event pairs, 493 based on Foata normal form. 5/7295 useless extension candidates. Maximal degree in co-relation 4991. Up to 1699 conditions per place. [2025-02-06 09:25:34,179 INFO L140 encePairwiseOnDemand]: 259/264 looper letters, 44 selfloop transitions, 5 changer transitions 0/272 dead transitions. [2025-02-06 09:25:34,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 272 transitions, 714 flow [2025-02-06 09:25:34,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:25:34,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:25:34,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1382 transitions. [2025-02-06 09:25:34,185 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8724747474747475 [2025-02-06 09:25:34,186 INFO L175 Difference]: Start difference. First operand has 250 places, 250 transitions, 572 flow. Second operand 6 states and 1382 transitions. [2025-02-06 09:25:34,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 272 transitions, 714 flow [2025-02-06 09:25:34,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 272 transitions, 698 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:25:34,191 INFO L231 Difference]: Finished difference. Result has 256 places, 252 transitions, 582 flow [2025-02-06 09:25:34,192 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=582, PETRI_PLACES=256, PETRI_TRANSITIONS=252} [2025-02-06 09:25:34,193 INFO L279 CegarLoopForPetriNet]: 251 programPoint places, 5 predicate places. [2025-02-06 09:25:34,193 INFO L471 AbstractCegarLoop]: Abstraction has has 256 places, 252 transitions, 582 flow [2025-02-06 09:25:34,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 223.6) internal successors, (1118), 5 states have internal predecessors, (1118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:25:34,194 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:25:34,194 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-02-06 09:25:34,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 09:25:34,194 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-02-06 09:25:34,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:25:34,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1702092831, now seen corresponding path program 1 times [2025-02-06 09:25:34,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:25:34,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84938067] [2025-02-06 09:25:34,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:25:34,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:25:34,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-06 09:25:34,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-06 09:25:34,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:34,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:25:34,227 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 09:25:34,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-06 09:25:34,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-06 09:25:34,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:34,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:25:34,262 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 09:25:34,263 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 09:25:34,263 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-02-06 09:25:34,263 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2025-02-06 09:25:34,263 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2025-02-06 09:25:34,263 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2025-02-06 09:25:34,263 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2025-02-06 09:25:34,264 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2025-02-06 09:25:34,264 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2025-02-06 09:25:34,264 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2025-02-06 09:25:34,264 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2025-02-06 09:25:34,264 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2025-02-06 09:25:34,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 09:25:34,264 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-06 09:25:34,264 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 09:25:34,265 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-06 09:25:34,294 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-06 09:25:34,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 281 places, 297 transitions, 621 flow [2025-02-06 09:25:34,334 INFO L124 PetriNetUnfolderBase]: 52/721 cut-off events. [2025-02-06 09:25:34,335 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-02-06 09:25:34,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 746 conditions, 721 events. 52/721 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3008 event pairs, 1 based on Foata normal form. 0/634 useless extension candidates. Maximal degree in co-relation 517. Up to 12 conditions per place. [2025-02-06 09:25:34,338 INFO L82 GeneralOperation]: Start removeDead. Operand has 281 places, 297 transitions, 621 flow [2025-02-06 09:25:34,340 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 281 places, 297 transitions, 621 flow [2025-02-06 09:25:34,341 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:25:34,342 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;@38bfe57c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:25:34,342 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-02-06 09:25:34,345 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:25:34,345 INFO L124 PetriNetUnfolderBase]: 0/104 cut-off events. [2025-02-06 09:25:34,345 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:25:34,345 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:25:34,345 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-02-06 09:25:34,346 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-02-06 09:25:34,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:25:34,346 INFO L85 PathProgramCache]: Analyzing trace with hash -2010727256, now seen corresponding path program 1 times [2025-02-06 09:25:34,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:25:34,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671373078] [2025-02-06 09:25:34,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:25:34,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:25:34,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-06 09:25:34,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-06 09:25:34,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:34,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:25:34,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:25:34,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:25:34,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671373078] [2025-02-06 09:25:34,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671373078] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:25:34,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:25:34,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:25:34,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758808459] [2025-02-06 09:25:34,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:25:34,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:25:34,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:25:34,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:25:34,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:25:34,710 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 297 [2025-02-06 09:25:34,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 297 transitions, 621 flow. Second operand has 6 states, 6 states have (on average 235.5) internal successors, (1413), 6 states have internal predecessors, (1413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:25:34,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:25:34,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 297 [2025-02-06 09:25:34,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:25:37,192 INFO L124 PetriNetUnfolderBase]: 8120/27507 cut-off events. [2025-02-06 09:25:37,193 INFO L125 PetriNetUnfolderBase]: For 547/547 co-relation queries the response was YES. [2025-02-06 09:25:37,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39242 conditions, 27507 events. 8120/27507 cut-off events. For 547/547 co-relation queries the response was YES. Maximal size of possible extension queue 723. Compared 333440 event pairs, 913 based on Foata normal form. 8600/34275 useless extension candidates. Maximal degree in co-relation 6418. Up to 8631 conditions per place. [2025-02-06 09:25:37,338 INFO L140 encePairwiseOnDemand]: 273/297 looper letters, 84 selfloop transitions, 5 changer transitions 0/320 dead transitions. [2025-02-06 09:25:37,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 320 transitions, 845 flow [2025-02-06 09:25:37,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:25:37,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:25:37,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1560 transitions. [2025-02-06 09:25:37,341 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8754208754208754 [2025-02-06 09:25:37,341 INFO L175 Difference]: Start difference. First operand has 281 places, 297 transitions, 621 flow. Second operand 6 states and 1560 transitions. [2025-02-06 09:25:37,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 320 transitions, 845 flow [2025-02-06 09:25:37,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 320 transitions, 845 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:25:37,345 INFO L231 Difference]: Finished difference. Result has 279 places, 272 transitions, 581 flow [2025-02-06 09:25:37,345 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=571, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=581, PETRI_PLACES=279, PETRI_TRANSITIONS=272} [2025-02-06 09:25:37,346 INFO L279 CegarLoopForPetriNet]: 281 programPoint places, -2 predicate places. [2025-02-06 09:25:37,346 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 272 transitions, 581 flow [2025-02-06 09:25:37,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 235.5) internal successors, (1413), 6 states have internal predecessors, (1413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:25:37,347 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:25:37,347 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-02-06 09:25:37,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 09:25:37,347 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-02-06 09:25:37,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:25:37,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1047825185, now seen corresponding path program 1 times [2025-02-06 09:25:37,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:25:37,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495280629] [2025-02-06 09:25:37,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:25:37,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:25:37,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-06 09:25:37,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-06 09:25:37,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:37,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:25:37,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:25:37,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:25:37,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495280629] [2025-02-06 09:25:37,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495280629] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:25:37,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:25:37,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:25:37,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760595286] [2025-02-06 09:25:37,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:25:37,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:25:37,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:25:37,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:25:37,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:25:37,432 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 297 [2025-02-06 09:25:37,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 272 transitions, 581 flow. Second operand has 3 states, 3 states have (on average 247.33333333333334) internal successors, (742), 3 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:25:37,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:25:37,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 297 [2025-02-06 09:25:37,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:25:39,119 INFO L124 PetriNetUnfolderBase]: 3966/16084 cut-off events. [2025-02-06 09:25:39,120 INFO L125 PetriNetUnfolderBase]: For 687/687 co-relation queries the response was YES. [2025-02-06 09:25:39,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22328 conditions, 16084 events. 3966/16084 cut-off events. For 687/687 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 189117 event pairs, 2461 based on Foata normal form. 1/14608 useless extension candidates. Maximal degree in co-relation 4000. Up to 5780 conditions per place. [2025-02-06 09:25:39,291 INFO L140 encePairwiseOnDemand]: 294/297 looper letters, 33 selfloop transitions, 2 changer transitions 0/277 dead transitions. [2025-02-06 09:25:39,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 277 transitions, 663 flow [2025-02-06 09:25:39,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:25:39,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:25:39,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 774 transitions. [2025-02-06 09:25:39,293 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8686868686868687 [2025-02-06 09:25:39,293 INFO L175 Difference]: Start difference. First operand has 279 places, 272 transitions, 581 flow. Second operand 3 states and 774 transitions. [2025-02-06 09:25:39,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 277 transitions, 663 flow [2025-02-06 09:25:39,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 277 transitions, 651 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:25:39,302 INFO L231 Difference]: Finished difference. Result has 277 places, 273 transitions, 583 flow [2025-02-06 09:25:39,306 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=571, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=583, PETRI_PLACES=277, PETRI_TRANSITIONS=273} [2025-02-06 09:25:39,306 INFO L279 CegarLoopForPetriNet]: 281 programPoint places, -4 predicate places. [2025-02-06 09:25:39,306 INFO L471 AbstractCegarLoop]: Abstraction has has 277 places, 273 transitions, 583 flow [2025-02-06 09:25:39,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 247.33333333333334) internal successors, (742), 3 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:25:39,307 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:25:39,307 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:25:39,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 09:25:39,307 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-02-06 09:25:39,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:25:39,308 INFO L85 PathProgramCache]: Analyzing trace with hash 802149384, now seen corresponding path program 1 times [2025-02-06 09:25:39,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:25:39,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625220718] [2025-02-06 09:25:39,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:25:39,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:25:39,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-06 09:25:39,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-06 09:25:39,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:39,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:25:39,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:25:39,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:25:39,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625220718] [2025-02-06 09:25:39,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625220718] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:25:39,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:25:39,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:25:39,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390348448] [2025-02-06 09:25:39,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:25:39,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:25:39,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:25:39,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:25:39,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:25:39,414 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 297 [2025-02-06 09:25:39,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 273 transitions, 583 flow. Second operand has 3 states, 3 states have (on average 236.66666666666666) internal successors, (710), 3 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:25:39,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:25:39,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 297 [2025-02-06 09:25:39,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:25:46,953 INFO L124 PetriNetUnfolderBase]: 27408/82928 cut-off events. [2025-02-06 09:25:46,954 INFO L125 PetriNetUnfolderBase]: For 2827/4511 co-relation queries the response was YES. [2025-02-06 09:25:47,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122736 conditions, 82928 events. 27408/82928 cut-off events. For 2827/4511 co-relation queries the response was YES. Maximal size of possible extension queue 1674. Compared 1104705 event pairs, 10807 based on Foata normal form. 38/74968 useless extension candidates. Maximal degree in co-relation 122628. Up to 25328 conditions per place. [2025-02-06 09:25:47,414 INFO L140 encePairwiseOnDemand]: 282/297 looper letters, 60 selfloop transitions, 10 changer transitions 0/302 dead transitions. [2025-02-06 09:25:47,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 302 transitions, 802 flow [2025-02-06 09:25:47,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:25:47,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:25:47,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 780 transitions. [2025-02-06 09:25:47,416 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8754208754208754 [2025-02-06 09:25:47,416 INFO L175 Difference]: Start difference. First operand has 277 places, 273 transitions, 583 flow. Second operand 3 states and 780 transitions. [2025-02-06 09:25:47,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 302 transitions, 802 flow [2025-02-06 09:25:47,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 302 transitions, 800 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:25:47,423 INFO L231 Difference]: Finished difference. Result has 278 places, 279 transitions, 655 flow [2025-02-06 09:25:47,423 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=577, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=655, PETRI_PLACES=278, PETRI_TRANSITIONS=279} [2025-02-06 09:25:47,424 INFO L279 CegarLoopForPetriNet]: 281 programPoint places, -3 predicate places. [2025-02-06 09:25:47,424 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 279 transitions, 655 flow [2025-02-06 09:25:47,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.66666666666666) internal successors, (710), 3 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:25:47,424 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:25:47,424 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:25:47,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 09:25:47,425 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-02-06 09:25:47,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:25:47,425 INFO L85 PathProgramCache]: Analyzing trace with hash 160159471, now seen corresponding path program 1 times [2025-02-06 09:25:47,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:25:47,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214172656] [2025-02-06 09:25:47,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:25:47,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:25:47,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-06 09:25:47,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-06 09:25:47,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:47,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:25:47,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 09:25:47,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:25:47,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214172656] [2025-02-06 09:25:47,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214172656] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:25:47,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:25:47,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:25:47,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562471901] [2025-02-06 09:25:47,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:25:47,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 09:25:47,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:25:47,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 09:25:47,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 09:25:47,657 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 297 [2025-02-06 09:25:47,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 279 transitions, 655 flow. Second operand has 5 states, 5 states have (on average 245.6) internal successors, (1228), 5 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:25:47,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:25:47,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 297 [2025-02-06 09:25:47,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:25:55,177 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1123] L715-5-->L715-2: Formula: (and (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][244], [278#true, 172#L715-2true, 299#true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 282#true, 169#L715-2true, Black: 294#true, 11#L708true, 280#true, 296#(= |#race~glob~0| 0), 196#L715-8true]) [2025-02-06 09:25:55,178 INFO L294 olderBase$Statistics]: this new event has 237 ancestors and is cut-off event [2025-02-06 09:25:55,178 INFO L297 olderBase$Statistics]: existing Event has 237 ancestors and is cut-off event [2025-02-06 09:25:55,178 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is cut-off event [2025-02-06 09:25:55,178 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is cut-off event [2025-02-06 09:25:55,178 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1123] L715-5-->L715-2: Formula: (and (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][244], [278#true, 172#L715-2true, 299#true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 282#true, 169#L715-2true, Black: 294#true, 123#L715-9true, 11#L708true, 280#true, 296#(= |#race~glob~0| 0)]) [2025-02-06 09:25:55,178 INFO L294 olderBase$Statistics]: this new event has 238 ancestors and is cut-off event [2025-02-06 09:25:55,178 INFO L297 olderBase$Statistics]: existing Event has 238 ancestors and is cut-off event [2025-02-06 09:25:55,178 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2025-02-06 09:25:55,178 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2025-02-06 09:25:55,236 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1123] L715-5-->L715-2: Formula: (and (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][244], [211#ULTIMATE.startFINALtrue, 278#true, 172#L715-2true, 299#true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 282#true, Black: 294#true, 169#L715-2true, 280#true, 296#(= |#race~glob~0| 0), 196#L715-8true]) [2025-02-06 09:25:55,236 INFO L294 olderBase$Statistics]: this new event has 238 ancestors and is cut-off event [2025-02-06 09:25:55,236 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2025-02-06 09:25:55,237 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2025-02-06 09:25:55,237 INFO L297 olderBase$Statistics]: existing Event has 238 ancestors and is cut-off event [2025-02-06 09:25:55,237 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1123] L715-5-->L715-2: Formula: (and (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][244], [211#ULTIMATE.startFINALtrue, 278#true, 172#L715-2true, 299#true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 282#true, Black: 294#true, 123#L715-9true, 169#L715-2true, 280#true, 296#(= |#race~glob~0| 0)]) [2025-02-06 09:25:55,237 INFO L294 olderBase$Statistics]: this new event has 239 ancestors and is cut-off event [2025-02-06 09:25:55,237 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2025-02-06 09:25:55,237 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2025-02-06 09:25:55,237 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2025-02-06 09:25:55,346 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1123] L715-5-->L715-2: Formula: (and (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][244], [278#true, 299#true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 282#true, 169#L715-2true, Black: 294#true, 11#L708true, 280#true, 296#(= |#race~glob~0| 0), 196#L715-8true, 150#L716true]) [2025-02-06 09:25:55,347 INFO L294 olderBase$Statistics]: this new event has 240 ancestors and is cut-off event [2025-02-06 09:25:55,347 INFO L297 olderBase$Statistics]: existing Event has 181 ancestors and is cut-off event [2025-02-06 09:25:55,347 INFO L297 olderBase$Statistics]: existing Event has 240 ancestors and is cut-off event [2025-02-06 09:25:55,347 INFO L297 olderBase$Statistics]: existing Event has 181 ancestors and is cut-off event [2025-02-06 09:25:55,347 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1123] L715-5-->L715-2: Formula: (and (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][244], [278#true, 299#true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 282#true, 169#L715-2true, Black: 294#true, 123#L715-9true, 11#L708true, 280#true, 296#(= |#race~glob~0| 0), 150#L716true]) [2025-02-06 09:25:55,347 INFO L294 olderBase$Statistics]: this new event has 241 ancestors and is cut-off event [2025-02-06 09:25:55,347 INFO L297 olderBase$Statistics]: existing Event has 182 ancestors and is cut-off event [2025-02-06 09:25:55,347 INFO L297 olderBase$Statistics]: existing Event has 241 ancestors and is cut-off event [2025-02-06 09:25:55,347 INFO L297 olderBase$Statistics]: existing Event has 182 ancestors and is cut-off event [2025-02-06 09:25:55,397 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1123] L715-5-->L715-2: Formula: (and (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][244], [211#ULTIMATE.startFINALtrue, 278#true, 299#true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 282#true, Black: 294#true, 169#L715-2true, 280#true, 296#(= |#race~glob~0| 0), 196#L715-8true, 150#L716true]) [2025-02-06 09:25:55,397 INFO L294 olderBase$Statistics]: this new event has 241 ancestors and is cut-off event [2025-02-06 09:25:55,397 INFO L297 olderBase$Statistics]: existing Event has 182 ancestors and is cut-off event [2025-02-06 09:25:55,397 INFO L297 olderBase$Statistics]: existing Event has 182 ancestors and is cut-off event [2025-02-06 09:25:55,397 INFO L297 olderBase$Statistics]: existing Event has 241 ancestors and is cut-off event [2025-02-06 09:25:55,397 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1123] L715-5-->L715-2: Formula: (and (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][244], [211#ULTIMATE.startFINALtrue, 278#true, 299#true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 282#true, Black: 294#true, 123#L715-9true, 169#L715-2true, 280#true, 296#(= |#race~glob~0| 0), 150#L716true]) [2025-02-06 09:25:55,398 INFO L294 olderBase$Statistics]: this new event has 242 ancestors and is cut-off event [2025-02-06 09:25:55,398 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2025-02-06 09:25:55,398 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2025-02-06 09:25:55,398 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2025-02-06 09:25:55,400 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1123] L715-5-->L715-2: Formula: (and (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][244], [278#true, 172#L715-2true, 299#true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 282#true, Black: 294#true, 169#L715-2true, 13#L709-36true, 280#true, 296#(= |#race~glob~0| 0), 196#L715-8true]) [2025-02-06 09:25:55,400 INFO L294 olderBase$Statistics]: this new event has 241 ancestors and is cut-off event [2025-02-06 09:25:55,400 INFO L297 olderBase$Statistics]: existing Event has 182 ancestors and is cut-off event [2025-02-06 09:25:55,400 INFO L297 olderBase$Statistics]: existing Event has 182 ancestors and is cut-off event [2025-02-06 09:25:55,400 INFO L297 olderBase$Statistics]: existing Event has 241 ancestors and is cut-off event [2025-02-06 09:25:55,400 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1123] L715-5-->L715-2: Formula: (and (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][244], [278#true, 172#L715-2true, 299#true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 282#true, Black: 294#true, 123#L715-9true, 169#L715-2true, 13#L709-36true, 280#true, 296#(= |#race~glob~0| 0)]) [2025-02-06 09:25:55,400 INFO L294 olderBase$Statistics]: this new event has 242 ancestors and is cut-off event [2025-02-06 09:25:55,400 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2025-02-06 09:25:55,400 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2025-02-06 09:25:55,400 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2025-02-06 09:25:55,449 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([921] L709-35-->L709-33: Formula: (= |v_#race~glob~0_12| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_12|} AuxVars[] AssignedVars[#race~glob~0][249], [278#true, 34#L715-8true, 172#L715-2true, 299#true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 282#true, 123#L715-9true, Black: 294#true, 280#true, 296#(= |#race~glob~0| 0), 118#L709-33true]) [2025-02-06 09:25:55,449 INFO L294 olderBase$Statistics]: this new event has 236 ancestors and is cut-off event [2025-02-06 09:25:55,449 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2025-02-06 09:25:55,449 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2025-02-06 09:25:55,449 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2025-02-06 09:25:55,449 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([921] L709-35-->L709-33: Formula: (= |v_#race~glob~0_12| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_12|} AuxVars[] AssignedVars[#race~glob~0][249], [278#true, 172#L715-2true, 299#true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 162#L715-9true, 282#true, Black: 294#true, 280#true, 296#(= |#race~glob~0| 0), 118#L709-33true, 196#L715-8true]) [2025-02-06 09:25:55,449 INFO L294 olderBase$Statistics]: this new event has 236 ancestors and is cut-off event [2025-02-06 09:25:55,449 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2025-02-06 09:25:55,449 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2025-02-06 09:25:55,449 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2025-02-06 09:25:55,450 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([921] L709-35-->L709-33: Formula: (= |v_#race~glob~0_12| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_12|} AuxVars[] AssignedVars[#race~glob~0][249], [278#true, 172#L715-2true, 299#true, 162#L715-9true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 282#true, 123#L715-9true, Black: 294#true, 280#true, 296#(= |#race~glob~0| 0), 118#L709-33true]) [2025-02-06 09:25:55,450 INFO L294 olderBase$Statistics]: this new event has 237 ancestors and is cut-off event [2025-02-06 09:25:55,450 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is cut-off event [2025-02-06 09:25:55,450 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is cut-off event [2025-02-06 09:25:55,450 INFO L297 olderBase$Statistics]: existing Event has 237 ancestors and is cut-off event [2025-02-06 09:25:55,450 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([921] L709-35-->L709-33: Formula: (= |v_#race~glob~0_12| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_12|} AuxVars[] AssignedVars[#race~glob~0][249], [278#true, 34#L715-8true, 172#L715-2true, 299#true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 282#true, Black: 294#true, 280#true, 296#(= |#race~glob~0| 0), 118#L709-33true, 196#L715-8true]) [2025-02-06 09:25:55,450 INFO L294 olderBase$Statistics]: this new event has 235 ancestors and is cut-off event [2025-02-06 09:25:55,450 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2025-02-06 09:25:55,450 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-02-06 09:25:55,450 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2025-02-06 09:25:55,545 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1123] L715-5-->L715-2: Formula: (and (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][244], [278#true, 299#true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 282#true, Black: 294#true, 169#L715-2true, 13#L709-36true, 280#true, 296#(= |#race~glob~0| 0), 196#L715-8true, 150#L716true]) [2025-02-06 09:25:55,545 INFO L294 olderBase$Statistics]: this new event has 244 ancestors and is cut-off event [2025-02-06 09:25:55,545 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2025-02-06 09:25:55,545 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2025-02-06 09:25:55,545 INFO L297 olderBase$Statistics]: existing Event has 244 ancestors and is cut-off event [2025-02-06 09:25:55,545 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1123] L715-5-->L715-2: Formula: (and (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][244], [278#true, 299#true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 282#true, Black: 294#true, 123#L715-9true, 169#L715-2true, 13#L709-36true, 280#true, 296#(= |#race~glob~0| 0), 150#L716true]) [2025-02-06 09:25:55,546 INFO L294 olderBase$Statistics]: this new event has 245 ancestors and is cut-off event [2025-02-06 09:25:55,546 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2025-02-06 09:25:55,546 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2025-02-06 09:25:55,546 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is cut-off event [2025-02-06 09:25:55,584 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1123] L715-5-->L715-2: Formula: (and (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][244], [277#true, 299#true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 282#true, 12#L722-3true, 169#L715-2true, Black: 294#true, 280#true, 296#(= |#race~glob~0| 0), 196#L715-8true]) [2025-02-06 09:25:55,585 INFO L294 olderBase$Statistics]: this new event has 245 ancestors and is cut-off event [2025-02-06 09:25:55,585 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is cut-off event [2025-02-06 09:25:55,585 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2025-02-06 09:25:55,585 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2025-02-06 09:25:55,585 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1123] L715-5-->L715-2: Formula: (and (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][244], [277#true, 299#true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 282#true, 12#L722-3true, Black: 294#true, 123#L715-9true, 169#L715-2true, 280#true, 296#(= |#race~glob~0| 0)]) [2025-02-06 09:25:55,585 INFO L294 olderBase$Statistics]: this new event has 246 ancestors and is cut-off event [2025-02-06 09:25:55,585 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2025-02-06 09:25:55,585 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2025-02-06 09:25:55,585 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2025-02-06 09:25:55,586 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([921] L709-35-->L709-33: Formula: (= |v_#race~glob~0_12| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_12|} AuxVars[] AssignedVars[#race~glob~0][249], [278#true, 34#L715-8true, 299#true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 282#true, 123#L715-9true, Black: 294#true, 280#true, 296#(= |#race~glob~0| 0), 118#L709-33true, 150#L716true]) [2025-02-06 09:25:55,586 INFO L294 olderBase$Statistics]: this new event has 239 ancestors and is cut-off event [2025-02-06 09:25:55,586 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2025-02-06 09:25:55,586 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2025-02-06 09:25:55,586 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2025-02-06 09:25:55,586 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([921] L709-35-->L709-33: Formula: (= |v_#race~glob~0_12| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_12|} AuxVars[] AssignedVars[#race~glob~0][249], [278#true, 299#true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 162#L715-9true, 282#true, Black: 294#true, 280#true, 296#(= |#race~glob~0| 0), 118#L709-33true, 196#L715-8true, 150#L716true]) [2025-02-06 09:25:55,586 INFO L294 olderBase$Statistics]: this new event has 239 ancestors and is cut-off event [2025-02-06 09:25:55,586 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2025-02-06 09:25:55,586 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2025-02-06 09:25:55,587 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2025-02-06 09:25:55,587 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([921] L709-35-->L709-33: Formula: (= |v_#race~glob~0_12| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_12|} AuxVars[] AssignedVars[#race~glob~0][249], [278#true, 299#true, 162#L715-9true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 282#true, Black: 294#true, 123#L715-9true, 280#true, 296#(= |#race~glob~0| 0), 118#L709-33true, 150#L716true]) [2025-02-06 09:25:55,587 INFO L294 olderBase$Statistics]: this new event has 240 ancestors and is cut-off event [2025-02-06 09:25:55,587 INFO L297 olderBase$Statistics]: existing Event has 181 ancestors and is cut-off event [2025-02-06 09:25:55,587 INFO L297 olderBase$Statistics]: existing Event has 181 ancestors and is cut-off event [2025-02-06 09:25:55,587 INFO L297 olderBase$Statistics]: existing Event has 240 ancestors and is cut-off event [2025-02-06 09:25:55,587 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([921] L709-35-->L709-33: Formula: (= |v_#race~glob~0_12| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_12|} AuxVars[] AssignedVars[#race~glob~0][249], [278#true, 34#L715-8true, 299#true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 282#true, Black: 294#true, 280#true, 296#(= |#race~glob~0| 0), 118#L709-33true, 196#L715-8true, 150#L716true]) [2025-02-06 09:25:55,587 INFO L294 olderBase$Statistics]: this new event has 238 ancestors and is cut-off event [2025-02-06 09:25:55,587 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2025-02-06 09:25:55,587 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2025-02-06 09:25:55,587 INFO L297 olderBase$Statistics]: existing Event has 238 ancestors and is cut-off event [2025-02-06 09:25:56,054 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1123] L715-5-->L715-2: Formula: (and (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][244], [211#ULTIMATE.startFINALtrue, 277#true, 299#true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 282#true, 169#L715-2true, Black: 294#true, 280#true, 296#(= |#race~glob~0| 0), 196#L715-8true]) [2025-02-06 09:25:56,054 INFO L294 olderBase$Statistics]: this new event has 255 ancestors and is cut-off event [2025-02-06 09:25:56,055 INFO L297 olderBase$Statistics]: existing Event has 196 ancestors and is cut-off event [2025-02-06 09:25:56,055 INFO L297 olderBase$Statistics]: existing Event has 196 ancestors and is cut-off event [2025-02-06 09:25:56,055 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2025-02-06 09:25:56,055 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1123] L715-5-->L715-2: Formula: (and (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][244], [211#ULTIMATE.startFINALtrue, 277#true, 299#true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 282#true, Black: 294#true, 123#L715-9true, 169#L715-2true, 280#true, 296#(= |#race~glob~0| 0)]) [2025-02-06 09:25:56,055 INFO L294 olderBase$Statistics]: this new event has 256 ancestors and is cut-off event [2025-02-06 09:25:56,055 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-02-06 09:25:56,055 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-02-06 09:25:56,055 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2025-02-06 09:25:56,173 INFO L124 PetriNetUnfolderBase]: 17381/82412 cut-off events. [2025-02-06 09:25:56,174 INFO L125 PetriNetUnfolderBase]: For 4529/4670 co-relation queries the response was YES. [2025-02-06 09:25:56,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112958 conditions, 82412 events. 17381/82412 cut-off events. For 4529/4670 co-relation queries the response was YES. Maximal size of possible extension queue 1297. Compared 1232728 event pairs, 8955 based on Foata normal form. 5/74957 useless extension candidates. Maximal degree in co-relation 43231. Up to 20332 conditions per place. [2025-02-06 09:25:56,652 INFO L140 encePairwiseOnDemand]: 292/297 looper letters, 52 selfloop transitions, 5 changer transitions 0/303 dead transitions. [2025-02-06 09:25:56,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 303 transitions, 819 flow [2025-02-06 09:25:56,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:25:56,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:25:56,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1522 transitions. [2025-02-06 09:25:56,655 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8540965207631874 [2025-02-06 09:25:56,655 INFO L175 Difference]: Start difference. First operand has 278 places, 279 transitions, 655 flow. Second operand 6 states and 1522 transitions. [2025-02-06 09:25:56,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 303 transitions, 819 flow [2025-02-06 09:25:56,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 303 transitions, 799 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:25:56,687 INFO L231 Difference]: Finished difference. Result has 284 places, 282 transitions, 667 flow [2025-02-06 09:25:56,687 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=635, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=667, PETRI_PLACES=284, PETRI_TRANSITIONS=282} [2025-02-06 09:25:56,688 INFO L279 CegarLoopForPetriNet]: 281 programPoint places, 3 predicate places. [2025-02-06 09:25:56,688 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 282 transitions, 667 flow [2025-02-06 09:25:56,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 245.6) internal successors, (1228), 5 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:25:56,688 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:25:56,689 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-02-06 09:25:56,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 09:25:56,689 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-02-06 09:25:56,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:25:56,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1033444572, now seen corresponding path program 1 times [2025-02-06 09:25:56,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:25:56,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944331246] [2025-02-06 09:25:56,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:25:56,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:25:56,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-06 09:25:56,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-06 09:25:56,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:56,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:25:56,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 09:25:56,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:25:56,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944331246] [2025-02-06 09:25:56,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944331246] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:25:56,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:25:56,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:25:56,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772480434] [2025-02-06 09:25:56,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:25:56,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:25:56,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:25:56,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:25:56,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:25:56,750 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 297 [2025-02-06 09:25:56,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 282 transitions, 667 flow. Second operand has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:25:56,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:25:56,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 297 [2025-02-06 09:25:56,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:26:09,033 INFO L124 PetriNetUnfolderBase]: 28122/119345 cut-off events. [2025-02-06 09:26:09,033 INFO L125 PetriNetUnfolderBase]: For 1437/1437 co-relation queries the response was YES. [2025-02-06 09:26:09,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164990 conditions, 119345 events. 28122/119345 cut-off events. For 1437/1437 co-relation queries the response was YES. Maximal size of possible extension queue 2352. Compared 1879907 event pairs, 16827 based on Foata normal form. 242/108682 useless extension candidates. Maximal degree in co-relation 164802. Up to 22645 conditions per place. [2025-02-06 09:26:09,942 INFO L140 encePairwiseOnDemand]: 294/297 looper letters, 47 selfloop transitions, 2 changer transitions 0/301 dead transitions. [2025-02-06 09:26:09,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 301 transitions, 803 flow [2025-02-06 09:26:09,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:26:09,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:26:09,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 788 transitions. [2025-02-06 09:26:09,955 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8843995510662177 [2025-02-06 09:26:09,956 INFO L175 Difference]: Start difference. First operand has 284 places, 282 transitions, 667 flow. Second operand 3 states and 788 transitions. [2025-02-06 09:26:09,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 301 transitions, 803 flow [2025-02-06 09:26:09,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 301 transitions, 797 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-06 09:26:09,966 INFO L231 Difference]: Finished difference. Result has 285 places, 283 transitions, 673 flow [2025-02-06 09:26:09,970 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=661, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=673, PETRI_PLACES=285, PETRI_TRANSITIONS=283} [2025-02-06 09:26:09,971 INFO L279 CegarLoopForPetriNet]: 281 programPoint places, 4 predicate places. [2025-02-06 09:26:09,971 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 283 transitions, 673 flow [2025-02-06 09:26:09,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:26:09,971 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:26:09,971 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:26:09,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 09:26:09,972 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-02-06 09:26:09,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:26:09,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1954154265, now seen corresponding path program 1 times [2025-02-06 09:26:09,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:26:09,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151680086] [2025-02-06 09:26:09,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:26:09,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:26:09,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-06 09:26:10,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-06 09:26:10,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:26:10,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:26:10,025 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 09:26:10,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-06 09:26:10,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-06 09:26:10,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:26:10,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:26:10,076 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 09:26:10,076 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 09:26:10,076 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-02-06 09:26:10,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2025-02-06 09:26:10,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2025-02-06 09:26:10,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2025-02-06 09:26:10,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2025-02-06 09:26:10,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2025-02-06 09:26:10,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2025-02-06 09:26:10,077 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2025-02-06 09:26:10,077 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2025-02-06 09:26:10,077 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2025-02-06 09:26:10,077 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2025-02-06 09:26:10,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 09:26:10,077 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-02-06 09:26:10,077 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 09:26:10,077 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-02-06 09:26:10,102 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-02-06 09:26:10,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 311 places, 330 transitions, 700 flow [2025-02-06 09:26:10,176 INFO L124 PetriNetUnfolderBase]: 77/1021 cut-off events. [2025-02-06 09:26:10,176 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-02-06 09:26:10,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1072 conditions, 1021 events. 77/1021 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 4749 event pairs, 6 based on Foata normal form. 0/899 useless extension candidates. Maximal degree in co-relation 741. Up to 32 conditions per place. [2025-02-06 09:26:10,182 INFO L82 GeneralOperation]: Start removeDead. Operand has 311 places, 330 transitions, 700 flow [2025-02-06 09:26:10,186 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 311 places, 330 transitions, 700 flow [2025-02-06 09:26:10,187 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:26:10,187 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;@38bfe57c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:26:10,187 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-02-06 09:26:10,193 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:26:10,193 INFO L124 PetriNetUnfolderBase]: 0/104 cut-off events. [2025-02-06 09:26:10,193 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:26:10,193 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:26:10,193 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-02-06 09:26:10,194 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-02-06 09:26:10,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:26:10,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1719907880, now seen corresponding path program 1 times [2025-02-06 09:26:10,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:26:10,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182112082] [2025-02-06 09:26:10,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:26:10,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:26:10,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-06 09:26:10,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-06 09:26:10,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:26:10,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:26:10,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:26:10,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:26:10,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182112082] [2025-02-06 09:26:10,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182112082] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:26:10,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:26:10,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:26:10,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684632382] [2025-02-06 09:26:10,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:26:10,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:26:10,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:26:10,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:26:10,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:26:10,457 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 330 [2025-02-06 09:26:10,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 330 transitions, 700 flow. Second operand has 6 states, 6 states have (on average 257.5) internal successors, (1545), 6 states have internal predecessors, (1545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:26:10,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:26:10,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 330 [2025-02-06 09:26:10,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand