./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-4_1-thread_local_vars.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-4_1-thread_local_vars.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 a9552a698db9701543deeff63aa990ab8fc4764b65dba5035623425bdf77554d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:02:55,624 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:02:55,670 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-11 17:02:55,676 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:02:55,677 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:02:55,696 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:02:55,697 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:02:55,697 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:02:55,697 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:02:55,698 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:02:55,698 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:02:55,698 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:02:55,698 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:02:55,699 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:02:55,699 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:02:55,700 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:02:55,701 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:02:55,702 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:02:55,703 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:02:55,703 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:02:55,704 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:02:55,704 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:02:55,704 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-11 17:02:55,704 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:02:55,704 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:02:55,704 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:02:55,705 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:02:55,705 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:02:55,705 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:02:55,705 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:02:55,705 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:02:55,705 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:02:55,706 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:02:55,706 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:02:55,706 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 17:02:55,706 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:02:55,706 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:02:55,706 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:02:55,706 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:02:55,707 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:02:55,707 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:02:55,708 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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-clean/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 -> a9552a698db9701543deeff63aa990ab8fc4764b65dba5035623425bdf77554d [2024-10-11 17:02:55,896 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:02:55,916 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:02:55,918 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:02:55,919 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:02:55,920 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:02:55,920 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-4_1-thread_local_vars.i [2024-10-11 17:02:57,112 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:02:57,337 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:02:57,337 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-4_1-thread_local_vars.i [2024-10-11 17:02:57,353 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/dd93e3917/15fe560ae2f34aadb41f781fa54ec0de/FLAG05af20c8f [2024-10-11 17:02:57,363 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/dd93e3917/15fe560ae2f34aadb41f781fa54ec0de [2024-10-11 17:02:57,365 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:02:57,366 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:02:57,367 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:02:57,367 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:02:57,375 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:02:57,376 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:02:57" (1/1) ... [2024-10-11 17:02:57,378 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52e4f225 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:57, skipping insertion in model container [2024-10-11 17:02:57,378 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:02:57" (1/1) ... [2024-10-11 17:02:57,416 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:02:57,900 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:02:57,911 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:02:57,980 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:02:58,078 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:02:58,078 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:58 WrapperNode [2024-10-11 17:02:58,078 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:02:58,079 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:02:58,079 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:02:58,079 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:02:58,084 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:58" (1/1) ... [2024-10-11 17:02:58,106 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:58" (1/1) ... [2024-10-11 17:02:58,135 INFO L138 Inliner]: procedures = 487, calls = 37, calls flagged for inlining = 16, calls inlined = 21, statements flattened = 280 [2024-10-11 17:02:58,136 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:02:58,136 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:02:58,136 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:02:58,138 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:02:58,144 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:58" (1/1) ... [2024-10-11 17:02:58,144 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:58" (1/1) ... [2024-10-11 17:02:58,148 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:58" (1/1) ... [2024-10-11 17:02:58,148 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:58" (1/1) ... [2024-10-11 17:02:58,158 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:58" (1/1) ... [2024-10-11 17:02:58,162 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:58" (1/1) ... [2024-10-11 17:02:58,165 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:58" (1/1) ... [2024-10-11 17:02:58,167 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:58" (1/1) ... [2024-10-11 17:02:58,171 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:02:58,171 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:02:58,171 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:02:58,172 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:02:58,172 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:58" (1/1) ... [2024-10-11 17:02:58,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:02:58,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:02:58,201 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:02:58,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:02:58,239 INFO L130 BoogieDeclarations]: Found specification of procedure thread_usb [2024-10-11 17:02:58,239 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_usb [2024-10-11 17:02:58,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 17:02:58,239 INFO L130 BoogieDeclarations]: Found specification of procedure thread_ath9k [2024-10-11 17:02:58,240 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_ath9k [2024-10-11 17:02:58,240 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-11 17:02:58,240 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:02:58,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-10-11 17:02:58,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:02:58,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:02:58,241 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 17:02:58,241 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-11 17:02:58,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-11 17:02:58,243 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 17:02:58,432 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:02:58,437 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:02:58,692 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 17:02:58,692 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:02:58,710 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:02:58,710 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 17:02:58,710 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:02:58 BoogieIcfgContainer [2024-10-11 17:02:58,710 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:02:58,712 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:02:58,712 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:02:58,715 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:02:58,717 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:02:57" (1/3) ... [2024-10-11 17:02:58,718 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60be40ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:02:58, skipping insertion in model container [2024-10-11 17:02:58,718 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:58" (2/3) ... [2024-10-11 17:02:58,718 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60be40ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:02:58, skipping insertion in model container [2024-10-11 17:02:58,718 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:02:58" (3/3) ... [2024-10-11 17:02:58,719 INFO L112 eAbstractionObserver]: Analyzing ICFG race-4_1-thread_local_vars.i [2024-10-11 17:02:58,731 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:02:58,732 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2024-10-11 17:02:58,732 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 17:02:58,813 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2024-10-11 17:02:58,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 432 places, 470 transitions, 967 flow [2024-10-11 17:02:59,013 INFO L124 PetriNetUnfolderBase]: 41/476 cut-off events. [2024-10-11 17:02:59,013 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-11 17:02:59,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 487 conditions, 476 events. 41/476 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1280 event pairs, 0 based on Foata normal form. 0/397 useless extension candidates. Maximal degree in co-relation 323. Up to 11 conditions per place. [2024-10-11 17:02:59,024 INFO L82 GeneralOperation]: Start removeDead. Operand has 432 places, 470 transitions, 967 flow [2024-10-11 17:02:59,031 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 303 places, 326 transitions, 668 flow [2024-10-11 17:02:59,050 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:02:59,056 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;@6c3ef97d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:02:59,057 INFO L334 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2024-10-11 17:02:59,061 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:02:59,061 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2024-10-11 17:02:59,061 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:02:59,061 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:59,062 INFO L204 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] [2024-10-11 17:02:59,062 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-10-11 17:02:59,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:59,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1208568071, now seen corresponding path program 1 times [2024-10-11 17:02:59,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:59,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808326318] [2024-10-11 17:02:59,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:59,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:59,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:59,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:02:59,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:59,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808326318] [2024-10-11 17:02:59,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808326318] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:59,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:59,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:02:59,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672049070] [2024-10-11 17:02:59,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:59,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:02:59,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:59,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:02:59,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:02:59,487 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 470 [2024-10-11 17:02:59,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 326 transitions, 668 flow. Second operand has 3 states, 3 states have (on average 409.3333333333333) internal successors, (1228), 3 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:02:59,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:59,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 470 [2024-10-11 17:02:59,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:59,621 INFO L124 PetriNetUnfolderBase]: 82/946 cut-off events. [2024-10-11 17:02:59,621 INFO L125 PetriNetUnfolderBase]: For 27/35 co-relation queries the response was YES. [2024-10-11 17:02:59,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1092 conditions, 946 events. 82/946 cut-off events. For 27/35 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 4774 event pairs, 48 based on Foata normal form. 73/883 useless extension candidates. Maximal degree in co-relation 765. Up to 125 conditions per place. [2024-10-11 17:02:59,633 INFO L140 encePairwiseOnDemand]: 451/470 looper letters, 22 selfloop transitions, 2 changer transitions 6/297 dead transitions. [2024-10-11 17:02:59,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 297 transitions, 658 flow [2024-10-11 17:02:59,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:02:59,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:02:59,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1265 transitions. [2024-10-11 17:02:59,651 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8971631205673759 [2024-10-11 17:02:59,654 INFO L175 Difference]: Start difference. First operand has 303 places, 326 transitions, 668 flow. Second operand 3 states and 1265 transitions. [2024-10-11 17:02:59,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 297 transitions, 658 flow [2024-10-11 17:02:59,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 297 transitions, 654 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:02:59,665 INFO L231 Difference]: Finished difference. Result has 290 places, 291 transitions, 598 flow [2024-10-11 17:02:59,667 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=470, PETRI_DIFFERENCE_MINUEND_FLOW=606, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=598, PETRI_PLACES=290, PETRI_TRANSITIONS=291} [2024-10-11 17:02:59,671 INFO L277 CegarLoopForPetriNet]: 303 programPoint places, -13 predicate places. [2024-10-11 17:02:59,672 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 291 transitions, 598 flow [2024-10-11 17:02:59,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 409.3333333333333) internal successors, (1228), 3 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:02:59,673 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:59,673 INFO L204 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] [2024-10-11 17:02:59,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:02:59,673 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-10-11 17:02:59,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:59,673 INFO L85 PathProgramCache]: Analyzing trace with hash -258701395, now seen corresponding path program 1 times [2024-10-11 17:02:59,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:59,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576890291] [2024-10-11 17:02:59,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:59,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:59,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:59,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:02:59,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:59,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576890291] [2024-10-11 17:02:59,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576890291] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:59,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:59,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:02:59,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956035039] [2024-10-11 17:02:59,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:59,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:02:59,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:59,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:02:59,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:02:59,844 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 398 out of 470 [2024-10-11 17:02:59,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 291 transitions, 598 flow. Second operand has 3 states, 3 states have (on average 399.0) internal successors, (1197), 3 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:02:59,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:59,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 398 of 470 [2024-10-11 17:02:59,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:59,949 INFO L124 PetriNetUnfolderBase]: 83/951 cut-off events. [2024-10-11 17:02:59,949 INFO L125 PetriNetUnfolderBase]: For 14/19 co-relation queries the response was YES. [2024-10-11 17:02:59,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1115 conditions, 951 events. 83/951 cut-off events. For 14/19 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4777 event pairs, 21 based on Foata normal form. 1/838 useless extension candidates. Maximal degree in co-relation 1081. Up to 112 conditions per place. [2024-10-11 17:02:59,956 INFO L140 encePairwiseOnDemand]: 450/470 looper letters, 26 selfloop transitions, 14 changer transitions 0/300 dead transitions. [2024-10-11 17:02:59,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 300 transitions, 697 flow [2024-10-11 17:02:59,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:02:59,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:02:59,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1240 transitions. [2024-10-11 17:02:59,959 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8794326241134752 [2024-10-11 17:02:59,960 INFO L175 Difference]: Start difference. First operand has 290 places, 291 transitions, 598 flow. Second operand 3 states and 1240 transitions. [2024-10-11 17:02:59,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 300 transitions, 697 flow [2024-10-11 17:02:59,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 300 transitions, 693 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:02:59,966 INFO L231 Difference]: Finished difference. Result has 283 places, 297 transitions, 686 flow [2024-10-11 17:02:59,966 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=470, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=686, PETRI_PLACES=283, PETRI_TRANSITIONS=297} [2024-10-11 17:02:59,967 INFO L277 CegarLoopForPetriNet]: 303 programPoint places, -20 predicate places. [2024-10-11 17:02:59,967 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 297 transitions, 686 flow [2024-10-11 17:02:59,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 399.0) internal successors, (1197), 3 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:02:59,968 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:59,969 INFO L204 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] [2024-10-11 17:02:59,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:02:59,969 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-10-11 17:02:59,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:59,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1194276038, now seen corresponding path program 1 times [2024-10-11 17:02:59,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:59,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099910779] [2024-10-11 17:02:59,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:59,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:59,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:03:00,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:03:00,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:03:00,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099910779] [2024-10-11 17:03:00,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099910779] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:03:00,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:03:00,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:03:00,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248382920] [2024-10-11 17:03:00,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:03:00,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:03:00,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:03:00,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:03:00,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:03:00,103 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 470 [2024-10-11 17:03:00,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 297 transitions, 686 flow. Second operand has 3 states, 3 states have (on average 410.0) internal successors, (1230), 3 states have internal predecessors, (1230), 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) [2024-10-11 17:03:00,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:03:00,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 470 [2024-10-11 17:03:00,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:03:00,242 INFO L124 PetriNetUnfolderBase]: 137/1399 cut-off events. [2024-10-11 17:03:00,243 INFO L125 PetriNetUnfolderBase]: For 273/311 co-relation queries the response was YES. [2024-10-11 17:03:00,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1852 conditions, 1399 events. 137/1399 cut-off events. For 273/311 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 8704 event pairs, 61 based on Foata normal form. 0/1227 useless extension candidates. Maximal degree in co-relation 1443. Up to 203 conditions per place. [2024-10-11 17:03:00,252 INFO L140 encePairwiseOnDemand]: 467/470 looper letters, 28 selfloop transitions, 2 changer transitions 0/296 dead transitions. [2024-10-11 17:03:00,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 296 transitions, 744 flow [2024-10-11 17:03:00,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:03:00,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:03:00,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1249 transitions. [2024-10-11 17:03:00,254 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8858156028368794 [2024-10-11 17:03:00,254 INFO L175 Difference]: Start difference. First operand has 283 places, 297 transitions, 686 flow. Second operand 3 states and 1249 transitions. [2024-10-11 17:03:00,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 296 transitions, 744 flow [2024-10-11 17:03:00,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 296 transitions, 716 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:03:00,260 INFO L231 Difference]: Finished difference. Result has 282 places, 296 transitions, 660 flow [2024-10-11 17:03:00,261 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=470, PETRI_DIFFERENCE_MINUEND_FLOW=656, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=660, PETRI_PLACES=282, PETRI_TRANSITIONS=296} [2024-10-11 17:03:00,262 INFO L277 CegarLoopForPetriNet]: 303 programPoint places, -21 predicate places. [2024-10-11 17:03:00,262 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 296 transitions, 660 flow [2024-10-11 17:03:00,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 410.0) internal successors, (1230), 3 states have internal predecessors, (1230), 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) [2024-10-11 17:03:00,263 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:03:00,263 INFO L204 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] [2024-10-11 17:03:00,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:03:00,264 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-10-11 17:03:00,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:03:00,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1090006123, now seen corresponding path program 1 times [2024-10-11 17:03:00,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:03:00,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673528298] [2024-10-11 17:03:00,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:03:00,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:03:00,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:03:00,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:03:00,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:03:00,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673528298] [2024-10-11 17:03:00,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673528298] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:03:00,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:03:00,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:03:00,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112226942] [2024-10-11 17:03:00,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:03:00,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:03:00,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:03:00,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:03:00,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:03:00,350 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 422 out of 470 [2024-10-11 17:03:00,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 296 transitions, 660 flow. Second operand has 3 states, 3 states have (on average 423.3333333333333) internal successors, (1270), 3 states have internal predecessors, (1270), 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) [2024-10-11 17:03:00,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:03:00,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 422 of 470 [2024-10-11 17:03:00,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:03:00,467 INFO L124 PetriNetUnfolderBase]: 99/1140 cut-off events. [2024-10-11 17:03:00,467 INFO L125 PetriNetUnfolderBase]: For 24/55 co-relation queries the response was YES. [2024-10-11 17:03:00,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1371 conditions, 1140 events. 99/1140 cut-off events. For 24/55 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 6770 event pairs, 9 based on Foata normal form. 4/991 useless extension candidates. Maximal degree in co-relation 1332. Up to 98 conditions per place. [2024-10-11 17:03:00,473 INFO L140 encePairwiseOnDemand]: 467/470 looper letters, 17 selfloop transitions, 2 changer transitions 0/300 dead transitions. [2024-10-11 17:03:00,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 300 transitions, 715 flow [2024-10-11 17:03:00,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:03:00,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:03:00,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1286 transitions. [2024-10-11 17:03:00,476 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9120567375886525 [2024-10-11 17:03:00,476 INFO L175 Difference]: Start difference. First operand has 282 places, 296 transitions, 660 flow. Second operand 3 states and 1286 transitions. [2024-10-11 17:03:00,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 300 transitions, 715 flow [2024-10-11 17:03:00,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 300 transitions, 711 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:03:00,481 INFO L231 Difference]: Finished difference. Result has 281 places, 295 transitions, 658 flow [2024-10-11 17:03:00,481 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=470, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=658, PETRI_PLACES=281, PETRI_TRANSITIONS=295} [2024-10-11 17:03:00,482 INFO L277 CegarLoopForPetriNet]: 303 programPoint places, -22 predicate places. [2024-10-11 17:03:00,482 INFO L471 AbstractCegarLoop]: Abstraction has has 281 places, 295 transitions, 658 flow [2024-10-11 17:03:00,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 423.3333333333333) internal successors, (1270), 3 states have internal predecessors, (1270), 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) [2024-10-11 17:03:00,483 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:03:00,483 INFO L204 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] [2024-10-11 17:03:00,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:03:00,484 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread_usbErr0ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-10-11 17:03:00,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:03:00,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1642742462, now seen corresponding path program 1 times [2024-10-11 17:03:00,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:03:00,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645738240] [2024-10-11 17:03:00,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:03:00,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:03:00,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:03:00,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:03:00,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:03:00,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645738240] [2024-10-11 17:03:00,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645738240] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:03:00,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:03:00,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:03:00,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205409889] [2024-10-11 17:03:00,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:03:00,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:03:00,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:03:00,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:03:00,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:03:00,582 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 470 [2024-10-11 17:03:00,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 295 transitions, 658 flow. Second operand has 3 states, 3 states have (on average 416.3333333333333) internal successors, (1249), 3 states have internal predecessors, (1249), 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) [2024-10-11 17:03:00,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:03:00,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 470 [2024-10-11 17:03:00,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:03:00,690 INFO L124 PetriNetUnfolderBase]: 78/1012 cut-off events. [2024-10-11 17:03:00,691 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-10-11 17:03:00,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1192 conditions, 1012 events. 78/1012 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 5500 event pairs, 19 based on Foata normal form. 0/890 useless extension candidates. Maximal degree in co-relation 1100. Up to 67 conditions per place. [2024-10-11 17:03:00,697 INFO L140 encePairwiseOnDemand]: 467/470 looper letters, 14 selfloop transitions, 2 changer transitions 0/294 dead transitions. [2024-10-11 17:03:00,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 294 transitions, 688 flow [2024-10-11 17:03:00,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:03:00,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:03:00,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1262 transitions. [2024-10-11 17:03:00,700 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8950354609929078 [2024-10-11 17:03:00,701 INFO L175 Difference]: Start difference. First operand has 281 places, 295 transitions, 658 flow. Second operand 3 states and 1262 transitions. [2024-10-11 17:03:00,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 294 transitions, 688 flow [2024-10-11 17:03:00,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 294 transitions, 684 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:03:00,705 INFO L231 Difference]: Finished difference. Result has 280 places, 294 transitions, 656 flow [2024-10-11 17:03:00,705 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=470, PETRI_DIFFERENCE_MINUEND_FLOW=652, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=656, PETRI_PLACES=280, PETRI_TRANSITIONS=294} [2024-10-11 17:03:00,707 INFO L277 CegarLoopForPetriNet]: 303 programPoint places, -23 predicate places. [2024-10-11 17:03:00,707 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 294 transitions, 656 flow [2024-10-11 17:03:00,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 416.3333333333333) internal successors, (1249), 3 states have internal predecessors, (1249), 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) [2024-10-11 17:03:00,708 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:03:00,708 INFO L204 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] [2024-10-11 17:03:00,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:03:00,709 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-10-11 17:03:00,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:03:00,711 INFO L85 PathProgramCache]: Analyzing trace with hash 281040216, now seen corresponding path program 1 times [2024-10-11 17:03:00,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:03:00,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950522684] [2024-10-11 17:03:00,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:03:00,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:03:00,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:03:00,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:03:00,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:03:00,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950522684] [2024-10-11 17:03:00,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950522684] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:03:00,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:03:00,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:03:00,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590124059] [2024-10-11 17:03:00,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:03:00,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:03:00,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:03:00,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:03:00,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:03:00,797 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 470 [2024-10-11 17:03:00,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 294 transitions, 656 flow. Second operand has 3 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 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) [2024-10-11 17:03:00,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:03:00,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 470 [2024-10-11 17:03:00,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:03:00,892 INFO L124 PetriNetUnfolderBase]: 85/924 cut-off events. [2024-10-11 17:03:00,892 INFO L125 PetriNetUnfolderBase]: For 17/39 co-relation queries the response was YES. [2024-10-11 17:03:00,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1122 conditions, 924 events. 85/924 cut-off events. For 17/39 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4927 event pairs, 9 based on Foata normal form. 4/819 useless extension candidates. Maximal degree in co-relation 1024. Up to 69 conditions per place. [2024-10-11 17:03:00,896 INFO L140 encePairwiseOnDemand]: 468/470 looper letters, 14 selfloop transitions, 1 changer transitions 19/298 dead transitions. [2024-10-11 17:03:00,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 298 transitions, 703 flow [2024-10-11 17:03:00,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:03:00,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:03:00,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1294 transitions. [2024-10-11 17:03:00,898 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9177304964539007 [2024-10-11 17:03:00,898 INFO L175 Difference]: Start difference. First operand has 280 places, 294 transitions, 656 flow. Second operand 3 states and 1294 transitions. [2024-10-11 17:03:00,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 298 transitions, 703 flow [2024-10-11 17:03:00,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 298 transitions, 699 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:03:00,902 INFO L231 Difference]: Finished difference. Result has 279 places, 274 transitions, 610 flow [2024-10-11 17:03:00,902 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=470, PETRI_DIFFERENCE_MINUEND_FLOW=650, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=610, PETRI_PLACES=279, PETRI_TRANSITIONS=274} [2024-10-11 17:03:00,903 INFO L277 CegarLoopForPetriNet]: 303 programPoint places, -24 predicate places. [2024-10-11 17:03:00,903 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 274 transitions, 610 flow [2024-10-11 17:03:00,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 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) [2024-10-11 17:03:00,903 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:03:00,903 INFO L204 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] [2024-10-11 17:03:00,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:03:00,904 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread_usbErr1ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-10-11 17:03:00,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:03:00,904 INFO L85 PathProgramCache]: Analyzing trace with hash 602710765, now seen corresponding path program 1 times [2024-10-11 17:03:00,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:03:00,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865287536] [2024-10-11 17:03:00,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:03:00,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:03:00,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:03:00,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:03:00,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:03:00,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865287536] [2024-10-11 17:03:00,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865287536] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:03:00,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:03:00,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:03:00,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691533497] [2024-10-11 17:03:00,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:03:00,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:03:00,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:03:00,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:03:00,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:03:00,992 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 407 out of 470 [2024-10-11 17:03:00,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 274 transitions, 610 flow. Second operand has 3 states, 3 states have (on average 408.3333333333333) internal successors, (1225), 3 states have internal predecessors, (1225), 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) [2024-10-11 17:03:00,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:03:00,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 407 of 470 [2024-10-11 17:03:00,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:03:01,086 INFO L124 PetriNetUnfolderBase]: 101/1142 cut-off events. [2024-10-11 17:03:01,087 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-10-11 17:03:01,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1354 conditions, 1142 events. 101/1142 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 6642 event pairs, 23 based on Foata normal form. 0/1009 useless extension candidates. Maximal degree in co-relation 1281. Up to 83 conditions per place. [2024-10-11 17:03:01,095 INFO L140 encePairwiseOnDemand]: 462/470 looper letters, 16 selfloop transitions, 5 changer transitions 0/276 dead transitions. [2024-10-11 17:03:01,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 276 transitions, 656 flow [2024-10-11 17:03:01,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:03:01,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:03:01,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1245 transitions. [2024-10-11 17:03:01,097 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8829787234042553 [2024-10-11 17:03:01,098 INFO L175 Difference]: Start difference. First operand has 279 places, 274 transitions, 610 flow. Second operand 3 states and 1245 transitions. [2024-10-11 17:03:01,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 276 transitions, 656 flow [2024-10-11 17:03:01,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 276 transitions, 655 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:03:01,102 INFO L231 Difference]: Finished difference. Result has 260 places, 274 transitions, 630 flow [2024-10-11 17:03:01,102 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=470, PETRI_DIFFERENCE_MINUEND_FLOW=603, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=630, PETRI_PLACES=260, PETRI_TRANSITIONS=274} [2024-10-11 17:03:01,103 INFO L277 CegarLoopForPetriNet]: 303 programPoint places, -43 predicate places. [2024-10-11 17:03:01,103 INFO L471 AbstractCegarLoop]: Abstraction has has 260 places, 274 transitions, 630 flow [2024-10-11 17:03:01,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 408.3333333333333) internal successors, (1225), 3 states have internal predecessors, (1225), 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) [2024-10-11 17:03:01,104 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:03:01,104 INFO L204 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] [2024-10-11 17:03:01,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:03:01,104 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread_usbErr5ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-10-11 17:03:01,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:03:01,105 INFO L85 PathProgramCache]: Analyzing trace with hash -779475163, now seen corresponding path program 1 times [2024-10-11 17:03:01,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:03:01,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485964868] [2024-10-11 17:03:01,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:03:01,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:03:01,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:03:01,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:03:01,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:03:01,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485964868] [2024-10-11 17:03:01,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485964868] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:03:01,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:03:01,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:03:01,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49805430] [2024-10-11 17:03:01,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:03:01,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:03:01,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:03:01,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:03:01,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:03:01,235 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 414 out of 470 [2024-10-11 17:03:01,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 274 transitions, 630 flow. Second operand has 3 states, 3 states have (on average 415.3333333333333) internal successors, (1246), 3 states have internal predecessors, (1246), 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) [2024-10-11 17:03:01,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:03:01,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 414 of 470 [2024-10-11 17:03:01,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:03:01,326 INFO L124 PetriNetUnfolderBase]: 103/1074 cut-off events. [2024-10-11 17:03:01,327 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-10-11 17:03:01,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1303 conditions, 1074 events. 103/1074 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 5939 event pairs, 14 based on Foata normal form. 1/945 useless extension candidates. Maximal degree in co-relation 1229. Up to 63 conditions per place. [2024-10-11 17:03:01,333 INFO L140 encePairwiseOnDemand]: 462/470 looper letters, 15 selfloop transitions, 5 changer transitions 0/278 dead transitions. [2024-10-11 17:03:01,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 278 transitions, 678 flow [2024-10-11 17:03:01,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:03:01,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:03:01,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1265 transitions. [2024-10-11 17:03:01,335 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8971631205673759 [2024-10-11 17:03:01,335 INFO L175 Difference]: Start difference. First operand has 260 places, 274 transitions, 630 flow. Second operand 3 states and 1265 transitions. [2024-10-11 17:03:01,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 278 transitions, 678 flow [2024-10-11 17:03:01,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 278 transitions, 673 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:03:01,339 INFO L231 Difference]: Finished difference. Result has 263 places, 276 transitions, 659 flow [2024-10-11 17:03:01,339 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=470, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=659, PETRI_PLACES=263, PETRI_TRANSITIONS=276} [2024-10-11 17:03:01,341 INFO L277 CegarLoopForPetriNet]: 303 programPoint places, -40 predicate places. [2024-10-11 17:03:01,341 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 276 transitions, 659 flow [2024-10-11 17:03:01,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 415.3333333333333) internal successors, (1246), 3 states have internal predecessors, (1246), 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) [2024-10-11 17:03:01,342 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:03:01,342 INFO L204 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] [2024-10-11 17:03:01,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:03:01,343 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread_usbErr10ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-10-11 17:03:01,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:03:01,344 INFO L85 PathProgramCache]: Analyzing trace with hash -180834619, now seen corresponding path program 1 times [2024-10-11 17:03:01,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:03:01,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191479024] [2024-10-11 17:03:01,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:03:01,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:03:01,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:03:01,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:03:01,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:03:01,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191479024] [2024-10-11 17:03:01,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191479024] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:03:01,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:03:01,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:03:01,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921832305] [2024-10-11 17:03:01,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:03:01,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:03:01,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:03:01,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:03:01,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:03:01,463 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 470 [2024-10-11 17:03:01,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 276 transitions, 659 flow. Second operand has 3 states, 3 states have (on average 413.0) internal successors, (1239), 3 states have internal predecessors, (1239), 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) [2024-10-11 17:03:01,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:03:01,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 470 [2024-10-11 17:03:01,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:03:01,552 INFO L124 PetriNetUnfolderBase]: 120/1104 cut-off events. [2024-10-11 17:03:01,552 INFO L125 PetriNetUnfolderBase]: For 87/100 co-relation queries the response was YES. [2024-10-11 17:03:01,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1449 conditions, 1104 events. 120/1104 cut-off events. For 87/100 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 5988 event pairs, 28 based on Foata normal form. 2/980 useless extension candidates. Maximal degree in co-relation 1370. Up to 137 conditions per place. [2024-10-11 17:03:01,559 INFO L140 encePairwiseOnDemand]: 464/470 looper letters, 26 selfloop transitions, 8 changer transitions 0/284 dead transitions. [2024-10-11 17:03:01,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 284 transitions, 753 flow [2024-10-11 17:03:01,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:03:01,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:03:01,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1260 transitions. [2024-10-11 17:03:01,561 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8936170212765957 [2024-10-11 17:03:01,561 INFO L175 Difference]: Start difference. First operand has 263 places, 276 transitions, 659 flow. Second operand 3 states and 1260 transitions. [2024-10-11 17:03:01,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 284 transitions, 753 flow [2024-10-11 17:03:01,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 284 transitions, 743 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:03:01,565 INFO L231 Difference]: Finished difference. Result has 265 places, 282 transitions, 717 flow [2024-10-11 17:03:01,566 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=470, PETRI_DIFFERENCE_MINUEND_FLOW=649, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=717, PETRI_PLACES=265, PETRI_TRANSITIONS=282} [2024-10-11 17:03:01,566 INFO L277 CegarLoopForPetriNet]: 303 programPoint places, -38 predicate places. [2024-10-11 17:03:01,566 INFO L471 AbstractCegarLoop]: Abstraction has has 265 places, 282 transitions, 717 flow [2024-10-11 17:03:01,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.0) internal successors, (1239), 3 states have internal predecessors, (1239), 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) [2024-10-11 17:03:01,567 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:03:01,567 INFO L204 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] [2024-10-11 17:03:01,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 17:03:01,567 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread_usbErr2ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-10-11 17:03:01,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:03:01,568 INFO L85 PathProgramCache]: Analyzing trace with hash 59076434, now seen corresponding path program 1 times [2024-10-11 17:03:01,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:03:01,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886044320] [2024-10-11 17:03:01,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:03:01,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:03:01,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:03:01,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:03:01,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:03:01,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886044320] [2024-10-11 17:03:01,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886044320] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:03:01,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:03:01,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:03:01,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004209752] [2024-10-11 17:03:01,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:03:01,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:03:01,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:03:01,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:03:01,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:03:01,632 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 420 out of 470 [2024-10-11 17:03:01,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 282 transitions, 717 flow. Second operand has 3 states, 3 states have (on average 421.6666666666667) internal successors, (1265), 3 states have internal predecessors, (1265), 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) [2024-10-11 17:03:01,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:03:01,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 420 of 470 [2024-10-11 17:03:01,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:03:01,730 INFO L124 PetriNetUnfolderBase]: 114/1189 cut-off events. [2024-10-11 17:03:01,731 INFO L125 PetriNetUnfolderBase]: For 83/94 co-relation queries the response was YES. [2024-10-11 17:03:01,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1536 conditions, 1189 events. 114/1189 cut-off events. For 83/94 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 6837 event pairs, 14 based on Foata normal form. 0/1058 useless extension candidates. Maximal degree in co-relation 1459. Up to 73 conditions per place. [2024-10-11 17:03:01,738 INFO L140 encePairwiseOnDemand]: 467/470 looper letters, 14 selfloop transitions, 2 changer transitions 0/283 dead transitions. [2024-10-11 17:03:01,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 283 transitions, 751 flow [2024-10-11 17:03:01,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:03:01,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:03:01,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1277 transitions. [2024-10-11 17:03:01,741 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9056737588652483 [2024-10-11 17:03:01,741 INFO L175 Difference]: Start difference. First operand has 265 places, 282 transitions, 717 flow. Second operand 3 states and 1277 transitions. [2024-10-11 17:03:01,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 283 transitions, 751 flow [2024-10-11 17:03:01,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 283 transitions, 735 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:03:01,745 INFO L231 Difference]: Finished difference. Result has 264 places, 281 transitions, 703 flow [2024-10-11 17:03:01,745 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=470, PETRI_DIFFERENCE_MINUEND_FLOW=699, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=703, PETRI_PLACES=264, PETRI_TRANSITIONS=281} [2024-10-11 17:03:01,745 INFO L277 CegarLoopForPetriNet]: 303 programPoint places, -39 predicate places. [2024-10-11 17:03:01,746 INFO L471 AbstractCegarLoop]: Abstraction has has 264 places, 281 transitions, 703 flow [2024-10-11 17:03:01,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 421.6666666666667) internal successors, (1265), 3 states have internal predecessors, (1265), 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) [2024-10-11 17:03:01,746 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:03:01,747 INFO L204 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] [2024-10-11 17:03:01,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 17:03:01,747 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread_usbErr3ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-10-11 17:03:01,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:03:01,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1232941445, now seen corresponding path program 1 times [2024-10-11 17:03:01,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:03:01,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432089582] [2024-10-11 17:03:01,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:03:01,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:03:01,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:03:01,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:03:01,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:03:01,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432089582] [2024-10-11 17:03:01,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432089582] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:03:01,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:03:01,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:03:01,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637767463] [2024-10-11 17:03:01,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:03:01,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:03:01,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:03:01,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:03:01,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:03:01,827 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 470 [2024-10-11 17:03:01,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 281 transitions, 703 flow. Second operand has 3 states, 3 states have (on average 417.0) internal successors, (1251), 3 states have internal predecessors, (1251), 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) [2024-10-11 17:03:01,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:03:01,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 470 [2024-10-11 17:03:01,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:03:01,929 INFO L124 PetriNetUnfolderBase]: 136/1235 cut-off events. [2024-10-11 17:03:01,930 INFO L125 PetriNetUnfolderBase]: For 93/112 co-relation queries the response was YES. [2024-10-11 17:03:01,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1614 conditions, 1235 events. 136/1235 cut-off events. For 93/112 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 7309 event pairs, 22 based on Foata normal form. 0/1092 useless extension candidates. Maximal degree in co-relation 1537. Up to 92 conditions per place. [2024-10-11 17:03:01,952 INFO L140 encePairwiseOnDemand]: 467/470 looper letters, 19 selfloop transitions, 2 changer transitions 0/282 dead transitions. [2024-10-11 17:03:01,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 282 transitions, 747 flow [2024-10-11 17:03:01,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:03:01,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:03:01,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1264 transitions. [2024-10-11 17:03:01,955 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8964539007092198 [2024-10-11 17:03:01,955 INFO L175 Difference]: Start difference. First operand has 264 places, 281 transitions, 703 flow. Second operand 3 states and 1264 transitions. [2024-10-11 17:03:01,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 282 transitions, 747 flow [2024-10-11 17:03:01,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 282 transitions, 743 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:03:01,960 INFO L231 Difference]: Finished difference. Result has 263 places, 280 transitions, 701 flow [2024-10-11 17:03:01,960 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=470, PETRI_DIFFERENCE_MINUEND_FLOW=697, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=701, PETRI_PLACES=263, PETRI_TRANSITIONS=280} [2024-10-11 17:03:01,960 INFO L277 CegarLoopForPetriNet]: 303 programPoint places, -40 predicate places. [2024-10-11 17:03:01,961 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 280 transitions, 701 flow [2024-10-11 17:03:01,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 417.0) internal successors, (1251), 3 states have internal predecessors, (1251), 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) [2024-10-11 17:03:01,962 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:03:01,962 INFO L204 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] [2024-10-11 17:03:01,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 17:03:01,962 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-10-11 17:03:01,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:03:01,963 INFO L85 PathProgramCache]: Analyzing trace with hash 756046649, now seen corresponding path program 1 times [2024-10-11 17:03:01,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:03:01,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489416990] [2024-10-11 17:03:01,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:03:01,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:03:01,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:03:02,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:03:02,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:03:02,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489416990] [2024-10-11 17:03:02,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489416990] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:03:02,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:03:02,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:03:02,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967332275] [2024-10-11 17:03:02,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:03:02,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:03:02,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:03:02,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:03:02,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:03:02,068 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 470 [2024-10-11 17:03:02,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 280 transitions, 701 flow. Second operand has 3 states, 3 states have (on average 411.0) internal successors, (1233), 3 states have internal predecessors, (1233), 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) [2024-10-11 17:03:02,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:03:02,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 470 [2024-10-11 17:03:02,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:03:02,176 INFO L124 PetriNetUnfolderBase]: 168/1252 cut-off events. [2024-10-11 17:03:02,177 INFO L125 PetriNetUnfolderBase]: For 266/343 co-relation queries the response was YES. [2024-10-11 17:03:02,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1852 conditions, 1252 events. 168/1252 cut-off events. For 266/343 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 7371 event pairs, 39 based on Foata normal form. 8/1127 useless extension candidates. Maximal degree in co-relation 1773. Up to 236 conditions per place. [2024-10-11 17:03:02,187 INFO L140 encePairwiseOnDemand]: 462/470 looper letters, 31 selfloop transitions, 12 changer transitions 0/289 dead transitions. [2024-10-11 17:03:02,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 289 transitions, 824 flow [2024-10-11 17:03:02,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:03:02,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:03:02,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1255 transitions. [2024-10-11 17:03:02,190 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8900709219858156 [2024-10-11 17:03:02,190 INFO L175 Difference]: Start difference. First operand has 263 places, 280 transitions, 701 flow. Second operand 3 states and 1255 transitions. [2024-10-11 17:03:02,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 289 transitions, 824 flow [2024-10-11 17:03:02,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 289 transitions, 820 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:03:02,195 INFO L231 Difference]: Finished difference. Result has 265 places, 288 transitions, 797 flow [2024-10-11 17:03:02,195 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=470, PETRI_DIFFERENCE_MINUEND_FLOW=697, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=797, PETRI_PLACES=265, PETRI_TRANSITIONS=288} [2024-10-11 17:03:02,196 INFO L277 CegarLoopForPetriNet]: 303 programPoint places, -38 predicate places. [2024-10-11 17:03:02,196 INFO L471 AbstractCegarLoop]: Abstraction has has 265 places, 288 transitions, 797 flow [2024-10-11 17:03:02,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 411.0) internal successors, (1233), 3 states have internal predecessors, (1233), 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) [2024-10-11 17:03:02,197 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:03:02,197 INFO L204 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] [2024-10-11 17:03:02,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 17:03:02,198 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-10-11 17:03:02,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:03:02,198 INFO L85 PathProgramCache]: Analyzing trace with hash 904070119, now seen corresponding path program 1 times [2024-10-11 17:03:02,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:03:02,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031891810] [2024-10-11 17:03:02,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:03:02,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:03:02,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:03:02,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:03:02,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:03:02,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031891810] [2024-10-11 17:03:02,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031891810] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:03:02,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:03:02,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:03:02,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946284691] [2024-10-11 17:03:02,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:03:02,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:03:02,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:03:02,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:03:02,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:03:02,315 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 470 [2024-10-11 17:03:02,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 288 transitions, 797 flow. Second operand has 3 states, 3 states have (on average 411.3333333333333) internal successors, (1234), 3 states have internal predecessors, (1234), 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) [2024-10-11 17:03:02,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:03:02,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 470 [2024-10-11 17:03:02,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:03:02,487 INFO L124 PetriNetUnfolderBase]: 278/1846 cut-off events. [2024-10-11 17:03:02,487 INFO L125 PetriNetUnfolderBase]: For 952/1053 co-relation queries the response was YES. [2024-10-11 17:03:02,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3005 conditions, 1846 events. 278/1846 cut-off events. For 952/1053 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 12908 event pairs, 86 based on Foata normal form. 8/1673 useless extension candidates. Maximal degree in co-relation 2614. Up to 358 conditions per place. [2024-10-11 17:03:02,497 INFO L140 encePairwiseOnDemand]: 464/470 looper letters, 38 selfloop transitions, 9 changer transitions 1/295 dead transitions. [2024-10-11 17:03:02,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 295 transitions, 925 flow [2024-10-11 17:03:02,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:03:02,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:03:02,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1254 transitions. [2024-10-11 17:03:02,500 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8893617021276595 [2024-10-11 17:03:02,500 INFO L175 Difference]: Start difference. First operand has 265 places, 288 transitions, 797 flow. Second operand 3 states and 1254 transitions. [2024-10-11 17:03:02,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 295 transitions, 925 flow [2024-10-11 17:03:02,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 295 transitions, 897 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:03:02,506 INFO L231 Difference]: Finished difference. Result has 267 places, 292 transitions, 843 flow [2024-10-11 17:03:02,507 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=470, PETRI_DIFFERENCE_MINUEND_FLOW=773, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=843, PETRI_PLACES=267, PETRI_TRANSITIONS=292} [2024-10-11 17:03:02,507 INFO L277 CegarLoopForPetriNet]: 303 programPoint places, -36 predicate places. [2024-10-11 17:03:02,507 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 292 transitions, 843 flow [2024-10-11 17:03:02,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 411.3333333333333) internal successors, (1234), 3 states have internal predecessors, (1234), 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) [2024-10-11 17:03:02,508 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:03:02,508 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:03:02,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 17:03:02,508 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread_usbErr5ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-10-11 17:03:02,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:03:02,509 INFO L85 PathProgramCache]: Analyzing trace with hash -883329259, now seen corresponding path program 1 times [2024-10-11 17:03:02,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:03:02,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897271232] [2024-10-11 17:03:02,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:03:02,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:03:02,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:03:02,550 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 17:03:02,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:03:02,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897271232] [2024-10-11 17:03:02,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897271232] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:03:02,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:03:02,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:03:02,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195043454] [2024-10-11 17:03:02,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:03:02,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:03:02,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:03:02,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:03:02,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:03:02,564 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 422 out of 470 [2024-10-11 17:03:02,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 292 transitions, 843 flow. Second operand has 3 states, 3 states have (on average 423.0) internal successors, (1269), 3 states have internal predecessors, (1269), 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) [2024-10-11 17:03:02,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:03:02,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 422 of 470 [2024-10-11 17:03:02,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:03:02,674 INFO L124 PetriNetUnfolderBase]: 152/1466 cut-off events. [2024-10-11 17:03:02,674 INFO L125 PetriNetUnfolderBase]: For 403/445 co-relation queries the response was YES. [2024-10-11 17:03:02,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2102 conditions, 1466 events. 152/1466 cut-off events. For 403/445 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 8367 event pairs, 16 based on Foata normal form. 2/1323 useless extension candidates. Maximal degree in co-relation 2023. Up to 104 conditions per place. [2024-10-11 17:03:02,682 INFO L140 encePairwiseOnDemand]: 467/470 looper letters, 11 selfloop transitions, 2 changer transitions 2/296 dead transitions. [2024-10-11 17:03:02,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 296 transitions, 882 flow [2024-10-11 17:03:02,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:03:02,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:03:02,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1282 transitions. [2024-10-11 17:03:02,685 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9092198581560283 [2024-10-11 17:03:02,685 INFO L175 Difference]: Start difference. First operand has 267 places, 292 transitions, 843 flow. Second operand 3 states and 1282 transitions. [2024-10-11 17:03:02,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 296 transitions, 882 flow [2024-10-11 17:03:02,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 296 transitions, 858 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-10-11 17:03:02,690 INFO L231 Difference]: Finished difference. Result has 267 places, 292 transitions, 827 flow [2024-10-11 17:03:02,691 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=470, PETRI_DIFFERENCE_MINUEND_FLOW=817, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=827, PETRI_PLACES=267, PETRI_TRANSITIONS=292} [2024-10-11 17:03:02,691 INFO L277 CegarLoopForPetriNet]: 303 programPoint places, -36 predicate places. [2024-10-11 17:03:02,691 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 292 transitions, 827 flow [2024-10-11 17:03:02,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 423.0) internal successors, (1269), 3 states have internal predecessors, (1269), 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) [2024-10-11 17:03:02,692 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:03:02,692 INFO L204 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] [2024-10-11 17:03:02,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 17:03:02,693 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread_usbErr10ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-10-11 17:03:02,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:03:02,693 INFO L85 PathProgramCache]: Analyzing trace with hash -12439881, now seen corresponding path program 1 times [2024-10-11 17:03:02,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:03:02,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084175891] [2024-10-11 17:03:02,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:03:02,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:03:02,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:03:02,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:03:02,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:03:02,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084175891] [2024-10-11 17:03:02,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084175891] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:03:02,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:03:02,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:03:02,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516147247] [2024-10-11 17:03:02,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:03:02,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:03:02,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:03:02,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:03:02,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:03:02,801 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 419 out of 470 [2024-10-11 17:03:02,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 292 transitions, 827 flow. Second operand has 5 states, 5 states have (on average 421.4) internal successors, (2107), 5 states have internal predecessors, (2107), 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) [2024-10-11 17:03:02,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:03:02,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 419 of 470 [2024-10-11 17:03:02,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:03:03,068 INFO L124 PetriNetUnfolderBase]: 342/2848 cut-off events. [2024-10-11 17:03:03,069 INFO L125 PetriNetUnfolderBase]: For 575/629 co-relation queries the response was YES. [2024-10-11 17:03:03,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4104 conditions, 2848 events. 342/2848 cut-off events. For 575/629 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 20705 event pairs, 32 based on Foata normal form. 4/2571 useless extension candidates. Maximal degree in co-relation 4024. Up to 205 conditions per place. [2024-10-11 17:03:03,112 INFO L140 encePairwiseOnDemand]: 462/470 looper letters, 32 selfloop transitions, 8 changer transitions 0/314 dead transitions. [2024-10-11 17:03:03,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 314 transitions, 958 flow [2024-10-11 17:03:03,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 17:03:03,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-11 17:03:03,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2974 transitions. [2024-10-11 17:03:03,117 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.903951367781155 [2024-10-11 17:03:03,117 INFO L175 Difference]: Start difference. First operand has 267 places, 292 transitions, 827 flow. Second operand 7 states and 2974 transitions. [2024-10-11 17:03:03,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 314 transitions, 958 flow [2024-10-11 17:03:03,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 314 transitions, 956 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:03:03,122 INFO L231 Difference]: Finished difference. Result has 277 places, 299 transitions, 883 flow [2024-10-11 17:03:03,122 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=470, PETRI_DIFFERENCE_MINUEND_FLOW=825, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=883, PETRI_PLACES=277, PETRI_TRANSITIONS=299} [2024-10-11 17:03:03,123 INFO L277 CegarLoopForPetriNet]: 303 programPoint places, -26 predicate places. [2024-10-11 17:03:03,123 INFO L471 AbstractCegarLoop]: Abstraction has has 277 places, 299 transitions, 883 flow [2024-10-11 17:03:03,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 421.4) internal successors, (2107), 5 states have internal predecessors, (2107), 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) [2024-10-11 17:03:03,124 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:03:03,125 INFO L204 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] [2024-10-11 17:03:03,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 17:03:03,125 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread_usbErr10ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-10-11 17:03:03,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:03:03,125 INFO L85 PathProgramCache]: Analyzing trace with hash -997250345, now seen corresponding path program 1 times [2024-10-11 17:03:03,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:03:03,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087391357] [2024-10-11 17:03:03,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:03:03,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:03:03,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:03:03,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:03:03,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:03:03,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087391357] [2024-10-11 17:03:03,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087391357] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:03:03,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:03:03,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:03:03,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818159643] [2024-10-11 17:03:03,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:03:03,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:03:03,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:03:03,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:03:03,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:03:03,228 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 421 out of 470 [2024-10-11 17:03:03,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 299 transitions, 883 flow. Second operand has 5 states, 5 states have (on average 423.0) internal successors, (2115), 5 states have internal predecessors, (2115), 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) [2024-10-11 17:03:03,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:03:03,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 421 of 470 [2024-10-11 17:03:03,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:03:03,738 INFO L124 PetriNetUnfolderBase]: 583/5262 cut-off events. [2024-10-11 17:03:03,785 INFO L125 PetriNetUnfolderBase]: For 1222/1354 co-relation queries the response was YES. [2024-10-11 17:03:03,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7736 conditions, 5262 events. 583/5262 cut-off events. For 1222/1354 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 46682 event pairs, 50 based on Foata normal form. 10/4768 useless extension candidates. Maximal degree in co-relation 7652. Up to 424 conditions per place. [2024-10-11 17:03:03,809 INFO L140 encePairwiseOnDemand]: 463/470 looper letters, 34 selfloop transitions, 9 changer transitions 0/326 dead transitions. [2024-10-11 17:03:03,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 326 transitions, 1034 flow [2024-10-11 17:03:03,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 17:03:03,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-11 17:03:03,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2991 transitions. [2024-10-11 17:03:03,813 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9091185410334347 [2024-10-11 17:03:03,813 INFO L175 Difference]: Start difference. First operand has 277 places, 299 transitions, 883 flow. Second operand 7 states and 2991 transitions. [2024-10-11 17:03:03,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 326 transitions, 1034 flow [2024-10-11 17:03:03,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 326 transitions, 1034 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:03:03,819 INFO L231 Difference]: Finished difference. Result has 289 places, 307 transitions, 951 flow [2024-10-11 17:03:03,819 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=470, PETRI_DIFFERENCE_MINUEND_FLOW=883, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=951, PETRI_PLACES=289, PETRI_TRANSITIONS=307} [2024-10-11 17:03:03,820 INFO L277 CegarLoopForPetriNet]: 303 programPoint places, -14 predicate places. [2024-10-11 17:03:03,820 INFO L471 AbstractCegarLoop]: Abstraction has has 289 places, 307 transitions, 951 flow [2024-10-11 17:03:03,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 423.0) internal successors, (2115), 5 states have internal predecessors, (2115), 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) [2024-10-11 17:03:03,821 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:03:03,821 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:03:03,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 17:03:03,821 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread_usbThread1of1ForFork0Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-10-11 17:03:03,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:03:03,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1718529893, now seen corresponding path program 1 times [2024-10-11 17:03:03,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:03:03,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310352185] [2024-10-11 17:03:03,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:03:03,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:03:03,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:03:03,894 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:03:03,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:03:03,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310352185] [2024-10-11 17:03:03,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310352185] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:03:03,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:03:03,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:03:03,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821286395] [2024-10-11 17:03:03,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:03:03,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:03:03,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:03:03,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:03:03,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:03:03,912 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 470 [2024-10-11 17:03:03,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 307 transitions, 951 flow. Second operand has 3 states, 3 states have (on average 418.3333333333333) internal successors, (1255), 3 states have internal predecessors, (1255), 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) [2024-10-11 17:03:03,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:03:03,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 470 [2024-10-11 17:03:03,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:03:03,987 INFO L124 PetriNetUnfolderBase]: 62/832 cut-off events. [2024-10-11 17:03:03,988 INFO L125 PetriNetUnfolderBase]: For 94/94 co-relation queries the response was YES. [2024-10-11 17:03:03,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1144 conditions, 832 events. 62/832 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2659 event pairs, 0 based on Foata normal form. 21/782 useless extension candidates. Maximal degree in co-relation 1053. Up to 54 conditions per place. [2024-10-11 17:03:03,993 INFO L140 encePairwiseOnDemand]: 465/470 looper letters, 13 selfloop transitions, 2 changer transitions 55/272 dead transitions. [2024-10-11 17:03:03,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 272 transitions, 776 flow [2024-10-11 17:03:03,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:03:03,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:03:03,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1267 transitions. [2024-10-11 17:03:03,995 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.898581560283688 [2024-10-11 17:03:03,996 INFO L175 Difference]: Start difference. First operand has 289 places, 307 transitions, 951 flow. Second operand 3 states and 1267 transitions. [2024-10-11 17:03:03,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 272 transitions, 776 flow [2024-10-11 17:03:03,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 272 transitions, 714 flow, removed 13 selfloop flow, removed 10 redundant places. [2024-10-11 17:03:04,000 INFO L231 Difference]: Finished difference. Result has 275 places, 215 transitions, 543 flow [2024-10-11 17:03:04,000 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=470, PETRI_DIFFERENCE_MINUEND_FLOW=678, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=543, PETRI_PLACES=275, PETRI_TRANSITIONS=215} [2024-10-11 17:03:04,000 INFO L277 CegarLoopForPetriNet]: 303 programPoint places, -28 predicate places. [2024-10-11 17:03:04,001 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 215 transitions, 543 flow [2024-10-11 17:03:04,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 418.3333333333333) internal successors, (1255), 3 states have internal predecessors, (1255), 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) [2024-10-11 17:03:04,001 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:03:04,002 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:03:04,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 17:03:04,002 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread_usbErr6ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-10-11 17:03:04,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:03:04,002 INFO L85 PathProgramCache]: Analyzing trace with hash -2096826464, now seen corresponding path program 1 times [2024-10-11 17:03:04,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:03:04,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479316478] [2024-10-11 17:03:04,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:03:04,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:03:04,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:03:04,055 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 17:03:04,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:03:04,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479316478] [2024-10-11 17:03:04,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479316478] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:03:04,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:03:04,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:03:04,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264939556] [2024-10-11 17:03:04,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:03:04,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:03:04,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:03:04,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:03:04,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:03:04,096 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 470 [2024-10-11 17:03:04,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 215 transitions, 543 flow. Second operand has 3 states, 3 states have (on average 418.3333333333333) internal successors, (1255), 3 states have internal predecessors, (1255), 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) [2024-10-11 17:03:04,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:03:04,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 470 [2024-10-11 17:03:04,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:03:04,180 INFO L124 PetriNetUnfolderBase]: 46/545 cut-off events. [2024-10-11 17:03:04,181 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2024-10-11 17:03:04,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 721 conditions, 545 events. 46/545 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1383 event pairs, 8 based on Foata normal form. 0/498 useless extension candidates. Maximal degree in co-relation 635. Up to 60 conditions per place. [2024-10-11 17:03:04,184 INFO L140 encePairwiseOnDemand]: 467/470 looper letters, 16 selfloop transitions, 2 changer transitions 0/214 dead transitions. [2024-10-11 17:03:04,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 214 transitions, 577 flow [2024-10-11 17:03:04,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:03:04,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:03:04,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1261 transitions. [2024-10-11 17:03:04,186 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8943262411347518 [2024-10-11 17:03:04,186 INFO L175 Difference]: Start difference. First operand has 275 places, 215 transitions, 543 flow. Second operand 3 states and 1261 transitions. [2024-10-11 17:03:04,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 214 transitions, 577 flow [2024-10-11 17:03:04,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 214 transitions, 540 flow, removed 3 selfloop flow, removed 15 redundant places. [2024-10-11 17:03:04,190 INFO L231 Difference]: Finished difference. Result has 218 places, 214 transitions, 508 flow [2024-10-11 17:03:04,190 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=470, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=508, PETRI_PLACES=218, PETRI_TRANSITIONS=214} [2024-10-11 17:03:04,190 INFO L277 CegarLoopForPetriNet]: 303 programPoint places, -85 predicate places. [2024-10-11 17:03:04,190 INFO L471 AbstractCegarLoop]: Abstraction has has 218 places, 214 transitions, 508 flow [2024-10-11 17:03:04,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 418.3333333333333) internal successors, (1255), 3 states have internal predecessors, (1255), 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) [2024-10-11 17:03:04,191 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:03:04,191 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:03:04,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 17:03:04,191 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread_usbErr7ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-10-11 17:03:04,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:03:04,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1992004148, now seen corresponding path program 1 times [2024-10-11 17:03:04,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:03:04,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31086598] [2024-10-11 17:03:04,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:03:04,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:03:04,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:03:04,255 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 17:03:04,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:03:04,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31086598] [2024-10-11 17:03:04,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31086598] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:03:04,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:03:04,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:03:04,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731162544] [2024-10-11 17:03:04,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:03:04,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:03:04,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:03:04,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:03:04,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:03:04,309 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 410 out of 470 [2024-10-11 17:03:04,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 214 transitions, 508 flow. Second operand has 3 states, 3 states have (on average 412.6666666666667) internal successors, (1238), 3 states have internal predecessors, (1238), 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) [2024-10-11 17:03:04,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:03:04,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 410 of 470 [2024-10-11 17:03:04,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:03:04,353 INFO L124 PetriNetUnfolderBase]: 22/376 cut-off events. [2024-10-11 17:03:04,354 INFO L125 PetriNetUnfolderBase]: For 4/8 co-relation queries the response was YES. [2024-10-11 17:03:04,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 465 conditions, 376 events. 22/376 cut-off events. For 4/8 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 453 event pairs, 0 based on Foata normal form. 0/350 useless extension candidates. Maximal degree in co-relation 384. Up to 19 conditions per place. [2024-10-11 17:03:04,356 INFO L140 encePairwiseOnDemand]: 467/470 looper letters, 0 selfloop transitions, 0 changer transitions 213/213 dead transitions. [2024-10-11 17:03:04,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 213 transitions, 536 flow [2024-10-11 17:03:04,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:03:04,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:03:04,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1246 transitions. [2024-10-11 17:03:04,358 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8836879432624114 [2024-10-11 17:03:04,358 INFO L175 Difference]: Start difference. First operand has 218 places, 214 transitions, 508 flow. Second operand 3 states and 1246 transitions. [2024-10-11 17:03:04,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 213 transitions, 536 flow [2024-10-11 17:03:04,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 213 transitions, 532 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:03:04,361 INFO L231 Difference]: Finished difference. Result has 217 places, 0 transitions, 0 flow [2024-10-11 17:03:04,361 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=470, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=217, PETRI_TRANSITIONS=0} [2024-10-11 17:03:04,362 INFO L277 CegarLoopForPetriNet]: 303 programPoint places, -86 predicate places. [2024-10-11 17:03:04,362 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 0 transitions, 0 flow [2024-10-11 17:03:04,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 412.6666666666667) internal successors, (1238), 3 states have internal predecessors, (1238), 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) [2024-10-11 17:03:04,365 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE (38 of 39 remaining) [2024-10-11 17:03:04,365 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE (37 of 39 remaining) [2024-10-11 17:03:04,365 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (36 of 39 remaining) [2024-10-11 17:03:04,365 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (35 of 39 remaining) [2024-10-11 17:03:04,365 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (34 of 39 remaining) [2024-10-11 17:03:04,365 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (33 of 39 remaining) [2024-10-11 17:03:04,366 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (32 of 39 remaining) [2024-10-11 17:03:04,366 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (31 of 39 remaining) [2024-10-11 17:03:04,366 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (30 of 39 remaining) [2024-10-11 17:03:04,366 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (29 of 39 remaining) [2024-10-11 17:03:04,366 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 39 remaining) [2024-10-11 17:03:04,366 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr0ASSERT_VIOLATIONDATA_RACE (27 of 39 remaining) [2024-10-11 17:03:04,366 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr10ASSERT_VIOLATIONDATA_RACE (26 of 39 remaining) [2024-10-11 17:03:04,366 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr1ASSERT_VIOLATIONDATA_RACE (25 of 39 remaining) [2024-10-11 17:03:04,367 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr11ASSERT_VIOLATIONDATA_RACE (24 of 39 remaining) [2024-10-11 17:03:04,367 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr4ASSERT_VIOLATIONDATA_RACE (23 of 39 remaining) [2024-10-11 17:03:04,367 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr9ASSERT_VIOLATIONDATA_RACE (22 of 39 remaining) [2024-10-11 17:03:04,367 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr5ASSERT_VIOLATIONDATA_RACE (21 of 39 remaining) [2024-10-11 17:03:04,367 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr2ASSERT_VIOLATIONDATA_RACE (20 of 39 remaining) [2024-10-11 17:03:04,367 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr6ASSERT_VIOLATIONDATA_RACE (19 of 39 remaining) [2024-10-11 17:03:04,367 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr7ASSERT_VIOLATIONDATA_RACE (18 of 39 remaining) [2024-10-11 17:03:04,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr8ASSERT_VIOLATIONDATA_RACE (17 of 39 remaining) [2024-10-11 17:03:04,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr3ASSERT_VIOLATIONDATA_RACE (16 of 39 remaining) [2024-10-11 17:03:04,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 39 remaining) [2024-10-11 17:03:04,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE (14 of 39 remaining) [2024-10-11 17:03:04,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE (13 of 39 remaining) [2024-10-11 17:03:04,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr0ASSERT_VIOLATIONDATA_RACE (12 of 39 remaining) [2024-10-11 17:03:04,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr10ASSERT_VIOLATIONDATA_RACE (11 of 39 remaining) [2024-10-11 17:03:04,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr1ASSERT_VIOLATIONDATA_RACE (10 of 39 remaining) [2024-10-11 17:03:04,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr11ASSERT_VIOLATIONDATA_RACE (9 of 39 remaining) [2024-10-11 17:03:04,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr4ASSERT_VIOLATIONDATA_RACE (8 of 39 remaining) [2024-10-11 17:03:04,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr9ASSERT_VIOLATIONDATA_RACE (7 of 39 remaining) [2024-10-11 17:03:04,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr5ASSERT_VIOLATIONDATA_RACE (6 of 39 remaining) [2024-10-11 17:03:04,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr2ASSERT_VIOLATIONDATA_RACE (5 of 39 remaining) [2024-10-11 17:03:04,370 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr6ASSERT_VIOLATIONDATA_RACE (4 of 39 remaining) [2024-10-11 17:03:04,370 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr7ASSERT_VIOLATIONDATA_RACE (3 of 39 remaining) [2024-10-11 17:03:04,370 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr8ASSERT_VIOLATIONDATA_RACE (2 of 39 remaining) [2024-10-11 17:03:04,370 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr3ASSERT_VIOLATIONDATA_RACE (1 of 39 remaining) [2024-10-11 17:03:04,370 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbThread1of1ForFork0Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 39 remaining) [2024-10-11 17:03:04,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 17:03:04,370 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:03:04,379 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-11 17:03:04,379 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 17:03:04,382 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 05:03:04 BasicIcfg [2024-10-11 17:03:04,383 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 17:03:04,383 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 17:03:04,383 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 17:03:04,383 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 17:03:04,384 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:02:58" (3/4) ... [2024-10-11 17:03:04,385 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 17:03:04,387 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread_ath9k [2024-10-11 17:03:04,387 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread_usb [2024-10-11 17:03:04,391 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-10-11 17:03:04,391 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-11 17:03:04,391 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 17:03:04,391 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 17:03:04,465 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 17:03:04,466 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 17:03:04,466 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 17:03:04,466 INFO L158 Benchmark]: Toolchain (without parser) took 7100.21ms. Allocated memory was 155.2MB in the beginning and 593.5MB in the end (delta: 438.3MB). Free memory was 80.5MB in the beginning and 426.8MB in the end (delta: -346.3MB). Peak memory consumption was 93.3MB. Max. memory is 16.1GB. [2024-10-11 17:03:04,467 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 155.2MB. Free memory was 106.9MB in the beginning and 106.7MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:03:04,467 INFO L158 Benchmark]: CACSL2BoogieTranslator took 711.15ms. Allocated memory was 155.2MB in the beginning and 207.6MB in the end (delta: 52.4MB). Free memory was 80.2MB in the beginning and 130.6MB in the end (delta: -50.5MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. [2024-10-11 17:03:04,467 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.73ms. Allocated memory is still 207.6MB. Free memory was 130.6MB in the beginning and 126.6MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 17:03:04,468 INFO L158 Benchmark]: Boogie Preprocessor took 34.68ms. Allocated memory is still 207.6MB. Free memory was 126.6MB in the beginning and 123.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 17:03:04,468 INFO L158 Benchmark]: RCFGBuilder took 538.89ms. Allocated memory is still 207.6MB. Free memory was 123.5MB in the beginning and 91.0MB in the end (delta: 32.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-11 17:03:04,468 INFO L158 Benchmark]: TraceAbstraction took 5670.45ms. Allocated memory was 207.6MB in the beginning and 593.5MB in the end (delta: 385.9MB). Free memory was 89.9MB in the beginning and 433.1MB in the end (delta: -343.1MB). Peak memory consumption was 42.7MB. Max. memory is 16.1GB. [2024-10-11 17:03:04,469 INFO L158 Benchmark]: Witness Printer took 82.78ms. Allocated memory is still 593.5MB. Free memory was 433.1MB in the beginning and 426.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 17:03:04,470 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.14ms. Allocated memory is still 155.2MB. Free memory was 106.9MB in the beginning and 106.7MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 711.15ms. Allocated memory was 155.2MB in the beginning and 207.6MB in the end (delta: 52.4MB). Free memory was 80.2MB in the beginning and 130.6MB in the end (delta: -50.5MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.73ms. Allocated memory is still 207.6MB. Free memory was 130.6MB in the beginning and 126.6MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.68ms. Allocated memory is still 207.6MB. Free memory was 126.6MB in the beginning and 123.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 538.89ms. Allocated memory is still 207.6MB. Free memory was 123.5MB in the beginning and 91.0MB in the end (delta: 32.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5670.45ms. Allocated memory was 207.6MB in the beginning and 593.5MB in the end (delta: 385.9MB). Free memory was 89.9MB in the beginning and 433.1MB in the end (delta: -343.1MB). Peak memory consumption was 42.7MB. Max. memory is 16.1GB. * Witness Printer took 82.78ms. Allocated memory is still 593.5MB. Free memory was 433.1MB in the beginning and 426.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1699]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1700]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1777]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1778]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1783]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1780]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1784]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1790]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1792]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1793]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1743]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1771]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1748]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1772]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1756]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1764]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1725]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1718]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1758]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1759]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1760]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1752]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 477 locations, 39 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: 5.5s, OverallIterations: 19, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1199 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 449 mSDsluCounter, 203 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 52 mSDsCounter, 86 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1252 IncrementalHoareTripleChecker+Invalid, 1338 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 86 mSolverCounterUnsat, 151 mSDtfsCounter, 1252 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=951occurred in iteration=16, InterpolantAutomatonStates: 65, 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, 1.0s InterpolantComputationTime, 1535 NumberOfCodeBlocks, 1535 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1516 ConstructedInterpolants, 0 QuantifiedInterpolants, 1632 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 39/39 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 - AllSpecificationsHoldResult: All specifications hold 22 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-11 17:03:04,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 Result: TRUE