./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/thread-join-array-const-race-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-race-challenges/thread-join-array-const-race-3.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 fa0ecdfec37b7bd940900ff854c772fdadeb6c6111223868a85a6141c0a777e6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:37:49,688 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:37:49,735 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:37:49,740 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:37:49,741 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:37:49,759 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:37:49,760 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:37:49,760 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:37:49,760 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:37:49,760 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:37:49,760 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:37:49,760 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:37:49,760 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:37:49,761 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:37:49,761 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:37:49,761 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:37:49,761 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:37:49,761 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:37:49,761 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:37:49,761 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:37:49,761 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:37:49,761 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:37:49,761 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:37:49,761 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:37:49,761 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:37:49,761 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:37:49,761 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:37:49,761 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:37:49,761 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:37:49,761 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:37:49,762 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:37:49,762 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:37:49,762 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:37:49,762 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:37:49,762 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:37:49,762 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:37:49,762 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:37:49,762 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:37:49,762 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:37:49,762 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:37:49,762 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:37:49,762 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:37:49,762 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:37:49,762 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:37:49,762 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:37:49,762 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:37:49,762 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 -> fa0ecdfec37b7bd940900ff854c772fdadeb6c6111223868a85a6141c0a777e6 [2025-01-09 21:37:49,979 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:37:49,987 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:37:49,988 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:37:49,989 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:37:49,989 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:37:49,990 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/thread-join-array-const-race-3.i [2025-01-09 21:37:51,120 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4c752912e/cd7a66e44d4548fca539b6c56c16a0ec/FLAGd53bd2948 [2025-01-09 21:37:51,388 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:37:51,389 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-array-const-race-3.i [2025-01-09 21:37:51,403 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4c752912e/cd7a66e44d4548fca539b6c56c16a0ec/FLAGd53bd2948 [2025-01-09 21:37:51,694 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4c752912e/cd7a66e44d4548fca539b6c56c16a0ec [2025-01-09 21:37:51,695 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:37:51,696 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:37:51,697 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:37:51,697 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:37:51,700 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:37:51,700 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:37:51" (1/1) ... [2025-01-09 21:37:51,701 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58d6f49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:37:51, skipping insertion in model container [2025-01-09 21:37:51,701 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:37:51" (1/1) ... [2025-01-09 21:37:51,723 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:37:51,955 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:37:51,968 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:37:52,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:37:52,043 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:37:52,044 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:37:52 WrapperNode [2025-01-09 21:37:52,045 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:37:52,046 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:37:52,047 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:37:52,047 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:37:52,052 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:37:52" (1/1) ... [2025-01-09 21:37:52,061 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:37:52" (1/1) ... [2025-01-09 21:37:52,077 INFO L138 Inliner]: procedures = 158, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 68 [2025-01-09 21:37:52,078 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:37:52,078 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:37:52,078 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:37:52,078 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:37:52,083 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:37:52" (1/1) ... [2025-01-09 21:37:52,083 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:37:52" (1/1) ... [2025-01-09 21:37:52,086 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:37:52" (1/1) ... [2025-01-09 21:37:52,089 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:37:52" (1/1) ... [2025-01-09 21:37:52,093 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:37:52" (1/1) ... [2025-01-09 21:37:52,094 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:37:52" (1/1) ... [2025-01-09 21:37:52,096 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:37:52" (1/1) ... [2025-01-09 21:37:52,097 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:37:52" (1/1) ... [2025-01-09 21:37:52,097 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:37:52" (1/1) ... [2025-01-09 21:37:52,099 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:37:52,099 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:37:52,099 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:37:52,099 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:37:52,100 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:37:52" (1/1) ... [2025-01-09 21:37:52,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:37:52,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:37:52,121 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 21:37:52,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 21:37:52,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:37:52,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:37:52,137 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 21:37:52,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:37:52,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 21:37:52,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 21:37:52,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:37:52,137 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-01-09 21:37:52,138 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-01-09 21:37:52,138 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 21:37:52,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:37:52,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:37:52,139 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:37:52,239 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:37:52,240 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:37:52,414 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:37:52,415 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:37:52,430 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:37:52,430 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 21:37:52,430 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:37:52 BoogieIcfgContainer [2025-01-09 21:37:52,430 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:37:52,432 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:37:52,432 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:37:52,435 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:37:52,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:37:51" (1/3) ... [2025-01-09 21:37:52,436 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2482a5ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:37:52, skipping insertion in model container [2025-01-09 21:37:52,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:37:52" (2/3) ... [2025-01-09 21:37:52,437 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2482a5ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:37:52, skipping insertion in model container [2025-01-09 21:37:52,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:37:52" (3/3) ... [2025-01-09 21:37:52,438 INFO L128 eAbstractionObserver]: Analyzing ICFG thread-join-array-const-race-3.i [2025-01-09 21:37:52,450 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:37:52,452 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG thread-join-array-const-race-3.i that has 2 procedures, 90 locations, 1 initial locations, 2 loop locations, and 5 error locations. [2025-01-09 21:37:52,452 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:37:52,495 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 21:37:52,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 109 transitions, 232 flow [2025-01-09 21:37:52,582 INFO L124 PetriNetUnfolderBase]: 2/219 cut-off events. [2025-01-09 21:37:52,584 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:37:52,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 219 events. 2/219 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 594 event pairs, 0 based on Foata normal form. 0/198 useless extension candidates. Maximal degree in co-relation 61. Up to 5 conditions per place. [2025-01-09 21:37:52,590 INFO L82 GeneralOperation]: Start removeDead. Operand has 113 places, 109 transitions, 232 flow [2025-01-09 21:37:52,594 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 108 transitions, 229 flow [2025-01-09 21:37:52,604 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:37:52,614 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;@16261487, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:37:52,615 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-01-09 21:37:52,624 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:37:52,624 INFO L124 PetriNetUnfolderBase]: 0/34 cut-off events. [2025-01-09 21:37:52,624 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:37:52,624 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:37:52,625 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:37:52,625 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-01-09 21:37:52,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:37:52,633 INFO L85 PathProgramCache]: Analyzing trace with hash -229988159, now seen corresponding path program 1 times [2025-01-09 21:37:52,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:37:52,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231988419] [2025-01-09 21:37:52,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:37:52,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:37:52,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 21:37:52,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 21:37:52,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:37:52,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:37:53,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:37:53,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:37:53,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231988419] [2025-01-09 21:37:53,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231988419] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:37:53,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:37:53,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:37:53,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330842269] [2025-01-09 21:37:53,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:37:53,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:37:53,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:37:53,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:37:53,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:37:53,456 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 109 [2025-01-09 21:37:53,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 108 transitions, 229 flow. Second operand has 6 states, 6 states have (on average 79.5) internal successors, (477), 6 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:37:53,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:37:53,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 109 [2025-01-09 21:37:53,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:37:53,683 INFO L124 PetriNetUnfolderBase]: 138/786 cut-off events. [2025-01-09 21:37:53,683 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-01-09 21:37:53,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1116 conditions, 786 events. 138/786 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 4923 event pairs, 87 based on Foata normal form. 0/702 useless extension candidates. Maximal degree in co-relation 826. Up to 276 conditions per place. [2025-01-09 21:37:53,691 INFO L140 encePairwiseOnDemand]: 103/109 looper letters, 33 selfloop transitions, 5 changer transitions 0/115 dead transitions. [2025-01-09 21:37:53,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 115 transitions, 319 flow [2025-01-09 21:37:53,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:37:53,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:37:53,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 507 transitions. [2025-01-09 21:37:53,704 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7752293577981652 [2025-01-09 21:37:53,706 INFO L175 Difference]: Start difference. First operand has 112 places, 108 transitions, 229 flow. Second operand 6 states and 507 transitions. [2025-01-09 21:37:53,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 115 transitions, 319 flow [2025-01-09 21:37:53,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 115 transitions, 315 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:37:53,715 INFO L231 Difference]: Finished difference. Result has 114 places, 107 transitions, 233 flow [2025-01-09 21:37:53,717 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=233, PETRI_PLACES=114, PETRI_TRANSITIONS=107} [2025-01-09 21:37:53,720 INFO L279 CegarLoopForPetriNet]: 112 programPoint places, 2 predicate places. [2025-01-09 21:37:53,720 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 107 transitions, 233 flow [2025-01-09 21:37:53,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 79.5) internal successors, (477), 6 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:37:53,721 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:37:53,721 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] [2025-01-09 21:37:53,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:37:53,722 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-01-09 21:37:53,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:37:53,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1469481322, now seen corresponding path program 1 times [2025-01-09 21:37:53,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:37:53,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289387689] [2025-01-09 21:37:53,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:37:53,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:37:53,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 21:37:53,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 21:37:53,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:37:53,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:37:53,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:37:53,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:37:53,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289387689] [2025-01-09 21:37:53,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289387689] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:37:53,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:37:53,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:37:53,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917136363] [2025-01-09 21:37:53,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:37:53,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:37:53,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:37:53,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:37:53,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:37:53,810 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 109 [2025-01-09 21:37:53,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 107 transitions, 233 flow. Second operand has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:37:53,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:37:53,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 109 [2025-01-09 21:37:53,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:37:53,872 INFO L124 PetriNetUnfolderBase]: 33/416 cut-off events. [2025-01-09 21:37:53,872 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-01-09 21:37:53,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 522 conditions, 416 events. 33/416 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1815 event pairs, 9 based on Foata normal form. 1/376 useless extension candidates. Maximal degree in co-relation 459. Up to 43 conditions per place. [2025-01-09 21:37:53,874 INFO L140 encePairwiseOnDemand]: 104/109 looper letters, 17 selfloop transitions, 4 changer transitions 0/113 dead transitions. [2025-01-09 21:37:53,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 113 transitions, 287 flow [2025-01-09 21:37:53,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:37:53,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 21:37:53,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 398 transitions. [2025-01-09 21:37:53,876 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9128440366972477 [2025-01-09 21:37:53,877 INFO L175 Difference]: Start difference. First operand has 114 places, 107 transitions, 233 flow. Second operand 4 states and 398 transitions. [2025-01-09 21:37:53,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 113 transitions, 287 flow [2025-01-09 21:37:53,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 113 transitions, 277 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:37:53,879 INFO L231 Difference]: Finished difference. Result has 113 places, 107 transitions, 235 flow [2025-01-09 21:37:53,879 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=235, PETRI_PLACES=113, PETRI_TRANSITIONS=107} [2025-01-09 21:37:53,880 INFO L279 CegarLoopForPetriNet]: 112 programPoint places, 1 predicate places. [2025-01-09 21:37:53,880 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 107 transitions, 235 flow [2025-01-09 21:37:53,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:37:53,880 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:37:53,881 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:37:53,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:37:53,881 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-01-09 21:37:53,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:37:53,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1350168109, now seen corresponding path program 1 times [2025-01-09 21:37:53,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:37:53,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882696011] [2025-01-09 21:37:53,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:37:53,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:37:53,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 21:37:53,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 21:37:53,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:37:53,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:37:53,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:37:53,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:37:53,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882696011] [2025-01-09 21:37:53,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882696011] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:37:53,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:37:53,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:37:53,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145705367] [2025-01-09 21:37:53,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:37:53,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:37:53,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:37:53,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:37:53,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:37:53,940 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 109 [2025-01-09 21:37:53,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 107 transitions, 235 flow. Second operand has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:37:53,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:37:53,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 109 [2025-01-09 21:37:53,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:37:54,019 INFO L124 PetriNetUnfolderBase]: 112/709 cut-off events. [2025-01-09 21:37:54,019 INFO L125 PetriNetUnfolderBase]: For 28/38 co-relation queries the response was YES. [2025-01-09 21:37:54,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 967 conditions, 709 events. 112/709 cut-off events. For 28/38 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 4257 event pairs, 59 based on Foata normal form. 1/628 useless extension candidates. Maximal degree in co-relation 910. Up to 182 conditions per place. [2025-01-09 21:37:54,025 INFO L140 encePairwiseOnDemand]: 103/109 looper letters, 18 selfloop transitions, 5 changer transitions 0/115 dead transitions. [2025-01-09 21:37:54,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 115 transitions, 299 flow [2025-01-09 21:37:54,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:37:54,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:37:54,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 306 transitions. [2025-01-09 21:37:54,027 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9357798165137615 [2025-01-09 21:37:54,027 INFO L175 Difference]: Start difference. First operand has 113 places, 107 transitions, 235 flow. Second operand 3 states and 306 transitions. [2025-01-09 21:37:54,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 115 transitions, 299 flow [2025-01-09 21:37:54,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 115 transitions, 291 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-09 21:37:54,029 INFO L231 Difference]: Finished difference. Result has 114 places, 111 transitions, 265 flow [2025-01-09 21:37:54,029 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=265, PETRI_PLACES=114, PETRI_TRANSITIONS=111} [2025-01-09 21:37:54,029 INFO L279 CegarLoopForPetriNet]: 112 programPoint places, 2 predicate places. [2025-01-09 21:37:54,029 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 111 transitions, 265 flow [2025-01-09 21:37:54,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:37:54,031 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:37:54,031 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] [2025-01-09 21:37:54,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:37:54,031 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-01-09 21:37:54,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:37:54,032 INFO L85 PathProgramCache]: Analyzing trace with hash 915388552, now seen corresponding path program 1 times [2025-01-09 21:37:54,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:37:54,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602876883] [2025-01-09 21:37:54,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:37:54,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:37:54,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 21:37:54,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 21:37:54,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:37:54,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:37:54,055 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:37:54,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 21:37:54,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 21:37:54,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:37:54,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:37:54,087 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:37:54,087 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:37:54,088 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2025-01-09 21:37:54,090 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2025-01-09 21:37:54,090 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2025-01-09 21:37:54,090 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2025-01-09 21:37:54,090 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2025-01-09 21:37:54,090 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 9 remaining) [2025-01-09 21:37:54,090 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2025-01-09 21:37:54,090 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2025-01-09 21:37:54,090 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2025-01-09 21:37:54,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:37:54,091 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:37:54,092 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:37:54,094 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-09 21:37:54,118 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-01-09 21:37:54,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 145 transitions, 322 flow [2025-01-09 21:37:54,154 INFO L124 PetriNetUnfolderBase]: 7/386 cut-off events. [2025-01-09 21:37:54,154 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-01-09 21:37:54,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 414 conditions, 386 events. 7/386 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1316 event pairs, 1 based on Foata normal form. 0/348 useless extension candidates. Maximal degree in co-relation 409. Up to 12 conditions per place. [2025-01-09 21:37:54,155 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 145 transitions, 322 flow [2025-01-09 21:37:54,157 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 131 places, 126 transitions, 274 flow [2025-01-09 21:37:54,158 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:37:54,158 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;@16261487, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:37:54,158 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-01-09 21:37:54,162 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:37:54,162 INFO L124 PetriNetUnfolderBase]: 0/34 cut-off events. [2025-01-09 21:37:54,162 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:37:54,162 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:37:54,162 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:37:54,162 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-01-09 21:37:54,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:37:54,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1242961599, now seen corresponding path program 1 times [2025-01-09 21:37:54,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:37:54,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598060613] [2025-01-09 21:37:54,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:37:54,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:37:54,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 21:37:54,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 21:37:54,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:37:54,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:37:54,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:37:54,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:37:54,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598060613] [2025-01-09 21:37:54,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598060613] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:37:54,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:37:54,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:37:54,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767839167] [2025-01-09 21:37:54,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:37:54,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:37:54,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:37:54,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:37:54,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:37:54,534 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 145 [2025-01-09 21:37:54,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 126 transitions, 274 flow. Second operand has 6 states, 6 states have (on average 107.5) internal successors, (645), 6 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:37:54,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:37:54,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 145 [2025-01-09 21:37:54,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:37:54,932 INFO L124 PetriNetUnfolderBase]: 879/3345 cut-off events. [2025-01-09 21:37:54,932 INFO L125 PetriNetUnfolderBase]: For 166/166 co-relation queries the response was YES. [2025-01-09 21:37:54,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4952 conditions, 3345 events. 879/3345 cut-off events. For 166/166 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 29418 event pairs, 505 based on Foata normal form. 0/3021 useless extension candidates. Maximal degree in co-relation 1438. Up to 1365 conditions per place. [2025-01-09 21:37:54,946 INFO L140 encePairwiseOnDemand]: 139/145 looper letters, 45 selfloop transitions, 5 changer transitions 0/141 dead transitions. [2025-01-09 21:37:54,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 141 transitions, 404 flow [2025-01-09 21:37:54,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:37:54,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:37:54,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 687 transitions. [2025-01-09 21:37:54,948 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7896551724137931 [2025-01-09 21:37:54,948 INFO L175 Difference]: Start difference. First operand has 131 places, 126 transitions, 274 flow. Second operand 6 states and 687 transitions. [2025-01-09 21:37:54,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 141 transitions, 404 flow [2025-01-09 21:37:54,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 141 transitions, 400 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:37:54,951 INFO L231 Difference]: Finished difference. Result has 133 places, 125 transitions, 278 flow [2025-01-09 21:37:54,951 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=278, PETRI_PLACES=133, PETRI_TRANSITIONS=125} [2025-01-09 21:37:54,952 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 2 predicate places. [2025-01-09 21:37:54,952 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 125 transitions, 278 flow [2025-01-09 21:37:54,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 107.5) internal successors, (645), 6 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:37:54,952 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:37:54,952 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] [2025-01-09 21:37:54,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:37:54,953 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-01-09 21:37:54,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:37:54,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1488080534, now seen corresponding path program 1 times [2025-01-09 21:37:54,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:37:54,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299735851] [2025-01-09 21:37:54,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:37:54,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:37:54,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 21:37:54,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 21:37:54,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:37:54,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:37:54,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:37:54,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:37:54,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299735851] [2025-01-09 21:37:54,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299735851] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:37:54,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:37:54,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:37:54,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980922794] [2025-01-09 21:37:54,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:37:54,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:37:54,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:37:54,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:37:54,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:37:55,015 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 145 [2025-01-09 21:37:55,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 125 transitions, 278 flow. Second operand has 4 states, 4 states have (on average 123.25) internal successors, (493), 4 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:37:55,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:37:55,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 145 [2025-01-09 21:37:55,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:37:55,149 INFO L124 PetriNetUnfolderBase]: 253/1589 cut-off events. [2025-01-09 21:37:55,149 INFO L125 PetriNetUnfolderBase]: For 133/133 co-relation queries the response was YES. [2025-01-09 21:37:55,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2112 conditions, 1589 events. 253/1589 cut-off events. For 133/133 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 11771 event pairs, 101 based on Foata normal form. 1/1437 useless extension candidates. Maximal degree in co-relation 1094. Up to 267 conditions per place. [2025-01-09 21:37:55,158 INFO L140 encePairwiseOnDemand]: 140/145 looper letters, 24 selfloop transitions, 4 changer transitions 0/134 dead transitions. [2025-01-09 21:37:55,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 134 transitions, 352 flow [2025-01-09 21:37:55,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:37:55,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 21:37:55,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 517 transitions. [2025-01-09 21:37:55,159 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8913793103448275 [2025-01-09 21:37:55,160 INFO L175 Difference]: Start difference. First operand has 133 places, 125 transitions, 278 flow. Second operand 4 states and 517 transitions. [2025-01-09 21:37:55,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 134 transitions, 352 flow [2025-01-09 21:37:55,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 134 transitions, 342 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:37:55,162 INFO L231 Difference]: Finished difference. Result has 132 places, 126 transitions, 284 flow [2025-01-09 21:37:55,162 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=284, PETRI_PLACES=132, PETRI_TRANSITIONS=126} [2025-01-09 21:37:55,163 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 1 predicate places. [2025-01-09 21:37:55,163 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 126 transitions, 284 flow [2025-01-09 21:37:55,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.25) internal successors, (493), 4 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:37:55,163 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:37:55,163 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:37:55,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:37:55,164 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-01-09 21:37:55,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:37:55,164 INFO L85 PathProgramCache]: Analyzing trace with hash 877305666, now seen corresponding path program 1 times [2025-01-09 21:37:55,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:37:55,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262205390] [2025-01-09 21:37:55,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:37:55,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:37:55,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 21:37:55,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 21:37:55,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:37:55,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:37:55,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:37:55,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:37:55,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262205390] [2025-01-09 21:37:55,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262205390] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:37:55,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:37:55,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:37:55,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330145705] [2025-01-09 21:37:55,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:37:55,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:37:55,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:37:55,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:37:55,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:37:55,213 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 145 [2025-01-09 21:37:55,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 126 transitions, 284 flow. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:37:55,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:37:55,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 145 [2025-01-09 21:37:55,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:37:55,561 INFO L124 PetriNetUnfolderBase]: 1070/3962 cut-off events. [2025-01-09 21:37:55,561 INFO L125 PetriNetUnfolderBase]: For 341/341 co-relation queries the response was YES. [2025-01-09 21:37:55,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5831 conditions, 3962 events. 1070/3962 cut-off events. For 341/341 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 37254 event pairs, 701 based on Foata normal form. 0/3518 useless extension candidates. Maximal degree in co-relation 5709. Up to 1393 conditions per place. [2025-01-09 21:37:55,590 INFO L140 encePairwiseOnDemand]: 138/145 looper letters, 27 selfloop transitions, 6 changer transitions 0/139 dead transitions. [2025-01-09 21:37:55,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 139 transitions, 386 flow [2025-01-09 21:37:55,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:37:55,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:37:55,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 394 transitions. [2025-01-09 21:37:55,593 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9057471264367816 [2025-01-09 21:37:55,593 INFO L175 Difference]: Start difference. First operand has 132 places, 126 transitions, 284 flow. Second operand 3 states and 394 transitions. [2025-01-09 21:37:55,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 139 transitions, 386 flow [2025-01-09 21:37:55,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 139 transitions, 380 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:37:55,596 INFO L231 Difference]: Finished difference. Result has 134 places, 131 transitions, 324 flow [2025-01-09 21:37:55,597 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=324, PETRI_PLACES=134, PETRI_TRANSITIONS=131} [2025-01-09 21:37:55,597 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 3 predicate places. [2025-01-09 21:37:55,597 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 131 transitions, 324 flow [2025-01-09 21:37:55,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:37:55,597 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:37:55,597 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:37:55,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:37:55,598 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-01-09 21:37:55,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:37:55,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1655545143, now seen corresponding path program 1 times [2025-01-09 21:37:55,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:37:55,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200275212] [2025-01-09 21:37:55,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:37:55,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:37:55,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 21:37:55,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 21:37:55,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:37:55,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:37:55,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:37:55,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:37:55,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200275212] [2025-01-09 21:37:55,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200275212] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:37:55,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:37:55,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 21:37:55,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109850299] [2025-01-09 21:37:55,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:37:55,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:37:55,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:37:55,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:37:55,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:37:55,743 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 145 [2025-01-09 21:37:55,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 131 transitions, 324 flow. Second operand has 6 states, 6 states have (on average 121.5) internal successors, (729), 6 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:37:55,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:37:55,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 145 [2025-01-09 21:37:55,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:37:56,034 INFO L124 PetriNetUnfolderBase]: 640/3440 cut-off events. [2025-01-09 21:37:56,036 INFO L125 PetriNetUnfolderBase]: For 292/304 co-relation queries the response was YES. [2025-01-09 21:37:56,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4874 conditions, 3440 events. 640/3440 cut-off events. For 292/304 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 31135 event pairs, 147 based on Foata normal form. 3/2997 useless extension candidates. Maximal degree in co-relation 2772. Up to 401 conditions per place. [2025-01-09 21:37:56,059 INFO L140 encePairwiseOnDemand]: 138/145 looper letters, 33 selfloop transitions, 7 changer transitions 0/149 dead transitions. [2025-01-09 21:37:56,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 149 transitions, 440 flow [2025-01-09 21:37:56,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 21:37:56,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 21:37:56,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 881 transitions. [2025-01-09 21:37:56,062 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8679802955665025 [2025-01-09 21:37:56,062 INFO L175 Difference]: Start difference. First operand has 134 places, 131 transitions, 324 flow. Second operand 7 states and 881 transitions. [2025-01-09 21:37:56,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 149 transitions, 440 flow [2025-01-09 21:37:56,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 149 transitions, 428 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:37:56,067 INFO L231 Difference]: Finished difference. Result has 141 places, 133 transitions, 342 flow [2025-01-09 21:37:56,067 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=342, PETRI_PLACES=141, PETRI_TRANSITIONS=133} [2025-01-09 21:37:56,068 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 10 predicate places. [2025-01-09 21:37:56,068 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 133 transitions, 342 flow [2025-01-09 21:37:56,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.5) internal successors, (729), 6 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:37:56,069 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:37:56,069 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] [2025-01-09 21:37:56,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:37:56,069 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-01-09 21:37:56,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:37:56,070 INFO L85 PathProgramCache]: Analyzing trace with hash -2054646016, now seen corresponding path program 1 times [2025-01-09 21:37:56,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:37:56,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031985931] [2025-01-09 21:37:56,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:37:56,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:37:56,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 21:37:56,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 21:37:56,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:37:56,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:37:56,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:37:56,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:37:56,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031985931] [2025-01-09 21:37:56,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031985931] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:37:56,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:37:56,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:37:56,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597624022] [2025-01-09 21:37:56,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:37:56,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:37:56,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:37:56,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:37:56,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:37:56,126 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 145 [2025-01-09 21:37:56,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 133 transitions, 342 flow. Second operand has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:37:56,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:37:56,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 145 [2025-01-09 21:37:56,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:37:56,597 INFO L124 PetriNetUnfolderBase]: 1661/6017 cut-off events. [2025-01-09 21:37:56,597 INFO L125 PetriNetUnfolderBase]: For 1158/1202 co-relation queries the response was YES. [2025-01-09 21:37:56,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9998 conditions, 6017 events. 1661/6017 cut-off events. For 1158/1202 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 60192 event pairs, 951 based on Foata normal form. 2/5317 useless extension candidates. Maximal degree in co-relation 9889. Up to 2039 conditions per place. [2025-01-09 21:37:56,635 INFO L140 encePairwiseOnDemand]: 138/145 looper letters, 28 selfloop transitions, 9 changer transitions 0/147 dead transitions. [2025-01-09 21:37:56,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 147 transitions, 459 flow [2025-01-09 21:37:56,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:37:56,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:37:56,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 393 transitions. [2025-01-09 21:37:56,637 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.903448275862069 [2025-01-09 21:37:56,637 INFO L175 Difference]: Start difference. First operand has 141 places, 133 transitions, 342 flow. Second operand 3 states and 393 transitions. [2025-01-09 21:37:56,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 147 transitions, 459 flow [2025-01-09 21:37:56,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 147 transitions, 449 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-01-09 21:37:56,644 INFO L231 Difference]: Finished difference. Result has 142 places, 140 transitions, 408 flow [2025-01-09 21:37:56,644 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=408, PETRI_PLACES=142, PETRI_TRANSITIONS=140} [2025-01-09 21:37:56,646 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 11 predicate places. [2025-01-09 21:37:56,646 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 140 transitions, 408 flow [2025-01-09 21:37:56,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:37:56,647 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:37:56,647 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:37:56,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:37:56,647 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-01-09 21:37:56,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:37:56,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1276503866, now seen corresponding path program 1 times [2025-01-09 21:37:56,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:37:56,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525525789] [2025-01-09 21:37:56,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:37:56,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:37:56,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 21:37:56,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 21:37:56,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:37:56,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:37:56,672 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:37:56,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 21:37:56,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 21:37:56,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:37:56,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:37:56,694 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:37:56,694 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:37:56,694 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-01-09 21:37:56,694 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2025-01-09 21:37:56,695 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2025-01-09 21:37:56,695 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2025-01-09 21:37:56,695 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2025-01-09 21:37:56,695 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 11 remaining) [2025-01-09 21:37:56,695 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2025-01-09 21:37:56,695 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2025-01-09 21:37:56,695 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2025-01-09 21:37:56,695 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2025-01-09 21:37:56,695 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2025-01-09 21:37:56,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:37:56,695 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-01-09 21:37:56,696 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:37:56,696 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-09 21:37:56,720 INFO L143 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2025-01-09 21:37:56,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 189 places, 181 transitions, 416 flow [2025-01-09 21:37:56,762 INFO L124 PetriNetUnfolderBase]: 20/657 cut-off events. [2025-01-09 21:37:56,762 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-01-09 21:37:56,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 713 conditions, 657 events. 20/657 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2730 event pairs, 6 based on Foata normal form. 0/590 useless extension candidates. Maximal degree in co-relation 706. Up to 32 conditions per place. [2025-01-09 21:37:56,764 INFO L82 GeneralOperation]: Start removeDead. Operand has 189 places, 181 transitions, 416 flow [2025-01-09 21:37:56,766 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 150 places, 144 transitions, 321 flow [2025-01-09 21:37:56,767 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:37:56,768 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;@16261487, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:37:56,769 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-01-09 21:37:56,770 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:37:56,770 INFO L124 PetriNetUnfolderBase]: 0/34 cut-off events. [2025-01-09 21:37:56,770 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:37:56,770 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:37:56,770 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:37:56,771 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:37:56,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:37:56,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1217262565, now seen corresponding path program 1 times [2025-01-09 21:37:56,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:37:56,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97263092] [2025-01-09 21:37:56,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:37:56,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:37:56,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 21:37:56,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 21:37:56,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:37:56,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:37:56,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:37:56,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:37:56,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97263092] [2025-01-09 21:37:56,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97263092] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:37:56,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:37:56,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:37:56,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416548105] [2025-01-09 21:37:56,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:37:56,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:37:56,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:37:56,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:37:56,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:37:57,070 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 181 [2025-01-09 21:37:57,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 144 transitions, 321 flow. Second operand has 6 states, 6 states have (on average 135.5) internal successors, (813), 6 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:37:57,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:37:57,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 181 [2025-01-09 21:37:57,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:37:58,282 INFO L124 PetriNetUnfolderBase]: 4640/13687 cut-off events. [2025-01-09 21:37:58,282 INFO L125 PetriNetUnfolderBase]: For 903/903 co-relation queries the response was YES. [2025-01-09 21:37:58,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21098 conditions, 13687 events. 4640/13687 cut-off events. For 903/903 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 143057 event pairs, 2591 based on Foata normal form. 0/12582 useless extension candidates. Maximal degree in co-relation 4944. Up to 6402 conditions per place. [2025-01-09 21:37:58,362 INFO L140 encePairwiseOnDemand]: 175/181 looper letters, 57 selfloop transitions, 5 changer transitions 0/167 dead transitions. [2025-01-09 21:37:58,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 167 transitions, 491 flow [2025-01-09 21:37:58,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:37:58,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:37:58,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 867 transitions. [2025-01-09 21:37:58,365 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7983425414364641 [2025-01-09 21:37:58,365 INFO L175 Difference]: Start difference. First operand has 150 places, 144 transitions, 321 flow. Second operand 6 states and 867 transitions. [2025-01-09 21:37:58,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 167 transitions, 491 flow [2025-01-09 21:37:58,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 167 transitions, 487 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:37:58,371 INFO L231 Difference]: Finished difference. Result has 152 places, 143 transitions, 325 flow [2025-01-09 21:37:58,371 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=325, PETRI_PLACES=152, PETRI_TRANSITIONS=143} [2025-01-09 21:37:58,372 INFO L279 CegarLoopForPetriNet]: 150 programPoint places, 2 predicate places. [2025-01-09 21:37:58,372 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 143 transitions, 325 flow [2025-01-09 21:37:58,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 135.5) internal successors, (813), 6 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:37:58,373 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:37:58,373 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] [2025-01-09 21:37:58,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:37:58,373 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:37:58,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:37:58,374 INFO L85 PathProgramCache]: Analyzing trace with hash 445618454, now seen corresponding path program 1 times [2025-01-09 21:37:58,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:37:58,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857519212] [2025-01-09 21:37:58,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:37:58,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:37:58,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 21:37:58,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 21:37:58,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:37:58,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:37:58,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:37:58,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:37:58,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857519212] [2025-01-09 21:37:58,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857519212] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:37:58,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:37:58,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:37:58,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792870310] [2025-01-09 21:37:58,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:37:58,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:37:58,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:37:58,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:37:58,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:37:58,446 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 181 [2025-01-09 21:37:58,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 143 transitions, 325 flow. Second operand has 4 states, 4 states have (on average 151.25) internal successors, (605), 4 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:37:58,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:37:58,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 181 [2025-01-09 21:37:58,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:37:59,105 INFO L124 PetriNetUnfolderBase]: 1406/6341 cut-off events. [2025-01-09 21:37:59,105 INFO L125 PetriNetUnfolderBase]: For 782/782 co-relation queries the response was YES. [2025-01-09 21:37:59,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8798 conditions, 6341 events. 1406/6341 cut-off events. For 782/782 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 62176 event pairs, 529 based on Foata normal form. 1/5734 useless extension candidates. Maximal degree in co-relation 2746. Up to 1304 conditions per place. [2025-01-09 21:37:59,130 INFO L140 encePairwiseOnDemand]: 176/181 looper letters, 30 selfloop transitions, 4 changer transitions 0/154 dead transitions. [2025-01-09 21:37:59,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 154 transitions, 415 flow [2025-01-09 21:37:59,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:37:59,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 21:37:59,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 635 transitions. [2025-01-09 21:37:59,131 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8770718232044199 [2025-01-09 21:37:59,131 INFO L175 Difference]: Start difference. First operand has 152 places, 143 transitions, 325 flow. Second operand 4 states and 635 transitions. [2025-01-09 21:37:59,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 154 transitions, 415 flow [2025-01-09 21:37:59,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 154 transitions, 405 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:37:59,134 INFO L231 Difference]: Finished difference. Result has 151 places, 144 transitions, 331 flow [2025-01-09 21:37:59,134 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=331, PETRI_PLACES=151, PETRI_TRANSITIONS=144} [2025-01-09 21:37:59,134 INFO L279 CegarLoopForPetriNet]: 150 programPoint places, 1 predicate places. [2025-01-09 21:37:59,134 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 144 transitions, 331 flow [2025-01-09 21:37:59,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 151.25) internal successors, (605), 4 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:37:59,134 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:37:59,135 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:37:59,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:37:59,135 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:37:59,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:37:59,135 INFO L85 PathProgramCache]: Analyzing trace with hash 730943637, now seen corresponding path program 1 times [2025-01-09 21:37:59,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:37:59,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511939302] [2025-01-09 21:37:59,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:37:59,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:37:59,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 21:37:59,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 21:37:59,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:37:59,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:37:59,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:37:59,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:37:59,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511939302] [2025-01-09 21:37:59,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511939302] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:37:59,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:37:59,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:37:59,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36981513] [2025-01-09 21:37:59,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:37:59,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:37:59,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:37:59,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:37:59,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:37:59,180 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 181 [2025-01-09 21:37:59,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 144 transitions, 331 flow. Second operand has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:37:59,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:37:59,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 181 [2025-01-09 21:37:59,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:38:01,021 INFO L124 PetriNetUnfolderBase]: 7632/23898 cut-off events. [2025-01-09 21:38:01,021 INFO L125 PetriNetUnfolderBase]: For 2848/2936 co-relation queries the response was YES. [2025-01-09 21:38:01,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35893 conditions, 23898 events. 7632/23898 cut-off events. For 2848/2936 co-relation queries the response was YES. Maximal size of possible extension queue 764. Compared 284606 event pairs, 4688 based on Foata normal form. 3/21137 useless extension candidates. Maximal degree in co-relation 35344. Up to 8983 conditions per place. [2025-01-09 21:38:01,171 INFO L140 encePairwiseOnDemand]: 173/181 looper letters, 36 selfloop transitions, 7 changer transitions 0/162 dead transitions. [2025-01-09 21:38:01,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 162 transitions, 473 flow [2025-01-09 21:38:01,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:38:01,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:38:01,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 482 transitions. [2025-01-09 21:38:01,176 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8876611418047882 [2025-01-09 21:38:01,176 INFO L175 Difference]: Start difference. First operand has 151 places, 144 transitions, 331 flow. Second operand 3 states and 482 transitions. [2025-01-09 21:38:01,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 162 transitions, 473 flow [2025-01-09 21:38:01,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 162 transitions, 467 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:38:01,186 INFO L231 Difference]: Finished difference. Result has 153 places, 150 transitions, 379 flow [2025-01-09 21:38:01,186 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=379, PETRI_PLACES=153, PETRI_TRANSITIONS=150} [2025-01-09 21:38:01,187 INFO L279 CegarLoopForPetriNet]: 150 programPoint places, 3 predicate places. [2025-01-09 21:38:01,187 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 150 transitions, 379 flow [2025-01-09 21:38:01,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:38:01,188 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:38:01,188 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:38:01,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:38:01,188 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:38:01,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:38:01,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1518871898, now seen corresponding path program 1 times [2025-01-09 21:38:01,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:38:01,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619458790] [2025-01-09 21:38:01,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:38:01,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:38:01,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 21:38:01,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 21:38:01,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:38:01,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:38:01,289 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:38:01,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:38:01,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619458790] [2025-01-09 21:38:01,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619458790] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:38:01,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:38:01,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 21:38:01,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772524678] [2025-01-09 21:38:01,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:38:01,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:38:01,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:38:01,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:38:01,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:38:01,355 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 181 [2025-01-09 21:38:01,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 150 transitions, 379 flow. Second operand has 6 states, 6 states have (on average 149.5) internal successors, (897), 6 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:38:01,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:38:01,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 181 [2025-01-09 21:38:01,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:38:03,175 INFO L124 PetriNetUnfolderBase]: 4543/18575 cut-off events. [2025-01-09 21:38:03,175 INFO L125 PetriNetUnfolderBase]: For 1933/2089 co-relation queries the response was YES. [2025-01-09 21:38:03,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27207 conditions, 18575 events. 4543/18575 cut-off events. For 1933/2089 co-relation queries the response was YES. Maximal size of possible extension queue 527. Compared 225742 event pairs, 1506 based on Foata normal form. 3/15943 useless extension candidates. Maximal degree in co-relation 7600. Up to 2942 conditions per place. [2025-01-09 21:38:03,305 INFO L140 encePairwiseOnDemand]: 174/181 looper letters, 41 selfloop transitions, 7 changer transitions 0/172 dead transitions. [2025-01-09 21:38:03,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 172 transitions, 521 flow [2025-01-09 21:38:03,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 21:38:03,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 21:38:03,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1085 transitions. [2025-01-09 21:38:03,310 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.856353591160221 [2025-01-09 21:38:03,310 INFO L175 Difference]: Start difference. First operand has 153 places, 150 transitions, 379 flow. Second operand 7 states and 1085 transitions. [2025-01-09 21:38:03,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 172 transitions, 521 flow [2025-01-09 21:38:03,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 172 transitions, 507 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:38:03,321 INFO L231 Difference]: Finished difference. Result has 160 places, 153 transitions, 401 flow [2025-01-09 21:38:03,321 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=401, PETRI_PLACES=160, PETRI_TRANSITIONS=153} [2025-01-09 21:38:03,322 INFO L279 CegarLoopForPetriNet]: 150 programPoint places, 10 predicate places. [2025-01-09 21:38:03,322 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 153 transitions, 401 flow [2025-01-09 21:38:03,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 149.5) internal successors, (897), 6 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:38:03,323 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:38:03,323 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] [2025-01-09 21:38:03,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:38:03,323 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:38:03,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:38:03,324 INFO L85 PathProgramCache]: Analyzing trace with hash -580527680, now seen corresponding path program 1 times [2025-01-09 21:38:03,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:38:03,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063619527] [2025-01-09 21:38:03,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:38:03,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:38:03,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 21:38:03,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 21:38:03,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:38:03,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:38:03,361 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 21:38:03,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:38:03,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063619527] [2025-01-09 21:38:03,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063619527] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:38:03,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:38:03,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:38:03,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897501750] [2025-01-09 21:38:03,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:38:03,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:38:03,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:38:03,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:38:03,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:38:03,383 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 181 [2025-01-09 21:38:03,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 153 transitions, 401 flow. Second operand has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:38:03,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:38:03,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 181 [2025-01-09 21:38:03,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:38:05,935 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([455] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][161], [32#L685-6true, 210#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), Black: 201#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 118#$Ultimate##0true, Black: 205#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet2|), 183#true, 116#L699-1true, 182#true, 180#true, 103#L685-6true, Black: 211#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 219#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|)), 223#true, Black: 217#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|) (= |ULTIMATE.start_main_#t~post7#1| 0))]) [2025-01-09 21:38:05,935 INFO L294 olderBase$Statistics]: this new event has 130 ancestors and is cut-off event [2025-01-09 21:38:05,935 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-01-09 21:38:05,935 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2025-01-09 21:38:05,935 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-01-09 21:38:05,936 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([455] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][161], [32#L685-6true, 122#L684-3true, 210#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), Black: 201#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 205#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet2|), 183#true, 116#L699-1true, 182#true, 180#true, 103#L685-6true, Black: 211#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 219#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|)), 223#true, Black: 217#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|) (= |ULTIMATE.start_main_#t~post7#1| 0))]) [2025-01-09 21:38:05,936 INFO L294 olderBase$Statistics]: this new event has 132 ancestors and is cut-off event [2025-01-09 21:38:05,936 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2025-01-09 21:38:05,936 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2025-01-09 21:38:05,936 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2025-01-09 21:38:06,303 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([455] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][161], [32#L685-6true, 210#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), Black: 201#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 205#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet2|), 183#true, 182#true, 116#L699-1true, 180#true, 103#L685-6true, Black: 211#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 219#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|)), 223#true, Black: 217#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|) (= |ULTIMATE.start_main_#t~post7#1| 0)), 178#L685-5true]) [2025-01-09 21:38:06,303 INFO L294 olderBase$Statistics]: this new event has 138 ancestors and is cut-off event [2025-01-09 21:38:06,303 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2025-01-09 21:38:06,303 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2025-01-09 21:38:06,303 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2025-01-09 21:38:06,303 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([455] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][161], [2#L686-3true, 32#L685-6true, 210#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), Black: 201#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 205#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet2|), 183#true, 182#true, 116#L699-1true, 180#true, 103#L685-6true, Black: 211#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 219#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|)), 223#true, Black: 217#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|) (= |ULTIMATE.start_main_#t~post7#1| 0))]) [2025-01-09 21:38:06,303 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2025-01-09 21:38:06,303 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-01-09 21:38:06,303 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2025-01-09 21:38:06,303 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-01-09 21:38:06,843 INFO L124 PetriNetUnfolderBase]: 13096/40137 cut-off events. [2025-01-09 21:38:06,843 INFO L125 PetriNetUnfolderBase]: For 9403/10156 co-relation queries the response was YES. [2025-01-09 21:38:06,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67560 conditions, 40137 events. 13096/40137 cut-off events. For 9403/10156 co-relation queries the response was YES. Maximal size of possible extension queue 1401. Compared 515176 event pairs, 6801 based on Foata normal form. 29/35212 useless extension candidates. Maximal degree in co-relation 66468. Up to 14649 conditions per place. [2025-01-09 21:38:07,147 INFO L140 encePairwiseOnDemand]: 173/181 looper letters, 38 selfloop transitions, 11 changer transitions 0/173 dead transitions. [2025-01-09 21:38:07,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 173 transitions, 568 flow [2025-01-09 21:38:07,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:38:07,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:38:07,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 481 transitions. [2025-01-09 21:38:07,149 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8858195211786372 [2025-01-09 21:38:07,149 INFO L175 Difference]: Start difference. First operand has 160 places, 153 transitions, 401 flow. Second operand 3 states and 481 transitions. [2025-01-09 21:38:07,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 173 transitions, 568 flow [2025-01-09 21:38:07,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 173 transitions, 558 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-01-09 21:38:07,170 INFO L231 Difference]: Finished difference. Result has 161 places, 162 transitions, 487 flow [2025-01-09 21:38:07,170 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=487, PETRI_PLACES=161, PETRI_TRANSITIONS=162} [2025-01-09 21:38:07,170 INFO L279 CegarLoopForPetriNet]: 150 programPoint places, 11 predicate places. [2025-01-09 21:38:07,171 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 162 transitions, 487 flow [2025-01-09 21:38:07,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:38:07,171 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:38:07,171 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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] [2025-01-09 21:38:07,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:38:07,171 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:38:07,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:38:07,172 INFO L85 PathProgramCache]: Analyzing trace with hash -863302731, now seen corresponding path program 1 times [2025-01-09 21:38:07,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:38:07,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548041846] [2025-01-09 21:38:07,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:38:07,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:38:07,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 21:38:07,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 21:38:07,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:38:07,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:38:07,283 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 21:38:07,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:38:07,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548041846] [2025-01-09 21:38:07,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548041846] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:38:07,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:38:07,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 21:38:07,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971985128] [2025-01-09 21:38:07,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:38:07,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 21:38:07,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:38:07,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 21:38:07,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 21:38:07,357 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 181 [2025-01-09 21:38:07,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 162 transitions, 487 flow. Second operand has 8 states, 8 states have (on average 149.625) internal successors, (1197), 8 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:38:07,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:38:07,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 181 [2025-01-09 21:38:07,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:38:09,936 INFO L124 PetriNetUnfolderBase]: 7011/27275 cut-off events. [2025-01-09 21:38:09,936 INFO L125 PetriNetUnfolderBase]: For 6400/14512 co-relation queries the response was YES. [2025-01-09 21:38:10,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44729 conditions, 27275 events. 7011/27275 cut-off events. For 6400/14512 co-relation queries the response was YES. Maximal size of possible extension queue 805. Compared 351920 event pairs, 1470 based on Foata normal form. 31/23360 useless extension candidates. Maximal degree in co-relation 23973. Up to 3883 conditions per place. [2025-01-09 21:38:10,329 INFO L140 encePairwiseOnDemand]: 174/181 looper letters, 53 selfloop transitions, 10 changer transitions 0/196 dead transitions. [2025-01-09 21:38:10,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 196 transitions, 685 flow [2025-01-09 21:38:10,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 21:38:10,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-09 21:38:10,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1544 transitions. [2025-01-09 21:38:10,332 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8530386740331491 [2025-01-09 21:38:10,332 INFO L175 Difference]: Start difference. First operand has 161 places, 162 transitions, 487 flow. Second operand 10 states and 1544 transitions. [2025-01-09 21:38:10,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 196 transitions, 685 flow [2025-01-09 21:38:10,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 196 transitions, 663 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:38:10,350 INFO L231 Difference]: Finished difference. Result has 171 places, 164 transitions, 505 flow [2025-01-09 21:38:10,351 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=465, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=505, PETRI_PLACES=171, PETRI_TRANSITIONS=164} [2025-01-09 21:38:10,351 INFO L279 CegarLoopForPetriNet]: 150 programPoint places, 21 predicate places. [2025-01-09 21:38:10,351 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 164 transitions, 505 flow [2025-01-09 21:38:10,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 149.625) internal successors, (1197), 8 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:38:10,352 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:38:10,352 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] [2025-01-09 21:38:10,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:38:10,352 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:38:10,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:38:10,353 INFO L85 PathProgramCache]: Analyzing trace with hash 536732020, now seen corresponding path program 1 times [2025-01-09 21:38:10,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:38:10,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989222952] [2025-01-09 21:38:10,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:38:10,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:38:10,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 21:38:10,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 21:38:10,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:38:10,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:38:10,413 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 21:38:10,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:38:10,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989222952] [2025-01-09 21:38:10,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989222952] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:38:10,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:38:10,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:38:10,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606036823] [2025-01-09 21:38:10,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:38:10,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:38:10,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:38:10,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:38:10,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:38:10,423 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 181 [2025-01-09 21:38:10,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 164 transitions, 505 flow. Second operand has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:38:10,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:38:10,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 181 [2025-01-09 21:38:10,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:38:10,835 INFO L124 PetriNetUnfolderBase]: 577/5856 cut-off events. [2025-01-09 21:38:10,835 INFO L125 PetriNetUnfolderBase]: For 1023/1269 co-relation queries the response was YES. [2025-01-09 21:38:10,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8283 conditions, 5856 events. 577/5856 cut-off events. For 1023/1269 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 63712 event pairs, 252 based on Foata normal form. 164/5330 useless extension candidates. Maximal degree in co-relation 4006. Up to 528 conditions per place. [2025-01-09 21:38:10,862 INFO L140 encePairwiseOnDemand]: 173/181 looper letters, 16 selfloop transitions, 8 changer transitions 0/162 dead transitions. [2025-01-09 21:38:10,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 162 transitions, 536 flow [2025-01-09 21:38:10,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:38:10,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:38:10,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions. [2025-01-09 21:38:10,863 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9134438305709024 [2025-01-09 21:38:10,863 INFO L175 Difference]: Start difference. First operand has 171 places, 164 transitions, 505 flow. Second operand 3 states and 496 transitions. [2025-01-09 21:38:10,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 162 transitions, 536 flow [2025-01-09 21:38:10,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 162 transitions, 510 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-01-09 21:38:10,869 INFO L231 Difference]: Finished difference. Result has 167 places, 155 transitions, 441 flow [2025-01-09 21:38:10,870 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=425, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=441, PETRI_PLACES=167, PETRI_TRANSITIONS=155} [2025-01-09 21:38:10,870 INFO L279 CegarLoopForPetriNet]: 150 programPoint places, 17 predicate places. [2025-01-09 21:38:10,870 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 155 transitions, 441 flow [2025-01-09 21:38:10,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:38:10,871 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:38:10,871 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-09 21:38:10,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:38:10,871 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:38:10,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:38:10,871 INFO L85 PathProgramCache]: Analyzing trace with hash -2137107724, now seen corresponding path program 1 times [2025-01-09 21:38:10,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:38:10,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283913286] [2025-01-09 21:38:10,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:38:10,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:38:10,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 21:38:10,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 21:38:10,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:38:10,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:38:10,898 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 21:38:10,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:38:10,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283913286] [2025-01-09 21:38:10,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283913286] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:38:10,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:38:10,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:38:10,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931195344] [2025-01-09 21:38:10,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:38:10,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:38:10,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:38:10,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:38:10,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:38:10,923 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 181 [2025-01-09 21:38:10,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 155 transitions, 441 flow. Second operand has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:38:10,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:38:10,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 181 [2025-01-09 21:38:10,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:38:11,544 INFO L124 PetriNetUnfolderBase]: 1009/6373 cut-off events. [2025-01-09 21:38:11,544 INFO L125 PetriNetUnfolderBase]: For 2996/2996 co-relation queries the response was YES. [2025-01-09 21:38:11,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10918 conditions, 6373 events. 1009/6373 cut-off events. For 2996/2996 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 70636 event pairs, 785 based on Foata normal form. 0/5746 useless extension candidates. Maximal degree in co-relation 10619. Up to 1702 conditions per place. [2025-01-09 21:38:11,574 INFO L140 encePairwiseOnDemand]: 176/181 looper letters, 30 selfloop transitions, 4 changer transitions 0/162 dead transitions. [2025-01-09 21:38:11,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 162 transitions, 535 flow [2025-01-09 21:38:11,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:38:11,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:38:11,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 471 transitions. [2025-01-09 21:38:11,579 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8674033149171271 [2025-01-09 21:38:11,579 INFO L175 Difference]: Start difference. First operand has 167 places, 155 transitions, 441 flow. Second operand 3 states and 471 transitions. [2025-01-09 21:38:11,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 162 transitions, 535 flow [2025-01-09 21:38:11,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 162 transitions, 527 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:38:11,585 INFO L231 Difference]: Finished difference. Result has 170 places, 158 transitions, 467 flow [2025-01-09 21:38:11,585 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=467, PETRI_PLACES=170, PETRI_TRANSITIONS=158} [2025-01-09 21:38:11,586 INFO L279 CegarLoopForPetriNet]: 150 programPoint places, 20 predicate places. [2025-01-09 21:38:11,586 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 158 transitions, 467 flow [2025-01-09 21:38:11,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:38:11,587 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:38:11,587 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:38:11,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 21:38:11,587 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:38:11,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:38:11,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1023468821, now seen corresponding path program 1 times [2025-01-09 21:38:11,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:38:11,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348332323] [2025-01-09 21:38:11,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:38:11,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:38:11,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 21:38:11,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 21:38:11,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:38:11,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:38:11,609 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:38:11,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 21:38:11,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 21:38:11,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:38:11,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:38:11,636 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:38:11,636 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:38:11,636 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-01-09 21:38:11,636 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining) [2025-01-09 21:38:11,637 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining) [2025-01-09 21:38:11,637 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining) [2025-01-09 21:38:11,637 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining) [2025-01-09 21:38:11,637 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 13 remaining) [2025-01-09 21:38:11,637 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining) [2025-01-09 21:38:11,637 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining) [2025-01-09 21:38:11,637 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining) [2025-01-09 21:38:11,637 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining) [2025-01-09 21:38:11,637 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining) [2025-01-09 21:38:11,637 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining) [2025-01-09 21:38:11,637 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining) [2025-01-09 21:38:11,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 21:38:11,637 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:38:11,639 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:38:11,639 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-01-09 21:38:11,686 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2025-01-09 21:38:11,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 227 places, 217 transitions, 514 flow [2025-01-09 21:38:11,793 INFO L124 PetriNetUnfolderBase]: 53/1140 cut-off events. [2025-01-09 21:38:11,793 INFO L125 PetriNetUnfolderBase]: For 96/96 co-relation queries the response was YES. [2025-01-09 21:38:11,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1253 conditions, 1140 events. 53/1140 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 5798 event pairs, 23 based on Foata normal form. 0/1020 useless extension candidates. Maximal degree in co-relation 1244. Up to 80 conditions per place. [2025-01-09 21:38:11,798 INFO L82 GeneralOperation]: Start removeDead. Operand has 227 places, 217 transitions, 514 flow [2025-01-09 21:38:11,801 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 169 places, 162 transitions, 370 flow [2025-01-09 21:38:11,802 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:38:11,802 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;@16261487, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:38:11,802 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-01-09 21:38:11,804 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:38:11,804 INFO L124 PetriNetUnfolderBase]: 0/34 cut-off events. [2025-01-09 21:38:11,804 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:38:11,804 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:38:11,804 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:38:11,804 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-01-09 21:38:11,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:38:11,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1439250259, now seen corresponding path program 1 times [2025-01-09 21:38:11,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:38:11,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563334250] [2025-01-09 21:38:11,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:38:11,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:38:11,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 21:38:11,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 21:38:11,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:38:11,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:38:11,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:38:11,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:38:11,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563334250] [2025-01-09 21:38:11,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563334250] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:38:11,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:38:11,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:38:11,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512564844] [2025-01-09 21:38:11,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:38:11,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:38:11,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:38:11,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:38:11,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:38:12,041 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 217 [2025-01-09 21:38:12,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 162 transitions, 370 flow. Second operand has 6 states, 6 states have (on average 163.5) internal successors, (981), 6 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:38:12,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:38:12,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 217 [2025-01-09 21:38:12,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:38:17,586 INFO L124 PetriNetUnfolderBase]: 22557/56260 cut-off events. [2025-01-09 21:38:17,586 INFO L125 PetriNetUnfolderBase]: For 4409/4409 co-relation queries the response was YES. [2025-01-09 21:38:17,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89470 conditions, 56260 events. 22557/56260 cut-off events. For 4409/4409 co-relation queries the response was YES. Maximal size of possible extension queue 1516. Compared 671605 event pairs, 4473 based on Foata normal form. 0/51761 useless extension candidates. Maximal degree in co-relation 21203. Up to 29151 conditions per place. [2025-01-09 21:38:18,027 INFO L140 encePairwiseOnDemand]: 211/217 looper letters, 69 selfloop transitions, 5 changer transitions 0/193 dead transitions. [2025-01-09 21:38:18,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 193 transitions, 580 flow [2025-01-09 21:38:18,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:38:18,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:38:18,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1047 transitions. [2025-01-09 21:38:18,029 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.804147465437788 [2025-01-09 21:38:18,029 INFO L175 Difference]: Start difference. First operand has 169 places, 162 transitions, 370 flow. Second operand 6 states and 1047 transitions. [2025-01-09 21:38:18,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 193 transitions, 580 flow [2025-01-09 21:38:18,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 193 transitions, 576 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:38:18,036 INFO L231 Difference]: Finished difference. Result has 171 places, 161 transitions, 374 flow [2025-01-09 21:38:18,036 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=374, PETRI_PLACES=171, PETRI_TRANSITIONS=161} [2025-01-09 21:38:18,037 INFO L279 CegarLoopForPetriNet]: 169 programPoint places, 2 predicate places. [2025-01-09 21:38:18,037 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 161 transitions, 374 flow [2025-01-09 21:38:18,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 163.5) internal successors, (981), 6 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:38:18,037 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:38:18,037 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] [2025-01-09 21:38:18,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 21:38:18,037 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-01-09 21:38:18,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:38:18,038 INFO L85 PathProgramCache]: Analyzing trace with hash -301900266, now seen corresponding path program 1 times [2025-01-09 21:38:18,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:38:18,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568598990] [2025-01-09 21:38:18,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:38:18,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:38:18,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 21:38:18,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 21:38:18,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:38:18,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:38:18,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:38:18,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:38:18,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568598990] [2025-01-09 21:38:18,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568598990] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:38:18,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:38:18,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:38:18,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501402878] [2025-01-09 21:38:18,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:38:18,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:38:18,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:38:18,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:38:18,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:38:18,096 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 217 [2025-01-09 21:38:18,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 161 transitions, 374 flow. Second operand has 4 states, 4 states have (on average 179.25) internal successors, (717), 4 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:38:18,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:38:18,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 217 [2025-01-09 21:38:18,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:38:20,672 INFO L124 PetriNetUnfolderBase]: 6974/24532 cut-off events. [2025-01-09 21:38:20,672 INFO L125 PetriNetUnfolderBase]: For 4016/4016 co-relation queries the response was YES. [2025-01-09 21:38:20,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35624 conditions, 24532 events. 6974/24532 cut-off events. For 4016/4016 co-relation queries the response was YES. Maximal size of possible extension queue 617. Compared 287743 event pairs, 3483 based on Foata normal form. 1/22342 useless extension candidates. Maximal degree in co-relation 19152. Up to 5916 conditions per place. [2025-01-09 21:38:20,803 INFO L140 encePairwiseOnDemand]: 212/217 looper letters, 36 selfloop transitions, 4 changer transitions 0/174 dead transitions. [2025-01-09 21:38:20,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 174 transitions, 480 flow [2025-01-09 21:38:20,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:38:20,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 21:38:20,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 753 transitions. [2025-01-09 21:38:20,804 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8675115207373272 [2025-01-09 21:38:20,804 INFO L175 Difference]: Start difference. First operand has 171 places, 161 transitions, 374 flow. Second operand 4 states and 753 transitions. [2025-01-09 21:38:20,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 174 transitions, 480 flow [2025-01-09 21:38:20,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 174 transitions, 470 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:38:20,808 INFO L231 Difference]: Finished difference. Result has 170 places, 162 transitions, 380 flow [2025-01-09 21:38:20,808 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=380, PETRI_PLACES=170, PETRI_TRANSITIONS=162} [2025-01-09 21:38:20,808 INFO L279 CegarLoopForPetriNet]: 169 programPoint places, 1 predicate places. [2025-01-09 21:38:20,808 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 162 transitions, 380 flow [2025-01-09 21:38:20,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 179.25) internal successors, (717), 4 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:38:20,809 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:38:20,809 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:38:20,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 21:38:20,809 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-01-09 21:38:20,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:38:20,809 INFO L85 PathProgramCache]: Analyzing trace with hash -2019404436, now seen corresponding path program 1 times [2025-01-09 21:38:20,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:38:20,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290061310] [2025-01-09 21:38:20,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:38:20,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:38:20,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 21:38:20,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 21:38:20,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:38:20,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:38:20,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:38:20,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:38:20,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290061310] [2025-01-09 21:38:20,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290061310] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:38:20,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:38:20,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:38:20,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114387105] [2025-01-09 21:38:20,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:38:20,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:38:20,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:38:20,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:38:20,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:38:20,862 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 217 [2025-01-09 21:38:20,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 162 transitions, 380 flow. Second operand has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:38:20,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:38:20,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 217 [2025-01-09 21:38:20,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:38:32,176 INFO L124 PetriNetUnfolderBase]: 48754/121632 cut-off events. [2025-01-09 21:38:32,176 INFO L125 PetriNetUnfolderBase]: For 18880/18880 co-relation queries the response was YES. [2025-01-09 21:38:32,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192937 conditions, 121632 events. 48754/121632 cut-off events. For 18880/18880 co-relation queries the response was YES. Maximal size of possible extension queue 3510. Compared 1636914 event pairs, 34341 based on Foata normal form. 0/109072 useless extension candidates. Maximal degree in co-relation 191895. Up to 54063 conditions per place. [2025-01-09 21:38:33,523 INFO L140 encePairwiseOnDemand]: 208/217 looper letters, 45 selfloop transitions, 8 changer transitions 0/185 dead transitions. [2025-01-09 21:38:33,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 185 transitions, 564 flow [2025-01-09 21:38:33,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:38:33,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:38:33,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 570 transitions. [2025-01-09 21:38:33,524 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8755760368663594 [2025-01-09 21:38:33,524 INFO L175 Difference]: Start difference. First operand has 170 places, 162 transitions, 380 flow. Second operand 3 states and 570 transitions. [2025-01-09 21:38:33,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 185 transitions, 564 flow [2025-01-09 21:38:33,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 185 transitions, 558 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:38:33,690 INFO L231 Difference]: Finished difference. Result has 172 places, 169 transitions, 436 flow [2025-01-09 21:38:33,690 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=436, PETRI_PLACES=172, PETRI_TRANSITIONS=169} [2025-01-09 21:38:33,690 INFO L279 CegarLoopForPetriNet]: 169 programPoint places, 3 predicate places. [2025-01-09 21:38:33,690 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 169 transitions, 436 flow [2025-01-09 21:38:33,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:38:33,690 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:38:33,690 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:38:33,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 21:38:33,691 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-01-09 21:38:33,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:38:33,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1870552865, now seen corresponding path program 1 times [2025-01-09 21:38:33,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:38:33,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585894344] [2025-01-09 21:38:33,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:38:33,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:38:33,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 21:38:33,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 21:38:33,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:38:33,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:38:33,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:38:33,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:38:33,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585894344] [2025-01-09 21:38:33,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585894344] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:38:33,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:38:33,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 21:38:33,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931755977] [2025-01-09 21:38:33,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:38:33,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:38:33,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:38:33,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:38:33,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:38:33,780 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 217 [2025-01-09 21:38:33,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 169 transitions, 436 flow. Second operand has 6 states, 6 states have (on average 177.5) internal successors, (1065), 6 states have internal predecessors, (1065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:38:33,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:38:33,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 217 [2025-01-09 21:38:33,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand