./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_2-thread_local_vars.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-4_2-thread_local_vars.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0f799b8cb369af433cd7b4f4a2ae1c7efd2306d185f06da0302d2727c00c6bf0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 09:45:55,116 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 09:45:55,164 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-13 09:45:55,170 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 09:45:55,171 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 09:45:55,195 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 09:45:55,196 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 09:45:55,196 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 09:45:55,196 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 09:45:55,197 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 09:45:55,197 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 09:45:55,210 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 09:45:55,210 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 09:45:55,211 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 09:45:55,211 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 09:45:55,211 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 09:45:55,211 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 09:45:55,212 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 09:45:55,212 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 09:45:55,212 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 09:45:55,212 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 09:45:55,215 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 09:45:55,216 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-13 09:45:55,216 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 09:45:55,216 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 09:45:55,216 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 09:45:55,216 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 09:45:55,217 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 09:45:55,217 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 09:45:55,217 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 09:45:55,217 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 09:45:55,217 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 09:45:55,218 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 09:45:55,218 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 09:45:55,218 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 09:45:55,218 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 09:45:55,218 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 09:45:55,219 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 09:45:55,219 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 09:45:55,219 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 09:45:55,219 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 09:45:55,223 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/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/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0f799b8cb369af433cd7b4f4a2ae1c7efd2306d185f06da0302d2727c00c6bf0 [2024-10-13 09:45:55,478 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 09:45:55,495 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 09:45:55,497 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 09:45:55,498 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 09:45:55,499 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 09:45:55,500 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-4_2-thread_local_vars.i [2024-10-13 09:45:57,062 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 09:45:57,370 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 09:45:57,371 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-4_2-thread_local_vars.i [2024-10-13 09:45:57,403 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b37a20038/adda9020e6a54e248643b8a3195ec482/FLAG34bf39f66 [2024-10-13 09:45:57,418 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b37a20038/adda9020e6a54e248643b8a3195ec482 [2024-10-13 09:45:57,421 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 09:45:57,422 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 09:45:57,424 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 09:45:57,425 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 09:45:57,429 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 09:45:57,430 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:45:57" (1/1) ... [2024-10-13 09:45:57,431 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@740ee4e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:45:57, skipping insertion in model container [2024-10-13 09:45:57,432 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:45:57" (1/1) ... [2024-10-13 09:45:57,490 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 09:45:58,046 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 09:45:58,063 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 09:45:58,116 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 09:45:58,209 INFO L204 MainTranslator]: Completed translation [2024-10-13 09:45:58,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:45:58 WrapperNode [2024-10-13 09:45:58,210 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 09:45:58,211 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 09:45:58,214 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 09:45:58,214 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 09:45:58,220 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:45:58" (1/1) ... [2024-10-13 09:45:58,243 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:45:58" (1/1) ... [2024-10-13 09:45:58,279 INFO L138 Inliner]: procedures = 487, calls = 38, calls flagged for inlining = 17, calls inlined = 23, statements flattened = 296 [2024-10-13 09:45:58,280 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 09:45:58,280 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 09:45:58,280 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 09:45:58,281 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 09:45:58,288 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:45:58" (1/1) ... [2024-10-13 09:45:58,288 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:45:58" (1/1) ... [2024-10-13 09:45:58,293 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:45:58" (1/1) ... [2024-10-13 09:45:58,293 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:45:58" (1/1) ... [2024-10-13 09:45:58,307 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:45:58" (1/1) ... [2024-10-13 09:45:58,314 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:45:58" (1/1) ... [2024-10-13 09:45:58,317 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:45:58" (1/1) ... [2024-10-13 09:45:58,319 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:45:58" (1/1) ... [2024-10-13 09:45:58,323 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 09:45:58,324 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 09:45:58,324 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 09:45:58,324 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 09:45:58,325 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:45:58" (1/1) ... [2024-10-13 09:45:58,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 09:45:58,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 09:45:58,368 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 09:45:58,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 09:45:58,406 INFO L130 BoogieDeclarations]: Found specification of procedure thread_usb [2024-10-13 09:45:58,406 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_usb [2024-10-13 09:45:58,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 09:45:58,406 INFO L130 BoogieDeclarations]: Found specification of procedure thread_ath9k [2024-10-13 09:45:58,406 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_ath9k [2024-10-13 09:45:58,407 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-13 09:45:58,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 09:45:58,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-10-13 09:45:58,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 09:45:58,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 09:45:58,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 09:45:58,407 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-13 09:45:58,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-13 09:45:58,409 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-13 09:45:58,620 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 09:45:58,622 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 09:45:58,930 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 09:45:58,931 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 09:45:58,958 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 09:45:58,958 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-13 09:45:58,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:45:58 BoogieIcfgContainer [2024-10-13 09:45:58,959 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 09:45:58,960 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 09:45:58,961 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 09:45:58,966 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 09:45:58,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:45:57" (1/3) ... [2024-10-13 09:45:58,967 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11a0c7ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:45:58, skipping insertion in model container [2024-10-13 09:45:58,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:45:58" (2/3) ... [2024-10-13 09:45:58,968 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11a0c7ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:45:58, skipping insertion in model container [2024-10-13 09:45:58,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:45:58" (3/3) ... [2024-10-13 09:45:58,969 INFO L112 eAbstractionObserver]: Analyzing ICFG race-4_2-thread_local_vars.i [2024-10-13 09:45:58,983 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 09:45:58,984 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 24 error locations. [2024-10-13 09:45:58,984 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 09:45:59,074 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2024-10-13 09:45:59,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 472 places, 514 transitions, 1055 flow [2024-10-13 09:45:59,261 INFO L124 PetriNetUnfolderBase]: 45/520 cut-off events. [2024-10-13 09:45:59,262 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-13 09:45:59,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 531 conditions, 520 events. 45/520 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1454 event pairs, 0 based on Foata normal form. 0/433 useless extension candidates. Maximal degree in co-relation 367. Up to 11 conditions per place. [2024-10-13 09:45:59,274 INFO L82 GeneralOperation]: Start removeDead. Operand has 472 places, 514 transitions, 1055 flow [2024-10-13 09:45:59,285 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 323 places, 348 transitions, 712 flow [2024-10-13 09:45:59,297 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 09:45:59,305 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;@46a68a7d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 09:45:59,305 INFO L334 AbstractCegarLoop]: Starting to check reachability of 43 error locations. [2024-10-13 09:45:59,310 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 09:45:59,310 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2024-10-13 09:45:59,310 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 09:45:59,311 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:45:59,311 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-13 09:45:59,312 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-10-13 09:45:59,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:45:59,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1019178130, now seen corresponding path program 1 times [2024-10-13 09:45:59,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:45:59,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60072515] [2024-10-13 09:45:59,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:45:59,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:45:59,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:45:59,669 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-13 09:45:59,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:45:59,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60072515] [2024-10-13 09:45:59,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60072515] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:45:59,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:45:59,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:45:59,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967903292] [2024-10-13 09:45:59,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:45:59,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:45:59,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:45:59,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:45:59,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:45:59,806 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 442 out of 514 [2024-10-13 09:45:59,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 348 transitions, 712 flow. Second operand has 3 states, 3 states have (on average 443.3333333333333) internal successors, (1330), 3 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:45:59,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:45:59,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 442 of 514 [2024-10-13 09:45:59,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:46:00,022 INFO L124 PetriNetUnfolderBase]: 122/1234 cut-off events. [2024-10-13 09:46:00,022 INFO L125 PetriNetUnfolderBase]: For 40/47 co-relation queries the response was YES. [2024-10-13 09:46:00,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1444 conditions, 1234 events. 122/1234 cut-off events. For 40/47 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 7314 event pairs, 76 based on Foata normal form. 115/1168 useless extension candidates. Maximal degree in co-relation 1117. Up to 185 conditions per place. [2024-10-13 09:46:00,040 INFO L140 encePairwiseOnDemand]: 493/514 looper letters, 24 selfloop transitions, 2 changer transitions 6/315 dead transitions. [2024-10-13 09:46:00,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 315 transitions, 698 flow [2024-10-13 09:46:00,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:46:00,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:46:00,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1371 transitions. [2024-10-13 09:46:00,063 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8891050583657587 [2024-10-13 09:46:00,066 INFO L175 Difference]: Start difference. First operand has 323 places, 348 transitions, 712 flow. Second operand 3 states and 1371 transitions. [2024-10-13 09:46:00,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 315 transitions, 698 flow [2024-10-13 09:46:00,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 315 transitions, 694 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:46:00,078 INFO L231 Difference]: Finished difference. Result has 308 places, 309 transitions, 634 flow [2024-10-13 09:46:00,082 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=642, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=634, PETRI_PLACES=308, PETRI_TRANSITIONS=309} [2024-10-13 09:46:00,087 INFO L277 CegarLoopForPetriNet]: 323 programPoint places, -15 predicate places. [2024-10-13 09:46:00,089 INFO L471 AbstractCegarLoop]: Abstraction has has 308 places, 309 transitions, 634 flow [2024-10-13 09:46:00,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 443.3333333333333) internal successors, (1330), 3 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:46:00,090 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:46:00,090 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-13 09:46:00,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 09:46:00,091 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-10-13 09:46:00,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:46:00,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1211256555, now seen corresponding path program 1 times [2024-10-13 09:46:00,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:46:00,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297538009] [2024-10-13 09:46:00,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:46:00,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:46:00,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:46:00,204 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-13 09:46:00,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:46:00,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297538009] [2024-10-13 09:46:00,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297538009] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:46:00,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:46:00,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:46:00,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084151481] [2024-10-13 09:46:00,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:46:00,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:46:00,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:46:00,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:46:00,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:46:00,295 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 514 [2024-10-13 09:46:00,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 309 transitions, 634 flow. Second operand has 3 states, 3 states have (on average 429.0) internal successors, (1287), 3 states have internal predecessors, (1287), 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-13 09:46:00,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:46:00,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 514 [2024-10-13 09:46:00,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:46:00,549 INFO L124 PetriNetUnfolderBase]: 161/1710 cut-off events. [2024-10-13 09:46:00,550 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2024-10-13 09:46:00,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1950 conditions, 1710 events. 161/1710 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 11687 event pairs, 29 based on Foata normal form. 0/1468 useless extension candidates. Maximal degree in co-relation 1916. Up to 156 conditions per place. [2024-10-13 09:46:00,562 INFO L140 encePairwiseOnDemand]: 490/514 looper letters, 30 selfloop transitions, 17 changer transitions 0/321 dead transitions. [2024-10-13 09:46:00,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 321 transitions, 753 flow [2024-10-13 09:46:00,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:46:00,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:46:00,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1338 transitions. [2024-10-13 09:46:00,565 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.867704280155642 [2024-10-13 09:46:00,565 INFO L175 Difference]: Start difference. First operand has 308 places, 309 transitions, 634 flow. Second operand 3 states and 1338 transitions. [2024-10-13 09:46:00,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 321 transitions, 753 flow [2024-10-13 09:46:00,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 321 transitions, 749 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:46:00,573 INFO L231 Difference]: Finished difference. Result has 301 places, 318 transitions, 748 flow [2024-10-13 09:46:00,573 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=624, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=748, PETRI_PLACES=301, PETRI_TRANSITIONS=318} [2024-10-13 09:46:00,574 INFO L277 CegarLoopForPetriNet]: 323 programPoint places, -22 predicate places. [2024-10-13 09:46:00,574 INFO L471 AbstractCegarLoop]: Abstraction has has 301 places, 318 transitions, 748 flow [2024-10-13 09:46:00,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 429.0) internal successors, (1287), 3 states have internal predecessors, (1287), 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-13 09:46:00,575 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:46:00,575 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-13 09:46:00,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 09:46:00,576 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-10-13 09:46:00,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:46:00,577 INFO L85 PathProgramCache]: Analyzing trace with hash 357497468, now seen corresponding path program 1 times [2024-10-13 09:46:00,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:46:00,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140679823] [2024-10-13 09:46:00,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:46:00,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:46:00,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:46:00,665 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-13 09:46:00,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:46:00,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140679823] [2024-10-13 09:46:00,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140679823] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:46:00,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:46:00,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:46:00,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976124560] [2024-10-13 09:46:00,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:46:00,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:46:00,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:46:00,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:46:00,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:46:00,751 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 442 out of 514 [2024-10-13 09:46:00,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 318 transitions, 748 flow. Second operand has 3 states, 3 states have (on average 444.0) internal successors, (1332), 3 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:46:00,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:46:00,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 442 of 514 [2024-10-13 09:46:00,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:46:00,989 INFO L124 PetriNetUnfolderBase]: 274/2597 cut-off events. [2024-10-13 09:46:00,989 INFO L125 PetriNetUnfolderBase]: For 480/543 co-relation queries the response was YES. [2024-10-13 09:46:01,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3358 conditions, 2597 events. 274/2597 cut-off events. For 480/543 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 20850 event pairs, 99 based on Foata normal form. 0/2232 useless extension candidates. Maximal degree in co-relation 2866. Up to 333 conditions per place. [2024-10-13 09:46:01,017 INFO L140 encePairwiseOnDemand]: 511/514 looper letters, 32 selfloop transitions, 2 changer transitions 0/317 dead transitions. [2024-10-13 09:46:01,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 317 transitions, 814 flow [2024-10-13 09:46:01,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:46:01,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:46:01,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1353 transitions. [2024-10-13 09:46:01,022 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.877431906614786 [2024-10-13 09:46:01,023 INFO L175 Difference]: Start difference. First operand has 301 places, 318 transitions, 748 flow. Second operand 3 states and 1353 transitions. [2024-10-13 09:46:01,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 317 transitions, 814 flow [2024-10-13 09:46:01,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 317 transitions, 780 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:46:01,034 INFO L231 Difference]: Finished difference. Result has 300 places, 317 transitions, 716 flow [2024-10-13 09:46:01,034 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=712, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=716, PETRI_PLACES=300, PETRI_TRANSITIONS=317} [2024-10-13 09:46:01,036 INFO L277 CegarLoopForPetriNet]: 323 programPoint places, -23 predicate places. [2024-10-13 09:46:01,036 INFO L471 AbstractCegarLoop]: Abstraction has has 300 places, 317 transitions, 716 flow [2024-10-13 09:46:01,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 444.0) internal successors, (1332), 3 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:46:01,038 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:46:01,038 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-13 09:46:01,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 09:46:01,038 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-10-13 09:46:01,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:46:01,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1517070653, now seen corresponding path program 1 times [2024-10-13 09:46:01,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:46:01,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918090035] [2024-10-13 09:46:01,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:46:01,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:46:01,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:46:01,165 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-13 09:46:01,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:46:01,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918090035] [2024-10-13 09:46:01,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918090035] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:46:01,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:46:01,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:46:01,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184993426] [2024-10-13 09:46:01,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:46:01,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:46:01,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:46:01,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:46:01,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:46:01,183 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 460 out of 514 [2024-10-13 09:46:01,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 317 transitions, 716 flow. Second operand has 3 states, 3 states have (on average 461.3333333333333) internal successors, (1384), 3 states have internal predecessors, (1384), 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-13 09:46:01,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:46:01,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 514 [2024-10-13 09:46:01,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:46:01,476 INFO L124 PetriNetUnfolderBase]: 264/2775 cut-off events. [2024-10-13 09:46:01,476 INFO L125 PetriNetUnfolderBase]: For 51/81 co-relation queries the response was YES. [2024-10-13 09:46:01,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3215 conditions, 2775 events. 264/2775 cut-off events. For 51/81 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 22463 event pairs, 60 based on Foata normal form. 1/2348 useless extension candidates. Maximal degree in co-relation 3176. Up to 144 conditions per place. [2024-10-13 09:46:01,491 INFO L140 encePairwiseOnDemand]: 511/514 looper letters, 17 selfloop transitions, 2 changer transitions 0/321 dead transitions. [2024-10-13 09:46:01,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 321 transitions, 771 flow [2024-10-13 09:46:01,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:46:01,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:46:01,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1400 transitions. [2024-10-13 09:46:01,495 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9079118028534371 [2024-10-13 09:46:01,495 INFO L175 Difference]: Start difference. First operand has 300 places, 317 transitions, 716 flow. Second operand 3 states and 1400 transitions. [2024-10-13 09:46:01,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 321 transitions, 771 flow [2024-10-13 09:46:01,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 321 transitions, 767 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:46:01,501 INFO L231 Difference]: Finished difference. Result has 299 places, 316 transitions, 714 flow [2024-10-13 09:46:01,501 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=710, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=714, PETRI_PLACES=299, PETRI_TRANSITIONS=316} [2024-10-13 09:46:01,503 INFO L277 CegarLoopForPetriNet]: 323 programPoint places, -24 predicate places. [2024-10-13 09:46:01,503 INFO L471 AbstractCegarLoop]: Abstraction has has 299 places, 316 transitions, 714 flow [2024-10-13 09:46:01,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 461.3333333333333) internal successors, (1384), 3 states have internal predecessors, (1384), 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-13 09:46:01,504 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:46:01,504 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-13 09:46:01,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 09:46:01,505 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread_usbErr0ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-10-13 09:46:01,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:46:01,506 INFO L85 PathProgramCache]: Analyzing trace with hash -375367980, now seen corresponding path program 1 times [2024-10-13 09:46:01,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:46:01,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233870995] [2024-10-13 09:46:01,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:46:01,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:46:01,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:46:01,571 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-13 09:46:01,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:46:01,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233870995] [2024-10-13 09:46:01,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233870995] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:46:01,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:46:01,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:46:01,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076960506] [2024-10-13 09:46:01,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:46:01,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:46:01,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:46:01,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:46:01,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:46:01,632 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 453 out of 514 [2024-10-13 09:46:01,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 316 transitions, 714 flow. Second operand has 3 states, 3 states have (on average 454.3333333333333) internal successors, (1363), 3 states have internal predecessors, (1363), 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-13 09:46:01,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:46:01,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 453 of 514 [2024-10-13 09:46:01,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:46:01,761 INFO L124 PetriNetUnfolderBase]: 123/1436 cut-off events. [2024-10-13 09:46:01,762 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-10-13 09:46:01,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1683 conditions, 1436 events. 123/1436 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 9200 event pairs, 29 based on Foata normal form. 0/1246 useless extension candidates. Maximal degree in co-relation 1591. Up to 93 conditions per place. [2024-10-13 09:46:01,772 INFO L140 encePairwiseOnDemand]: 511/514 looper letters, 14 selfloop transitions, 2 changer transitions 0/315 dead transitions. [2024-10-13 09:46:01,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 315 transitions, 744 flow [2024-10-13 09:46:01,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:46:01,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:46:01,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1376 transitions. [2024-10-13 09:46:01,775 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8923476005188068 [2024-10-13 09:46:01,775 INFO L175 Difference]: Start difference. First operand has 299 places, 316 transitions, 714 flow. Second operand 3 states and 1376 transitions. [2024-10-13 09:46:01,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 315 transitions, 744 flow [2024-10-13 09:46:01,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 315 transitions, 740 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:46:01,781 INFO L231 Difference]: Finished difference. Result has 298 places, 315 transitions, 712 flow [2024-10-13 09:46:01,782 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=708, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=712, PETRI_PLACES=298, PETRI_TRANSITIONS=315} [2024-10-13 09:46:01,783 INFO L277 CegarLoopForPetriNet]: 323 programPoint places, -25 predicate places. [2024-10-13 09:46:01,783 INFO L471 AbstractCegarLoop]: Abstraction has has 298 places, 315 transitions, 712 flow [2024-10-13 09:46:01,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 454.3333333333333) internal successors, (1363), 3 states have internal predecessors, (1363), 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-13 09:46:01,785 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:46:01,785 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-13 09:46:01,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 09:46:01,785 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-10-13 09:46:01,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:46:01,786 INFO L85 PathProgramCache]: Analyzing trace with hash 929673292, now seen corresponding path program 1 times [2024-10-13 09:46:01,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:46:01,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943753023] [2024-10-13 09:46:01,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:46:01,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:46:01,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:46:01,888 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-13 09:46:01,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:46:01,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943753023] [2024-10-13 09:46:01,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943753023] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:46:01,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:46:01,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:46:01,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402285503] [2024-10-13 09:46:01,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:46:01,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:46:01,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:46:01,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:46:01,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:46:01,901 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 464 out of 514 [2024-10-13 09:46:01,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 315 transitions, 712 flow. Second operand has 3 states, 3 states have (on average 465.3333333333333) internal successors, (1396), 3 states have internal predecessors, (1396), 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-13 09:46:01,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:46:01,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 464 of 514 [2024-10-13 09:46:01,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:46:02,073 INFO L124 PetriNetUnfolderBase]: 153/1505 cut-off events. [2024-10-13 09:46:02,074 INFO L125 PetriNetUnfolderBase]: For 33/56 co-relation queries the response was YES. [2024-10-13 09:46:02,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1793 conditions, 1505 events. 153/1505 cut-off events. For 33/56 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 10453 event pairs, 13 based on Foata normal form. 4/1304 useless extension candidates. Maximal degree in co-relation 1695. Up to 97 conditions per place. [2024-10-13 09:46:02,085 INFO L140 encePairwiseOnDemand]: 512/514 looper letters, 14 selfloop transitions, 1 changer transitions 19/319 dead transitions. [2024-10-13 09:46:02,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 319 transitions, 759 flow [2024-10-13 09:46:02,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:46:02,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:46:02,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1408 transitions. [2024-10-13 09:46:02,088 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9130998702983139 [2024-10-13 09:46:02,089 INFO L175 Difference]: Start difference. First operand has 298 places, 315 transitions, 712 flow. Second operand 3 states and 1408 transitions. [2024-10-13 09:46:02,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 319 transitions, 759 flow [2024-10-13 09:46:02,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 319 transitions, 755 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:46:02,094 INFO L231 Difference]: Finished difference. Result has 297 places, 295 transitions, 666 flow [2024-10-13 09:46:02,095 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=706, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=666, PETRI_PLACES=297, PETRI_TRANSITIONS=295} [2024-10-13 09:46:02,096 INFO L277 CegarLoopForPetriNet]: 323 programPoint places, -26 predicate places. [2024-10-13 09:46:02,097 INFO L471 AbstractCegarLoop]: Abstraction has has 297 places, 295 transitions, 666 flow [2024-10-13 09:46:02,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 465.3333333333333) internal successors, (1396), 3 states have internal predecessors, (1396), 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-13 09:46:02,098 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:46:02,098 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-13 09:46:02,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 09:46:02,098 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread_usbErr1ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-10-13 09:46:02,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:46:02,099 INFO L85 PathProgramCache]: Analyzing trace with hash 567808721, now seen corresponding path program 1 times [2024-10-13 09:46:02,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:46:02,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759081988] [2024-10-13 09:46:02,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:46:02,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:46:02,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:46:02,173 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-13 09:46:02,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:46:02,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759081988] [2024-10-13 09:46:02,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759081988] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:46:02,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:46:02,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:46:02,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697076692] [2024-10-13 09:46:02,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:46:02,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:46:02,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:46:02,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:46:02,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:46:02,214 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 445 out of 514 [2024-10-13 09:46:02,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 295 transitions, 666 flow. Second operand has 3 states, 3 states have (on average 446.3333333333333) internal successors, (1339), 3 states have internal predecessors, (1339), 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-13 09:46:02,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:46:02,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 445 of 514 [2024-10-13 09:46:02,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:46:02,375 INFO L124 PetriNetUnfolderBase]: 147/1605 cut-off events. [2024-10-13 09:46:02,376 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-10-13 09:46:02,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1896 conditions, 1605 events. 147/1605 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 10895 event pairs, 33 based on Foata normal form. 0/1406 useless extension candidates. Maximal degree in co-relation 1823. Up to 107 conditions per place. [2024-10-13 09:46:02,384 INFO L140 encePairwiseOnDemand]: 506/514 looper letters, 16 selfloop transitions, 5 changer transitions 0/297 dead transitions. [2024-10-13 09:46:02,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 297 transitions, 712 flow [2024-10-13 09:46:02,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:46:02,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:46:02,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1359 transitions. [2024-10-13 09:46:02,387 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8813229571984436 [2024-10-13 09:46:02,387 INFO L175 Difference]: Start difference. First operand has 297 places, 295 transitions, 666 flow. Second operand 3 states and 1359 transitions. [2024-10-13 09:46:02,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 297 transitions, 712 flow [2024-10-13 09:46:02,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 297 transitions, 711 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 09:46:02,392 INFO L231 Difference]: Finished difference. Result has 278 places, 295 transitions, 686 flow [2024-10-13 09:46:02,392 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=659, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=686, PETRI_PLACES=278, PETRI_TRANSITIONS=295} [2024-10-13 09:46:02,393 INFO L277 CegarLoopForPetriNet]: 323 programPoint places, -45 predicate places. [2024-10-13 09:46:02,393 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 295 transitions, 686 flow [2024-10-13 09:46:02,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 446.3333333333333) internal successors, (1339), 3 states have internal predecessors, (1339), 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-13 09:46:02,394 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:46:02,394 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-13 09:46:02,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 09:46:02,394 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread_usbErr7ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-10-13 09:46:02,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:46:02,395 INFO L85 PathProgramCache]: Analyzing trace with hash 336089783, now seen corresponding path program 1 times [2024-10-13 09:46:02,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:46:02,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428720703] [2024-10-13 09:46:02,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:46:02,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:46:02,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:46:02,487 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-13 09:46:02,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:46:02,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428720703] [2024-10-13 09:46:02,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428720703] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:46:02,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:46:02,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 09:46:02,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661721568] [2024-10-13 09:46:02,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:46:02,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:46:02,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:46:02,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:46:02,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:46:02,511 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 452 out of 514 [2024-10-13 09:46:02,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 295 transitions, 686 flow. Second operand has 3 states, 3 states have (on average 453.3333333333333) internal successors, (1360), 3 states have internal predecessors, (1360), 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-13 09:46:02,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:46:02,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 452 of 514 [2024-10-13 09:46:02,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:46:02,678 INFO L124 PetriNetUnfolderBase]: 157/1614 cut-off events. [2024-10-13 09:46:02,678 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2024-10-13 09:46:02,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1954 conditions, 1614 events. 157/1614 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 10872 event pairs, 20 based on Foata normal form. 1/1411 useless extension candidates. Maximal degree in co-relation 1880. Up to 91 conditions per place. [2024-10-13 09:46:02,693 INFO L140 encePairwiseOnDemand]: 506/514 looper letters, 15 selfloop transitions, 5 changer transitions 0/299 dead transitions. [2024-10-13 09:46:02,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 299 transitions, 734 flow [2024-10-13 09:46:02,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:46:02,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:46:02,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1379 transitions. [2024-10-13 09:46:02,696 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8942931258106356 [2024-10-13 09:46:02,697 INFO L175 Difference]: Start difference. First operand has 278 places, 295 transitions, 686 flow. Second operand 3 states and 1379 transitions. [2024-10-13 09:46:02,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 299 transitions, 734 flow [2024-10-13 09:46:02,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 299 transitions, 729 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 09:46:02,701 INFO L231 Difference]: Finished difference. Result has 281 places, 297 transitions, 715 flow [2024-10-13 09:46:02,702 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=681, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=715, PETRI_PLACES=281, PETRI_TRANSITIONS=297} [2024-10-13 09:46:02,703 INFO L277 CegarLoopForPetriNet]: 323 programPoint places, -42 predicate places. [2024-10-13 09:46:02,704 INFO L471 AbstractCegarLoop]: Abstraction has has 281 places, 297 transitions, 715 flow [2024-10-13 09:46:02,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 453.3333333333333) internal successors, (1360), 3 states have internal predecessors, (1360), 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-13 09:46:02,705 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:46:02,705 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-13 09:46:02,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 09:46:02,708 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread_usbErr12ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-10-13 09:46:02,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:46:02,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1864743785, now seen corresponding path program 1 times [2024-10-13 09:46:02,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:46:02,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857736653] [2024-10-13 09:46:02,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:46:02,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:46:02,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:46:02,792 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-13 09:46:02,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:46:02,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857736653] [2024-10-13 09:46:02,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857736653] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:46:02,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:46:02,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:46:02,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369933699] [2024-10-13 09:46:02,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:46:02,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:46:02,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:46:02,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:46:02,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:46:02,874 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 445 out of 514 [2024-10-13 09:46:02,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 297 transitions, 715 flow. Second operand has 3 states, 3 states have (on average 447.0) internal successors, (1341), 3 states have internal predecessors, (1341), 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-13 09:46:02,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:46:02,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 445 of 514 [2024-10-13 09:46:02,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:46:03,034 INFO L124 PetriNetUnfolderBase]: 194/1751 cut-off events. [2024-10-13 09:46:03,035 INFO L125 PetriNetUnfolderBase]: For 138/164 co-relation queries the response was YES. [2024-10-13 09:46:03,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2269 conditions, 1751 events. 194/1751 cut-off events. For 138/164 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 12007 event pairs, 36 based on Foata normal form. 2/1543 useless extension candidates. Maximal degree in co-relation 2190. Up to 190 conditions per place. [2024-10-13 09:46:03,046 INFO L140 encePairwiseOnDemand]: 508/514 looper letters, 30 selfloop transitions, 8 changer transitions 0/305 dead transitions. [2024-10-13 09:46:03,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 305 transitions, 817 flow [2024-10-13 09:46:03,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:46:03,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:46:03,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1364 transitions. [2024-10-13 09:46:03,048 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8845654993514915 [2024-10-13 09:46:03,049 INFO L175 Difference]: Start difference. First operand has 281 places, 297 transitions, 715 flow. Second operand 3 states and 1364 transitions. [2024-10-13 09:46:03,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 305 transitions, 817 flow [2024-10-13 09:46:03,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 305 transitions, 807 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:46:03,053 INFO L231 Difference]: Finished difference. Result has 283 places, 303 transitions, 773 flow [2024-10-13 09:46:03,054 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=705, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=773, PETRI_PLACES=283, PETRI_TRANSITIONS=303} [2024-10-13 09:46:03,056 INFO L277 CegarLoopForPetriNet]: 323 programPoint places, -40 predicate places. [2024-10-13 09:46:03,056 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 303 transitions, 773 flow [2024-10-13 09:46:03,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 447.0) internal successors, (1341), 3 states have internal predecessors, (1341), 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-13 09:46:03,057 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:46:03,057 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-13 09:46:03,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 09:46:03,057 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread_usbErr2ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-10-13 09:46:03,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:46:03,058 INFO L85 PathProgramCache]: Analyzing trace with hash 241274166, now seen corresponding path program 1 times [2024-10-13 09:46:03,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:46:03,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722287772] [2024-10-13 09:46:03,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:46:03,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:46:03,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:46:03,135 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-13 09:46:03,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:46:03,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722287772] [2024-10-13 09:46:03,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722287772] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:46:03,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:46:03,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:46:03,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911665262] [2024-10-13 09:46:03,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:46:03,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:46:03,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:46:03,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:46:03,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:46:03,156 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 458 out of 514 [2024-10-13 09:46:03,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 303 transitions, 773 flow. Second operand has 3 states, 3 states have (on average 459.6666666666667) internal successors, (1379), 3 states have internal predecessors, (1379), 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-13 09:46:03,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:46:03,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 458 of 514 [2024-10-13 09:46:03,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:46:03,318 INFO L124 PetriNetUnfolderBase]: 175/1811 cut-off events. [2024-10-13 09:46:03,318 INFO L125 PetriNetUnfolderBase]: For 102/113 co-relation queries the response was YES. [2024-10-13 09:46:03,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2309 conditions, 1811 events. 175/1811 cut-off events. For 102/113 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 12591 event pairs, 18 based on Foata normal form. 0/1598 useless extension candidates. Maximal degree in co-relation 2232. Up to 103 conditions per place. [2024-10-13 09:46:03,326 INFO L140 encePairwiseOnDemand]: 511/514 looper letters, 14 selfloop transitions, 2 changer transitions 0/304 dead transitions. [2024-10-13 09:46:03,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 304 transitions, 807 flow [2024-10-13 09:46:03,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:46:03,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:46:03,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1391 transitions. [2024-10-13 09:46:03,330 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9020752269779507 [2024-10-13 09:46:03,330 INFO L175 Difference]: Start difference. First operand has 283 places, 303 transitions, 773 flow. Second operand 3 states and 1391 transitions. [2024-10-13 09:46:03,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 304 transitions, 807 flow [2024-10-13 09:46:03,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 304 transitions, 791 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:46:03,335 INFO L231 Difference]: Finished difference. Result has 282 places, 302 transitions, 759 flow [2024-10-13 09:46:03,337 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=755, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=759, PETRI_PLACES=282, PETRI_TRANSITIONS=302} [2024-10-13 09:46:03,338 INFO L277 CegarLoopForPetriNet]: 323 programPoint places, -41 predicate places. [2024-10-13 09:46:03,338 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 302 transitions, 759 flow [2024-10-13 09:46:03,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 459.6666666666667) internal successors, (1379), 3 states have internal predecessors, (1379), 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-13 09:46:03,339 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:46:03,339 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-13 09:46:03,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 09:46:03,341 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread_usbErr3ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-10-13 09:46:03,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:46:03,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1974694377, now seen corresponding path program 1 times [2024-10-13 09:46:03,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:46:03,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202907000] [2024-10-13 09:46:03,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:46:03,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:46:03,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:46:03,400 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-13 09:46:03,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:46:03,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202907000] [2024-10-13 09:46:03,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202907000] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:46:03,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:46:03,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:46:03,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217527479] [2024-10-13 09:46:03,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:46:03,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:46:03,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:46:03,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:46:03,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:46:03,444 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 453 out of 514 [2024-10-13 09:46:03,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 302 transitions, 759 flow. Second operand has 3 states, 3 states have (on average 455.0) internal successors, (1365), 3 states have internal predecessors, (1365), 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-13 09:46:03,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:46:03,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 453 of 514 [2024-10-13 09:46:03,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:46:03,589 INFO L124 PetriNetUnfolderBase]: 193/1832 cut-off events. [2024-10-13 09:46:03,590 INFO L125 PetriNetUnfolderBase]: For 129/142 co-relation queries the response was YES. [2024-10-13 09:46:03,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2362 conditions, 1832 events. 193/1832 cut-off events. For 129/142 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 12981 event pairs, 27 based on Foata normal form. 0/1617 useless extension candidates. Maximal degree in co-relation 2285. Up to 127 conditions per place. [2024-10-13 09:46:03,601 INFO L140 encePairwiseOnDemand]: 511/514 looper letters, 19 selfloop transitions, 2 changer transitions 0/303 dead transitions. [2024-10-13 09:46:03,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 303 transitions, 803 flow [2024-10-13 09:46:03,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:46:03,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:46:03,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1378 transitions. [2024-10-13 09:46:03,604 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.893644617380026 [2024-10-13 09:46:03,604 INFO L175 Difference]: Start difference. First operand has 282 places, 302 transitions, 759 flow. Second operand 3 states and 1378 transitions. [2024-10-13 09:46:03,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 303 transitions, 803 flow [2024-10-13 09:46:03,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 303 transitions, 799 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:46:03,609 INFO L231 Difference]: Finished difference. Result has 281 places, 301 transitions, 757 flow [2024-10-13 09:46:03,609 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=753, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=757, PETRI_PLACES=281, PETRI_TRANSITIONS=301} [2024-10-13 09:46:03,610 INFO L277 CegarLoopForPetriNet]: 323 programPoint places, -42 predicate places. [2024-10-13 09:46:03,610 INFO L471 AbstractCegarLoop]: Abstraction has has 281 places, 301 transitions, 757 flow [2024-10-13 09:46:03,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 455.0) internal successors, (1365), 3 states have internal predecessors, (1365), 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-13 09:46:03,611 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:46:03,611 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-13 09:46:03,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 09:46:03,611 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-10-13 09:46:03,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:46:03,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1916310265, now seen corresponding path program 1 times [2024-10-13 09:46:03,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:46:03,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925329251] [2024-10-13 09:46:03,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:46:03,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:46:03,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:46:03,654 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-13 09:46:03,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:46:03,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925329251] [2024-10-13 09:46:03,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925329251] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:46:03,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:46:03,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:46:03,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657920367] [2024-10-13 09:46:03,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:46:03,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:46:03,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:46:03,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:46:03,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:46:03,753 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 442 out of 514 [2024-10-13 09:46:03,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 301 transitions, 757 flow. Second operand has 3 states, 3 states have (on average 445.0) internal successors, (1335), 3 states have internal predecessors, (1335), 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-13 09:46:03,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:46:03,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 442 of 514 [2024-10-13 09:46:03,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:46:04,041 INFO L124 PetriNetUnfolderBase]: 299/2254 cut-off events. [2024-10-13 09:46:04,042 INFO L125 PetriNetUnfolderBase]: For 357/476 co-relation queries the response was YES. [2024-10-13 09:46:04,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3180 conditions, 2254 events. 299/2254 cut-off events. For 357/476 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 17469 event pairs, 53 based on Foata normal form. 9/1995 useless extension candidates. Maximal degree in co-relation 3101. Up to 335 conditions per place. [2024-10-13 09:46:04,058 INFO L140 encePairwiseOnDemand]: 504/514 looper letters, 35 selfloop transitions, 16 changer transitions 0/314 dead transitions. [2024-10-13 09:46:04,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 314 transitions, 914 flow [2024-10-13 09:46:04,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:46:04,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:46:04,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1361 transitions. [2024-10-13 09:46:04,064 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8826199740596627 [2024-10-13 09:46:04,065 INFO L175 Difference]: Start difference. First operand has 281 places, 301 transitions, 757 flow. Second operand 3 states and 1361 transitions. [2024-10-13 09:46:04,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 314 transitions, 914 flow [2024-10-13 09:46:04,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 314 transitions, 910 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:46:04,069 INFO L231 Difference]: Finished difference. Result has 283 places, 313 transitions, 895 flow [2024-10-13 09:46:04,070 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=753, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=895, PETRI_PLACES=283, PETRI_TRANSITIONS=313} [2024-10-13 09:46:04,071 INFO L277 CegarLoopForPetriNet]: 323 programPoint places, -40 predicate places. [2024-10-13 09:46:04,071 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 313 transitions, 895 flow [2024-10-13 09:46:04,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 445.0) internal successors, (1335), 3 states have internal predecessors, (1335), 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-13 09:46:04,072 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:46:04,072 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] [2024-10-13 09:46:04,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 09:46:04,072 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread_usbErr4ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-10-13 09:46:04,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:46:04,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1082734402, now seen corresponding path program 1 times [2024-10-13 09:46:04,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:46:04,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338066196] [2024-10-13 09:46:04,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:46:04,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:46:04,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:46:04,121 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-13 09:46:04,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:46:04,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338066196] [2024-10-13 09:46:04,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338066196] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:46:04,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:46:04,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:46:04,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463746370] [2024-10-13 09:46:04,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:46:04,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:46:04,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:46:04,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:46:04,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:46:04,196 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 444 out of 514 [2024-10-13 09:46:04,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 313 transitions, 895 flow. Second operand has 3 states, 3 states have (on average 446.0) internal successors, (1338), 3 states have internal predecessors, (1338), 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-13 09:46:04,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:46:04,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 444 of 514 [2024-10-13 09:46:04,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:46:04,429 INFO L124 PetriNetUnfolderBase]: 310/2459 cut-off events. [2024-10-13 09:46:04,429 INFO L125 PetriNetUnfolderBase]: For 900/993 co-relation queries the response was YES. [2024-10-13 09:46:04,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3604 conditions, 2459 events. 310/2459 cut-off events. For 900/993 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 19434 event pairs, 39 based on Foata normal form. 7/2187 useless extension candidates. Maximal degree in co-relation 3524. Up to 289 conditions per place. [2024-10-13 09:46:04,443 INFO L140 encePairwiseOnDemand]: 508/514 looper letters, 44 selfloop transitions, 9 changer transitions 0/320 dead transitions. [2024-10-13 09:46:04,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 320 transitions, 1035 flow [2024-10-13 09:46:04,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:46:04,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:46:04,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1362 transitions. [2024-10-13 09:46:04,446 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8832684824902723 [2024-10-13 09:46:04,446 INFO L175 Difference]: Start difference. First operand has 283 places, 313 transitions, 895 flow. Second operand 3 states and 1362 transitions. [2024-10-13 09:46:04,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 320 transitions, 1035 flow [2024-10-13 09:46:04,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 320 transitions, 999 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:46:04,452 INFO L231 Difference]: Finished difference. Result has 285 places, 318 transitions, 937 flow [2024-10-13 09:46:04,453 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=863, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=937, PETRI_PLACES=285, PETRI_TRANSITIONS=318} [2024-10-13 09:46:04,454 INFO L277 CegarLoopForPetriNet]: 323 programPoint places, -38 predicate places. [2024-10-13 09:46:04,454 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 318 transitions, 937 flow [2024-10-13 09:46:04,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 446.0) internal successors, (1338), 3 states have internal predecessors, (1338), 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-13 09:46:04,455 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:46:04,455 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-13 09:46:04,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 09:46:04,455 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-10-13 09:46:04,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:46:04,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1602259071, now seen corresponding path program 1 times [2024-10-13 09:46:04,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:46:04,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456832679] [2024-10-13 09:46:04,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:46:04,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:46:04,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:46:04,510 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-13 09:46:04,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:46:04,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456832679] [2024-10-13 09:46:04,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456832679] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:46:04,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:46:04,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:46:04,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014686236] [2024-10-13 09:46:04,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:46:04,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:46:04,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:46:04,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:46:04,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:46:04,600 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 442 out of 514 [2024-10-13 09:46:04,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 318 transitions, 937 flow. Second operand has 3 states, 3 states have (on average 445.3333333333333) internal successors, (1336), 3 states have internal predecessors, (1336), 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-13 09:46:04,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:46:04,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 442 of 514 [2024-10-13 09:46:04,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:46:04,972 INFO L124 PetriNetUnfolderBase]: 566/3731 cut-off events. [2024-10-13 09:46:04,972 INFO L125 PetriNetUnfolderBase]: For 2189/2477 co-relation queries the response was YES. [2024-10-13 09:46:04,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5915 conditions, 3731 events. 566/3731 cut-off events. For 2189/2477 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 33750 event pairs, 142 based on Foata normal form. 10/3316 useless extension candidates. Maximal degree in co-relation 5448. Up to 601 conditions per place. [2024-10-13 09:46:04,988 INFO L140 encePairwiseOnDemand]: 508/514 looper letters, 49 selfloop transitions, 9 changer transitions 1/325 dead transitions. [2024-10-13 09:46:04,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 325 transitions, 1089 flow [2024-10-13 09:46:04,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:46:04,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:46:04,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1358 transitions. [2024-10-13 09:46:04,994 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.880674448767834 [2024-10-13 09:46:04,995 INFO L175 Difference]: Start difference. First operand has 285 places, 318 transitions, 937 flow. Second operand 3 states and 1358 transitions. [2024-10-13 09:46:04,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 325 transitions, 1089 flow [2024-10-13 09:46:05,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 325 transitions, 1065 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-10-13 09:46:05,003 INFO L231 Difference]: Finished difference. Result has 287 places, 322 transitions, 989 flow [2024-10-13 09:46:05,003 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=913, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=989, PETRI_PLACES=287, PETRI_TRANSITIONS=322} [2024-10-13 09:46:05,004 INFO L277 CegarLoopForPetriNet]: 323 programPoint places, -36 predicate places. [2024-10-13 09:46:05,004 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 322 transitions, 989 flow [2024-10-13 09:46:05,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 445.3333333333333) internal successors, (1336), 3 states have internal predecessors, (1336), 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-13 09:46:05,005 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:46:05,005 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-13 09:46:05,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 09:46:05,006 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread_usbErr12ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-10-13 09:46:05,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:46:05,006 INFO L85 PathProgramCache]: Analyzing trace with hash 135680379, now seen corresponding path program 1 times [2024-10-13 09:46:05,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:46:05,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774306659] [2024-10-13 09:46:05,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:46:05,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:46:05,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:46:05,116 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-13 09:46:05,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:46:05,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774306659] [2024-10-13 09:46:05,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774306659] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:46:05,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:46:05,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 09:46:05,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697216198] [2024-10-13 09:46:05,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:46:05,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 09:46:05,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:46:05,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 09:46:05,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 09:46:05,133 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 457 out of 514 [2024-10-13 09:46:05,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 322 transitions, 989 flow. Second operand has 5 states, 5 states have (on average 459.4) internal successors, (2297), 5 states have internal predecessors, (2297), 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-13 09:46:05,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:46:05,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 457 of 514 [2024-10-13 09:46:05,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:46:05,629 INFO L124 PetriNetUnfolderBase]: 557/4613 cut-off events. [2024-10-13 09:46:05,629 INFO L125 PetriNetUnfolderBase]: For 1450/1560 co-relation queries the response was YES. [2024-10-13 09:46:05,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6727 conditions, 4613 events. 557/4613 cut-off events. For 1450/1560 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 38993 event pairs, 50 based on Foata normal form. 8/4117 useless extension candidates. Maximal degree in co-relation 6647. Up to 285 conditions per place. [2024-10-13 09:46:05,654 INFO L140 encePairwiseOnDemand]: 506/514 looper letters, 32 selfloop transitions, 8 changer transitions 0/344 dead transitions. [2024-10-13 09:46:05,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 344 transitions, 1120 flow [2024-10-13 09:46:05,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 09:46:05,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-13 09:46:05,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 3240 transitions. [2024-10-13 09:46:05,660 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9005002779321846 [2024-10-13 09:46:05,660 INFO L175 Difference]: Start difference. First operand has 287 places, 322 transitions, 989 flow. Second operand 7 states and 3240 transitions. [2024-10-13 09:46:05,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 344 transitions, 1120 flow [2024-10-13 09:46:05,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 344 transitions, 1090 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-10-13 09:46:05,667 INFO L231 Difference]: Finished difference. Result has 296 places, 329 transitions, 1017 flow [2024-10-13 09:46:05,668 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=959, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1017, PETRI_PLACES=296, PETRI_TRANSITIONS=329} [2024-10-13 09:46:05,668 INFO L277 CegarLoopForPetriNet]: 323 programPoint places, -27 predicate places. [2024-10-13 09:46:05,668 INFO L471 AbstractCegarLoop]: Abstraction has has 296 places, 329 transitions, 1017 flow [2024-10-13 09:46:05,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 459.4) internal successors, (2297), 5 states have internal predecessors, (2297), 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-13 09:46:05,670 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:46:05,670 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-13 09:46:05,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 09:46:05,670 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread_usbErr12ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-10-13 09:46:05,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:46:05,670 INFO L85 PathProgramCache]: Analyzing trace with hash 254624561, now seen corresponding path program 1 times [2024-10-13 09:46:05,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:46:05,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864940765] [2024-10-13 09:46:05,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:46:05,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:46:05,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:46:05,746 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-13 09:46:05,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:46:05,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864940765] [2024-10-13 09:46:05,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864940765] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:46:05,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:46:05,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 09:46:05,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085214934] [2024-10-13 09:46:05,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:46:05,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 09:46:05,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:46:05,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 09:46:05,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 09:46:05,766 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 459 out of 514 [2024-10-13 09:46:05,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 329 transitions, 1017 flow. Second operand has 5 states, 5 states have (on average 461.0) internal successors, (2305), 5 states have internal predecessors, (2305), 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-13 09:46:05,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:46:05,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 459 of 514 [2024-10-13 09:46:05,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:46:07,142 INFO L124 PetriNetUnfolderBase]: 887/7750 cut-off events. [2024-10-13 09:46:07,142 INFO L125 PetriNetUnfolderBase]: For 2419/2620 co-relation queries the response was YES. [2024-10-13 09:46:07,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11498 conditions, 7750 events. 887/7750 cut-off events. For 2419/2620 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 74048 event pairs, 88 based on Foata normal form. 16/6951 useless extension candidates. Maximal degree in co-relation 11414. Up to 550 conditions per place. [2024-10-13 09:46:07,219 INFO L140 encePairwiseOnDemand]: 507/514 looper letters, 34 selfloop transitions, 9 changer transitions 0/356 dead transitions. [2024-10-13 09:46:07,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 356 transitions, 1168 flow [2024-10-13 09:46:07,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 09:46:07,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-13 09:46:07,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 3257 transitions. [2024-10-13 09:46:07,231 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.905225125069483 [2024-10-13 09:46:07,232 INFO L175 Difference]: Start difference. First operand has 296 places, 329 transitions, 1017 flow. Second operand 7 states and 3257 transitions. [2024-10-13 09:46:07,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 356 transitions, 1168 flow [2024-10-13 09:46:07,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 356 transitions, 1168 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 09:46:07,243 INFO L231 Difference]: Finished difference. Result has 308 places, 337 transitions, 1085 flow [2024-10-13 09:46:07,246 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=1017, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=329, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1085, PETRI_PLACES=308, PETRI_TRANSITIONS=337} [2024-10-13 09:46:07,247 INFO L277 CegarLoopForPetriNet]: 323 programPoint places, -15 predicate places. [2024-10-13 09:46:07,247 INFO L471 AbstractCegarLoop]: Abstraction has has 308 places, 337 transitions, 1085 flow [2024-10-13 09:46:07,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 461.0) internal successors, (2305), 5 states have internal predecessors, (2305), 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-13 09:46:07,252 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:46:07,252 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, 1, 1, 1, 1, 1] [2024-10-13 09:46:07,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 09:46:07,252 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-10-13 09:46:07,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:46:07,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1803342996, now seen corresponding path program 1 times [2024-10-13 09:46:07,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:46:07,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857888748] [2024-10-13 09:46:07,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:46:07,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:46:07,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 09:46:07,286 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 09:46:07,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 09:46:07,364 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 09:46:07,365 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 09:46:07,366 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE (42 of 43 remaining) [2024-10-13 09:46:07,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE (41 of 43 remaining) [2024-10-13 09:46:07,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE (40 of 43 remaining) [2024-10-13 09:46:07,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (39 of 43 remaining) [2024-10-13 09:46:07,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (38 of 43 remaining) [2024-10-13 09:46:07,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (37 of 43 remaining) [2024-10-13 09:46:07,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (36 of 43 remaining) [2024-10-13 09:46:07,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (35 of 43 remaining) [2024-10-13 09:46:07,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (34 of 43 remaining) [2024-10-13 09:46:07,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (33 of 43 remaining) [2024-10-13 09:46:07,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (32 of 43 remaining) [2024-10-13 09:46:07,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 43 remaining) [2024-10-13 09:46:07,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr0ASSERT_VIOLATIONDATA_RACE (30 of 43 remaining) [2024-10-13 09:46:07,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr12ASSERT_VIOLATIONDATA_RACE (29 of 43 remaining) [2024-10-13 09:46:07,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr1ASSERT_VIOLATIONDATA_RACE (28 of 43 remaining) [2024-10-13 09:46:07,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr13ASSERT_VIOLATIONDATA_RACE (27 of 43 remaining) [2024-10-13 09:46:07,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr6ASSERT_VIOLATIONDATA_RACE (26 of 43 remaining) [2024-10-13 09:46:07,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr11ASSERT_VIOLATIONDATA_RACE (25 of 43 remaining) [2024-10-13 09:46:07,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr7ASSERT_VIOLATIONDATA_RACE (24 of 43 remaining) [2024-10-13 09:46:07,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr2ASSERT_VIOLATIONDATA_RACE (23 of 43 remaining) [2024-10-13 09:46:07,376 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr8ASSERT_VIOLATIONDATA_RACE (22 of 43 remaining) [2024-10-13 09:46:07,376 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr9ASSERT_VIOLATIONDATA_RACE (21 of 43 remaining) [2024-10-13 09:46:07,376 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr10ASSERT_VIOLATIONDATA_RACE (20 of 43 remaining) [2024-10-13 09:46:07,376 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr3ASSERT_VIOLATIONDATA_RACE (19 of 43 remaining) [2024-10-13 09:46:07,376 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr4ASSERT_VIOLATIONDATA_RACE (18 of 43 remaining) [2024-10-13 09:46:07,376 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr5ASSERT_VIOLATIONDATA_RACE (17 of 43 remaining) [2024-10-13 09:46:07,376 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 43 remaining) [2024-10-13 09:46:07,376 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE (15 of 43 remaining) [2024-10-13 09:46:07,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr0ASSERT_VIOLATIONDATA_RACE (14 of 43 remaining) [2024-10-13 09:46:07,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr12ASSERT_VIOLATIONDATA_RACE (13 of 43 remaining) [2024-10-13 09:46:07,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr1ASSERT_VIOLATIONDATA_RACE (12 of 43 remaining) [2024-10-13 09:46:07,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr13ASSERT_VIOLATIONDATA_RACE (11 of 43 remaining) [2024-10-13 09:46:07,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr6ASSERT_VIOLATIONDATA_RACE (10 of 43 remaining) [2024-10-13 09:46:07,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr11ASSERT_VIOLATIONDATA_RACE (9 of 43 remaining) [2024-10-13 09:46:07,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr7ASSERT_VIOLATIONDATA_RACE (8 of 43 remaining) [2024-10-13 09:46:07,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr2ASSERT_VIOLATIONDATA_RACE (7 of 43 remaining) [2024-10-13 09:46:07,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr8ASSERT_VIOLATIONDATA_RACE (6 of 43 remaining) [2024-10-13 09:46:07,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr9ASSERT_VIOLATIONDATA_RACE (5 of 43 remaining) [2024-10-13 09:46:07,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr10ASSERT_VIOLATIONDATA_RACE (4 of 43 remaining) [2024-10-13 09:46:07,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr3ASSERT_VIOLATIONDATA_RACE (3 of 43 remaining) [2024-10-13 09:46:07,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr4ASSERT_VIOLATIONDATA_RACE (2 of 43 remaining) [2024-10-13 09:46:07,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr5ASSERT_VIOLATIONDATA_RACE (1 of 43 remaining) [2024-10-13 09:46:07,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbThread1of1ForFork0Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 43 remaining) [2024-10-13 09:46:07,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 09:46:07,378 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:46:07,531 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-13 09:46:07,531 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 09:46:07,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 09:46:07 BasicIcfg [2024-10-13 09:46:07,540 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 09:46:07,541 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 09:46:07,544 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 09:46:07,544 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 09:46:07,545 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:45:58" (3/4) ... [2024-10-13 09:46:07,547 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 09:46:07,548 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 09:46:07,548 INFO L158 Benchmark]: Toolchain (without parser) took 10126.21ms. Allocated memory was 178.3MB in the beginning and 687.9MB in the end (delta: 509.6MB). Free memory was 108.7MB in the beginning and 527.5MB in the end (delta: -418.8MB). Peak memory consumption was 93.4MB. Max. memory is 16.1GB. [2024-10-13 09:46:07,552 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 104.9MB. Free memory was 75.4MB in the beginning and 75.2MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 09:46:07,553 INFO L158 Benchmark]: CACSL2BoogieTranslator took 786.91ms. Allocated memory is still 178.3MB. Free memory was 108.5MB in the beginning and 107.3MB in the end (delta: 1.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-13 09:46:07,553 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.73ms. Allocated memory is still 178.3MB. Free memory was 107.3MB in the beginning and 103.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 09:46:07,553 INFO L158 Benchmark]: Boogie Preprocessor took 43.16ms. Allocated memory is still 178.3MB. Free memory was 103.1MB in the beginning and 99.7MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 09:46:07,553 INFO L158 Benchmark]: RCFGBuilder took 634.84ms. Allocated memory is still 178.3MB. Free memory was 99.7MB in the beginning and 137.1MB in the end (delta: -37.4MB). Peak memory consumption was 36.7MB. Max. memory is 16.1GB. [2024-10-13 09:46:07,553 INFO L158 Benchmark]: TraceAbstraction took 8579.68ms. Allocated memory was 178.3MB in the beginning and 687.9MB in the end (delta: 509.6MB). Free memory was 136.1MB in the beginning and 527.5MB in the end (delta: -391.4MB). Peak memory consumption was 118.2MB. Max. memory is 16.1GB. [2024-10-13 09:46:07,554 INFO L158 Benchmark]: Witness Printer took 7.06ms. Allocated memory is still 687.9MB. Free memory is still 527.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 09:46:07,555 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.13ms. Allocated memory is still 104.9MB. Free memory was 75.4MB in the beginning and 75.2MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 786.91ms. Allocated memory is still 178.3MB. Free memory was 108.5MB in the beginning and 107.3MB in the end (delta: 1.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.73ms. Allocated memory is still 178.3MB. Free memory was 107.3MB in the beginning and 103.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.16ms. Allocated memory is still 178.3MB. Free memory was 103.1MB in the beginning and 99.7MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 634.84ms. Allocated memory is still 178.3MB. Free memory was 99.7MB in the beginning and 137.1MB in the end (delta: -37.4MB). Peak memory consumption was 36.7MB. Max. memory is 16.1GB. * TraceAbstraction took 8579.68ms. Allocated memory was 178.3MB in the beginning and 687.9MB in the end (delta: 509.6MB). Free memory was 136.1MB in the beginning and 527.5MB in the end (delta: -391.4MB). Peak memory consumption was 118.2MB. Max. memory is 16.1GB. * Witness Printer took 7.06ms. Allocated memory is still 687.9MB. Free memory is still 527.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 1699]: Data race detected Data race detected The following path leads to a data race: [L1694] 0 pthread_t t1, t2; VAL [t1=0, t2=0] [L1695] 0 pthread_mutex_t mutex; VAL [mutex={3:0}, t1=0, t2=0] [L1696] 0 int pdev; VAL [mutex={3:0}, pdev=0, t1=0, t2=0] [L1741] 0 int ldv_usb_state; VAL [ldv_usb_state=0, mutex={3:0}, pdev=0, t1=0, t2=0] [L1798] CALL 0 module_init() [L1779] 0 pdev = 1 VAL [ldv_usb_state=0, mutex={3:0}, pdev=1, t1=0, t2=0] [L1780] EXPR 0 pdev==1 [L1780] CALL 0 ldv_assert(pdev==1) [L1693] COND FALSE 0 !(!expression) VAL [\old(expression)=1, expression=1, ldv_usb_state=0, mutex={3:0}, pdev=1, t1=0, t2=0] [L1780] RET 0 ldv_assert(pdev==1) [L1781] COND TRUE 0 __VERIFIER_nondet_int() VAL [ldv_usb_state=0, mutex={3:0}, pdev=1, t1=0, t2=0] [L1782] 0 pthread_create(&t1, ((void *)0), thread_usb, ((void *)0)) VAL [ldv_usb_state=0, mutex={3:0}, pdev=1, t1=-1, t2=0] [L1782] FCALL, FORK 0 pthread_create(&t1, ((void *)0), thread_usb, ((void *)0)) VAL [ldv_usb_state=0, mutex={3:0}, pdev=1, t1=-1, t2=0] [L1743] 1 ldv_usb_state = 0 VAL [\old(arg)={0:0}, arg={0:0}, ldv_usb_state=0, mutex={3:0}, pdev=1, t1=-1, t2=0] [L1744] 1 int probe_ret; VAL [\old(arg)={0:0}, arg={0:0}, ldv_usb_state=0, mutex={3:0}, pdev=1, t1=-1, t2=0] [L1745] COND TRUE 1 1 VAL [\old(arg)={0:0}, arg={0:0}, ldv_usb_state=0, mutex={3:0}, pdev=1, t1=-1, t2=0] [L1747] 1 case 0: VAL [\old(arg)={0:0}, arg={0:0}, ldv_usb_state=0, mutex={3:0}, pdev=1, t1=-1, t2=0] [L1748] 1 ldv_usb_state==0 VAL [\old(arg)={0:0}, arg={0:0}, ldv_usb_state=0, mutex={3:0}, pdev=1, t1=-1, t2=0] [L1747] 1 case 0: [L1749] CALL, EXPR 1 ath_ahb_probe() [L1730] 1 int error; [L1731] CALL, EXPR 1 ieee80211_register_hw() [L1717] COND TRUE 1 __VERIFIER_nondet_int() VAL [ldv_usb_state=0, mutex={3:0}, pdev=1, t1=-1, t2=0] [L1718] 1 pthread_create(&t2, ((void *)0), thread_ath9k, ((void *)0)) VAL [ldv_usb_state=0, mutex={3:0}, pdev=1, t1=-1, t2=0] [L1718] FCALL, FORK 1 pthread_create(&t2, ((void *)0), thread_ath9k, ((void *)0)) VAL [ldv_usb_state=0, mutex={3:0}, pdev=1, t1=-1, t2=0] [L1704] COND TRUE 2 1 VAL [\old(arg)={0:0}, arg={0:0}, ldv_usb_state=0, mutex={3:0}, pdev=1, t1=-1, t2=0] [L1706] 2 case 1: [L1707] CALL 2 ath9k_flush() [L1719] 1 return 0; VAL [\result=0, ldv_usb_state=0, mutex={3:0}, pdev=1, t1=-1, t2=0] [L1731] RET, EXPR 1 ieee80211_register_hw() [L1731] 1 error = ieee80211_register_hw() VAL [error=0, ldv_usb_state=0, mutex={3:0}, pdev=1, t1=-1, t2=0] [L1732] COND FALSE 1 !(\read(error)) VAL [error=0, ldv_usb_state=0, mutex={3:0}, pdev=1, t1=-1, t2=0] [L1734] 1 return 0; VAL [\result=0, error=0, ldv_usb_state=0, mutex={3:0}, pdev=1, t1=-1, t2=0] [L1749] RET, EXPR 1 ath_ahb_probe() [L1749] 1 probe_ret = ath_ahb_probe() VAL [\old(arg)={0:0}, arg={0:0}, ldv_usb_state=0, mutex={3:0}, pdev=1, probe_ret=0, t1=-1, t2=0] [L1747] 1 case 0: VAL [\old(arg)={0:0}, arg={0:0}, ldv_usb_state=0, mutex={3:0}, pdev=1, probe_ret=0, t1=-1, t2=0] [L1752] 1 ldv_usb_state = 1 VAL [\old(arg)={0:0}, arg={0:0}, ldv_usb_state=1, mutex={3:0}, pdev=1, probe_ret=0, t1=-1, t2=0] [L1753] 1 pdev = 7 VAL [\old(arg)={0:0}, arg={0:0}, ldv_usb_state=1, mutex={3:0}, pdev=7, probe_ret=0, t1=-1, t2=0] [L1699] 2 pdev = 6 VAL [ldv_usb_state=1, mutex={3:0}, pdev=6, t1=-1, t2=0] [L1753] 1 pdev = 7 VAL [\old(arg)={0:0}, arg={0:0}, ldv_usb_state=1, mutex={3:0}, pdev=6, probe_ret=0, t1=-1, t2=0] [L1699] 2 pdev = 6 VAL [ldv_usb_state=1, mutex={3:0}, pdev=6, t1=-1, t2=0] Now there is a data race on ~pdev~0 between C: pdev = 7 [1753] and C: pdev = 6 [1699] - UnprovableResult [Line: 1700]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1779]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1780]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1785]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1782]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1786]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1792]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1794]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1795]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1782]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1743]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1773]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1748]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1774]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1758]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1766]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1725]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1718]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1760]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1761]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1762]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1752]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1753]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1754]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1718]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1718]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 517 locations, 43 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.3s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1300 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 454 mSDsluCounter, 275 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 51 mSDsCounter, 78 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1332 IncrementalHoareTripleChecker+Invalid, 1410 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 78 mSolverCounterUnsat, 224 mSDtfsCounter, 1332 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1085occurred in iteration=16, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 1230 NumberOfCodeBlocks, 1230 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1099 ConstructedInterpolants, 0 QuantifiedInterpolants, 1179 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-13 09:46:07,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE