./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/ldv-races/race-4_1-thread_local_vars.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/ldv-races/race-4_1-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 a9552a698db9701543deeff63aa990ab8fc4764b65dba5035623425bdf77554d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 12:24:11,787 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 12:24:11,847 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-12 12:24:11,853 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 12:24:11,854 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 12:24:11,902 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 12:24:11,903 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 12:24:11,903 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 12:24:11,904 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 12:24:11,904 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 12:24:11,905 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 12:24:11,905 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 12:24:11,906 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 12:24:11,906 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 12:24:11,907 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 12:24:11,907 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 12:24:11,907 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 12:24:11,908 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 12:24:11,908 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 12:24:11,909 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 12:24:11,912 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 12:24:11,913 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 12:24:11,913 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-12 12:24:11,914 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 12:24:11,914 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 12:24:11,914 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 12:24:11,915 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 12:24:11,915 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 12:24:11,915 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 12:24:11,916 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 12:24:11,916 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 12:24:11,916 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 12:24:11,917 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 12:24:11,924 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 12:24:11,924 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 12:24:11,924 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 12:24:11,925 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 12:24:11,925 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 12:24:11,925 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 12:24:11,925 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 12:24:11,926 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 12:24:11,926 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 -> a9552a698db9701543deeff63aa990ab8fc4764b65dba5035623425bdf77554d [2024-11-12 12:24:12,183 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 12:24:12,207 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 12:24:12,210 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 12:24:12,212 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 12:24:12,212 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 12:24:12,213 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-4_1-thread_local_vars.i [2024-11-12 12:24:13,730 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 12:24:14,079 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 12:24:14,080 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-4_1-thread_local_vars.i [2024-11-12 12:24:14,114 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b6064009/040f9aac38c4481abfa7c2fb0f6cc51d/FLAGe801bc0e9 [2024-11-12 12:24:14,128 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b6064009/040f9aac38c4481abfa7c2fb0f6cc51d [2024-11-12 12:24:14,131 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 12:24:14,133 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 12:24:14,135 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 12:24:14,135 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 12:24:14,140 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 12:24:14,142 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:24:14" (1/1) ... [2024-11-12 12:24:14,142 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f1f5057 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:24:14, skipping insertion in model container [2024-11-12 12:24:14,143 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:24:14" (1/1) ... [2024-11-12 12:24:14,199 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 12:24:15,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 12:24:15,065 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 12:24:15,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 12:24:15,300 INFO L204 MainTranslator]: Completed translation [2024-11-12 12:24:15,301 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:24:15 WrapperNode [2024-11-12 12:24:15,301 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 12:24:15,302 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 12:24:15,303 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 12:24:15,303 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 12:24:15,309 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:24:15" (1/1) ... [2024-11-12 12:24:15,338 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:24:15" (1/1) ... [2024-11-12 12:24:15,381 INFO L138 Inliner]: procedures = 487, calls = 37, calls flagged for inlining = 16, calls inlined = 21, statements flattened = 280 [2024-11-12 12:24:15,382 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 12:24:15,383 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 12:24:15,383 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 12:24:15,383 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 12:24:15,391 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:24:15" (1/1) ... [2024-11-12 12:24:15,392 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:24:15" (1/1) ... [2024-11-12 12:24:15,397 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:24:15" (1/1) ... [2024-11-12 12:24:15,398 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:24:15" (1/1) ... [2024-11-12 12:24:15,410 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:24:15" (1/1) ... [2024-11-12 12:24:15,414 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:24:15" (1/1) ... [2024-11-12 12:24:15,420 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:24:15" (1/1) ... [2024-11-12 12:24:15,423 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:24:15" (1/1) ... [2024-11-12 12:24:15,433 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 12:24:15,434 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 12:24:15,434 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 12:24:15,434 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 12:24:15,435 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:24:15" (1/1) ... [2024-11-12 12:24:15,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 12:24:15,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 12:24:15,486 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-11-12 12:24:15,490 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-11-12 12:24:15,545 INFO L130 BoogieDeclarations]: Found specification of procedure thread_usb [2024-11-12 12:24:15,545 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_usb [2024-11-12 12:24:15,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 12:24:15,546 INFO L130 BoogieDeclarations]: Found specification of procedure thread_ath9k [2024-11-12 12:24:15,546 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_ath9k [2024-11-12 12:24:15,547 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-12 12:24:15,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 12:24:15,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-12 12:24:15,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 12:24:15,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 12:24:15,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-12 12:24:15,547 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-12 12:24:15,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-12 12:24:15,551 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-12 12:24:15,819 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 12:24:15,821 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 12:24:16,170 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-12 12:24:16,171 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 12:24:16,218 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 12:24:16,219 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-12 12:24:16,221 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:24:16 BoogieIcfgContainer [2024-11-12 12:24:16,221 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 12:24:16,224 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 12:24:16,224 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 12:24:16,229 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 12:24:16,229 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:24:14" (1/3) ... [2024-11-12 12:24:16,230 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@712fa3e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:24:16, skipping insertion in model container [2024-11-12 12:24:16,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:24:15" (2/3) ... [2024-11-12 12:24:16,231 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@712fa3e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:24:16, skipping insertion in model container [2024-11-12 12:24:16,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:24:16" (3/3) ... [2024-11-12 12:24:16,233 INFO L112 eAbstractionObserver]: Analyzing ICFG race-4_1-thread_local_vars.i [2024-11-12 12:24:16,252 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 12:24:16,252 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2024-11-12 12:24:16,253 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-12 12:24:16,378 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2024-11-12 12:24:16,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 432 places, 470 transitions, 967 flow [2024-11-12 12:24:16,602 INFO L124 PetriNetUnfolderBase]: 41/476 cut-off events. [2024-11-12 12:24:16,602 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-12 12:24:16,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 487 conditions, 476 events. 41/476 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1280 event pairs, 0 based on Foata normal form. 0/397 useless extension candidates. Maximal degree in co-relation 323. Up to 11 conditions per place. [2024-11-12 12:24:16,617 INFO L82 GeneralOperation]: Start removeDead. Operand has 432 places, 470 transitions, 967 flow [2024-11-12 12:24:16,626 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 303 places, 326 transitions, 668 flow [2024-11-12 12:24:16,641 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 12:24:16,648 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;@5bccc4b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 12:24:16,649 INFO L334 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2024-11-12 12:24:16,653 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-12 12:24:16,653 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2024-11-12 12:24:16,653 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 12:24:16,654 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:24:16,655 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:24:16,655 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-11-12 12:24:16,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:24:16,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1208568071, now seen corresponding path program 1 times [2024-11-12 12:24:16,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:24:16,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223806747] [2024-11-12 12:24:16,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:24:16,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:24:16,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:24:17,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:24:17,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:24:17,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223806747] [2024-11-12 12:24:17,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223806747] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:24:17,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:24:17,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:24:17,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255625745] [2024-11-12 12:24:17,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:24:17,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:24:17,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:24:17,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:24:17,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:24:17,366 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 470 [2024-11-12 12:24:17,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 326 transitions, 668 flow. Second operand has 3 states, 3 states have (on average 409.3333333333333) internal successors, (1228), 3 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:24:17,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:24:17,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 470 [2024-11-12 12:24:17,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:24:17,540 INFO L124 PetriNetUnfolderBase]: 82/946 cut-off events. [2024-11-12 12:24:17,541 INFO L125 PetriNetUnfolderBase]: For 35/43 co-relation queries the response was YES. [2024-11-12 12:24:17,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1092 conditions, 946 events. 82/946 cut-off events. For 35/43 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 4774 event pairs, 48 based on Foata normal form. 73/883 useless extension candidates. Maximal degree in co-relation 765. Up to 125 conditions per place. [2024-11-12 12:24:17,553 INFO L140 encePairwiseOnDemand]: 451/470 looper letters, 22 selfloop transitions, 2 changer transitions 6/297 dead transitions. [2024-11-12 12:24:17,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 297 transitions, 658 flow [2024-11-12 12:24:17,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:24:17,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:24:17,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1265 transitions. [2024-11-12 12:24:17,576 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8971631205673759 [2024-11-12 12:24:17,580 INFO L175 Difference]: Start difference. First operand has 303 places, 326 transitions, 668 flow. Second operand 3 states and 1265 transitions. [2024-11-12 12:24:17,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 297 transitions, 658 flow [2024-11-12 12:24:17,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 297 transitions, 654 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:24:17,593 INFO L231 Difference]: Finished difference. Result has 290 places, 291 transitions, 598 flow [2024-11-12 12:24:17,596 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=470, PETRI_DIFFERENCE_MINUEND_FLOW=606, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=598, PETRI_PLACES=290, PETRI_TRANSITIONS=291} [2024-11-12 12:24:17,602 INFO L279 CegarLoopForPetriNet]: 303 programPoint places, -13 predicate places. [2024-11-12 12:24:17,603 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 291 transitions, 598 flow [2024-11-12 12:24:17,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 409.3333333333333) internal successors, (1228), 3 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:24:17,604 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:24:17,605 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:24:17,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 12:24:17,605 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-11-12 12:24:17,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:24:17,606 INFO L85 PathProgramCache]: Analyzing trace with hash -258701395, now seen corresponding path program 1 times [2024-11-12 12:24:17,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:24:17,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563776727] [2024-11-12 12:24:17,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:24:17,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:24:17,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:24:17,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:24:17,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:24:17,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563776727] [2024-11-12 12:24:17,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563776727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:24:17,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:24:17,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:24:17,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378792627] [2024-11-12 12:24:17,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:24:17,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:24:17,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:24:17,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:24:17,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:24:17,818 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 398 out of 470 [2024-11-12 12:24:17,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 291 transitions, 598 flow. Second operand has 3 states, 3 states have (on average 399.0) internal successors, (1197), 3 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:24:17,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:24:17,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 398 of 470 [2024-11-12 12:24:17,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:24:18,008 INFO L124 PetriNetUnfolderBase]: 83/951 cut-off events. [2024-11-12 12:24:18,009 INFO L125 PetriNetUnfolderBase]: For 14/19 co-relation queries the response was YES. [2024-11-12 12:24:18,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1115 conditions, 951 events. 83/951 cut-off events. For 14/19 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4777 event pairs, 21 based on Foata normal form. 1/838 useless extension candidates. Maximal degree in co-relation 1081. Up to 112 conditions per place. [2024-11-12 12:24:18,017 INFO L140 encePairwiseOnDemand]: 450/470 looper letters, 26 selfloop transitions, 14 changer transitions 0/300 dead transitions. [2024-11-12 12:24:18,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 300 transitions, 697 flow [2024-11-12 12:24:18,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:24:18,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:24:18,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1240 transitions. [2024-11-12 12:24:18,022 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8794326241134752 [2024-11-12 12:24:18,022 INFO L175 Difference]: Start difference. First operand has 290 places, 291 transitions, 598 flow. Second operand 3 states and 1240 transitions. [2024-11-12 12:24:18,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 300 transitions, 697 flow [2024-11-12 12:24:18,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 300 transitions, 693 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:24:18,031 INFO L231 Difference]: Finished difference. Result has 283 places, 297 transitions, 686 flow [2024-11-12 12:24:18,032 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=470, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=686, PETRI_PLACES=283, PETRI_TRANSITIONS=297} [2024-11-12 12:24:18,033 INFO L279 CegarLoopForPetriNet]: 303 programPoint places, -20 predicate places. [2024-11-12 12:24:18,033 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 297 transitions, 686 flow [2024-11-12 12:24:18,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 399.0) internal successors, (1197), 3 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:24:18,035 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:24:18,035 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:24:18,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 12:24:18,036 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-11-12 12:24:18,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:24:18,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1194276038, now seen corresponding path program 1 times [2024-11-12 12:24:18,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:24:18,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110848453] [2024-11-12 12:24:18,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:24:18,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:24:18,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:24:18,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:24:18,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:24:18,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110848453] [2024-11-12 12:24:18,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110848453] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:24:18,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:24:18,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:24:18,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137320287] [2024-11-12 12:24:18,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:24:18,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:24:18,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:24:18,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:24:18,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:24:18,228 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 470 [2024-11-12 12:24:18,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 297 transitions, 686 flow. Second operand has 3 states, 3 states have (on average 410.0) internal successors, (1230), 3 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:24:18,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:24:18,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 470 [2024-11-12 12:24:18,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:24:18,420 INFO L124 PetriNetUnfolderBase]: 137/1399 cut-off events. [2024-11-12 12:24:18,421 INFO L125 PetriNetUnfolderBase]: For 273/311 co-relation queries the response was YES. [2024-11-12 12:24:18,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1852 conditions, 1399 events. 137/1399 cut-off events. For 273/311 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 8704 event pairs, 61 based on Foata normal form. 0/1227 useless extension candidates. Maximal degree in co-relation 1443. Up to 203 conditions per place. [2024-11-12 12:24:18,437 INFO L140 encePairwiseOnDemand]: 467/470 looper letters, 28 selfloop transitions, 2 changer transitions 0/296 dead transitions. [2024-11-12 12:24:18,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 296 transitions, 744 flow [2024-11-12 12:24:18,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:24:18,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:24:18,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1249 transitions. [2024-11-12 12:24:18,441 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8858156028368794 [2024-11-12 12:24:18,441 INFO L175 Difference]: Start difference. First operand has 283 places, 297 transitions, 686 flow. Second operand 3 states and 1249 transitions. [2024-11-12 12:24:18,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 296 transitions, 744 flow [2024-11-12 12:24:18,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 296 transitions, 716 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:24:18,451 INFO L231 Difference]: Finished difference. Result has 282 places, 296 transitions, 660 flow [2024-11-12 12:24:18,452 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=470, PETRI_DIFFERENCE_MINUEND_FLOW=656, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=660, PETRI_PLACES=282, PETRI_TRANSITIONS=296} [2024-11-12 12:24:18,454 INFO L279 CegarLoopForPetriNet]: 303 programPoint places, -21 predicate places. [2024-11-12 12:24:18,454 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 296 transitions, 660 flow [2024-11-12 12:24:18,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 410.0) internal successors, (1230), 3 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:24:18,455 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:24:18,456 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:24:18,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 12:24:18,456 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-11-12 12:24:18,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:24:18,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1090006123, now seen corresponding path program 1 times [2024-11-12 12:24:18,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:24:18,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461809058] [2024-11-12 12:24:18,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:24:18,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:24:18,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:24:18,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:24:18,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:24:18,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461809058] [2024-11-12 12:24:18,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461809058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:24:18,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:24:18,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:24:18,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879077893] [2024-11-12 12:24:18,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:24:18,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:24:18,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:24:18,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:24:18,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:24:18,607 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 422 out of 470 [2024-11-12 12:24:18,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 296 transitions, 660 flow. Second operand has 3 states, 3 states have (on average 423.3333333333333) internal successors, (1270), 3 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:24:18,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:24:18,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 422 of 470 [2024-11-12 12:24:18,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:24:18,770 INFO L124 PetriNetUnfolderBase]: 99/1140 cut-off events. [2024-11-12 12:24:18,771 INFO L125 PetriNetUnfolderBase]: For 24/55 co-relation queries the response was YES. [2024-11-12 12:24:18,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1371 conditions, 1140 events. 99/1140 cut-off events. For 24/55 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 6770 event pairs, 9 based on Foata normal form. 4/991 useless extension candidates. Maximal degree in co-relation 1332. Up to 98 conditions per place. [2024-11-12 12:24:18,784 INFO L140 encePairwiseOnDemand]: 467/470 looper letters, 17 selfloop transitions, 2 changer transitions 0/300 dead transitions. [2024-11-12 12:24:18,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 300 transitions, 715 flow [2024-11-12 12:24:18,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:24:18,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:24:18,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1286 transitions. [2024-11-12 12:24:18,787 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9120567375886525 [2024-11-12 12:24:18,787 INFO L175 Difference]: Start difference. First operand has 282 places, 296 transitions, 660 flow. Second operand 3 states and 1286 transitions. [2024-11-12 12:24:18,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 300 transitions, 715 flow [2024-11-12 12:24:18,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 300 transitions, 711 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:24:18,795 INFO L231 Difference]: Finished difference. Result has 281 places, 295 transitions, 658 flow [2024-11-12 12:24:18,796 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=470, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=658, PETRI_PLACES=281, PETRI_TRANSITIONS=295} [2024-11-12 12:24:18,797 INFO L279 CegarLoopForPetriNet]: 303 programPoint places, -22 predicate places. [2024-11-12 12:24:18,798 INFO L471 AbstractCegarLoop]: Abstraction has has 281 places, 295 transitions, 658 flow [2024-11-12 12:24:18,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 423.3333333333333) internal successors, (1270), 3 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:24:18,800 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:24:18,800 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:24:18,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 12:24:18,801 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread_usbErr0ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-11-12 12:24:18,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:24:18,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1642742462, now seen corresponding path program 1 times [2024-11-12 12:24:18,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:24:18,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500056834] [2024-11-12 12:24:18,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:24:18,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:24:18,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:24:18,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:24:18,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:24:18,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500056834] [2024-11-12 12:24:18,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500056834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:24:18,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:24:18,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:24:18,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626655197] [2024-11-12 12:24:18,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:24:18,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:24:18,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:24:18,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:24:18,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:24:18,938 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 470 [2024-11-12 12:24:18,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 295 transitions, 658 flow. Second operand has 3 states, 3 states have (on average 416.3333333333333) internal successors, (1249), 3 states have internal predecessors, (1249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:24:18,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:24:18,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 470 [2024-11-12 12:24:18,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:24:19,117 INFO L124 PetriNetUnfolderBase]: 78/1012 cut-off events. [2024-11-12 12:24:19,117 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-12 12:24:19,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1192 conditions, 1012 events. 78/1012 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 5500 event pairs, 19 based on Foata normal form. 0/890 useless extension candidates. Maximal degree in co-relation 1100. Up to 67 conditions per place. [2024-11-12 12:24:19,126 INFO L140 encePairwiseOnDemand]: 467/470 looper letters, 14 selfloop transitions, 2 changer transitions 0/294 dead transitions. [2024-11-12 12:24:19,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 294 transitions, 688 flow [2024-11-12 12:24:19,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:24:19,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:24:19,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1262 transitions. [2024-11-12 12:24:19,130 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8950354609929078 [2024-11-12 12:24:19,130 INFO L175 Difference]: Start difference. First operand has 281 places, 295 transitions, 658 flow. Second operand 3 states and 1262 transitions. [2024-11-12 12:24:19,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 294 transitions, 688 flow [2024-11-12 12:24:19,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 294 transitions, 684 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:24:19,136 INFO L231 Difference]: Finished difference. Result has 280 places, 294 transitions, 656 flow [2024-11-12 12:24:19,137 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=470, PETRI_DIFFERENCE_MINUEND_FLOW=652, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=656, PETRI_PLACES=280, PETRI_TRANSITIONS=294} [2024-11-12 12:24:19,138 INFO L279 CegarLoopForPetriNet]: 303 programPoint places, -23 predicate places. [2024-11-12 12:24:19,138 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 294 transitions, 656 flow [2024-11-12 12:24:19,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 416.3333333333333) internal successors, (1249), 3 states have internal predecessors, (1249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:24:19,139 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:24:19,139 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:24:19,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 12:24:19,140 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-11-12 12:24:19,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:24:19,141 INFO L85 PathProgramCache]: Analyzing trace with hash 281040216, now seen corresponding path program 1 times [2024-11-12 12:24:19,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:24:19,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563862934] [2024-11-12 12:24:19,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:24:19,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:24:19,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:24:19,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:24:19,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:24:19,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563862934] [2024-11-12 12:24:19,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563862934] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:24:19,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:24:19,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:24:19,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989826800] [2024-11-12 12:24:19,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:24:19,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:24:19,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:24:19,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:24:19,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:24:19,285 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 470 [2024-11-12 12:24:19,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 294 transitions, 656 flow. Second operand has 3 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:24:19,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:24:19,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 470 [2024-11-12 12:24:19,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:24:19,432 INFO L124 PetriNetUnfolderBase]: 85/924 cut-off events. [2024-11-12 12:24:19,433 INFO L125 PetriNetUnfolderBase]: For 17/39 co-relation queries the response was YES. [2024-11-12 12:24:19,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1122 conditions, 924 events. 85/924 cut-off events. For 17/39 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4927 event pairs, 9 based on Foata normal form. 4/819 useless extension candidates. Maximal degree in co-relation 1024. Up to 69 conditions per place. [2024-11-12 12:24:19,443 INFO L140 encePairwiseOnDemand]: 468/470 looper letters, 14 selfloop transitions, 1 changer transitions 19/298 dead transitions. [2024-11-12 12:24:19,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 298 transitions, 703 flow [2024-11-12 12:24:19,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:24:19,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:24:19,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1294 transitions. [2024-11-12 12:24:19,446 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9177304964539007 [2024-11-12 12:24:19,446 INFO L175 Difference]: Start difference. First operand has 280 places, 294 transitions, 656 flow. Second operand 3 states and 1294 transitions. [2024-11-12 12:24:19,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 298 transitions, 703 flow [2024-11-12 12:24:19,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 298 transitions, 699 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:24:19,453 INFO L231 Difference]: Finished difference. Result has 279 places, 274 transitions, 610 flow [2024-11-12 12:24:19,453 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=470, PETRI_DIFFERENCE_MINUEND_FLOW=650, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=610, PETRI_PLACES=279, PETRI_TRANSITIONS=274} [2024-11-12 12:24:19,454 INFO L279 CegarLoopForPetriNet]: 303 programPoint places, -24 predicate places. [2024-11-12 12:24:19,454 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 274 transitions, 610 flow [2024-11-12 12:24:19,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:24:19,456 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:24:19,457 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:24:19,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 12:24:19,457 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread_usbErr1ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-11-12 12:24:19,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:24:19,458 INFO L85 PathProgramCache]: Analyzing trace with hash 602710765, now seen corresponding path program 1 times [2024-11-12 12:24:19,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:24:19,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886047470] [2024-11-12 12:24:19,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:24:19,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:24:19,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:24:19,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:24:19,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:24:19,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886047470] [2024-11-12 12:24:19,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886047470] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:24:19,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:24:19,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:24:19,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54013726] [2024-11-12 12:24:19,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:24:19,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:24:19,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:24:19,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:24:19,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:24:19,587 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 407 out of 470 [2024-11-12 12:24:19,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 274 transitions, 610 flow. Second operand has 3 states, 3 states have (on average 408.3333333333333) internal successors, (1225), 3 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:24:19,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:24:19,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 407 of 470 [2024-11-12 12:24:19,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:24:19,742 INFO L124 PetriNetUnfolderBase]: 101/1142 cut-off events. [2024-11-12 12:24:19,742 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-12 12:24:19,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1354 conditions, 1142 events. 101/1142 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 6642 event pairs, 23 based on Foata normal form. 0/1009 useless extension candidates. Maximal degree in co-relation 1281. Up to 83 conditions per place. [2024-11-12 12:24:19,750 INFO L140 encePairwiseOnDemand]: 462/470 looper letters, 16 selfloop transitions, 5 changer transitions 0/276 dead transitions. [2024-11-12 12:24:19,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 276 transitions, 656 flow [2024-11-12 12:24:19,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:24:19,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:24:19,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1245 transitions. [2024-11-12 12:24:19,753 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8829787234042553 [2024-11-12 12:24:19,754 INFO L175 Difference]: Start difference. First operand has 279 places, 274 transitions, 610 flow. Second operand 3 states and 1245 transitions. [2024-11-12 12:24:19,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 276 transitions, 656 flow [2024-11-12 12:24:19,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 276 transitions, 655 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:24:19,759 INFO L231 Difference]: Finished difference. Result has 260 places, 274 transitions, 630 flow [2024-11-12 12:24:19,759 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=470, PETRI_DIFFERENCE_MINUEND_FLOW=603, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=630, PETRI_PLACES=260, PETRI_TRANSITIONS=274} [2024-11-12 12:24:19,760 INFO L279 CegarLoopForPetriNet]: 303 programPoint places, -43 predicate places. [2024-11-12 12:24:19,760 INFO L471 AbstractCegarLoop]: Abstraction has has 260 places, 274 transitions, 630 flow [2024-11-12 12:24:19,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 408.3333333333333) internal successors, (1225), 3 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:24:19,761 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:24:19,762 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:24:19,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 12:24:19,762 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread_usbErr5ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-11-12 12:24:19,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:24:19,763 INFO L85 PathProgramCache]: Analyzing trace with hash -779475163, now seen corresponding path program 1 times [2024-11-12 12:24:19,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:24:19,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336282137] [2024-11-12 12:24:19,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:24:19,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:24:19,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:24:19,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:24:19,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:24:19,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336282137] [2024-11-12 12:24:19,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336282137] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:24:19,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:24:19,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 12:24:19,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006957124] [2024-11-12 12:24:19,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:24:19,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:24:19,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:24:19,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:24:19,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:24:19,918 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 414 out of 470 [2024-11-12 12:24:19,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 274 transitions, 630 flow. Second operand has 3 states, 3 states have (on average 415.3333333333333) internal successors, (1246), 3 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:24:19,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:24:19,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 414 of 470 [2024-11-12 12:24:19,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:24:20,051 INFO L124 PetriNetUnfolderBase]: 103/1074 cut-off events. [2024-11-12 12:24:20,052 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-11-12 12:24:20,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1303 conditions, 1074 events. 103/1074 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 5939 event pairs, 14 based on Foata normal form. 1/945 useless extension candidates. Maximal degree in co-relation 1229. Up to 63 conditions per place. [2024-11-12 12:24:20,062 INFO L140 encePairwiseOnDemand]: 462/470 looper letters, 15 selfloop transitions, 5 changer transitions 0/278 dead transitions. [2024-11-12 12:24:20,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 278 transitions, 678 flow [2024-11-12 12:24:20,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:24:20,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:24:20,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1265 transitions. [2024-11-12 12:24:20,066 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8971631205673759 [2024-11-12 12:24:20,066 INFO L175 Difference]: Start difference. First operand has 260 places, 274 transitions, 630 flow. Second operand 3 states and 1265 transitions. [2024-11-12 12:24:20,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 278 transitions, 678 flow [2024-11-12 12:24:20,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 278 transitions, 673 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:24:20,071 INFO L231 Difference]: Finished difference. Result has 263 places, 276 transitions, 659 flow [2024-11-12 12:24:20,072 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=470, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=659, PETRI_PLACES=263, PETRI_TRANSITIONS=276} [2024-11-12 12:24:20,073 INFO L279 CegarLoopForPetriNet]: 303 programPoint places, -40 predicate places. [2024-11-12 12:24:20,073 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 276 transitions, 659 flow [2024-11-12 12:24:20,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 415.3333333333333) internal successors, (1246), 3 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:24:20,074 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:24:20,074 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:24:20,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 12:24:20,075 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread_usbErr10ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-11-12 12:24:20,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:24:20,075 INFO L85 PathProgramCache]: Analyzing trace with hash -180834619, now seen corresponding path program 1 times [2024-11-12 12:24:20,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:24:20,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400555345] [2024-11-12 12:24:20,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:24:20,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:24:20,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:24:20,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:24:20,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:24:20,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400555345] [2024-11-12 12:24:20,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400555345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:24:20,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:24:20,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:24:20,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790189868] [2024-11-12 12:24:20,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:24:20,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:24:20,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:24:20,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:24:20,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:24:20,220 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 470 [2024-11-12 12:24:20,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 276 transitions, 659 flow. Second operand has 3 states, 3 states have (on average 413.0) internal successors, (1239), 3 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:24:20,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:24:20,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 470 [2024-11-12 12:24:20,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:24:20,380 INFO L124 PetriNetUnfolderBase]: 120/1104 cut-off events. [2024-11-12 12:24:20,380 INFO L125 PetriNetUnfolderBase]: For 87/100 co-relation queries the response was YES. [2024-11-12 12:24:20,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1449 conditions, 1104 events. 120/1104 cut-off events. For 87/100 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 5988 event pairs, 28 based on Foata normal form. 2/980 useless extension candidates. Maximal degree in co-relation 1370. Up to 137 conditions per place. [2024-11-12 12:24:20,389 INFO L140 encePairwiseOnDemand]: 464/470 looper letters, 26 selfloop transitions, 8 changer transitions 0/284 dead transitions. [2024-11-12 12:24:20,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 284 transitions, 753 flow [2024-11-12 12:24:20,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:24:20,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:24:20,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1260 transitions. [2024-11-12 12:24:20,392 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8936170212765957 [2024-11-12 12:24:20,392 INFO L175 Difference]: Start difference. First operand has 263 places, 276 transitions, 659 flow. Second operand 3 states and 1260 transitions. [2024-11-12 12:24:20,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 284 transitions, 753 flow [2024-11-12 12:24:20,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 284 transitions, 743 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:24:20,398 INFO L231 Difference]: Finished difference. Result has 265 places, 282 transitions, 717 flow [2024-11-12 12:24:20,398 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=470, PETRI_DIFFERENCE_MINUEND_FLOW=649, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=717, PETRI_PLACES=265, PETRI_TRANSITIONS=282} [2024-11-12 12:24:20,400 INFO L279 CegarLoopForPetriNet]: 303 programPoint places, -38 predicate places. [2024-11-12 12:24:20,400 INFO L471 AbstractCegarLoop]: Abstraction has has 265 places, 282 transitions, 717 flow [2024-11-12 12:24:20,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.0) internal successors, (1239), 3 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:24:20,402 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:24:20,402 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:24:20,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 12:24:20,402 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread_usbErr2ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-11-12 12:24:20,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:24:20,403 INFO L85 PathProgramCache]: Analyzing trace with hash 59076434, now seen corresponding path program 1 times [2024-11-12 12:24:20,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:24:20,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31187313] [2024-11-12 12:24:20,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:24:20,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:24:20,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:24:20,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:24:20,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:24:20,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31187313] [2024-11-12 12:24:20,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31187313] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:24:20,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:24:20,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:24:20,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815656542] [2024-11-12 12:24:20,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:24:20,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:24:20,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:24:20,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:24:20,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:24:20,506 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 420 out of 470 [2024-11-12 12:24:20,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 282 transitions, 717 flow. Second operand has 3 states, 3 states have (on average 421.6666666666667) internal successors, (1265), 3 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:24:20,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:24:20,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 420 of 470 [2024-11-12 12:24:20,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:24:20,655 INFO L124 PetriNetUnfolderBase]: 114/1189 cut-off events. [2024-11-12 12:24:20,656 INFO L125 PetriNetUnfolderBase]: For 83/94 co-relation queries the response was YES. [2024-11-12 12:24:20,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1536 conditions, 1189 events. 114/1189 cut-off events. For 83/94 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 6837 event pairs, 14 based on Foata normal form. 0/1058 useless extension candidates. Maximal degree in co-relation 1459. Up to 73 conditions per place. [2024-11-12 12:24:20,667 INFO L140 encePairwiseOnDemand]: 467/470 looper letters, 14 selfloop transitions, 2 changer transitions 0/283 dead transitions. [2024-11-12 12:24:20,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 283 transitions, 751 flow [2024-11-12 12:24:20,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:24:20,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:24:20,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1277 transitions. [2024-11-12 12:24:20,671 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9056737588652483 [2024-11-12 12:24:20,672 INFO L175 Difference]: Start difference. First operand has 265 places, 282 transitions, 717 flow. Second operand 3 states and 1277 transitions. [2024-11-12 12:24:20,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 283 transitions, 751 flow [2024-11-12 12:24:20,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 283 transitions, 735 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:24:20,677 INFO L231 Difference]: Finished difference. Result has 264 places, 281 transitions, 703 flow [2024-11-12 12:24:20,679 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=470, PETRI_DIFFERENCE_MINUEND_FLOW=699, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=703, PETRI_PLACES=264, PETRI_TRANSITIONS=281} [2024-11-12 12:24:20,679 INFO L279 CegarLoopForPetriNet]: 303 programPoint places, -39 predicate places. [2024-11-12 12:24:20,680 INFO L471 AbstractCegarLoop]: Abstraction has has 264 places, 281 transitions, 703 flow [2024-11-12 12:24:20,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 421.6666666666667) internal successors, (1265), 3 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:24:20,681 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:24:20,681 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:24:20,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 12:24:20,682 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread_usbErr3ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-11-12 12:24:20,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:24:20,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1232941445, now seen corresponding path program 1 times [2024-11-12 12:24:20,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:24:20,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823778128] [2024-11-12 12:24:20,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:24:20,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:24:20,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:24:20,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:24:20,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:24:20,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823778128] [2024-11-12 12:24:20,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823778128] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:24:20,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:24:20,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:24:20,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110666899] [2024-11-12 12:24:20,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:24:20,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:24:20,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:24:20,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:24:20,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:24:20,823 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 470 [2024-11-12 12:24:20,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 281 transitions, 703 flow. Second operand has 3 states, 3 states have (on average 417.0) internal successors, (1251), 3 states have internal predecessors, (1251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:24:20,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:24:20,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 470 [2024-11-12 12:24:20,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:24:20,980 INFO L124 PetriNetUnfolderBase]: 136/1235 cut-off events. [2024-11-12 12:24:20,980 INFO L125 PetriNetUnfolderBase]: For 93/112 co-relation queries the response was YES. [2024-11-12 12:24:20,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1614 conditions, 1235 events. 136/1235 cut-off events. For 93/112 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 7309 event pairs, 22 based on Foata normal form. 0/1092 useless extension candidates. Maximal degree in co-relation 1537. Up to 92 conditions per place. [2024-11-12 12:24:20,991 INFO L140 encePairwiseOnDemand]: 467/470 looper letters, 19 selfloop transitions, 2 changer transitions 0/282 dead transitions. [2024-11-12 12:24:20,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 282 transitions, 747 flow [2024-11-12 12:24:20,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:24:20,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:24:20,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1264 transitions. [2024-11-12 12:24:20,994 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8964539007092198 [2024-11-12 12:24:20,994 INFO L175 Difference]: Start difference. First operand has 264 places, 281 transitions, 703 flow. Second operand 3 states and 1264 transitions. [2024-11-12 12:24:20,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 282 transitions, 747 flow [2024-11-12 12:24:20,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 282 transitions, 743 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:24:21,000 INFO L231 Difference]: Finished difference. Result has 263 places, 280 transitions, 701 flow [2024-11-12 12:24:21,000 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=470, PETRI_DIFFERENCE_MINUEND_FLOW=697, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=701, PETRI_PLACES=263, PETRI_TRANSITIONS=280} [2024-11-12 12:24:21,001 INFO L279 CegarLoopForPetriNet]: 303 programPoint places, -40 predicate places. [2024-11-12 12:24:21,001 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 280 transitions, 701 flow [2024-11-12 12:24:21,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 417.0) internal successors, (1251), 3 states have internal predecessors, (1251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:24:21,002 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:24:21,002 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:24:21,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 12:24:21,003 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-11-12 12:24:21,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:24:21,003 INFO L85 PathProgramCache]: Analyzing trace with hash 756046649, now seen corresponding path program 1 times [2024-11-12 12:24:21,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:24:21,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971074853] [2024-11-12 12:24:21,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:24:21,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:24:21,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:24:21,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:24:21,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:24:21,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971074853] [2024-11-12 12:24:21,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971074853] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:24:21,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:24:21,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:24:21,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353026600] [2024-11-12 12:24:21,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:24:21,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:24:21,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:24:21,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:24:21,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:24:21,151 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 470 [2024-11-12 12:24:21,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 280 transitions, 701 flow. Second operand has 3 states, 3 states have (on average 411.0) internal successors, (1233), 3 states have internal predecessors, (1233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:24:21,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:24:21,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 470 [2024-11-12 12:24:21,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:24:21,296 INFO L124 PetriNetUnfolderBase]: 168/1252 cut-off events. [2024-11-12 12:24:21,297 INFO L125 PetriNetUnfolderBase]: For 266/343 co-relation queries the response was YES. [2024-11-12 12:24:21,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1852 conditions, 1252 events. 168/1252 cut-off events. For 266/343 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 7371 event pairs, 39 based on Foata normal form. 8/1127 useless extension candidates. Maximal degree in co-relation 1773. Up to 236 conditions per place. [2024-11-12 12:24:21,309 INFO L140 encePairwiseOnDemand]: 462/470 looper letters, 31 selfloop transitions, 12 changer transitions 0/289 dead transitions. [2024-11-12 12:24:21,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 289 transitions, 824 flow [2024-11-12 12:24:21,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:24:21,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:24:21,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1255 transitions. [2024-11-12 12:24:21,313 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8900709219858156 [2024-11-12 12:24:21,313 INFO L175 Difference]: Start difference. First operand has 263 places, 280 transitions, 701 flow. Second operand 3 states and 1255 transitions. [2024-11-12 12:24:21,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 289 transitions, 824 flow [2024-11-12 12:24:21,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 289 transitions, 820 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:24:21,319 INFO L231 Difference]: Finished difference. Result has 265 places, 288 transitions, 797 flow [2024-11-12 12:24:21,319 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=470, PETRI_DIFFERENCE_MINUEND_FLOW=697, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=797, PETRI_PLACES=265, PETRI_TRANSITIONS=288} [2024-11-12 12:24:21,320 INFO L279 CegarLoopForPetriNet]: 303 programPoint places, -38 predicate places. [2024-11-12 12:24:21,320 INFO L471 AbstractCegarLoop]: Abstraction has has 265 places, 288 transitions, 797 flow [2024-11-12 12:24:21,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 411.0) internal successors, (1233), 3 states have internal predecessors, (1233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:24:21,321 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:24:21,321 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:24:21,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 12:24:21,322 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-11-12 12:24:21,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:24:21,322 INFO L85 PathProgramCache]: Analyzing trace with hash 904070119, now seen corresponding path program 1 times [2024-11-12 12:24:21,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:24:21,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193776920] [2024-11-12 12:24:21,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:24:21,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:24:21,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:24:21,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:24:21,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:24:21,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193776920] [2024-11-12 12:24:21,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193776920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:24:21,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:24:21,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:24:21,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833090049] [2024-11-12 12:24:21,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:24:21,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:24:21,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:24:21,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:24:21,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:24:21,463 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 470 [2024-11-12 12:24:21,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 288 transitions, 797 flow. Second operand has 3 states, 3 states have (on average 411.3333333333333) internal successors, (1234), 3 states have internal predecessors, (1234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:24:21,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:24:21,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 470 [2024-11-12 12:24:21,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:24:21,734 INFO L124 PetriNetUnfolderBase]: 278/1846 cut-off events. [2024-11-12 12:24:21,734 INFO L125 PetriNetUnfolderBase]: For 952/1053 co-relation queries the response was YES. [2024-11-12 12:24:21,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3005 conditions, 1846 events. 278/1846 cut-off events. For 952/1053 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 12908 event pairs, 86 based on Foata normal form. 8/1673 useless extension candidates. Maximal degree in co-relation 2614. Up to 358 conditions per place. [2024-11-12 12:24:21,753 INFO L140 encePairwiseOnDemand]: 464/470 looper letters, 38 selfloop transitions, 9 changer transitions 1/295 dead transitions. [2024-11-12 12:24:21,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 295 transitions, 925 flow [2024-11-12 12:24:21,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:24:21,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:24:21,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1254 transitions. [2024-11-12 12:24:21,756 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8893617021276595 [2024-11-12 12:24:21,756 INFO L175 Difference]: Start difference. First operand has 265 places, 288 transitions, 797 flow. Second operand 3 states and 1254 transitions. [2024-11-12 12:24:21,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 295 transitions, 925 flow [2024-11-12 12:24:21,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 295 transitions, 897 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:24:21,765 INFO L231 Difference]: Finished difference. Result has 267 places, 292 transitions, 843 flow [2024-11-12 12:24:21,766 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=470, PETRI_DIFFERENCE_MINUEND_FLOW=773, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=843, PETRI_PLACES=267, PETRI_TRANSITIONS=292} [2024-11-12 12:24:21,767 INFO L279 CegarLoopForPetriNet]: 303 programPoint places, -36 predicate places. [2024-11-12 12:24:21,767 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 292 transitions, 843 flow [2024-11-12 12:24:21,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 411.3333333333333) internal successors, (1234), 3 states have internal predecessors, (1234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:24:21,768 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:24:21,769 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:24:21,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 12:24:21,769 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread_usbErr5ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-11-12 12:24:21,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:24:21,770 INFO L85 PathProgramCache]: Analyzing trace with hash -883329259, now seen corresponding path program 1 times [2024-11-12 12:24:21,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:24:21,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199733741] [2024-11-12 12:24:21,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:24:21,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:24:21,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:24:21,852 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-12 12:24:21,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:24:21,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199733741] [2024-11-12 12:24:21,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199733741] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:24:21,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:24:21,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:24:21,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613223994] [2024-11-12 12:24:21,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:24:21,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:24:21,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:24:21,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:24:21,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:24:21,874 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 422 out of 470 [2024-11-12 12:24:21,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 292 transitions, 843 flow. Second operand has 3 states, 3 states have (on average 423.0) internal successors, (1269), 3 states have internal predecessors, (1269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:24:21,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:24:21,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 422 of 470 [2024-11-12 12:24:21,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:24:22,047 INFO L124 PetriNetUnfolderBase]: 152/1466 cut-off events. [2024-11-12 12:24:22,047 INFO L125 PetriNetUnfolderBase]: For 403/445 co-relation queries the response was YES. [2024-11-12 12:24:22,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2102 conditions, 1466 events. 152/1466 cut-off events. For 403/445 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 8367 event pairs, 16 based on Foata normal form. 2/1323 useless extension candidates. Maximal degree in co-relation 2023. Up to 104 conditions per place. [2024-11-12 12:24:22,062 INFO L140 encePairwiseOnDemand]: 467/470 looper letters, 11 selfloop transitions, 2 changer transitions 2/296 dead transitions. [2024-11-12 12:24:22,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 296 transitions, 882 flow [2024-11-12 12:24:22,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:24:22,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:24:22,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1282 transitions. [2024-11-12 12:24:22,065 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9092198581560283 [2024-11-12 12:24:22,065 INFO L175 Difference]: Start difference. First operand has 267 places, 292 transitions, 843 flow. Second operand 3 states and 1282 transitions. [2024-11-12 12:24:22,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 296 transitions, 882 flow [2024-11-12 12:24:22,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 296 transitions, 858 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-11-12 12:24:22,072 INFO L231 Difference]: Finished difference. Result has 267 places, 292 transitions, 827 flow [2024-11-12 12:24:22,073 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=470, PETRI_DIFFERENCE_MINUEND_FLOW=817, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=827, PETRI_PLACES=267, PETRI_TRANSITIONS=292} [2024-11-12 12:24:22,074 INFO L279 CegarLoopForPetriNet]: 303 programPoint places, -36 predicate places. [2024-11-12 12:24:22,074 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 292 transitions, 827 flow [2024-11-12 12:24:22,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 423.0) internal successors, (1269), 3 states have internal predecessors, (1269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:24:22,075 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:24:22,075 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:24:22,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 12:24:22,075 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread_usbErr10ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-11-12 12:24:22,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:24:22,076 INFO L85 PathProgramCache]: Analyzing trace with hash -12439881, now seen corresponding path program 1 times [2024-11-12 12:24:22,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:24:22,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768015340] [2024-11-12 12:24:22,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:24:22,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:24:22,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:24:22,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:24:22,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:24:22,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768015340] [2024-11-12 12:24:22,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768015340] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:24:22,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:24:22,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:24:22,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117607656] [2024-11-12 12:24:22,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:24:22,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 12:24:22,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:24:22,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 12:24:22,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 12:24:22,229 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 419 out of 470 [2024-11-12 12:24:22,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 292 transitions, 827 flow. Second operand has 5 states, 5 states have (on average 421.4) internal successors, (2107), 5 states have internal predecessors, (2107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:24:22,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:24:22,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 419 of 470 [2024-11-12 12:24:22,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:24:22,654 INFO L124 PetriNetUnfolderBase]: 342/2848 cut-off events. [2024-11-12 12:24:22,654 INFO L125 PetriNetUnfolderBase]: For 575/629 co-relation queries the response was YES. [2024-11-12 12:24:22,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4104 conditions, 2848 events. 342/2848 cut-off events. For 575/629 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 20705 event pairs, 32 based on Foata normal form. 4/2571 useless extension candidates. Maximal degree in co-relation 4024. Up to 205 conditions per place. [2024-11-12 12:24:22,685 INFO L140 encePairwiseOnDemand]: 462/470 looper letters, 32 selfloop transitions, 8 changer transitions 0/314 dead transitions. [2024-11-12 12:24:22,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 314 transitions, 958 flow [2024-11-12 12:24:22,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 12:24:22,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-12 12:24:22,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2974 transitions. [2024-11-12 12:24:22,691 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.903951367781155 [2024-11-12 12:24:22,692 INFO L175 Difference]: Start difference. First operand has 267 places, 292 transitions, 827 flow. Second operand 7 states and 2974 transitions. [2024-11-12 12:24:22,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 314 transitions, 958 flow [2024-11-12 12:24:22,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 314 transitions, 956 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:24:22,699 INFO L231 Difference]: Finished difference. Result has 277 places, 299 transitions, 883 flow [2024-11-12 12:24:22,701 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=470, PETRI_DIFFERENCE_MINUEND_FLOW=825, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=883, PETRI_PLACES=277, PETRI_TRANSITIONS=299} [2024-11-12 12:24:22,702 INFO L279 CegarLoopForPetriNet]: 303 programPoint places, -26 predicate places. [2024-11-12 12:24:22,702 INFO L471 AbstractCegarLoop]: Abstraction has has 277 places, 299 transitions, 883 flow [2024-11-12 12:24:22,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 421.4) internal successors, (2107), 5 states have internal predecessors, (2107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:24:22,704 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:24:22,704 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:24:22,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-12 12:24:22,704 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread_usbErr10ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-11-12 12:24:22,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:24:22,705 INFO L85 PathProgramCache]: Analyzing trace with hash -997250345, now seen corresponding path program 1 times [2024-11-12 12:24:22,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:24:22,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389494291] [2024-11-12 12:24:22,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:24:22,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:24:22,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:24:22,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:24:22,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:24:22,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389494291] [2024-11-12 12:24:22,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389494291] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:24:22,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:24:22,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:24:22,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355920042] [2024-11-12 12:24:22,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:24:22,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 12:24:22,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:24:22,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 12:24:22,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 12:24:22,878 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 421 out of 470 [2024-11-12 12:24:22,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 299 transitions, 883 flow. Second operand has 5 states, 5 states have (on average 423.0) internal successors, (2115), 5 states have internal predecessors, (2115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:24:22,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:24:22,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 421 of 470 [2024-11-12 12:24:22,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:24:23,694 INFO L124 PetriNetUnfolderBase]: 583/5262 cut-off events. [2024-11-12 12:24:23,694 INFO L125 PetriNetUnfolderBase]: For 1222/1354 co-relation queries the response was YES. [2024-11-12 12:24:23,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7736 conditions, 5262 events. 583/5262 cut-off events. For 1222/1354 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 46682 event pairs, 50 based on Foata normal form. 10/4768 useless extension candidates. Maximal degree in co-relation 7652. Up to 424 conditions per place. [2024-11-12 12:24:23,737 INFO L140 encePairwiseOnDemand]: 463/470 looper letters, 34 selfloop transitions, 9 changer transitions 0/326 dead transitions. [2024-11-12 12:24:23,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 326 transitions, 1034 flow [2024-11-12 12:24:23,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 12:24:23,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-12 12:24:23,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2991 transitions. [2024-11-12 12:24:23,743 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9091185410334347 [2024-11-12 12:24:23,743 INFO L175 Difference]: Start difference. First operand has 277 places, 299 transitions, 883 flow. Second operand 7 states and 2991 transitions. [2024-11-12 12:24:23,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 326 transitions, 1034 flow [2024-11-12 12:24:23,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 326 transitions, 1034 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-12 12:24:23,752 INFO L231 Difference]: Finished difference. Result has 289 places, 307 transitions, 951 flow [2024-11-12 12:24:23,753 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=470, PETRI_DIFFERENCE_MINUEND_FLOW=883, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=951, PETRI_PLACES=289, PETRI_TRANSITIONS=307} [2024-11-12 12:24:23,754 INFO L279 CegarLoopForPetriNet]: 303 programPoint places, -14 predicate places. [2024-11-12 12:24:23,755 INFO L471 AbstractCegarLoop]: Abstraction has has 289 places, 307 transitions, 951 flow [2024-11-12 12:24:23,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 423.0) internal successors, (2115), 5 states have internal predecessors, (2115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:24:23,757 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:24:23,757 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:24:23,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-12 12:24:23,757 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread_usbThread1of1ForFork0Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-11-12 12:24:23,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:24:23,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1718529893, now seen corresponding path program 1 times [2024-11-12 12:24:23,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:24:23,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028900279] [2024-11-12 12:24:23,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:24:23,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:24:23,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:24:23,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:24:23,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:24:23,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028900279] [2024-11-12 12:24:23,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028900279] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:24:23,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:24:23,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 12:24:23,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238306488] [2024-11-12 12:24:23,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:24:23,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:24:23,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:24:23,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:24:23,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:24:23,901 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 470 [2024-11-12 12:24:23,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 307 transitions, 951 flow. Second operand has 3 states, 3 states have (on average 418.3333333333333) internal successors, (1255), 3 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:24:23,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:24:23,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 470 [2024-11-12 12:24:23,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:24:24,055 INFO L124 PetriNetUnfolderBase]: 62/832 cut-off events. [2024-11-12 12:24:24,055 INFO L125 PetriNetUnfolderBase]: For 94/94 co-relation queries the response was YES. [2024-11-12 12:24:24,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1144 conditions, 832 events. 62/832 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2659 event pairs, 0 based on Foata normal form. 21/782 useless extension candidates. Maximal degree in co-relation 1053. Up to 54 conditions per place. [2024-11-12 12:24:24,063 INFO L140 encePairwiseOnDemand]: 465/470 looper letters, 13 selfloop transitions, 2 changer transitions 55/272 dead transitions. [2024-11-12 12:24:24,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 272 transitions, 776 flow [2024-11-12 12:24:24,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:24:24,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:24:24,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1267 transitions. [2024-11-12 12:24:24,067 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.898581560283688 [2024-11-12 12:24:24,067 INFO L175 Difference]: Start difference. First operand has 289 places, 307 transitions, 951 flow. Second operand 3 states and 1267 transitions. [2024-11-12 12:24:24,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 272 transitions, 776 flow [2024-11-12 12:24:24,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 272 transitions, 714 flow, removed 13 selfloop flow, removed 10 redundant places. [2024-11-12 12:24:24,076 INFO L231 Difference]: Finished difference. Result has 275 places, 215 transitions, 543 flow [2024-11-12 12:24:24,076 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=470, PETRI_DIFFERENCE_MINUEND_FLOW=678, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=543, PETRI_PLACES=275, PETRI_TRANSITIONS=215} [2024-11-12 12:24:24,077 INFO L279 CegarLoopForPetriNet]: 303 programPoint places, -28 predicate places. [2024-11-12 12:24:24,077 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 215 transitions, 543 flow [2024-11-12 12:24:24,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 418.3333333333333) internal successors, (1255), 3 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:24:24,079 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:24:24,079 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:24:24,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-12 12:24:24,080 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread_usbErr6ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-11-12 12:24:24,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:24:24,081 INFO L85 PathProgramCache]: Analyzing trace with hash -2096826464, now seen corresponding path program 1 times [2024-11-12 12:24:24,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:24:24,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853852646] [2024-11-12 12:24:24,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:24:24,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:24:24,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:24:24,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-11-12 12:24:24,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:24:24,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853852646] [2024-11-12 12:24:24,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853852646] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:24:24,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:24:24,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:24:24,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228063554] [2024-11-12 12:24:24,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:24:24,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:24:24,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:24:24,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:24:24,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:24:24,233 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 470 [2024-11-12 12:24:24,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 215 transitions, 543 flow. Second operand has 3 states, 3 states have (on average 418.3333333333333) internal successors, (1255), 3 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:24:24,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:24:24,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 470 [2024-11-12 12:24:24,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:24:24,344 INFO L124 PetriNetUnfolderBase]: 46/545 cut-off events. [2024-11-12 12:24:24,344 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2024-11-12 12:24:24,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 721 conditions, 545 events. 46/545 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1383 event pairs, 8 based on Foata normal form. 0/498 useless extension candidates. Maximal degree in co-relation 635. Up to 60 conditions per place. [2024-11-12 12:24:24,352 INFO L140 encePairwiseOnDemand]: 467/470 looper letters, 16 selfloop transitions, 2 changer transitions 0/214 dead transitions. [2024-11-12 12:24:24,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 214 transitions, 577 flow [2024-11-12 12:24:24,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:24:24,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:24:24,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1261 transitions. [2024-11-12 12:24:24,356 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8943262411347518 [2024-11-12 12:24:24,357 INFO L175 Difference]: Start difference. First operand has 275 places, 215 transitions, 543 flow. Second operand 3 states and 1261 transitions. [2024-11-12 12:24:24,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 214 transitions, 577 flow [2024-11-12 12:24:24,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 214 transitions, 540 flow, removed 3 selfloop flow, removed 15 redundant places. [2024-11-12 12:24:24,363 INFO L231 Difference]: Finished difference. Result has 218 places, 214 transitions, 508 flow [2024-11-12 12:24:24,363 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=470, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=508, PETRI_PLACES=218, PETRI_TRANSITIONS=214} [2024-11-12 12:24:24,364 INFO L279 CegarLoopForPetriNet]: 303 programPoint places, -85 predicate places. [2024-11-12 12:24:24,364 INFO L471 AbstractCegarLoop]: Abstraction has has 218 places, 214 transitions, 508 flow [2024-11-12 12:24:24,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 418.3333333333333) internal successors, (1255), 3 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:24:24,365 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:24:24,366 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:24:24,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-12 12:24:24,366 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread_usbErr7ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-11-12 12:24:24,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:24:24,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1992004148, now seen corresponding path program 1 times [2024-11-12 12:24:24,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:24:24,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844735164] [2024-11-12 12:24:24,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:24:24,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:24:24,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:24:24,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:24:24,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:24:24,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844735164] [2024-11-12 12:24:24,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844735164] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:24:24,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:24:24,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:24:24,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132617319] [2024-11-12 12:24:24,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:24:24,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:24:24,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:24:24,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:24:24,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:24:24,539 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 410 out of 470 [2024-11-12 12:24:24,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 214 transitions, 508 flow. Second operand has 3 states, 3 states have (on average 412.6666666666667) internal successors, (1238), 3 states have internal predecessors, (1238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:24:24,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:24:24,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 410 of 470 [2024-11-12 12:24:24,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:24:24,604 INFO L124 PetriNetUnfolderBase]: 22/376 cut-off events. [2024-11-12 12:24:24,604 INFO L125 PetriNetUnfolderBase]: For 4/8 co-relation queries the response was YES. [2024-11-12 12:24:24,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 465 conditions, 376 events. 22/376 cut-off events. For 4/8 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 453 event pairs, 0 based on Foata normal form. 0/350 useless extension candidates. Maximal degree in co-relation 384. Up to 19 conditions per place. [2024-11-12 12:24:24,608 INFO L140 encePairwiseOnDemand]: 467/470 looper letters, 0 selfloop transitions, 0 changer transitions 213/213 dead transitions. [2024-11-12 12:24:24,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 213 transitions, 536 flow [2024-11-12 12:24:24,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:24:24,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:24:24,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1246 transitions. [2024-11-12 12:24:24,612 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8836879432624114 [2024-11-12 12:24:24,612 INFO L175 Difference]: Start difference. First operand has 218 places, 214 transitions, 508 flow. Second operand 3 states and 1246 transitions. [2024-11-12 12:24:24,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 213 transitions, 536 flow [2024-11-12 12:24:24,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 213 transitions, 532 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:24:24,616 INFO L231 Difference]: Finished difference. Result has 217 places, 0 transitions, 0 flow [2024-11-12 12:24:24,616 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=470, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=217, PETRI_TRANSITIONS=0} [2024-11-12 12:24:24,617 INFO L279 CegarLoopForPetriNet]: 303 programPoint places, -86 predicate places. [2024-11-12 12:24:24,617 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 0 transitions, 0 flow [2024-11-12 12:24:24,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 412.6666666666667) internal successors, (1238), 3 states have internal predecessors, (1238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:24:24,621 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE (38 of 39 remaining) [2024-11-12 12:24:24,621 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE (37 of 39 remaining) [2024-11-12 12:24:24,622 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (36 of 39 remaining) [2024-11-12 12:24:24,622 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (35 of 39 remaining) [2024-11-12 12:24:24,622 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (34 of 39 remaining) [2024-11-12 12:24:24,622 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (33 of 39 remaining) [2024-11-12 12:24:24,622 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (32 of 39 remaining) [2024-11-12 12:24:24,623 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (31 of 39 remaining) [2024-11-12 12:24:24,623 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (30 of 39 remaining) [2024-11-12 12:24:24,623 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (29 of 39 remaining) [2024-11-12 12:24:24,623 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 39 remaining) [2024-11-12 12:24:24,623 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr0ASSERT_VIOLATIONDATA_RACE (27 of 39 remaining) [2024-11-12 12:24:24,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr10ASSERT_VIOLATIONDATA_RACE (26 of 39 remaining) [2024-11-12 12:24:24,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr1ASSERT_VIOLATIONDATA_RACE (25 of 39 remaining) [2024-11-12 12:24:24,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr11ASSERT_VIOLATIONDATA_RACE (24 of 39 remaining) [2024-11-12 12:24:24,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr4ASSERT_VIOLATIONDATA_RACE (23 of 39 remaining) [2024-11-12 12:24:24,625 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr9ASSERT_VIOLATIONDATA_RACE (22 of 39 remaining) [2024-11-12 12:24:24,625 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr5ASSERT_VIOLATIONDATA_RACE (21 of 39 remaining) [2024-11-12 12:24:24,625 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr2ASSERT_VIOLATIONDATA_RACE (20 of 39 remaining) [2024-11-12 12:24:24,625 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr6ASSERT_VIOLATIONDATA_RACE (19 of 39 remaining) [2024-11-12 12:24:24,625 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr7ASSERT_VIOLATIONDATA_RACE (18 of 39 remaining) [2024-11-12 12:24:24,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr8ASSERT_VIOLATIONDATA_RACE (17 of 39 remaining) [2024-11-12 12:24:24,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr3ASSERT_VIOLATIONDATA_RACE (16 of 39 remaining) [2024-11-12 12:24:24,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 39 remaining) [2024-11-12 12:24:24,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE (14 of 39 remaining) [2024-11-12 12:24:24,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE (13 of 39 remaining) [2024-11-12 12:24:24,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr0ASSERT_VIOLATIONDATA_RACE (12 of 39 remaining) [2024-11-12 12:24:24,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr10ASSERT_VIOLATIONDATA_RACE (11 of 39 remaining) [2024-11-12 12:24:24,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr1ASSERT_VIOLATIONDATA_RACE (10 of 39 remaining) [2024-11-12 12:24:24,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr11ASSERT_VIOLATIONDATA_RACE (9 of 39 remaining) [2024-11-12 12:24:24,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr4ASSERT_VIOLATIONDATA_RACE (8 of 39 remaining) [2024-11-12 12:24:24,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr9ASSERT_VIOLATIONDATA_RACE (7 of 39 remaining) [2024-11-12 12:24:24,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr5ASSERT_VIOLATIONDATA_RACE (6 of 39 remaining) [2024-11-12 12:24:24,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr2ASSERT_VIOLATIONDATA_RACE (5 of 39 remaining) [2024-11-12 12:24:24,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr6ASSERT_VIOLATIONDATA_RACE (4 of 39 remaining) [2024-11-12 12:24:24,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr7ASSERT_VIOLATIONDATA_RACE (3 of 39 remaining) [2024-11-12 12:24:24,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr8ASSERT_VIOLATIONDATA_RACE (2 of 39 remaining) [2024-11-12 12:24:24,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr3ASSERT_VIOLATIONDATA_RACE (1 of 39 remaining) [2024-11-12 12:24:24,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbThread1of1ForFork0Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 39 remaining) [2024-11-12 12:24:24,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-12 12:24:24,630 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:24:24,636 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-12 12:24:24,637 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 12:24:24,642 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 12:24:24 BasicIcfg [2024-11-12 12:24:24,642 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 12:24:24,643 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 12:24:24,643 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 12:24:24,643 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 12:24:24,643 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:24:16" (3/4) ... [2024-11-12 12:24:24,645 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-12 12:24:24,649 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread_ath9k [2024-11-12 12:24:24,649 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread_usb [2024-11-12 12:24:24,654 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-12 12:24:24,654 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-12 12:24:24,655 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-12 12:24:24,655 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-12 12:24:24,764 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 12:24:24,764 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-12 12:24:24,764 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 12:24:24,765 INFO L158 Benchmark]: Toolchain (without parser) took 10632.48ms. Allocated memory was 159.4MB in the beginning and 547.4MB in the end (delta: 388.0MB). Free memory was 101.7MB in the beginning and 329.3MB in the end (delta: -227.6MB). Peak memory consumption was 162.5MB. Max. memory is 16.1GB. [2024-11-12 12:24:24,765 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 159.4MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 12:24:24,766 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1166.92ms. Allocated memory was 159.4MB in the beginning and 230.7MB in the end (delta: 71.3MB). Free memory was 101.3MB in the beginning and 193.7MB in the end (delta: -92.4MB). Peak memory consumption was 79.9MB. Max. memory is 16.1GB. [2024-11-12 12:24:24,766 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.84ms. Allocated memory is still 230.7MB. Free memory was 193.7MB in the beginning and 190.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 12:24:24,767 INFO L158 Benchmark]: Boogie Preprocessor took 50.07ms. Allocated memory is still 230.7MB. Free memory was 190.6MB in the beginning and 187.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 12:24:24,767 INFO L158 Benchmark]: RCFGBuilder took 787.78ms. Allocated memory is still 230.7MB. Free memory was 187.4MB in the beginning and 154.9MB in the end (delta: 32.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-12 12:24:24,767 INFO L158 Benchmark]: TraceAbstraction took 8418.49ms. Allocated memory was 230.7MB in the beginning and 547.4MB in the end (delta: 316.7MB). Free memory was 153.9MB in the beginning and 335.6MB in the end (delta: -181.7MB). Peak memory consumption was 134.9MB. Max. memory is 16.1GB. [2024-11-12 12:24:24,768 INFO L158 Benchmark]: Witness Printer took 121.74ms. Allocated memory is still 547.4MB. Free memory was 335.6MB in the beginning and 329.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 12:24:24,769 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.19ms. Allocated memory is still 159.4MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1166.92ms. Allocated memory was 159.4MB in the beginning and 230.7MB in the end (delta: 71.3MB). Free memory was 101.3MB in the beginning and 193.7MB in the end (delta: -92.4MB). Peak memory consumption was 79.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.84ms. Allocated memory is still 230.7MB. Free memory was 193.7MB in the beginning and 190.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.07ms. Allocated memory is still 230.7MB. Free memory was 190.6MB in the beginning and 187.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 787.78ms. Allocated memory is still 230.7MB. Free memory was 187.4MB in the beginning and 154.9MB in the end (delta: 32.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 8418.49ms. Allocated memory was 230.7MB in the beginning and 547.4MB in the end (delta: 316.7MB). Free memory was 153.9MB in the beginning and 335.6MB in the end (delta: -181.7MB). Peak memory consumption was 134.9MB. Max. memory is 16.1GB. * Witness Printer took 121.74ms. Allocated memory is still 547.4MB. Free memory was 335.6MB in the beginning and 329.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1699]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1700]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1777]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1778]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1783]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1780]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1784]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1790]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1792]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1793]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1743]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1771]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1748]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1772]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1756]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1764]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1725]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1718]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1758]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1759]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1760]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1752]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 477 locations, 39 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.2s, OverallIterations: 19, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1199 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 449 mSDsluCounter, 203 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 52 mSDsCounter, 86 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1252 IncrementalHoareTripleChecker+Invalid, 1338 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 86 mSolverCounterUnsat, 151 mSDtfsCounter, 1252 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=951occurred in iteration=16, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1535 NumberOfCodeBlocks, 1535 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1516 ConstructedInterpolants, 0 QuantifiedInterpolants, 1632 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 5/5 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 22 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-12 12:24:24,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE