./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/ldv-races/race-4_2-thread_local_vars.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/ldv-races/race-4_2-thread_local_vars.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 0f799b8cb369af433cd7b4f4a2ae1c7efd2306d185f06da0302d2727c00c6bf0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:17:26,708 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:17:26,748 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:17:26,752 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:17:26,752 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:17:26,769 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:17:26,769 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:17:26,769 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:17:26,769 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:17:26,769 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:17:26,770 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:17:26,770 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:17:26,770 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:17:26,770 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:17:26,770 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:17:26,770 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:17:26,770 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:17:26,770 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:17:26,770 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:17:26,770 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:17:26,771 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:17:26,771 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:17:26,771 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:17:26,771 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:17:26,771 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:17:26,771 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:17:26,771 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:17:26,771 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:17:26,771 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:17:26,771 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:17:26,771 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:17:26,771 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:17:26,772 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:17:26,772 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:17:26,772 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:17:26,772 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:17:26,772 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:17:26,772 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:17:26,772 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:17:26,772 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:17:26,772 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:17:26,772 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:17:26,772 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:17:26,773 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:17:26,773 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:17:26,773 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:17:26,773 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 -> 0f799b8cb369af433cd7b4f4a2ae1c7efd2306d185f06da0302d2727c00c6bf0 [2025-01-09 21:17:26,937 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:17:26,942 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:17:26,943 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:17:26,944 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:17:26,944 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:17:26,945 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-4_2-thread_local_vars.i [2025-01-09 21:17:28,007 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/182ffaddc/2ddad2295d2644f7b2c8761f9b7d0ada/FLAGb66789bc5 [2025-01-09 21:17:28,376 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:17:28,378 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-races/race-4_2-thread_local_vars.i [2025-01-09 21:17:28,402 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/182ffaddc/2ddad2295d2644f7b2c8761f9b7d0ada/FLAGb66789bc5 [2025-01-09 21:17:28,589 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/182ffaddc/2ddad2295d2644f7b2c8761f9b7d0ada [2025-01-09 21:17:28,592 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:17:28,593 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:17:28,595 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:17:28,596 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:17:28,599 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:17:28,600 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:17:28" (1/1) ... [2025-01-09 21:17:28,600 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65d60027 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:28, skipping insertion in model container [2025-01-09 21:17:28,600 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:17:28" (1/1) ... [2025-01-09 21:17:28,642 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:17:29,108 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:17:29,118 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:17:29,163 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:17:29,243 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:17:29,246 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:29 WrapperNode [2025-01-09 21:17:29,246 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:17:29,247 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:17:29,247 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:17:29,247 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:17:29,252 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:17:29" (1/1) ... [2025-01-09 21:17:29,270 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:17:29" (1/1) ... [2025-01-09 21:17:29,289 INFO L138 Inliner]: procedures = 487, calls = 38, calls flagged for inlining = 17, calls inlined = 23, statements flattened = 290 [2025-01-09 21:17:29,289 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:17:29,290 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:17:29,290 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:17:29,290 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:17:29,295 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:29" (1/1) ... [2025-01-09 21:17:29,295 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:29" (1/1) ... [2025-01-09 21:17:29,298 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:29" (1/1) ... [2025-01-09 21:17:29,302 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:29" (1/1) ... [2025-01-09 21:17:29,312 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:29" (1/1) ... [2025-01-09 21:17:29,317 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:29" (1/1) ... [2025-01-09 21:17:29,320 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:29" (1/1) ... [2025-01-09 21:17:29,322 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:29" (1/1) ... [2025-01-09 21:17:29,323 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:29" (1/1) ... [2025-01-09 21:17:29,326 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:17:29,327 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:17:29,327 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:17:29,327 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:17:29,327 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:29" (1/1) ... [2025-01-09 21:17:29,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:17:29,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:17:29,356 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:17:29,359 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:17:29,375 INFO L130 BoogieDeclarations]: Found specification of procedure thread_usb [2025-01-09 21:17:29,375 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_usb [2025-01-09 21:17:29,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 21:17:29,375 INFO L130 BoogieDeclarations]: Found specification of procedure thread_ath9k [2025-01-09 21:17:29,376 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_ath9k [2025-01-09 21:17:29,376 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 21:17:29,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:17:29,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-01-09 21:17:29,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:17:29,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:17:29,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 21:17:29,376 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 21:17:29,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:17:29,377 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:17:29,583 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:17:29,584 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:17:29,868 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:17:29,869 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:17:29,894 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:17:29,895 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 21:17:29,895 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:17:29 BoogieIcfgContainer [2025-01-09 21:17:29,895 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:17:29,900 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:17:29,900 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:17:29,903 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:17:29,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:17:28" (1/3) ... [2025-01-09 21:17:29,904 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@441fe98a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:17:29, skipping insertion in model container [2025-01-09 21:17:29,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:29" (2/3) ... [2025-01-09 21:17:29,905 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@441fe98a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:17:29, skipping insertion in model container [2025-01-09 21:17:29,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:17:29" (3/3) ... [2025-01-09 21:17:29,906 INFO L128 eAbstractionObserver]: Analyzing ICFG race-4_2-thread_local_vars.i [2025-01-09 21:17:29,919 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:17:29,922 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG race-4_2-thread_local_vars.i that has 3 procedures, 316 locations, 1 initial locations, 2 loop locations, and 24 error locations. [2025-01-09 21:17:29,923 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:17:30,016 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2025-01-09 21:17:30,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 469 places, 508 transitions, 1043 flow [2025-01-09 21:17:30,126 INFO L124 PetriNetUnfolderBase]: 42/514 cut-off events. [2025-01-09 21:17:30,128 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 21:17:30,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 525 conditions, 514 events. 42/514 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1464 event pairs, 0 based on Foata normal form. 0/430 useless extension candidates. Maximal degree in co-relation 361. Up to 11 conditions per place. [2025-01-09 21:17:30,134 INFO L82 GeneralOperation]: Start removeDead. Operand has 469 places, 508 transitions, 1043 flow [2025-01-09 21:17:30,139 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 321 places, 344 transitions, 704 flow [2025-01-09 21:17:30,145 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:17:30,156 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;@5db6afa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:17:30,156 INFO L334 AbstractCegarLoop]: Starting to check reachability of 43 error locations. [2025-01-09 21:17:30,162 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:17:30,162 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2025-01-09 21:17:30,162 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:17:30,162 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:30,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] [2025-01-09 21:17:30,164 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-01-09 21:17:30,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:30,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1573215475, now seen corresponding path program 1 times [2025-01-09 21:17:30,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:30,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765682262] [2025-01-09 21:17:30,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:30,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:30,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 21:17:30,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 21:17:30,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:30,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:30,437 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:17:30,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:30,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765682262] [2025-01-09 21:17:30,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765682262] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:30,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:30,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:17:30,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056736841] [2025-01-09 21:17:30,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:30,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:17:30,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:30,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:17:30,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:17:30,568 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 439 out of 508 [2025-01-09 21:17:30,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 344 transitions, 704 flow. Second operand has 3 states, 3 states have (on average 440.3333333333333) internal successors, (1321), 3 states have internal predecessors, (1321), 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:17:30,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:30,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 439 of 508 [2025-01-09 21:17:30,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:30,734 INFO L124 PetriNetUnfolderBase]: 122/1220 cut-off events. [2025-01-09 21:17:30,734 INFO L125 PetriNetUnfolderBase]: For 33/40 co-relation queries the response was YES. [2025-01-09 21:17:30,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1430 conditions, 1220 events. 122/1220 cut-off events. For 33/40 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 7197 event pairs, 76 based on Foata normal form. 113/1152 useless extension candidates. Maximal degree in co-relation 1106. Up to 185 conditions per place. [2025-01-09 21:17:30,742 INFO L140 encePairwiseOnDemand]: 489/508 looper letters, 24 selfloop transitions, 2 changer transitions 6/313 dead transitions. [2025-01-09 21:17:30,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 313 transitions, 694 flow [2025-01-09 21:17:30,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:17:30,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:17:30,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1360 transitions. [2025-01-09 21:17:30,755 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8923884514435696 [2025-01-09 21:17:30,756 INFO L175 Difference]: Start difference. First operand has 321 places, 344 transitions, 704 flow. Second operand 3 states and 1360 transitions. [2025-01-09 21:17:30,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 313 transitions, 694 flow [2025-01-09 21:17:30,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 313 transitions, 690 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:17:30,764 INFO L231 Difference]: Finished difference. Result has 306 places, 307 transitions, 630 flow [2025-01-09 21:17:30,766 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=508, PETRI_DIFFERENCE_MINUEND_FLOW=638, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=630, PETRI_PLACES=306, PETRI_TRANSITIONS=307} [2025-01-09 21:17:30,768 INFO L279 CegarLoopForPetriNet]: 321 programPoint places, -15 predicate places. [2025-01-09 21:17:30,768 INFO L471 AbstractCegarLoop]: Abstraction has has 306 places, 307 transitions, 630 flow [2025-01-09 21:17:30,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 440.3333333333333) internal successors, (1321), 3 states have internal predecessors, (1321), 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:17:30,769 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:30,769 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] [2025-01-09 21:17:30,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:17:30,770 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-01-09 21:17:30,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:30,770 INFO L85 PathProgramCache]: Analyzing trace with hash -978494005, now seen corresponding path program 1 times [2025-01-09 21:17:30,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:30,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973067351] [2025-01-09 21:17:30,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:30,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:30,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 21:17:30,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 21:17:30,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:30,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:30,850 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:17:30,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:30,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973067351] [2025-01-09 21:17:30,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973067351] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:30,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:30,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:17:30,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937241853] [2025-01-09 21:17:30,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:30,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:17:30,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:30,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:17:30,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:17:30,931 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 425 out of 508 [2025-01-09 21:17:30,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 307 transitions, 630 flow. Second operand has 3 states, 3 states have (on average 426.0) internal successors, (1278), 3 states have internal predecessors, (1278), 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:17:30,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:30,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 425 of 508 [2025-01-09 21:17:30,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:31,124 INFO L124 PetriNetUnfolderBase]: 161/1690 cut-off events. [2025-01-09 21:17:31,125 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-01-09 21:17:31,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1930 conditions, 1690 events. 161/1690 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 11573 event pairs, 29 based on Foata normal form. 0/1447 useless extension candidates. Maximal degree in co-relation 1896. Up to 156 conditions per place. [2025-01-09 21:17:31,135 INFO L140 encePairwiseOnDemand]: 484/508 looper letters, 30 selfloop transitions, 17 changer transitions 0/319 dead transitions. [2025-01-09 21:17:31,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 319 transitions, 749 flow [2025-01-09 21:17:31,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:17:31,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:17:31,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1329 transitions. [2025-01-09 21:17:31,138 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8720472440944882 [2025-01-09 21:17:31,138 INFO L175 Difference]: Start difference. First operand has 306 places, 307 transitions, 630 flow. Second operand 3 states and 1329 transitions. [2025-01-09 21:17:31,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 319 transitions, 749 flow [2025-01-09 21:17:31,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 319 transitions, 745 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:17:31,143 INFO L231 Difference]: Finished difference. Result has 299 places, 316 transitions, 744 flow [2025-01-09 21:17:31,143 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=508, PETRI_DIFFERENCE_MINUEND_FLOW=620, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=744, PETRI_PLACES=299, PETRI_TRANSITIONS=316} [2025-01-09 21:17:31,144 INFO L279 CegarLoopForPetriNet]: 321 programPoint places, -22 predicate places. [2025-01-09 21:17:31,144 INFO L471 AbstractCegarLoop]: Abstraction has has 299 places, 316 transitions, 744 flow [2025-01-09 21:17:31,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 426.0) internal successors, (1278), 3 states have internal predecessors, (1278), 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:17:31,145 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:31,145 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:17:31,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:17:31,145 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-01-09 21:17:31,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:31,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1769964934, now seen corresponding path program 1 times [2025-01-09 21:17:31,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:31,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641923648] [2025-01-09 21:17:31,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:31,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:31,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 21:17:31,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 21:17:31,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:31,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:31,235 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:17:31,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:31,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641923648] [2025-01-09 21:17:31,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641923648] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:31,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:31,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:17:31,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48250588] [2025-01-09 21:17:31,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:31,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:17:31,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:31,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:17:31,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:17:31,313 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 439 out of 508 [2025-01-09 21:17:31,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 316 transitions, 744 flow. Second operand has 3 states, 3 states have (on average 441.0) internal successors, (1323), 3 states have internal predecessors, (1323), 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:17:31,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:31,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 439 of 508 [2025-01-09 21:17:31,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:31,575 INFO L124 PetriNetUnfolderBase]: 273/2558 cut-off events. [2025-01-09 21:17:31,576 INFO L125 PetriNetUnfolderBase]: For 498/568 co-relation queries the response was YES. [2025-01-09 21:17:31,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3316 conditions, 2558 events. 273/2558 cut-off events. For 498/568 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 20559 event pairs, 99 based on Foata normal form. 0/2197 useless extension candidates. Maximal degree in co-relation 2825. Up to 331 conditions per place. [2025-01-09 21:17:31,598 INFO L140 encePairwiseOnDemand]: 505/508 looper letters, 32 selfloop transitions, 2 changer transitions 0/315 dead transitions. [2025-01-09 21:17:31,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 315 transitions, 810 flow [2025-01-09 21:17:31,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:17:31,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:17:31,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1344 transitions. [2025-01-09 21:17:31,603 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8818897637795275 [2025-01-09 21:17:31,603 INFO L175 Difference]: Start difference. First operand has 299 places, 316 transitions, 744 flow. Second operand 3 states and 1344 transitions. [2025-01-09 21:17:31,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 315 transitions, 810 flow [2025-01-09 21:17:31,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 315 transitions, 776 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:17:31,616 INFO L231 Difference]: Finished difference. Result has 298 places, 315 transitions, 712 flow [2025-01-09 21:17:31,616 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=508, PETRI_DIFFERENCE_MINUEND_FLOW=708, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=712, PETRI_PLACES=298, PETRI_TRANSITIONS=315} [2025-01-09 21:17:31,617 INFO L279 CegarLoopForPetriNet]: 321 programPoint places, -23 predicate places. [2025-01-09 21:17:31,617 INFO L471 AbstractCegarLoop]: Abstraction has has 298 places, 315 transitions, 712 flow [2025-01-09 21:17:31,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 441.0) internal successors, (1323), 3 states have internal predecessors, (1323), 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:17:31,618 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:31,618 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:17:31,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:17:31,618 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-01-09 21:17:31,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:31,620 INFO L85 PathProgramCache]: Analyzing trace with hash -198036652, now seen corresponding path program 1 times [2025-01-09 21:17:31,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:31,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140610368] [2025-01-09 21:17:31,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:31,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:31,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 21:17:31,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 21:17:31,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:31,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:31,717 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:17:31,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:31,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140610368] [2025-01-09 21:17:31,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140610368] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:31,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:31,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:17:31,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525511283] [2025-01-09 21:17:31,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:31,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:17:31,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:31,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:17:31,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:17:31,734 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 457 out of 508 [2025-01-09 21:17:31,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 315 transitions, 712 flow. Second operand has 3 states, 3 states have (on average 458.3333333333333) internal successors, (1375), 3 states have internal predecessors, (1375), 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:17:31,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:31,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 457 of 508 [2025-01-09 21:17:31,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:31,924 INFO L124 PetriNetUnfolderBase]: 175/1815 cut-off events. [2025-01-09 21:17:31,924 INFO L125 PetriNetUnfolderBase]: For 46/79 co-relation queries the response was YES. [2025-01-09 21:17:31,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2152 conditions, 1815 events. 175/1815 cut-off events. For 46/79 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 13534 event pairs, 13 based on Foata normal form. 4/1554 useless extension candidates. Maximal degree in co-relation 2113. Up to 140 conditions per place. [2025-01-09 21:17:31,935 INFO L140 encePairwiseOnDemand]: 505/508 looper letters, 17 selfloop transitions, 2 changer transitions 0/319 dead transitions. [2025-01-09 21:17:31,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 319 transitions, 767 flow [2025-01-09 21:17:31,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:17:31,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:17:31,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1391 transitions. [2025-01-09 21:17:31,938 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9127296587926509 [2025-01-09 21:17:31,938 INFO L175 Difference]: Start difference. First operand has 298 places, 315 transitions, 712 flow. Second operand 3 states and 1391 transitions. [2025-01-09 21:17:31,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 319 transitions, 767 flow [2025-01-09 21:17:31,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 319 transitions, 763 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:17:31,941 INFO L231 Difference]: Finished difference. Result has 297 places, 314 transitions, 710 flow [2025-01-09 21:17:31,942 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=508, PETRI_DIFFERENCE_MINUEND_FLOW=706, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=710, PETRI_PLACES=297, PETRI_TRANSITIONS=314} [2025-01-09 21:17:31,942 INFO L279 CegarLoopForPetriNet]: 321 programPoint places, -24 predicate places. [2025-01-09 21:17:31,943 INFO L471 AbstractCegarLoop]: Abstraction has has 297 places, 314 transitions, 710 flow [2025-01-09 21:17:31,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 458.3333333333333) internal successors, (1375), 3 states have internal predecessors, (1375), 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:17:31,943 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:31,943 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:17:31,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:17:31,944 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread_usbErr0ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-01-09 21:17:31,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:31,944 INFO L85 PathProgramCache]: Analyzing trace with hash 411589867, now seen corresponding path program 1 times [2025-01-09 21:17:31,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:31,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018288959] [2025-01-09 21:17:31,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:31,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:31,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 21:17:31,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 21:17:31,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:31,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:31,993 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:17:31,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:31,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018288959] [2025-01-09 21:17:31,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018288959] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:31,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:31,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:17:31,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943974660] [2025-01-09 21:17:31,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:31,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:17:31,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:31,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:17:31,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:17:32,040 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 450 out of 508 [2025-01-09 21:17:32,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 314 transitions, 710 flow. Second operand has 3 states, 3 states have (on average 451.3333333333333) internal successors, (1354), 3 states have internal predecessors, (1354), 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:17:32,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:32,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 450 of 508 [2025-01-09 21:17:32,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:32,155 INFO L124 PetriNetUnfolderBase]: 117/1379 cut-off events. [2025-01-09 21:17:32,156 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-01-09 21:17:32,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1619 conditions, 1379 events. 117/1379 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 8710 event pairs, 29 based on Foata normal form. 0/1193 useless extension candidates. Maximal degree in co-relation 1527. Up to 93 conditions per place. [2025-01-09 21:17:32,166 INFO L140 encePairwiseOnDemand]: 505/508 looper letters, 14 selfloop transitions, 2 changer transitions 0/313 dead transitions. [2025-01-09 21:17:32,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 313 transitions, 740 flow [2025-01-09 21:17:32,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:17:32,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:17:32,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1367 transitions. [2025-01-09 21:17:32,169 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8969816272965879 [2025-01-09 21:17:32,170 INFO L175 Difference]: Start difference. First operand has 297 places, 314 transitions, 710 flow. Second operand 3 states and 1367 transitions. [2025-01-09 21:17:32,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 313 transitions, 740 flow [2025-01-09 21:17:32,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 313 transitions, 736 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:17:32,174 INFO L231 Difference]: Finished difference. Result has 296 places, 313 transitions, 708 flow [2025-01-09 21:17:32,174 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=508, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=708, PETRI_PLACES=296, PETRI_TRANSITIONS=313} [2025-01-09 21:17:32,175 INFO L279 CegarLoopForPetriNet]: 321 programPoint places, -25 predicate places. [2025-01-09 21:17:32,175 INFO L471 AbstractCegarLoop]: Abstraction has has 296 places, 313 transitions, 708 flow [2025-01-09 21:17:32,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 451.3333333333333) internal successors, (1354), 3 states have internal predecessors, (1354), 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:17:32,175 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:32,176 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:17:32,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:17:32,176 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread_usbErr1ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-01-09 21:17:32,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:32,176 INFO L85 PathProgramCache]: Analyzing trace with hash 349352852, now seen corresponding path program 1 times [2025-01-09 21:17:32,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:32,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420662234] [2025-01-09 21:17:32,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:32,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:32,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-09 21:17:32,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-09 21:17:32,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:32,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:32,238 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:17:32,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:32,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420662234] [2025-01-09 21:17:32,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420662234] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:32,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:32,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:17:32,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793929406] [2025-01-09 21:17:32,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:32,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:17:32,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:32,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:17:32,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:17:32,274 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 442 out of 508 [2025-01-09 21:17:32,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 313 transitions, 708 flow. Second operand has 3 states, 3 states have (on average 443.3333333333333) internal successors, (1330), 3 states have internal predecessors, (1330), 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:17:32,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:32,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 442 of 508 [2025-01-09 21:17:32,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:32,403 INFO L124 PetriNetUnfolderBase]: 147/1613 cut-off events. [2025-01-09 21:17:32,404 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-01-09 21:17:32,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1907 conditions, 1613 events. 147/1613 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 10833 event pairs, 33 based on Foata normal form. 0/1409 useless extension candidates. Maximal degree in co-relation 1810. Up to 107 conditions per place. [2025-01-09 21:17:32,411 INFO L140 encePairwiseOnDemand]: 500/508 looper letters, 16 selfloop transitions, 5 changer transitions 0/315 dead transitions. [2025-01-09 21:17:32,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 315 transitions, 754 flow [2025-01-09 21:17:32,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:17:32,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:17:32,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1350 transitions. [2025-01-09 21:17:32,414 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8858267716535433 [2025-01-09 21:17:32,414 INFO L175 Difference]: Start difference. First operand has 296 places, 313 transitions, 708 flow. Second operand 3 states and 1350 transitions. [2025-01-09 21:17:32,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 315 transitions, 754 flow [2025-01-09 21:17:32,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 315 transitions, 750 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:17:32,418 INFO L231 Difference]: Finished difference. Result has 294 places, 313 transitions, 725 flow [2025-01-09 21:17:32,418 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=508, PETRI_DIFFERENCE_MINUEND_FLOW=698, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=725, PETRI_PLACES=294, PETRI_TRANSITIONS=313} [2025-01-09 21:17:32,418 INFO L279 CegarLoopForPetriNet]: 321 programPoint places, -27 predicate places. [2025-01-09 21:17:32,418 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 313 transitions, 725 flow [2025-01-09 21:17:32,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 443.3333333333333) internal successors, (1330), 3 states have internal predecessors, (1330), 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:17:32,419 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:32,419 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:17:32,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:17:32,419 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-01-09 21:17:32,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:32,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1178681174, now seen corresponding path program 1 times [2025-01-09 21:17:32,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:32,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196421047] [2025-01-09 21:17:32,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:32,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:32,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-09 21:17:32,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-09 21:17:32,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:32,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:32,472 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:17:32,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:32,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196421047] [2025-01-09 21:17:32,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196421047] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:32,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:32,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:17:32,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589109823] [2025-01-09 21:17:32,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:32,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:17:32,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:32,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:17:32,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:17:32,482 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 461 out of 508 [2025-01-09 21:17:32,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 313 transitions, 725 flow. Second operand has 3 states, 3 states have (on average 462.3333333333333) internal successors, (1387), 3 states have internal predecessors, (1387), 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:17:32,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:32,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 461 of 508 [2025-01-09 21:17:32,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:32,609 INFO L124 PetriNetUnfolderBase]: 171/1579 cut-off events. [2025-01-09 21:17:32,609 INFO L125 PetriNetUnfolderBase]: For 40/63 co-relation queries the response was YES. [2025-01-09 21:17:32,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1926 conditions, 1579 events. 171/1579 cut-off events. For 40/63 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 11119 event pairs, 13 based on Foata normal form. 4/1378 useless extension candidates. Maximal degree in co-relation 1564. Up to 97 conditions per place. [2025-01-09 21:17:32,619 INFO L140 encePairwiseOnDemand]: 506/508 looper letters, 14 selfloop transitions, 1 changer transitions 19/317 dead transitions. [2025-01-09 21:17:32,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 317 transitions, 772 flow [2025-01-09 21:17:32,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:17:32,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:17:32,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1399 transitions. [2025-01-09 21:17:32,621 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9179790026246719 [2025-01-09 21:17:32,621 INFO L175 Difference]: Start difference. First operand has 294 places, 313 transitions, 725 flow. Second operand 3 states and 1399 transitions. [2025-01-09 21:17:32,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 317 transitions, 772 flow [2025-01-09 21:17:32,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 317 transitions, 767 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:17:32,625 INFO L231 Difference]: Finished difference. Result has 294 places, 293 transitions, 678 flow [2025-01-09 21:17:32,626 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=508, PETRI_DIFFERENCE_MINUEND_FLOW=718, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=678, PETRI_PLACES=294, PETRI_TRANSITIONS=293} [2025-01-09 21:17:32,626 INFO L279 CegarLoopForPetriNet]: 321 programPoint places, -27 predicate places. [2025-01-09 21:17:32,626 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 293 transitions, 678 flow [2025-01-09 21:17:32,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 462.3333333333333) internal successors, (1387), 3 states have internal predecessors, (1387), 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:17:32,627 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:32,627 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:17:32,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:17:32,627 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread_usbErr7ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-01-09 21:17:32,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:32,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1260263424, now seen corresponding path program 1 times [2025-01-09 21:17:32,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:32,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365705404] [2025-01-09 21:17:32,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:32,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:32,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 21:17:32,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 21:17:32,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:32,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:32,731 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:17:32,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:32,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365705404] [2025-01-09 21:17:32,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365705404] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:32,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:32,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:17:32,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543467339] [2025-01-09 21:17:32,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:32,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:17:32,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:32,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:17:32,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:17:32,748 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 508 [2025-01-09 21:17:32,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 293 transitions, 678 flow. Second operand has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 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:17:32,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:32,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 508 [2025-01-09 21:17:32,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:32,891 INFO L124 PetriNetUnfolderBase]: 157/1584 cut-off events. [2025-01-09 21:17:32,892 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-01-09 21:17:32,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1898 conditions, 1584 events. 157/1584 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 10587 event pairs, 20 based on Foata normal form. 1/1381 useless extension candidates. Maximal degree in co-relation 1823. Up to 91 conditions per place. [2025-01-09 21:17:32,900 INFO L140 encePairwiseOnDemand]: 500/508 looper letters, 15 selfloop transitions, 5 changer transitions 0/297 dead transitions. [2025-01-09 21:17:32,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 297 transitions, 726 flow [2025-01-09 21:17:32,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:17:32,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:17:32,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1370 transitions. [2025-01-09 21:17:32,903 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8989501312335958 [2025-01-09 21:17:32,903 INFO L175 Difference]: Start difference. First operand has 294 places, 293 transitions, 678 flow. Second operand 3 states and 1370 transitions. [2025-01-09 21:17:32,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 297 transitions, 726 flow [2025-01-09 21:17:32,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 297 transitions, 725 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:17:32,907 INFO L231 Difference]: Finished difference. Result has 279 places, 295 transitions, 711 flow [2025-01-09 21:17:32,907 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=508, PETRI_DIFFERENCE_MINUEND_FLOW=677, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=711, PETRI_PLACES=279, PETRI_TRANSITIONS=295} [2025-01-09 21:17:32,907 INFO L279 CegarLoopForPetriNet]: 321 programPoint places, -42 predicate places. [2025-01-09 21:17:32,908 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 295 transitions, 711 flow [2025-01-09 21:17:32,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 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:17:32,908 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:32,908 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:17:32,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:17:32,909 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread_usbErr12ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-01-09 21:17:32,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:32,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1502861600, now seen corresponding path program 1 times [2025-01-09 21:17:32,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:32,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177733178] [2025-01-09 21:17:32,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:32,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:32,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 21:17:32,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 21:17:32,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:32,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:32,973 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:17:32,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:32,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177733178] [2025-01-09 21:17:32,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177733178] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:32,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:32,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:17:32,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238488218] [2025-01-09 21:17:32,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:32,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:17:32,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:32,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:17:32,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:17:33,048 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 442 out of 508 [2025-01-09 21:17:33,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 295 transitions, 711 flow. Second operand has 3 states, 3 states have (on average 444.0) internal successors, (1332), 3 states have internal predecessors, (1332), 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:17:33,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:33,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 442 of 508 [2025-01-09 21:17:33,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:33,171 INFO L124 PetriNetUnfolderBase]: 194/1721 cut-off events. [2025-01-09 21:17:33,171 INFO L125 PetriNetUnfolderBase]: For 138/164 co-relation queries the response was YES. [2025-01-09 21:17:33,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2239 conditions, 1721 events. 194/1721 cut-off events. For 138/164 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 11757 event pairs, 36 based on Foata normal form. 2/1513 useless extension candidates. Maximal degree in co-relation 2160. Up to 190 conditions per place. [2025-01-09 21:17:33,180 INFO L140 encePairwiseOnDemand]: 502/508 looper letters, 30 selfloop transitions, 8 changer transitions 0/303 dead transitions. [2025-01-09 21:17:33,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 303 transitions, 813 flow [2025-01-09 21:17:33,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:17:33,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:17:33,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1355 transitions. [2025-01-09 21:17:33,183 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8891076115485564 [2025-01-09 21:17:33,183 INFO L175 Difference]: Start difference. First operand has 279 places, 295 transitions, 711 flow. Second operand 3 states and 1355 transitions. [2025-01-09 21:17:33,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 303 transitions, 813 flow [2025-01-09 21:17:33,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 303 transitions, 803 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:17:33,187 INFO L231 Difference]: Finished difference. Result has 281 places, 301 transitions, 769 flow [2025-01-09 21:17:33,187 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=508, PETRI_DIFFERENCE_MINUEND_FLOW=701, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=769, PETRI_PLACES=281, PETRI_TRANSITIONS=301} [2025-01-09 21:17:33,188 INFO L279 CegarLoopForPetriNet]: 321 programPoint places, -40 predicate places. [2025-01-09 21:17:33,188 INFO L471 AbstractCegarLoop]: Abstraction has has 281 places, 301 transitions, 769 flow [2025-01-09 21:17:33,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 444.0) internal successors, (1332), 3 states have internal predecessors, (1332), 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:17:33,189 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:33,189 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:17:33,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:17:33,189 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread_usbErr2ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-01-09 21:17:33,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:33,189 INFO L85 PathProgramCache]: Analyzing trace with hash 867808249, now seen corresponding path program 1 times [2025-01-09 21:17:33,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:33,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776351668] [2025-01-09 21:17:33,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:33,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:33,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 21:17:33,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 21:17:33,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:33,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:33,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:17:33,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:33,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776351668] [2025-01-09 21:17:33,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776351668] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:33,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:33,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:17:33,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446533590] [2025-01-09 21:17:33,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:33,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:17:33,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:33,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:17:33,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:17:33,253 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 508 [2025-01-09 21:17:33,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 301 transitions, 769 flow. Second operand has 3 states, 3 states have (on average 456.6666666666667) internal successors, (1370), 3 states have internal predecessors, (1370), 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:17:33,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:33,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 508 [2025-01-09 21:17:33,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:33,427 INFO L124 PetriNetUnfolderBase]: 188/1860 cut-off events. [2025-01-09 21:17:33,427 INFO L125 PetriNetUnfolderBase]: For 107/118 co-relation queries the response was YES. [2025-01-09 21:17:33,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2377 conditions, 1860 events. 188/1860 cut-off events. For 107/118 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 12815 event pairs, 29 based on Foata normal form. 0/1637 useless extension candidates. Maximal degree in co-relation 2300. Up to 105 conditions per place. [2025-01-09 21:17:33,438 INFO L140 encePairwiseOnDemand]: 505/508 looper letters, 14 selfloop transitions, 2 changer transitions 0/302 dead transitions. [2025-01-09 21:17:33,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 302 transitions, 803 flow [2025-01-09 21:17:33,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:17:33,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:17:33,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1382 transitions. [2025-01-09 21:17:33,441 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9068241469816273 [2025-01-09 21:17:33,441 INFO L175 Difference]: Start difference. First operand has 281 places, 301 transitions, 769 flow. Second operand 3 states and 1382 transitions. [2025-01-09 21:17:33,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 302 transitions, 803 flow [2025-01-09 21:17:33,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 302 transitions, 787 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:17:33,446 INFO L231 Difference]: Finished difference. Result has 280 places, 300 transitions, 755 flow [2025-01-09 21:17:33,446 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=508, PETRI_DIFFERENCE_MINUEND_FLOW=751, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=755, PETRI_PLACES=280, PETRI_TRANSITIONS=300} [2025-01-09 21:17:33,447 INFO L279 CegarLoopForPetriNet]: 321 programPoint places, -41 predicate places. [2025-01-09 21:17:33,447 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 300 transitions, 755 flow [2025-01-09 21:17:33,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 456.6666666666667) internal successors, (1370), 3 states have internal predecessors, (1370), 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:17:33,448 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:33,448 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:17:33,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:17:33,448 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread_usbErr3ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-01-09 21:17:33,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:33,448 INFO L85 PathProgramCache]: Analyzing trace with hash -893766324, now seen corresponding path program 1 times [2025-01-09 21:17:33,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:33,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794304029] [2025-01-09 21:17:33,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:33,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:33,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-09 21:17:33,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-09 21:17:33,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:33,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:33,512 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:17:33,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:33,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794304029] [2025-01-09 21:17:33,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794304029] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:33,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:33,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:17:33,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302540454] [2025-01-09 21:17:33,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:33,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:17:33,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:33,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:17:33,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:17:33,551 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 450 out of 508 [2025-01-09 21:17:33,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 300 transitions, 755 flow. Second operand has 3 states, 3 states have (on average 452.0) internal successors, (1356), 3 states have internal predecessors, (1356), 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:17:33,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:33,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 450 of 508 [2025-01-09 21:17:33,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:33,676 INFO L124 PetriNetUnfolderBase]: 193/1801 cut-off events. [2025-01-09 21:17:33,677 INFO L125 PetriNetUnfolderBase]: For 129/142 co-relation queries the response was YES. [2025-01-09 21:17:33,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2331 conditions, 1801 events. 193/1801 cut-off events. For 129/142 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 12729 event pairs, 27 based on Foata normal form. 0/1586 useless extension candidates. Maximal degree in co-relation 2254. Up to 127 conditions per place. [2025-01-09 21:17:33,686 INFO L140 encePairwiseOnDemand]: 505/508 looper letters, 19 selfloop transitions, 2 changer transitions 0/301 dead transitions. [2025-01-09 21:17:33,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 301 transitions, 799 flow [2025-01-09 21:17:33,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:17:33,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:17:33,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1369 transitions. [2025-01-09 21:17:33,689 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8982939632545932 [2025-01-09 21:17:33,689 INFO L175 Difference]: Start difference. First operand has 280 places, 300 transitions, 755 flow. Second operand 3 states and 1369 transitions. [2025-01-09 21:17:33,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 301 transitions, 799 flow [2025-01-09 21:17:33,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 301 transitions, 795 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:17:33,692 INFO L231 Difference]: Finished difference. Result has 279 places, 299 transitions, 753 flow [2025-01-09 21:17:33,693 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=508, PETRI_DIFFERENCE_MINUEND_FLOW=749, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=753, PETRI_PLACES=279, PETRI_TRANSITIONS=299} [2025-01-09 21:17:33,693 INFO L279 CegarLoopForPetriNet]: 321 programPoint places, -42 predicate places. [2025-01-09 21:17:33,693 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 299 transitions, 753 flow [2025-01-09 21:17:33,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 452.0) internal successors, (1356), 3 states have internal predecessors, (1356), 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:17:33,694 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:33,694 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:17:33,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:17:33,694 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-01-09 21:17:33,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:33,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1408043815, now seen corresponding path program 1 times [2025-01-09 21:17:33,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:33,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576264605] [2025-01-09 21:17:33,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:33,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:33,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 21:17:33,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 21:17:33,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:33,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:33,738 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:17:33,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:33,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576264605] [2025-01-09 21:17:33,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576264605] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:33,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:33,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:17:33,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455651695] [2025-01-09 21:17:33,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:33,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:17:33,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:33,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:17:33,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:17:33,812 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 439 out of 508 [2025-01-09 21:17:33,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 299 transitions, 753 flow. Second operand has 3 states, 3 states have (on average 442.0) internal successors, (1326), 3 states have internal predecessors, (1326), 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:17:33,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:33,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 439 of 508 [2025-01-09 21:17:33,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:33,968 INFO L124 PetriNetUnfolderBase]: 299/2218 cut-off events. [2025-01-09 21:17:33,968 INFO L125 PetriNetUnfolderBase]: For 371/477 co-relation queries the response was YES. [2025-01-09 21:17:33,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3144 conditions, 2218 events. 299/2218 cut-off events. For 371/477 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 17137 event pairs, 53 based on Foata normal form. 9/1958 useless extension candidates. Maximal degree in co-relation 3065. Up to 335 conditions per place. [2025-01-09 21:17:33,981 INFO L140 encePairwiseOnDemand]: 498/508 looper letters, 35 selfloop transitions, 16 changer transitions 0/312 dead transitions. [2025-01-09 21:17:33,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 312 transitions, 910 flow [2025-01-09 21:17:33,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:17:33,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:17:33,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1352 transitions. [2025-01-09 21:17:33,983 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8871391076115486 [2025-01-09 21:17:33,983 INFO L175 Difference]: Start difference. First operand has 279 places, 299 transitions, 753 flow. Second operand 3 states and 1352 transitions. [2025-01-09 21:17:33,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 312 transitions, 910 flow [2025-01-09 21:17:33,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 312 transitions, 906 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:17:33,988 INFO L231 Difference]: Finished difference. Result has 281 places, 311 transitions, 891 flow [2025-01-09 21:17:33,988 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=508, PETRI_DIFFERENCE_MINUEND_FLOW=749, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=891, PETRI_PLACES=281, PETRI_TRANSITIONS=311} [2025-01-09 21:17:33,989 INFO L279 CegarLoopForPetriNet]: 321 programPoint places, -40 predicate places. [2025-01-09 21:17:33,989 INFO L471 AbstractCegarLoop]: Abstraction has has 281 places, 311 transitions, 891 flow [2025-01-09 21:17:33,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 442.0) internal successors, (1326), 3 states have internal predecessors, (1326), 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:17:33,990 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:33,990 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:17:33,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:17:33,990 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread_usbErr4ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-01-09 21:17:33,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:33,990 INFO L85 PathProgramCache]: Analyzing trace with hash 117338151, now seen corresponding path program 1 times [2025-01-09 21:17:33,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:33,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742362345] [2025-01-09 21:17:33,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:33,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:34,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 21:17:34,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 21:17:34,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:34,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:34,030 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:17:34,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:34,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742362345] [2025-01-09 21:17:34,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742362345] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:34,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:34,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:17:34,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117832348] [2025-01-09 21:17:34,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:34,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:17:34,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:34,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:17:34,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:17:34,088 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 441 out of 508 [2025-01-09 21:17:34,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 311 transitions, 891 flow. Second operand has 3 states, 3 states have (on average 443.0) internal successors, (1329), 3 states have internal predecessors, (1329), 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:17:34,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:34,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 441 of 508 [2025-01-09 21:17:34,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:34,289 INFO L124 PetriNetUnfolderBase]: 318/2496 cut-off events. [2025-01-09 21:17:34,290 INFO L125 PetriNetUnfolderBase]: For 849/924 co-relation queries the response was YES. [2025-01-09 21:17:34,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3655 conditions, 2496 events. 318/2496 cut-off events. For 849/924 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 19841 event pairs, 39 based on Foata normal form. 7/2213 useless extension candidates. Maximal degree in co-relation 3575. Up to 289 conditions per place. [2025-01-09 21:17:34,299 INFO L140 encePairwiseOnDemand]: 502/508 looper letters, 44 selfloop transitions, 9 changer transitions 0/318 dead transitions. [2025-01-09 21:17:34,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 318 transitions, 1031 flow [2025-01-09 21:17:34,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:17:34,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:17:34,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1353 transitions. [2025-01-09 21:17:34,302 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8877952755905512 [2025-01-09 21:17:34,302 INFO L175 Difference]: Start difference. First operand has 281 places, 311 transitions, 891 flow. Second operand 3 states and 1353 transitions. [2025-01-09 21:17:34,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 318 transitions, 1031 flow [2025-01-09 21:17:34,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 318 transitions, 995 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:17:34,309 INFO L231 Difference]: Finished difference. Result has 283 places, 316 transitions, 933 flow [2025-01-09 21:17:34,309 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=508, PETRI_DIFFERENCE_MINUEND_FLOW=859, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=933, PETRI_PLACES=283, PETRI_TRANSITIONS=316} [2025-01-09 21:17:34,310 INFO L279 CegarLoopForPetriNet]: 321 programPoint places, -38 predicate places. [2025-01-09 21:17:34,310 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 316 transitions, 933 flow [2025-01-09 21:17:34,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 443.0) internal successors, (1329), 3 states have internal predecessors, (1329), 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:17:34,311 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:34,311 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:17:34,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:17:34,311 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-01-09 21:17:34,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:34,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1971488109, now seen corresponding path program 1 times [2025-01-09 21:17:34,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:34,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824239534] [2025-01-09 21:17:34,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:34,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:34,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 21:17:34,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 21:17:34,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:34,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:34,356 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:17:34,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:34,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824239534] [2025-01-09 21:17:34,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824239534] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:34,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:34,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:17:34,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273547000] [2025-01-09 21:17:34,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:34,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:17:34,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:34,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:17:34,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:17:34,428 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 439 out of 508 [2025-01-09 21:17:34,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 316 transitions, 933 flow. Second operand has 3 states, 3 states have (on average 442.3333333333333) internal successors, (1327), 3 states have internal predecessors, (1327), 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:17:34,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:34,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 439 of 508 [2025-01-09 21:17:34,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:34,718 INFO L124 PetriNetUnfolderBase]: 566/3670 cut-off events. [2025-01-09 21:17:34,719 INFO L125 PetriNetUnfolderBase]: For 2141/2389 co-relation queries the response was YES. [2025-01-09 21:17:34,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5854 conditions, 3670 events. 566/3670 cut-off events. For 2141/2389 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 33194 event pairs, 142 based on Foata normal form. 10/3254 useless extension candidates. Maximal degree in co-relation 5391. Up to 601 conditions per place. [2025-01-09 21:17:34,732 INFO L140 encePairwiseOnDemand]: 502/508 looper letters, 49 selfloop transitions, 9 changer transitions 1/323 dead transitions. [2025-01-09 21:17:34,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 323 transitions, 1085 flow [2025-01-09 21:17:34,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:17:34,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:17:34,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1349 transitions. [2025-01-09 21:17:34,734 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8851706036745407 [2025-01-09 21:17:34,734 INFO L175 Difference]: Start difference. First operand has 283 places, 316 transitions, 933 flow. Second operand 3 states and 1349 transitions. [2025-01-09 21:17:34,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 323 transitions, 1085 flow [2025-01-09 21:17:34,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 323 transitions, 1061 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-01-09 21:17:34,740 INFO L231 Difference]: Finished difference. Result has 285 places, 320 transitions, 985 flow [2025-01-09 21:17:34,741 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=508, PETRI_DIFFERENCE_MINUEND_FLOW=909, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=985, PETRI_PLACES=285, PETRI_TRANSITIONS=320} [2025-01-09 21:17:34,742 INFO L279 CegarLoopForPetriNet]: 321 programPoint places, -36 predicate places. [2025-01-09 21:17:34,742 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 320 transitions, 985 flow [2025-01-09 21:17:34,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 442.3333333333333) internal successors, (1327), 3 states have internal predecessors, (1327), 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:17:34,743 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:34,743 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:17:34,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:17:34,743 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread_usbErr12ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-01-09 21:17:34,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:34,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1308228295, now seen corresponding path program 1 times [2025-01-09 21:17:34,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:34,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93655496] [2025-01-09 21:17:34,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:34,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:34,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 21:17:34,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 21:17:34,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:34,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:34,838 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:17:34,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:34,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93655496] [2025-01-09 21:17:34,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93655496] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:34,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:34,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:17:34,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294397858] [2025-01-09 21:17:34,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:34,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:17:34,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:34,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:17:34,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:17:34,851 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 456 out of 508 [2025-01-09 21:17:34,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 320 transitions, 985 flow. Second operand has 5 states, 5 states have (on average 458.0) internal successors, (2290), 5 states have internal predecessors, (2290), 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:17:34,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:34,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 456 of 508 [2025-01-09 21:17:34,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:35,344 INFO L124 PetriNetUnfolderBase]: 669/5778 cut-off events. [2025-01-09 21:17:35,345 INFO L125 PetriNetUnfolderBase]: For 2090/2193 co-relation queries the response was YES. [2025-01-09 21:17:35,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8670 conditions, 5778 events. 669/5778 cut-off events. For 2090/2193 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 55963 event pairs, 62 based on Foata normal form. 10/5184 useless extension candidates. Maximal degree in co-relation 8590. Up to 411 conditions per place. [2025-01-09 21:17:35,370 INFO L140 encePairwiseOnDemand]: 501/508 looper letters, 34 selfloop transitions, 9 changer transitions 0/347 dead transitions. [2025-01-09 21:17:35,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 347 transitions, 1136 flow [2025-01-09 21:17:35,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 21:17:35,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 21:17:35,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 3236 transitions. [2025-01-09 21:17:35,375 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9100112485939258 [2025-01-09 21:17:35,375 INFO L175 Difference]: Start difference. First operand has 285 places, 320 transitions, 985 flow. Second operand 7 states and 3236 transitions. [2025-01-09 21:17:35,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 347 transitions, 1136 flow [2025-01-09 21:17:35,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 347 transitions, 1106 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-01-09 21:17:35,385 INFO L231 Difference]: Finished difference. Result has 295 places, 328 transitions, 1023 flow [2025-01-09 21:17:35,385 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=508, PETRI_DIFFERENCE_MINUEND_FLOW=955, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1023, PETRI_PLACES=295, PETRI_TRANSITIONS=328} [2025-01-09 21:17:35,386 INFO L279 CegarLoopForPetriNet]: 321 programPoint places, -26 predicate places. [2025-01-09 21:17:35,386 INFO L471 AbstractCegarLoop]: Abstraction has has 295 places, 328 transitions, 1023 flow [2025-01-09 21:17:35,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 458.0) internal successors, (2290), 5 states have internal predecessors, (2290), 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:17:35,387 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:35,387 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:17:35,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:17:35,387 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread_usbErr12ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-01-09 21:17:35,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:35,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1961053335, now seen corresponding path program 1 times [2025-01-09 21:17:35,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:35,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902945902] [2025-01-09 21:17:35,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:35,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:35,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 21:17:35,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 21:17:35,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:35,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:35,487 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:17:35,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:35,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902945902] [2025-01-09 21:17:35,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902945902] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:35,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:35,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:17:35,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783153365] [2025-01-09 21:17:35,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:35,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:17:35,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:35,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:17:35,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:17:35,511 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 454 out of 508 [2025-01-09 21:17:35,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 328 transitions, 1023 flow. Second operand has 5 states, 5 states have (on average 456.4) internal successors, (2282), 5 states have internal predecessors, (2282), 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:17:35,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:35,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 454 of 508 [2025-01-09 21:17:35,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:36,348 INFO L124 PetriNetUnfolderBase]: 872/7498 cut-off events. [2025-01-09 21:17:36,348 INFO L125 PetriNetUnfolderBase]: For 2325/2455 co-relation queries the response was YES. [2025-01-09 21:17:36,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11357 conditions, 7498 events. 872/7498 cut-off events. For 2325/2455 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 71104 event pairs, 103 based on Foata normal form. 15/6720 useless extension candidates. Maximal degree in co-relation 11272. Up to 546 conditions per place. [2025-01-09 21:17:36,380 INFO L140 encePairwiseOnDemand]: 500/508 looper letters, 32 selfloop transitions, 8 changer transitions 0/350 dead transitions. [2025-01-09 21:17:36,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 350 transitions, 1154 flow [2025-01-09 21:17:36,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 21:17:36,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 21:17:36,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 3219 transitions. [2025-01-09 21:17:36,385 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9052305961754781 [2025-01-09 21:17:36,385 INFO L175 Difference]: Start difference. First operand has 295 places, 328 transitions, 1023 flow. Second operand 7 states and 3219 transitions. [2025-01-09 21:17:36,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 350 transitions, 1154 flow [2025-01-09 21:17:36,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 350 transitions, 1154 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:17:36,391 INFO L231 Difference]: Finished difference. Result has 306 places, 335 transitions, 1081 flow [2025-01-09 21:17:36,392 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=508, PETRI_DIFFERENCE_MINUEND_FLOW=1023, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1081, PETRI_PLACES=306, PETRI_TRANSITIONS=335} [2025-01-09 21:17:36,393 INFO L279 CegarLoopForPetriNet]: 321 programPoint places, -15 predicate places. [2025-01-09 21:17:36,393 INFO L471 AbstractCegarLoop]: Abstraction has has 306 places, 335 transitions, 1081 flow [2025-01-09 21:17:36,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 456.4) internal successors, (2282), 5 states have internal predecessors, (2282), 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:17:36,394 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:36,394 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:17:36,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:17:36,395 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-01-09 21:17:36,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:36,395 INFO L85 PathProgramCache]: Analyzing trace with hash 358604708, now seen corresponding path program 1 times [2025-01-09 21:17:36,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:36,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997426999] [2025-01-09 21:17:36,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:36,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:36,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 21:17:36,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 21:17:36,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:36,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:17:36,411 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:17:36,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 21:17:36,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 21:17:36,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:36,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:17:36,442 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:17:36,442 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:17:36,443 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE (42 of 43 remaining) [2025-01-09 21:17:36,444 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE (41 of 43 remaining) [2025-01-09 21:17:36,444 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE (40 of 43 remaining) [2025-01-09 21:17:36,444 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (39 of 43 remaining) [2025-01-09 21:17:36,444 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (38 of 43 remaining) [2025-01-09 21:17:36,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (37 of 43 remaining) [2025-01-09 21:17:36,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (36 of 43 remaining) [2025-01-09 21:17:36,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (35 of 43 remaining) [2025-01-09 21:17:36,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (34 of 43 remaining) [2025-01-09 21:17:36,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (33 of 43 remaining) [2025-01-09 21:17:36,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (32 of 43 remaining) [2025-01-09 21:17:36,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 43 remaining) [2025-01-09 21:17:36,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr0ASSERT_VIOLATIONDATA_RACE (30 of 43 remaining) [2025-01-09 21:17:36,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr12ASSERT_VIOLATIONDATA_RACE (29 of 43 remaining) [2025-01-09 21:17:36,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr1ASSERT_VIOLATIONDATA_RACE (28 of 43 remaining) [2025-01-09 21:17:36,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr13ASSERT_VIOLATIONDATA_RACE (27 of 43 remaining) [2025-01-09 21:17:36,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr6ASSERT_VIOLATIONDATA_RACE (26 of 43 remaining) [2025-01-09 21:17:36,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr11ASSERT_VIOLATIONDATA_RACE (25 of 43 remaining) [2025-01-09 21:17:36,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr7ASSERT_VIOLATIONDATA_RACE (24 of 43 remaining) [2025-01-09 21:17:36,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr2ASSERT_VIOLATIONDATA_RACE (23 of 43 remaining) [2025-01-09 21:17:36,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr8ASSERT_VIOLATIONDATA_RACE (22 of 43 remaining) [2025-01-09 21:17:36,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr9ASSERT_VIOLATIONDATA_RACE (21 of 43 remaining) [2025-01-09 21:17:36,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr10ASSERT_VIOLATIONDATA_RACE (20 of 43 remaining) [2025-01-09 21:17:36,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr3ASSERT_VIOLATIONDATA_RACE (19 of 43 remaining) [2025-01-09 21:17:36,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr4ASSERT_VIOLATIONDATA_RACE (18 of 43 remaining) [2025-01-09 21:17:36,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr5ASSERT_VIOLATIONDATA_RACE (17 of 43 remaining) [2025-01-09 21:17:36,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 43 remaining) [2025-01-09 21:17:36,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE (15 of 43 remaining) [2025-01-09 21:17:36,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr0ASSERT_VIOLATIONDATA_RACE (14 of 43 remaining) [2025-01-09 21:17:36,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr12ASSERT_VIOLATIONDATA_RACE (13 of 43 remaining) [2025-01-09 21:17:36,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr1ASSERT_VIOLATIONDATA_RACE (12 of 43 remaining) [2025-01-09 21:17:36,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr13ASSERT_VIOLATIONDATA_RACE (11 of 43 remaining) [2025-01-09 21:17:36,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr6ASSERT_VIOLATIONDATA_RACE (10 of 43 remaining) [2025-01-09 21:17:36,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr11ASSERT_VIOLATIONDATA_RACE (9 of 43 remaining) [2025-01-09 21:17:36,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr7ASSERT_VIOLATIONDATA_RACE (8 of 43 remaining) [2025-01-09 21:17:36,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr2ASSERT_VIOLATIONDATA_RACE (7 of 43 remaining) [2025-01-09 21:17:36,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr8ASSERT_VIOLATIONDATA_RACE (6 of 43 remaining) [2025-01-09 21:17:36,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr9ASSERT_VIOLATIONDATA_RACE (5 of 43 remaining) [2025-01-09 21:17:36,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr10ASSERT_VIOLATIONDATA_RACE (4 of 43 remaining) [2025-01-09 21:17:36,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr3ASSERT_VIOLATIONDATA_RACE (3 of 43 remaining) [2025-01-09 21:17:36,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr4ASSERT_VIOLATIONDATA_RACE (2 of 43 remaining) [2025-01-09 21:17:36,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr5ASSERT_VIOLATIONDATA_RACE (1 of 43 remaining) [2025-01-09 21:17:36,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbThread1of1ForFork1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 43 remaining) [2025-01-09 21:17:36,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:17:36,446 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:17:36,495 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:17:36,496 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:17:36,499 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:17:36 BasicIcfg [2025-01-09 21:17:36,499 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:17:36,500 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:17:36,500 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:17:36,500 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:17:36,501 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:17:29" (3/4) ... [2025-01-09 21:17:36,501 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 21:17:36,553 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 13. [2025-01-09 21:17:36,590 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:17:36,590 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:17:36,590 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:17:36,591 INFO L158 Benchmark]: Toolchain (without parser) took 7997.81ms. Allocated memory was 142.6MB in the beginning and 578.8MB in the end (delta: 436.2MB). Free memory was 102.8MB in the beginning and 385.6MB in the end (delta: -282.8MB). Peak memory consumption was 155.1MB. Max. memory is 16.1GB. [2025-01-09 21:17:36,591 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 226.5MB. Free memory is still 143.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:17:36,591 INFO L158 Benchmark]: CACSL2BoogieTranslator took 651.34ms. Allocated memory is still 142.6MB. Free memory was 102.8MB in the beginning and 48.8MB in the end (delta: 54.0MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-01-09 21:17:36,592 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.37ms. Allocated memory is still 142.6MB. Free memory was 48.8MB in the beginning and 45.2MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:17:36,592 INFO L158 Benchmark]: Boogie Preprocessor took 36.27ms. Allocated memory is still 142.6MB. Free memory was 45.2MB in the beginning and 42.8MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:17:36,592 INFO L158 Benchmark]: RCFGBuilder took 568.52ms. Allocated memory is still 142.6MB. Free memory was 42.8MB in the beginning and 80.0MB in the end (delta: -37.2MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. [2025-01-09 21:17:36,592 INFO L158 Benchmark]: TraceAbstraction took 6599.54ms. Allocated memory was 142.6MB in the beginning and 578.8MB in the end (delta: 436.2MB). Free memory was 79.3MB in the beginning and 406.6MB in the end (delta: -327.2MB). Peak memory consumption was 105.7MB. Max. memory is 16.1GB. [2025-01-09 21:17:36,592 INFO L158 Benchmark]: Witness Printer took 90.70ms. Allocated memory is still 578.8MB. Free memory was 406.6MB in the beginning and 385.6MB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 21:17:36,593 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 226.5MB. Free memory is still 143.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 651.34ms. Allocated memory is still 142.6MB. Free memory was 102.8MB in the beginning and 48.8MB in the end (delta: 54.0MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.37ms. Allocated memory is still 142.6MB. Free memory was 48.8MB in the beginning and 45.2MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.27ms. Allocated memory is still 142.6MB. Free memory was 45.2MB in the beginning and 42.8MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 568.52ms. Allocated memory is still 142.6MB. Free memory was 42.8MB in the beginning and 80.0MB in the end (delta: -37.2MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. * TraceAbstraction took 6599.54ms. Allocated memory was 142.6MB in the beginning and 578.8MB in the end (delta: 436.2MB). Free memory was 79.3MB in the beginning and 406.6MB in the end (delta: -327.2MB). Peak memory consumption was 105.7MB. Max. memory is 16.1GB. * Witness Printer took 90.70ms. Allocated memory is still 578.8MB. Free memory was 406.6MB in the beginning and 385.6MB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 1699]: Data race detected Data race detected The following path leads to a data race: [L1694] 0 pthread_t t1, t2; VAL [t1=0, t2=0] [L1695] 0 pthread_mutex_t mutex; VAL [mutex={3:0}, t1=0, t2=0] [L1696] 0 int pdev; VAL [mutex={3:0}, pdev=0, t1=0, t2=0] [L1741] 0 int ldv_usb_state; VAL [ldv_usb_state=0, mutex={3:0}, pdev=0, t1=0, t2=0] [L1798] CALL 0 module_init() [L1779] 0 pdev = 1 VAL [ldv_usb_state=0, mutex={3:0}, pdev=1, t1=0, t2=0] [L1780] EXPR 0 pdev==1 [L1780] CALL 0 ldv_assert(pdev==1) [L1693] COND FALSE 0 !(!expression) VAL [\old(expression)=1, expression=1, ldv_usb_state=0, mutex={3:0}, pdev=1, t1=0, t2=0] [L1780] RET 0 ldv_assert(pdev==1) [L1781] COND TRUE 0 __VERIFIER_nondet_int() VAL [ldv_usb_state=0, mutex={3:0}, pdev=1, t1=0, t2=0] [L1782] 0 pthread_create(&t1, ((void *)0), thread_usb, ((void *)0)) VAL [ldv_usb_state=0, mutex={3:0}, pdev=1, t1=-1, t2=0] [L1782] FCALL, FORK 0 pthread_create(&t1, ((void *)0), thread_usb, ((void *)0)) VAL [ldv_usb_state=0, mutex={3:0}, pdev=1, t1=-1, t2=0] [L1743] 1 ldv_usb_state = 0 VAL [\old(arg)={0:0}, arg={0:0}, ldv_usb_state=0, mutex={3:0}, pdev=1, t1=-1, t2=0] [L1744] 1 int probe_ret; VAL [\old(arg)={0:0}, arg={0:0}, ldv_usb_state=0, mutex={3:0}, pdev=1, t1=-1, t2=0] [L1747] 1 case 0: VAL [\old(arg)={0:0}, arg={0:0}, ldv_usb_state=0, mutex={3:0}, pdev=1, t1=-1, t2=0] [L1748] 1 ldv_usb_state==0 VAL [\old(arg)={0:0}, arg={0:0}, ldv_usb_state=0, mutex={3:0}, pdev=1, t1=-1, t2=0] [L1747] 1 case 0: [L1749] CALL, EXPR 1 ath_ahb_probe() [L1730] 1 int error; [L1731] CALL, EXPR 1 ieee80211_register_hw() [L1717] COND TRUE 1 __VERIFIER_nondet_int() VAL [ldv_usb_state=0, mutex={3:0}, pdev=1, t1=-1, t2=0] [L1718] 1 pthread_create(&t2, ((void *)0), thread_ath9k, ((void *)0)) VAL [ldv_usb_state=0, mutex={3:0}, pdev=1, t1=-1, t2=0] [L1718] FCALL, FORK 1 pthread_create(&t2, ((void *)0), thread_ath9k, ((void *)0)) VAL [ldv_usb_state=0, mutex={3:0}, pdev=1, t1=-1, t2=0] [L1706] 2 case 1: [L1707] CALL 2 ath9k_flush() [L1699] 2 pdev = 6 VAL [ldv_usb_state=0, mutex={3:0}, pdev=6, t1=-1, t2=0] [L1719] 1 return 0; VAL [\result=0, ldv_usb_state=0, mutex={3:0}, pdev=6, t1=-1, t2=0] [L1731] RET, EXPR 1 ieee80211_register_hw() [L1731] 1 error = ieee80211_register_hw() VAL [error=0, ldv_usb_state=0, mutex={3:0}, pdev=6, t1=-1, t2=0] [L1732] COND FALSE 1 !(\read(error)) VAL [error=0, ldv_usb_state=0, mutex={3:0}, pdev=6, t1=-1, t2=0] [L1734] 1 return 0; VAL [\result=0, error=0, ldv_usb_state=0, mutex={3:0}, pdev=6, t1=-1, t2=0] [L1749] RET, EXPR 1 ath_ahb_probe() [L1749] 1 probe_ret = ath_ahb_probe() VAL [\old(arg)={0:0}, arg={0:0}, ldv_usb_state=0, mutex={3:0}, pdev=6, probe_ret=0, t1=-1, t2=0] [L1747] 1 case 0: VAL [\old(arg)={0:0}, arg={0:0}, ldv_usb_state=0, mutex={3:0}, pdev=6, probe_ret=0, t1=-1, t2=0] [L1752] 1 ldv_usb_state = 1 VAL [\old(arg)={0:0}, arg={0:0}, ldv_usb_state=1, mutex={3:0}, pdev=6, probe_ret=0, t1=-1, t2=0] [L1753] 1 pdev = 7 VAL [\old(arg)={0:0}, arg={0:0}, ldv_usb_state=1, mutex={3:0}, pdev=7, probe_ret=0, t1=-1, t2=0] [L1699] 2 pdev = 6 VAL [ldv_usb_state=1, mutex={3:0}, pdev=7, t1=-1, t2=0] Now there is a data race on ~pdev~0 between C: pdev = 7 [1753] and C: pdev = 6 [1699] - UnprovableResult [Line: 1700]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1779]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1780]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1785]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1782]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1786]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1792]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1794]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1795]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1782]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1743]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1773]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1748]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1774]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1758]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1766]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1725]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1718]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1760]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1761]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1762]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1752]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1753]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1754]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1718]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1718]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 513 locations, 43 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.4s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1290 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 454 mSDsluCounter, 265 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 54 mSDsCounter, 82 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1319 IncrementalHoareTripleChecker+Invalid, 1401 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 82 mSolverCounterUnsat, 211 mSDtfsCounter, 1319 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1081occurred in iteration=16, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1215 NumberOfCodeBlocks, 1215 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1086 ConstructedInterpolants, 0 QuantifiedInterpolants, 1164 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-01-09 21:17:36,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(DATA-RACE)