./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 023d838f 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-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 14:24:03,046 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 14:24:03,125 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-10 14:24:03,132 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 14:24:03,134 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 14:24:03,159 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 14:24:03,160 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 14:24:03,160 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 14:24:03,161 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 14:24:03,162 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 14:24:03,164 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 14:24:03,164 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 14:24:03,164 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 14:24:03,166 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 14:24:03,166 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 14:24:03,166 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 14:24:03,167 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 14:24:03,167 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 14:24:03,167 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 14:24:03,168 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 14:24:03,168 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 14:24:03,172 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 14:24:03,172 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-10 14:24:03,173 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 14:24:03,173 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 14:24:03,173 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 14:24:03,173 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 14:24:03,173 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 14:24:03,174 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 14:24:03,174 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 14:24:03,174 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 14:24:03,174 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:24:03,174 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 14:24:03,175 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 14:24:03,175 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 14:24:03,176 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 14:24:03,176 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 14:24:03,177 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 14:24:03,177 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 14:24:03,177 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 14:24:03,178 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 14:24:03,178 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-10 14:24:03,518 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 14:24:03,545 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 14:24:03,549 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 14:24:03,550 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 14:24:03,551 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 14:24:03,552 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-10 14:24:05,089 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 14:24:05,430 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 14:24:05,430 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-4_1-thread_local_vars.i [2024-11-10 14:24:05,456 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c5b6edda/93089560a9e34d78a0c5477bcc9160f9/FLAG14ea805b4 [2024-11-10 14:24:05,472 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c5b6edda/93089560a9e34d78a0c5477bcc9160f9 [2024-11-10 14:24:05,476 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 14:24:05,478 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 14:24:05,480 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 14:24:05,481 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 14:24:05,487 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 14:24:05,488 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:24:05" (1/1) ... [2024-11-10 14:24:05,489 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3209a57c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:24:05, skipping insertion in model container [2024-11-10 14:24:05,491 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:24:05" (1/1) ... [2024-11-10 14:24:05,552 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 14:24:06,342 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:24:06,368 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 14:24:06,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:24:06,527 INFO L204 MainTranslator]: Completed translation [2024-11-10 14:24:06,528 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:24:06 WrapperNode [2024-11-10 14:24:06,528 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 14:24:06,529 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 14:24:06,529 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 14:24:06,529 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 14:24:06,535 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:24:06" (1/1) ... [2024-11-10 14:24:06,587 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:24:06" (1/1) ... [2024-11-10 14:24:06,635 INFO L138 Inliner]: procedures = 487, calls = 37, calls flagged for inlining = 16, calls inlined = 21, statements flattened = 278 [2024-11-10 14:24:06,636 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 14:24:06,636 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 14:24:06,637 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 14:24:06,637 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 14:24:06,645 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:24:06" (1/1) ... [2024-11-10 14:24:06,646 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:24:06" (1/1) ... [2024-11-10 14:24:06,656 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:24:06" (1/1) ... [2024-11-10 14:24:06,659 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:24:06" (1/1) ... [2024-11-10 14:24:06,679 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:24:06" (1/1) ... [2024-11-10 14:24:06,684 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:24:06" (1/1) ... [2024-11-10 14:24:06,692 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:24:06" (1/1) ... [2024-11-10 14:24:06,698 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:24:06" (1/1) ... [2024-11-10 14:24:06,709 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 14:24:06,710 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 14:24:06,710 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 14:24:06,710 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 14:24:06,711 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:24:06" (1/1) ... [2024-11-10 14:24:06,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:24:06,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:24:06,760 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-10 14:24:06,762 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-10 14:24:06,857 INFO L130 BoogieDeclarations]: Found specification of procedure thread_usb [2024-11-10 14:24:06,857 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_usb [2024-11-10 14:24:06,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 14:24:06,857 INFO L130 BoogieDeclarations]: Found specification of procedure thread_ath9k [2024-11-10 14:24:06,858 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_ath9k [2024-11-10 14:24:06,858 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-10 14:24:06,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 14:24:06,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-10 14:24:06,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 14:24:06,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 14:24:06,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 14:24:06,862 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-10 14:24:06,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-10 14:24:06,863 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 14:24:07,195 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 14:24:07,196 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 14:24:07,634 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1724: havoc ieee80211_deregister_hw_~#status~0#1.base, ieee80211_deregister_hw_~#status~0#1.offset; [2024-11-10 14:24:07,634 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1724-1: SUMMARY for call ULTIMATE.dealloc(ieee80211_deregister_hw_~#status~0#1.base, ieee80211_deregister_hw_~#status~0#1.offset); srcloc: null [2024-11-10 14:24:07,636 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 14:24:07,636 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 14:24:07,679 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 14:24:07,681 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 14:24:07,681 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:24:07 BoogieIcfgContainer [2024-11-10 14:24:07,682 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 14:24:07,683 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 14:24:07,685 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 14:24:07,688 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 14:24:07,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:24:05" (1/3) ... [2024-11-10 14:24:07,689 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e3b8edb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:24:07, skipping insertion in model container [2024-11-10 14:24:07,689 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:24:06" (2/3) ... [2024-11-10 14:24:07,690 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e3b8edb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:24:07, skipping insertion in model container [2024-11-10 14:24:07,690 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:24:07" (3/3) ... [2024-11-10 14:24:07,692 INFO L112 eAbstractionObserver]: Analyzing ICFG race-4_1-thread_local_vars.i [2024-11-10 14:24:07,709 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 14:24:07,712 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2024-11-10 14:24:07,712 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 14:24:07,822 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2024-11-10 14:24:07,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 435 places, 473 transitions, 973 flow [2024-11-10 14:24:08,035 INFO L124 PetriNetUnfolderBase]: 41/479 cut-off events. [2024-11-10 14:24:08,035 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-10 14:24:08,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 490 conditions, 479 events. 41/479 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1288 event pairs, 0 based on Foata normal form. 0/400 useless extension candidates. Maximal degree in co-relation 326. Up to 11 conditions per place. [2024-11-10 14:24:08,046 INFO L82 GeneralOperation]: Start removeDead. Operand has 435 places, 473 transitions, 973 flow [2024-11-10 14:24:08,059 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 305 places, 328 transitions, 672 flow [2024-11-10 14:24:08,072 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:24:08,081 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;@744829f9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:24:08,081 INFO L334 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2024-11-10 14:24:08,087 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:24:08,088 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2024-11-10 14:24:08,088 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:24:08,088 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:24:08,089 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:24:08,090 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-11-10 14:24:08,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:24:08,121 INFO L85 PathProgramCache]: Analyzing trace with hash -595887298, now seen corresponding path program 1 times [2024-11-10 14:24:08,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:24:08,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819418923] [2024-11-10 14:24:08,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:24:08,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:24:08,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:24:08,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-10 14:24:08,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:24:08,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819418923] [2024-11-10 14:24:08,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819418923] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:24:08,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:24:08,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:24:08,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479808513] [2024-11-10 14:24:08,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:24:08,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:24:08,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:24:08,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:24:08,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:24:08,748 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 473 [2024-11-10 14:24:08,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 328 transitions, 672 flow. Second operand has 3 states, 3 states have (on average 412.3333333333333) internal successors, (1237), 3 states have internal predecessors, (1237), 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-10 14:24:08,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:24:08,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 473 [2024-11-10 14:24:08,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:24:08,972 INFO L124 PetriNetUnfolderBase]: 82/956 cut-off events. [2024-11-10 14:24:08,972 INFO L125 PetriNetUnfolderBase]: For 27/35 co-relation queries the response was YES. [2024-11-10 14:24:08,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1102 conditions, 956 events. 82/956 cut-off events. For 27/35 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 4863 event pairs, 48 based on Foata normal form. 92/912 useless extension candidates. Maximal degree in co-relation 772. Up to 125 conditions per place. [2024-11-10 14:24:08,990 INFO L140 encePairwiseOnDemand]: 454/473 looper letters, 22 selfloop transitions, 2 changer transitions 6/299 dead transitions. [2024-11-10 14:24:08,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 299 transitions, 662 flow [2024-11-10 14:24:08,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:24:08,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:24:09,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1274 transitions. [2024-11-10 14:24:09,014 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.897815362931642 [2024-11-10 14:24:09,019 INFO L175 Difference]: Start difference. First operand has 305 places, 328 transitions, 672 flow. Second operand 3 states and 1274 transitions. [2024-11-10 14:24:09,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 299 transitions, 662 flow [2024-11-10 14:24:09,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 299 transitions, 658 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:24:09,034 INFO L231 Difference]: Finished difference. Result has 292 places, 293 transitions, 602 flow [2024-11-10 14:24:09,038 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=610, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=602, PETRI_PLACES=292, PETRI_TRANSITIONS=293} [2024-11-10 14:24:09,042 INFO L277 CegarLoopForPetriNet]: 305 programPoint places, -13 predicate places. [2024-11-10 14:24:09,045 INFO L471 AbstractCegarLoop]: Abstraction has has 292 places, 293 transitions, 602 flow [2024-11-10 14:24:09,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 412.3333333333333) internal successors, (1237), 3 states have internal predecessors, (1237), 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-10 14:24:09,047 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:24:09,047 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:24:09,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 14:24:09,047 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-11-10 14:24:09,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:24:09,048 INFO L85 PathProgramCache]: Analyzing trace with hash -978320446, now seen corresponding path program 1 times [2024-11-10 14:24:09,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:24:09,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106502447] [2024-11-10 14:24:09,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:24:09,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:24:09,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:24:09,202 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-10 14:24:09,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:24:09,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106502447] [2024-11-10 14:24:09,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106502447] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:24:09,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:24:09,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:24:09,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057662467] [2024-11-10 14:24:09,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:24:09,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:24:09,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:24:09,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:24:09,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:24:09,292 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 401 out of 473 [2024-11-10 14:24:09,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 293 transitions, 602 flow. Second operand has 3 states, 3 states have (on average 402.0) internal successors, (1206), 3 states have internal predecessors, (1206), 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-10 14:24:09,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:24:09,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 401 of 473 [2024-11-10 14:24:09,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:24:09,452 INFO L124 PetriNetUnfolderBase]: 83/962 cut-off events. [2024-11-10 14:24:09,452 INFO L125 PetriNetUnfolderBase]: For 19/24 co-relation queries the response was YES. [2024-11-10 14:24:09,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1126 conditions, 962 events. 83/962 cut-off events. For 19/24 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4857 event pairs, 21 based on Foata normal form. 1/849 useless extension candidates. Maximal degree in co-relation 1092. Up to 112 conditions per place. [2024-11-10 14:24:09,463 INFO L140 encePairwiseOnDemand]: 453/473 looper letters, 26 selfloop transitions, 14 changer transitions 0/302 dead transitions. [2024-11-10 14:24:09,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 302 transitions, 701 flow [2024-11-10 14:24:09,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:24:09,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:24:09,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1249 transitions. [2024-11-10 14:24:09,468 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8801973220577872 [2024-11-10 14:24:09,468 INFO L175 Difference]: Start difference. First operand has 292 places, 293 transitions, 602 flow. Second operand 3 states and 1249 transitions. [2024-11-10 14:24:09,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 302 transitions, 701 flow [2024-11-10 14:24:09,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 302 transitions, 697 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:24:09,479 INFO L231 Difference]: Finished difference. Result has 285 places, 299 transitions, 690 flow [2024-11-10 14:24:09,480 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=592, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=690, PETRI_PLACES=285, PETRI_TRANSITIONS=299} [2024-11-10 14:24:09,481 INFO L277 CegarLoopForPetriNet]: 305 programPoint places, -20 predicate places. [2024-11-10 14:24:09,481 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 299 transitions, 690 flow [2024-11-10 14:24:09,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 402.0) internal successors, (1206), 3 states have internal predecessors, (1206), 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-10 14:24:09,483 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:24:09,484 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:24:09,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 14:24:09,484 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-11-10 14:24:09,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:24:09,485 INFO L85 PathProgramCache]: Analyzing trace with hash -2048151489, now seen corresponding path program 1 times [2024-11-10 14:24:09,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:24:09,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983593495] [2024-11-10 14:24:09,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:24:09,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:24:09,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:24:09,582 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-10 14:24:09,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:24:09,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983593495] [2024-11-10 14:24:09,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983593495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:24:09,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:24:09,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:24:09,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277195831] [2024-11-10 14:24:09,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:24:09,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:24:09,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:24:09,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:24:09,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:24:09,677 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 473 [2024-11-10 14:24:09,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 299 transitions, 690 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-10 14:24:09,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:24:09,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 473 [2024-11-10 14:24:09,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:24:09,886 INFO L124 PetriNetUnfolderBase]: 137/1414 cut-off events. [2024-11-10 14:24:09,887 INFO L125 PetriNetUnfolderBase]: For 280/318 co-relation queries the response was YES. [2024-11-10 14:24:09,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1867 conditions, 1414 events. 137/1414 cut-off events. For 280/318 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 8837 event pairs, 61 based on Foata normal form. 0/1242 useless extension candidates. Maximal degree in co-relation 1457. Up to 203 conditions per place. [2024-11-10 14:24:09,900 INFO L140 encePairwiseOnDemand]: 470/473 looper letters, 28 selfloop transitions, 2 changer transitions 0/298 dead transitions. [2024-11-10 14:24:09,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 298 transitions, 748 flow [2024-11-10 14:24:09,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:24:09,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:24:09,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1258 transitions. [2024-11-10 14:24:09,904 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8865398167723749 [2024-11-10 14:24:09,904 INFO L175 Difference]: Start difference. First operand has 285 places, 299 transitions, 690 flow. Second operand 3 states and 1258 transitions. [2024-11-10 14:24:09,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 298 transitions, 748 flow [2024-11-10 14:24:09,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 298 transitions, 720 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:24:09,911 INFO L231 Difference]: Finished difference. Result has 284 places, 298 transitions, 664 flow [2024-11-10 14:24:09,912 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=660, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=664, PETRI_PLACES=284, PETRI_TRANSITIONS=298} [2024-11-10 14:24:09,912 INFO L277 CegarLoopForPetriNet]: 305 programPoint places, -21 predicate places. [2024-11-10 14:24:09,913 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 298 transitions, 664 flow [2024-11-10 14:24:09,914 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-10 14:24:09,914 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:24:09,914 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:24:09,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 14:24:09,914 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-11-10 14:24:09,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:24:09,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1357785114, now seen corresponding path program 1 times [2024-11-10 14:24:09,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:24:09,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273482779] [2024-11-10 14:24:09,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:24:09,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:24:09,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:24:09,980 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-10 14:24:09,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:24:09,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273482779] [2024-11-10 14:24:09,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273482779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:24:09,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:24:09,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:24:09,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923832760] [2024-11-10 14:24:09,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:24:09,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:24:09,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:24:09,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:24:09,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:24:09,996 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 425 out of 473 [2024-11-10 14:24:09,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 298 transitions, 664 flow. Second operand has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 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-10 14:24:09,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:24:09,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 425 of 473 [2024-11-10 14:24:09,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:24:10,200 INFO L124 PetriNetUnfolderBase]: 99/1149 cut-off events. [2024-11-10 14:24:10,201 INFO L125 PetriNetUnfolderBase]: For 32/63 co-relation queries the response was YES. [2024-11-10 14:24:10,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1380 conditions, 1149 events. 99/1149 cut-off events. For 32/63 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 6755 event pairs, 9 based on Foata normal form. 4/1000 useless extension candidates. Maximal degree in co-relation 1341. Up to 98 conditions per place. [2024-11-10 14:24:10,212 INFO L140 encePairwiseOnDemand]: 470/473 looper letters, 17 selfloop transitions, 2 changer transitions 0/302 dead transitions. [2024-11-10 14:24:10,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 302 transitions, 719 flow [2024-11-10 14:24:10,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:24:10,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:24:10,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1295 transitions. [2024-11-10 14:24:10,215 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9126145172656801 [2024-11-10 14:24:10,215 INFO L175 Difference]: Start difference. First operand has 284 places, 298 transitions, 664 flow. Second operand 3 states and 1295 transitions. [2024-11-10 14:24:10,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 302 transitions, 719 flow [2024-11-10 14:24:10,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 302 transitions, 715 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:24:10,224 INFO L231 Difference]: Finished difference. Result has 283 places, 297 transitions, 662 flow [2024-11-10 14:24:10,224 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=281, 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=662, PETRI_PLACES=283, PETRI_TRANSITIONS=297} [2024-11-10 14:24:10,226 INFO L277 CegarLoopForPetriNet]: 305 programPoint places, -22 predicate places. [2024-11-10 14:24:10,227 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 297 transitions, 662 flow [2024-11-10 14:24:10,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 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-10 14:24:10,228 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:24:10,228 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:24:10,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 14:24:10,228 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread_usbErr11ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-11-10 14:24:10,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:24:10,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1768512027, now seen corresponding path program 1 times [2024-11-10 14:24:10,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:24:10,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041031792] [2024-11-10 14:24:10,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:24:10,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:24:10,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:24:10,318 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-10 14:24:10,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:24:10,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041031792] [2024-11-10 14:24:10,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041031792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:24:10,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:24:10,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:24:10,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449152836] [2024-11-10 14:24:10,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:24:10,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:24:10,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:24:10,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:24:10,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:24:10,382 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 473 [2024-11-10 14:24:10,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 297 transitions, 662 flow. Second operand has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 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-10 14:24:10,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:24:10,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 473 [2024-11-10 14:24:10,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:24:10,556 INFO L124 PetriNetUnfolderBase]: 78/1026 cut-off events. [2024-11-10 14:24:10,558 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-10 14:24:10,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1206 conditions, 1026 events. 78/1026 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 5593 event pairs, 19 based on Foata normal form. 0/904 useless extension candidates. Maximal degree in co-relation 1114. Up to 67 conditions per place. [2024-11-10 14:24:10,569 INFO L140 encePairwiseOnDemand]: 470/473 looper letters, 14 selfloop transitions, 2 changer transitions 0/296 dead transitions. [2024-11-10 14:24:10,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 296 transitions, 692 flow [2024-11-10 14:24:10,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:24:10,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:24:10,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1271 transitions. [2024-11-10 14:24:10,573 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8957011980267794 [2024-11-10 14:24:10,573 INFO L175 Difference]: Start difference. First operand has 283 places, 297 transitions, 662 flow. Second operand 3 states and 1271 transitions. [2024-11-10 14:24:10,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 296 transitions, 692 flow [2024-11-10 14:24:10,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 296 transitions, 688 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:24:10,581 INFO L231 Difference]: Finished difference. Result has 282 places, 296 transitions, 660 flow [2024-11-10 14:24:10,581 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, 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-10 14:24:10,583 INFO L277 CegarLoopForPetriNet]: 305 programPoint places, -23 predicate places. [2024-11-10 14:24:10,583 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 296 transitions, 660 flow [2024-11-10 14:24:10,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 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-10 14:24:10,584 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:24:10,586 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:24:10,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 14:24:10,586 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-11-10 14:24:10,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:24:10,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1769461221, now seen corresponding path program 1 times [2024-11-10 14:24:10,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:24:10,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656872957] [2024-11-10 14:24:10,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:24:10,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:24:10,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:24:10,695 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-10 14:24:10,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:24:10,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656872957] [2024-11-10 14:24:10,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656872957] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:24:10,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:24:10,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:24:10,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220921990] [2024-11-10 14:24:10,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:24:10,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:24:10,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:24:10,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:24:10,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:24:10,711 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 429 out of 473 [2024-11-10 14:24:10,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 296 transitions, 660 flow. Second operand has 3 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 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-10 14:24:10,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:24:10,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 429 of 473 [2024-11-10 14:24:10,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:24:10,859 INFO L124 PetriNetUnfolderBase]: 85/933 cut-off events. [2024-11-10 14:24:10,860 INFO L125 PetriNetUnfolderBase]: For 23/45 co-relation queries the response was YES. [2024-11-10 14:24:10,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1131 conditions, 933 events. 85/933 cut-off events. For 23/45 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 4989 event pairs, 9 based on Foata normal form. 4/824 useless extension candidates. Maximal degree in co-relation 1033. Up to 69 conditions per place. [2024-11-10 14:24:10,868 INFO L140 encePairwiseOnDemand]: 471/473 looper letters, 14 selfloop transitions, 1 changer transitions 19/300 dead transitions. [2024-11-10 14:24:10,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 300 transitions, 707 flow [2024-11-10 14:24:10,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:24:10,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:24:10,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1303 transitions. [2024-11-10 14:24:10,872 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9182522903453136 [2024-11-10 14:24:10,873 INFO L175 Difference]: Start difference. First operand has 282 places, 296 transitions, 660 flow. Second operand 3 states and 1303 transitions. [2024-11-10 14:24:10,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 300 transitions, 707 flow [2024-11-10 14:24:10,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 300 transitions, 703 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:24:10,882 INFO L231 Difference]: Finished difference. Result has 281 places, 276 transitions, 614 flow [2024-11-10 14:24:10,885 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=614, PETRI_PLACES=281, PETRI_TRANSITIONS=276} [2024-11-10 14:24:10,885 INFO L277 CegarLoopForPetriNet]: 305 programPoint places, -24 predicate places. [2024-11-10 14:24:10,886 INFO L471 AbstractCegarLoop]: Abstraction has has 281 places, 276 transitions, 614 flow [2024-11-10 14:24:10,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 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-10 14:24:10,887 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:24:10,887 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:24:10,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 14:24:10,887 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread_usbErr10ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-11-10 14:24:10,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:24:10,888 INFO L85 PathProgramCache]: Analyzing trace with hash 69512658, now seen corresponding path program 1 times [2024-11-10 14:24:10,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:24:10,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887921526] [2024-11-10 14:24:10,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:24:10,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:24:10,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:24:10,981 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-10 14:24:10,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:24:10,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887921526] [2024-11-10 14:24:10,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887921526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:24:10,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:24:10,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:24:10,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516939041] [2024-11-10 14:24:10,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:24:10,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:24:10,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:24:10,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:24:10,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:24:11,026 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 410 out of 473 [2024-11-10 14:24:11,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 276 transitions, 614 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-10 14:24:11,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:24:11,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 410 of 473 [2024-11-10 14:24:11,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:24:11,181 INFO L124 PetriNetUnfolderBase]: 101/1162 cut-off events. [2024-11-10 14:24:11,182 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-10 14:24:11,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1374 conditions, 1162 events. 101/1162 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 6726 event pairs, 23 based on Foata normal form. 0/1029 useless extension candidates. Maximal degree in co-relation 1301. Up to 83 conditions per place. [2024-11-10 14:24:11,194 INFO L140 encePairwiseOnDemand]: 465/473 looper letters, 16 selfloop transitions, 5 changer transitions 0/278 dead transitions. [2024-11-10 14:24:11,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 278 transitions, 660 flow [2024-11-10 14:24:11,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:24:11,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:24:11,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1254 transitions. [2024-11-10 14:24:11,197 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8837209302325582 [2024-11-10 14:24:11,198 INFO L175 Difference]: Start difference. First operand has 281 places, 276 transitions, 614 flow. Second operand 3 states and 1254 transitions. [2024-11-10 14:24:11,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 278 transitions, 660 flow [2024-11-10 14:24:11,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 278 transitions, 659 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:24:11,204 INFO L231 Difference]: Finished difference. Result has 262 places, 276 transitions, 634 flow [2024-11-10 14:24:11,205 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=607, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=634, PETRI_PLACES=262, PETRI_TRANSITIONS=276} [2024-11-10 14:24:11,206 INFO L277 CegarLoopForPetriNet]: 305 programPoint places, -43 predicate places. [2024-11-10 14:24:11,207 INFO L471 AbstractCegarLoop]: Abstraction has has 262 places, 276 transitions, 634 flow [2024-11-10 14:24:11,208 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-10 14:24:11,208 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:24:11,208 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:24:11,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 14:24:11,209 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread_usbErr6ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-11-10 14:24:11,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:24:11,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1230600033, now seen corresponding path program 1 times [2024-11-10 14:24:11,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:24:11,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782221070] [2024-11-10 14:24:11,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:24:11,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:24:11,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:24:11,361 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-10 14:24:11,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:24:11,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782221070] [2024-11-10 14:24:11,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782221070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:24:11,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:24:11,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:24:11,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851037092] [2024-11-10 14:24:11,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:24:11,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:24:11,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:24:11,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:24:11,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:24:11,391 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 417 out of 473 [2024-11-10 14:24:11,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 276 transitions, 634 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-10 14:24:11,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:24:11,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 417 of 473 [2024-11-10 14:24:11,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:24:11,529 INFO L124 PetriNetUnfolderBase]: 103/1093 cut-off events. [2024-11-10 14:24:11,530 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-11-10 14:24:11,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1322 conditions, 1093 events. 103/1093 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 6008 event pairs, 14 based on Foata normal form. 1/964 useless extension candidates. Maximal degree in co-relation 1248. Up to 63 conditions per place. [2024-11-10 14:24:11,540 INFO L140 encePairwiseOnDemand]: 465/473 looper letters, 15 selfloop transitions, 5 changer transitions 0/280 dead transitions. [2024-11-10 14:24:11,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 280 transitions, 682 flow [2024-11-10 14:24:11,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:24:11,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:24:11,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1274 transitions. [2024-11-10 14:24:11,544 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.897815362931642 [2024-11-10 14:24:11,544 INFO L175 Difference]: Start difference. First operand has 262 places, 276 transitions, 634 flow. Second operand 3 states and 1274 transitions. [2024-11-10 14:24:11,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 280 transitions, 682 flow [2024-11-10 14:24:11,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 280 transitions, 677 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:24:11,550 INFO L231 Difference]: Finished difference. Result has 265 places, 278 transitions, 663 flow [2024-11-10 14:24:11,551 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=629, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=663, PETRI_PLACES=265, PETRI_TRANSITIONS=278} [2024-11-10 14:24:11,551 INFO L277 CegarLoopForPetriNet]: 305 programPoint places, -40 predicate places. [2024-11-10 14:24:11,551 INFO L471 AbstractCegarLoop]: Abstraction has has 265 places, 278 transitions, 663 flow [2024-11-10 14:24:11,552 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-10 14:24:11,553 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:24:11,553 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:24:11,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 14:24:11,553 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread_usbErr1ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-11-10 14:24:11,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:24:11,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1793916158, now seen corresponding path program 1 times [2024-11-10 14:24:11,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:24:11,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864160340] [2024-11-10 14:24:11,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:24:11,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:24:11,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:24:11,645 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-10 14:24:11,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:24:11,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864160340] [2024-11-10 14:24:11,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864160340] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:24:11,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:24:11,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:24:11,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064609031] [2024-11-10 14:24:11,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:24:11,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:24:11,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:24:11,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:24:11,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:24:11,734 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 414 out of 473 [2024-11-10 14:24:11,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 278 transitions, 663 flow. Second operand has 3 states, 3 states have (on average 416.0) internal successors, (1248), 3 states have internal predecessors, (1248), 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-10 14:24:11,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:24:11,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 414 of 473 [2024-11-10 14:24:11,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:24:11,873 INFO L124 PetriNetUnfolderBase]: 120/1122 cut-off events. [2024-11-10 14:24:11,874 INFO L125 PetriNetUnfolderBase]: For 91/104 co-relation queries the response was YES. [2024-11-10 14:24:11,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1467 conditions, 1122 events. 120/1122 cut-off events. For 91/104 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 6106 event pairs, 28 based on Foata normal form. 2/999 useless extension candidates. Maximal degree in co-relation 1388. Up to 137 conditions per place. [2024-11-10 14:24:11,896 INFO L140 encePairwiseOnDemand]: 467/473 looper letters, 26 selfloop transitions, 8 changer transitions 0/286 dead transitions. [2024-11-10 14:24:11,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 286 transitions, 757 flow [2024-11-10 14:24:11,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:24:11,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:24:11,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1269 transitions. [2024-11-10 14:24:11,900 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8942917547568711 [2024-11-10 14:24:11,900 INFO L175 Difference]: Start difference. First operand has 265 places, 278 transitions, 663 flow. Second operand 3 states and 1269 transitions. [2024-11-10 14:24:11,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 286 transitions, 757 flow [2024-11-10 14:24:11,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 286 transitions, 747 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:24:11,906 INFO L231 Difference]: Finished difference. Result has 267 places, 284 transitions, 721 flow [2024-11-10 14:24:11,906 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=653, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=721, PETRI_PLACES=267, PETRI_TRANSITIONS=284} [2024-11-10 14:24:11,907 INFO L277 CegarLoopForPetriNet]: 305 programPoint places, -38 predicate places. [2024-11-10 14:24:11,907 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 284 transitions, 721 flow [2024-11-10 14:24:11,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 416.0) internal successors, (1248), 3 states have internal predecessors, (1248), 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-10 14:24:11,908 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:24:11,909 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:24:11,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 14:24:11,909 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread_usbErr9ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-11-10 14:24:11,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:24:11,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1905065385, now seen corresponding path program 1 times [2024-11-10 14:24:11,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:24:11,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112497744] [2024-11-10 14:24:11,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:24:11,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:24:11,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:24:11,990 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-10 14:24:11,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:24:11,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112497744] [2024-11-10 14:24:11,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112497744] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:24:11,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:24:11,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:24:11,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545593550] [2024-11-10 14:24:11,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:24:11,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:24:11,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:24:11,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:24:11,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:24:12,017 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 423 out of 473 [2024-11-10 14:24:12,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 284 transitions, 721 flow. Second operand has 3 states, 3 states have (on average 424.6666666666667) internal successors, (1274), 3 states have internal predecessors, (1274), 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-10 14:24:12,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:24:12,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 423 of 473 [2024-11-10 14:24:12,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:24:12,156 INFO L124 PetriNetUnfolderBase]: 114/1206 cut-off events. [2024-11-10 14:24:12,157 INFO L125 PetriNetUnfolderBase]: For 80/91 co-relation queries the response was YES. [2024-11-10 14:24:12,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1553 conditions, 1206 events. 114/1206 cut-off events. For 80/91 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 6886 event pairs, 14 based on Foata normal form. 0/1075 useless extension candidates. Maximal degree in co-relation 1476. Up to 73 conditions per place. [2024-11-10 14:24:12,168 INFO L140 encePairwiseOnDemand]: 470/473 looper letters, 14 selfloop transitions, 2 changer transitions 0/285 dead transitions. [2024-11-10 14:24:12,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 285 transitions, 755 flow [2024-11-10 14:24:12,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:24:12,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:24:12,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1286 transitions. [2024-11-10 14:24:12,171 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9062720225510923 [2024-11-10 14:24:12,171 INFO L175 Difference]: Start difference. First operand has 267 places, 284 transitions, 721 flow. Second operand 3 states and 1286 transitions. [2024-11-10 14:24:12,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 285 transitions, 755 flow [2024-11-10 14:24:12,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 285 transitions, 739 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:24:12,177 INFO L231 Difference]: Finished difference. Result has 266 places, 283 transitions, 707 flow [2024-11-10 14:24:12,178 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=703, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=707, PETRI_PLACES=266, PETRI_TRANSITIONS=283} [2024-11-10 14:24:12,179 INFO L277 CegarLoopForPetriNet]: 305 programPoint places, -39 predicate places. [2024-11-10 14:24:12,179 INFO L471 AbstractCegarLoop]: Abstraction has has 266 places, 283 transitions, 707 flow [2024-11-10 14:24:12,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 424.6666666666667) internal successors, (1274), 3 states have internal predecessors, (1274), 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-10 14:24:12,184 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:24:12,184 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:24:12,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 14:24:12,185 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread_usbErr8ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-11-10 14:24:12,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:24:12,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1683756342, now seen corresponding path program 1 times [2024-11-10 14:24:12,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:24:12,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066121922] [2024-11-10 14:24:12,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:24:12,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:24:12,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:24:12,260 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-10 14:24:12,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:24:12,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066121922] [2024-11-10 14:24:12,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066121922] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:24:12,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:24:12,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:24:12,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330979188] [2024-11-10 14:24:12,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:24:12,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:24:12,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:24:12,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:24:12,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:24:12,308 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 473 [2024-11-10 14:24:12,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 283 transitions, 707 flow. Second operand has 3 states, 3 states have (on average 420.0) internal successors, (1260), 3 states have internal predecessors, (1260), 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-10 14:24:12,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:24:12,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 473 [2024-11-10 14:24:12,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:24:12,506 INFO L124 PetriNetUnfolderBase]: 136/1256 cut-off events. [2024-11-10 14:24:12,506 INFO L125 PetriNetUnfolderBase]: For 93/112 co-relation queries the response was YES. [2024-11-10 14:24:12,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1635 conditions, 1256 events. 136/1256 cut-off events. For 93/112 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 7508 event pairs, 22 based on Foata normal form. 0/1113 useless extension candidates. Maximal degree in co-relation 1558. Up to 92 conditions per place. [2024-11-10 14:24:12,522 INFO L140 encePairwiseOnDemand]: 470/473 looper letters, 19 selfloop transitions, 2 changer transitions 0/284 dead transitions. [2024-11-10 14:24:12,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 284 transitions, 751 flow [2024-11-10 14:24:12,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:24:12,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:24:12,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1273 transitions. [2024-11-10 14:24:12,526 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8971106412966878 [2024-11-10 14:24:12,526 INFO L175 Difference]: Start difference. First operand has 266 places, 283 transitions, 707 flow. Second operand 3 states and 1273 transitions. [2024-11-10 14:24:12,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 284 transitions, 751 flow [2024-11-10 14:24:12,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 284 transitions, 747 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:24:12,533 INFO L231 Difference]: Finished difference. Result has 265 places, 282 transitions, 705 flow [2024-11-10 14:24:12,533 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=701, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=705, PETRI_PLACES=265, PETRI_TRANSITIONS=282} [2024-11-10 14:24:12,534 INFO L277 CegarLoopForPetriNet]: 305 programPoint places, -40 predicate places. [2024-11-10 14:24:12,534 INFO L471 AbstractCegarLoop]: Abstraction has has 265 places, 282 transitions, 705 flow [2024-11-10 14:24:12,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 420.0) internal successors, (1260), 3 states have internal predecessors, (1260), 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-10 14:24:12,535 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:24:12,535 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:24:12,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 14:24:12,536 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-11-10 14:24:12,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:24:12,536 INFO L85 PathProgramCache]: Analyzing trace with hash -749084977, now seen corresponding path program 1 times [2024-11-10 14:24:12,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:24:12,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057272727] [2024-11-10 14:24:12,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:24:12,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:24:12,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:24:12,600 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-10 14:24:12,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:24:12,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057272727] [2024-11-10 14:24:12,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057272727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:24:12,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:24:12,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:24:12,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054965575] [2024-11-10 14:24:12,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:24:12,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:24:12,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:24:12,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:24:12,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:24:12,677 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 473 [2024-11-10 14:24:12,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 282 transitions, 705 flow. Second operand has 3 states, 3 states have (on average 414.0) internal successors, (1242), 3 states have internal predecessors, (1242), 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-10 14:24:12,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:24:12,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 473 [2024-11-10 14:24:12,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:24:12,835 INFO L124 PetriNetUnfolderBase]: 168/1270 cut-off events. [2024-11-10 14:24:12,836 INFO L125 PetriNetUnfolderBase]: For 266/343 co-relation queries the response was YES. [2024-11-10 14:24:12,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1870 conditions, 1270 events. 168/1270 cut-off events. For 266/343 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 7467 event pairs, 39 based on Foata normal form. 8/1146 useless extension candidates. Maximal degree in co-relation 1791. Up to 236 conditions per place. [2024-11-10 14:24:12,867 INFO L140 encePairwiseOnDemand]: 465/473 looper letters, 31 selfloop transitions, 12 changer transitions 0/291 dead transitions. [2024-11-10 14:24:12,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 291 transitions, 828 flow [2024-11-10 14:24:12,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:24:12,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:24:12,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1264 transitions. [2024-11-10 14:24:12,870 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8907681465821 [2024-11-10 14:24:12,870 INFO L175 Difference]: Start difference. First operand has 265 places, 282 transitions, 705 flow. Second operand 3 states and 1264 transitions. [2024-11-10 14:24:12,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 291 transitions, 828 flow [2024-11-10 14:24:12,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 291 transitions, 824 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:24:12,876 INFO L231 Difference]: Finished difference. Result has 267 places, 290 transitions, 801 flow [2024-11-10 14:24:12,877 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=701, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=801, PETRI_PLACES=267, PETRI_TRANSITIONS=290} [2024-11-10 14:24:12,877 INFO L277 CegarLoopForPetriNet]: 305 programPoint places, -38 predicate places. [2024-11-10 14:24:12,877 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 290 transitions, 801 flow [2024-11-10 14:24:12,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 414.0) internal successors, (1242), 3 states have internal predecessors, (1242), 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-10 14:24:12,878 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:24:12,879 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:24:12,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 14:24:12,879 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-11-10 14:24:12,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:24:12,880 INFO L85 PathProgramCache]: Analyzing trace with hash 892454203, now seen corresponding path program 1 times [2024-11-10 14:24:12,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:24:12,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87219196] [2024-11-10 14:24:12,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:24:12,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:24:12,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:24:12,949 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-10 14:24:12,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:24:12,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87219196] [2024-11-10 14:24:12,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87219196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:24:12,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:24:12,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:24:12,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996058337] [2024-11-10 14:24:12,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:24:12,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:24:12,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:24:12,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:24:12,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:24:13,016 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 473 [2024-11-10 14:24:13,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 290 transitions, 801 flow. Second operand has 3 states, 3 states have (on average 414.3333333333333) internal successors, (1243), 3 states have internal predecessors, (1243), 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-10 14:24:13,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:24:13,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 473 [2024-11-10 14:24:13,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:24:13,221 INFO L124 PetriNetUnfolderBase]: 278/1874 cut-off events. [2024-11-10 14:24:13,222 INFO L125 PetriNetUnfolderBase]: For 923/1008 co-relation queries the response was YES. [2024-11-10 14:24:13,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3033 conditions, 1874 events. 278/1874 cut-off events. For 923/1008 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 13160 event pairs, 86 based on Foata normal form. 8/1701 useless extension candidates. Maximal degree in co-relation 2638. Up to 358 conditions per place. [2024-11-10 14:24:13,237 INFO L140 encePairwiseOnDemand]: 467/473 looper letters, 38 selfloop transitions, 9 changer transitions 1/297 dead transitions. [2024-11-10 14:24:13,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 297 transitions, 929 flow [2024-11-10 14:24:13,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:24:13,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:24:13,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1263 transitions. [2024-11-10 14:24:13,241 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8900634249471459 [2024-11-10 14:24:13,241 INFO L175 Difference]: Start difference. First operand has 267 places, 290 transitions, 801 flow. Second operand 3 states and 1263 transitions. [2024-11-10 14:24:13,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 297 transitions, 929 flow [2024-11-10 14:24:13,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 297 transitions, 901 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:24:13,247 INFO L231 Difference]: Finished difference. Result has 269 places, 294 transitions, 847 flow [2024-11-10 14:24:13,248 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=777, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=847, PETRI_PLACES=269, PETRI_TRANSITIONS=294} [2024-11-10 14:24:13,249 INFO L277 CegarLoopForPetriNet]: 305 programPoint places, -36 predicate places. [2024-11-10 14:24:13,249 INFO L471 AbstractCegarLoop]: Abstraction has has 269 places, 294 transitions, 847 flow [2024-11-10 14:24:13,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 414.3333333333333) internal successors, (1243), 3 states have internal predecessors, (1243), 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-10 14:24:13,250 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:24:13,250 INFO L204 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:24:13,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 14:24:13,250 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread_usbErr6ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-11-10 14:24:13,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:24:13,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1216512104, now seen corresponding path program 1 times [2024-11-10 14:24:13,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:24:13,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243802667] [2024-11-10 14:24:13,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:24:13,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:24:13,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:24:13,316 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-10 14:24:13,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:24:13,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243802667] [2024-11-10 14:24:13,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243802667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:24:13,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:24:13,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:24:13,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129943400] [2024-11-10 14:24:13,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:24:13,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:24:13,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:24:13,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:24:13,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:24:13,334 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 425 out of 473 [2024-11-10 14:24:13,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 294 transitions, 847 flow. Second operand has 3 states, 3 states have (on average 426.0) internal successors, (1278), 3 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:24:13,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:24:13,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 425 of 473 [2024-11-10 14:24:13,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:24:13,499 INFO L124 PetriNetUnfolderBase]: 152/1490 cut-off events. [2024-11-10 14:24:13,500 INFO L125 PetriNetUnfolderBase]: For 398/437 co-relation queries the response was YES. [2024-11-10 14:24:13,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2126 conditions, 1490 events. 152/1490 cut-off events. For 398/437 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 8467 event pairs, 16 based on Foata normal form. 2/1347 useless extension candidates. Maximal degree in co-relation 2047. Up to 104 conditions per place. [2024-11-10 14:24:13,513 INFO L140 encePairwiseOnDemand]: 470/473 looper letters, 11 selfloop transitions, 2 changer transitions 2/298 dead transitions. [2024-11-10 14:24:13,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 298 transitions, 886 flow [2024-11-10 14:24:13,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:24:13,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:24:13,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1291 transitions. [2024-11-10 14:24:13,516 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9097956307258633 [2024-11-10 14:24:13,516 INFO L175 Difference]: Start difference. First operand has 269 places, 294 transitions, 847 flow. Second operand 3 states and 1291 transitions. [2024-11-10 14:24:13,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 298 transitions, 886 flow [2024-11-10 14:24:13,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 298 transitions, 862 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-11-10 14:24:13,524 INFO L231 Difference]: Finished difference. Result has 269 places, 294 transitions, 831 flow [2024-11-10 14:24:13,525 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=821, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=831, PETRI_PLACES=269, PETRI_TRANSITIONS=294} [2024-11-10 14:24:13,525 INFO L277 CegarLoopForPetriNet]: 305 programPoint places, -36 predicate places. [2024-11-10 14:24:13,526 INFO L471 AbstractCegarLoop]: Abstraction has has 269 places, 294 transitions, 831 flow [2024-11-10 14:24:13,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 426.0) internal successors, (1278), 3 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:24:13,527 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:24:13,527 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:24:13,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 14:24:13,527 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread_usbErr1ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-11-10 14:24:13,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:24:13,528 INFO L85 PathProgramCache]: Analyzing trace with hash -135157407, now seen corresponding path program 1 times [2024-11-10 14:24:13,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:24:13,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413823199] [2024-11-10 14:24:13,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:24:13,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:24:13,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:24:13,635 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-10 14:24:13,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:24:13,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413823199] [2024-11-10 14:24:13,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413823199] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:24:13,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:24:13,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:24:13,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322429608] [2024-11-10 14:24:13,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:24:13,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 14:24:13,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:24:13,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 14:24:13,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 14:24:13,656 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 422 out of 473 [2024-11-10 14:24:13,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 294 transitions, 831 flow. Second operand has 5 states, 5 states have (on average 424.4) internal successors, (2122), 5 states have internal predecessors, (2122), 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-10 14:24:13,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:24:13,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 422 of 473 [2024-11-10 14:24:13,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:24:14,081 INFO L124 PetriNetUnfolderBase]: 345/3044 cut-off events. [2024-11-10 14:24:14,081 INFO L125 PetriNetUnfolderBase]: For 562/612 co-relation queries the response was YES. [2024-11-10 14:24:14,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4257 conditions, 3044 events. 345/3044 cut-off events. For 562/612 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 22699 event pairs, 34 based on Foata normal form. 4/2749 useless extension candidates. Maximal degree in co-relation 4177. Up to 199 conditions per place. [2024-11-10 14:24:14,113 INFO L140 encePairwiseOnDemand]: 465/473 looper letters, 32 selfloop transitions, 8 changer transitions 0/316 dead transitions. [2024-11-10 14:24:14,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 316 transitions, 962 flow [2024-11-10 14:24:14,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 14:24:14,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-10 14:24:14,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2995 transitions. [2024-11-10 14:24:14,120 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9045605557233464 [2024-11-10 14:24:14,120 INFO L175 Difference]: Start difference. First operand has 269 places, 294 transitions, 831 flow. Second operand 7 states and 2995 transitions. [2024-11-10 14:24:14,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 316 transitions, 962 flow [2024-11-10 14:24:14,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 316 transitions, 960 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:24:14,128 INFO L231 Difference]: Finished difference. Result has 279 places, 301 transitions, 887 flow [2024-11-10 14:24:14,128 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=829, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=887, PETRI_PLACES=279, PETRI_TRANSITIONS=301} [2024-11-10 14:24:14,129 INFO L277 CegarLoopForPetriNet]: 305 programPoint places, -26 predicate places. [2024-11-10 14:24:14,129 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 301 transitions, 887 flow [2024-11-10 14:24:14,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 424.4) internal successors, (2122), 5 states have internal predecessors, (2122), 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-10 14:24:14,130 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:24:14,131 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:24:14,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 14:24:14,131 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread_usbErr1ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-11-10 14:24:14,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:24:14,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1176331367, now seen corresponding path program 1 times [2024-11-10 14:24:14,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:24:14,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578477240] [2024-11-10 14:24:14,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:24:14,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:24:14,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:24:14,265 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-10 14:24:14,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:24:14,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578477240] [2024-11-10 14:24:14,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578477240] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:24:14,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:24:14,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:24:14,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864739569] [2024-11-10 14:24:14,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:24:14,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 14:24:14,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:24:14,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 14:24:14,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 14:24:14,292 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 473 [2024-11-10 14:24:14,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 301 transitions, 887 flow. Second operand has 5 states, 5 states have (on average 426.0) internal successors, (2130), 5 states have internal predecessors, (2130), 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-10 14:24:14,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:24:14,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 473 [2024-11-10 14:24:14,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:24:15,102 INFO L124 PetriNetUnfolderBase]: 584/5340 cut-off events. [2024-11-10 14:24:15,102 INFO L125 PetriNetUnfolderBase]: For 1199/1318 co-relation queries the response was YES. [2024-11-10 14:24:15,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7817 conditions, 5340 events. 584/5340 cut-off events. For 1199/1318 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 47353 event pairs, 50 based on Foata normal form. 10/4846 useless extension candidates. Maximal degree in co-relation 7733. Up to 424 conditions per place. [2024-11-10 14:24:15,154 INFO L140 encePairwiseOnDemand]: 466/473 looper letters, 34 selfloop transitions, 9 changer transitions 0/328 dead transitions. [2024-11-10 14:24:15,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 328 transitions, 1038 flow [2024-11-10 14:24:15,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 14:24:15,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-10 14:24:15,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 3012 transitions. [2024-11-10 14:24:15,164 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9096949562065841 [2024-11-10 14:24:15,164 INFO L175 Difference]: Start difference. First operand has 279 places, 301 transitions, 887 flow. Second operand 7 states and 3012 transitions. [2024-11-10 14:24:15,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 328 transitions, 1038 flow [2024-11-10 14:24:15,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 328 transitions, 1038 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:24:15,175 INFO L231 Difference]: Finished difference. Result has 291 places, 309 transitions, 955 flow [2024-11-10 14:24:15,177 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=887, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=955, PETRI_PLACES=291, PETRI_TRANSITIONS=309} [2024-11-10 14:24:15,177 INFO L277 CegarLoopForPetriNet]: 305 programPoint places, -14 predicate places. [2024-11-10 14:24:15,177 INFO L471 AbstractCegarLoop]: Abstraction has has 291 places, 309 transitions, 955 flow [2024-11-10 14:24:15,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 426.0) internal successors, (2130), 5 states have internal predecessors, (2130), 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-10 14:24:15,180 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:24:15,180 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10 14:24:15,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 14:24:15,180 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread_usbThread1of1ForFork0Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-11-10 14:24:15,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:24:15,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1764064405, now seen corresponding path program 1 times [2024-11-10 14:24:15,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:24:15,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667944625] [2024-11-10 14:24:15,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:24:15,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:24:15,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:24:15,299 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:24:15,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:24:15,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667944625] [2024-11-10 14:24:15,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667944625] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:24:15,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:24:15,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:24:15,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753650736] [2024-11-10 14:24:15,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:24:15,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:24:15,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:24:15,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:24:15,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:24:15,320 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 419 out of 473 [2024-11-10 14:24:15,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 309 transitions, 955 flow. Second operand has 3 states, 3 states have (on average 421.3333333333333) internal successors, (1264), 3 states have internal predecessors, (1264), 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-10 14:24:15,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:24:15,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 419 of 473 [2024-11-10 14:24:15,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:24:15,444 INFO L124 PetriNetUnfolderBase]: 62/852 cut-off events. [2024-11-10 14:24:15,444 INFO L125 PetriNetUnfolderBase]: For 94/94 co-relation queries the response was YES. [2024-11-10 14:24:15,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1164 conditions, 852 events. 62/852 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2746 event pairs, 0 based on Foata normal form. 21/802 useless extension candidates. Maximal degree in co-relation 1073. Up to 54 conditions per place. [2024-11-10 14:24:15,453 INFO L140 encePairwiseOnDemand]: 468/473 looper letters, 13 selfloop transitions, 2 changer transitions 55/274 dead transitions. [2024-11-10 14:24:15,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 274 transitions, 780 flow [2024-11-10 14:24:15,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:24:15,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:24:15,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1276 transitions. [2024-11-10 14:24:15,456 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8992248062015504 [2024-11-10 14:24:15,456 INFO L175 Difference]: Start difference. First operand has 291 places, 309 transitions, 955 flow. Second operand 3 states and 1276 transitions. [2024-11-10 14:24:15,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 274 transitions, 780 flow [2024-11-10 14:24:15,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 274 transitions, 718 flow, removed 13 selfloop flow, removed 10 redundant places. [2024-11-10 14:24:15,463 INFO L231 Difference]: Finished difference. Result has 277 places, 217 transitions, 547 flow [2024-11-10 14:24:15,463 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=547, PETRI_PLACES=277, PETRI_TRANSITIONS=217} [2024-11-10 14:24:15,463 INFO L277 CegarLoopForPetriNet]: 305 programPoint places, -28 predicate places. [2024-11-10 14:24:15,464 INFO L471 AbstractCegarLoop]: Abstraction has has 277 places, 217 transitions, 547 flow [2024-11-10 14:24:15,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 421.3333333333333) internal successors, (1264), 3 states have internal predecessors, (1264), 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-10 14:24:15,465 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:24:15,465 INFO L204 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 14:24:15,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 14:24:15,465 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread_usbErr5ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-11-10 14:24:15,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:24:15,466 INFO L85 PathProgramCache]: Analyzing trace with hash 408212196, now seen corresponding path program 1 times [2024-11-10 14:24:15,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:24:15,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270057225] [2024-11-10 14:24:15,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:24:15,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:24:15,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:24:15,528 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-10 14:24:15,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:24:15,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270057225] [2024-11-10 14:24:15,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270057225] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:24:15,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:24:15,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:24:15,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799428563] [2024-11-10 14:24:15,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:24:15,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:24:15,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:24:15,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:24:15,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:24:15,574 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 473 [2024-11-10 14:24:15,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 217 transitions, 547 flow. Second operand has 3 states, 3 states have (on average 421.3333333333333) internal successors, (1264), 3 states have internal predecessors, (1264), 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-10 14:24:15,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:24:15,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 473 [2024-11-10 14:24:15,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:24:15,643 INFO L124 PetriNetUnfolderBase]: 46/557 cut-off events. [2024-11-10 14:24:15,644 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2024-11-10 14:24:15,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 733 conditions, 557 events. 46/557 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1411 event pairs, 8 based on Foata normal form. 0/510 useless extension candidates. Maximal degree in co-relation 647. Up to 60 conditions per place. [2024-11-10 14:24:15,649 INFO L140 encePairwiseOnDemand]: 470/473 looper letters, 16 selfloop transitions, 2 changer transitions 0/216 dead transitions. [2024-11-10 14:24:15,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 216 transitions, 581 flow [2024-11-10 14:24:15,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:24:15,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:24:15,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1270 transitions. [2024-11-10 14:24:15,652 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8949964763918252 [2024-11-10 14:24:15,652 INFO L175 Difference]: Start difference. First operand has 277 places, 217 transitions, 547 flow. Second operand 3 states and 1270 transitions. [2024-11-10 14:24:15,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 216 transitions, 581 flow [2024-11-10 14:24:15,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 216 transitions, 544 flow, removed 3 selfloop flow, removed 15 redundant places. [2024-11-10 14:24:15,657 INFO L231 Difference]: Finished difference. Result has 220 places, 216 transitions, 512 flow [2024-11-10 14:24:15,657 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=512, PETRI_PLACES=220, PETRI_TRANSITIONS=216} [2024-11-10 14:24:15,657 INFO L277 CegarLoopForPetriNet]: 305 programPoint places, -85 predicate places. [2024-11-10 14:24:15,658 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 216 transitions, 512 flow [2024-11-10 14:24:15,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 421.3333333333333) internal successors, (1264), 3 states have internal predecessors, (1264), 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-10 14:24:15,659 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:24:15,659 INFO L204 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 14:24:15,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 14:24:15,659 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread_usbErr4ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-11-10 14:24:15,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:24:15,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1209025208, now seen corresponding path program 1 times [2024-11-10 14:24:15,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:24:15,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601194138] [2024-11-10 14:24:15,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:24:15,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:24:15,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:24:15,738 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-10 14:24:15,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:24:15,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601194138] [2024-11-10 14:24:15,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601194138] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:24:15,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:24:15,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:24:15,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834688030] [2024-11-10 14:24:15,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:24:15,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:24:15,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:24:15,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:24:15,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:24:15,801 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 413 out of 473 [2024-11-10 14:24:15,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 216 transitions, 512 flow. Second operand has 3 states, 3 states have (on average 415.6666666666667) internal successors, (1247), 3 states have internal predecessors, (1247), 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-10 14:24:15,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:24:15,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 413 of 473 [2024-11-10 14:24:15,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:24:15,860 INFO L124 PetriNetUnfolderBase]: 22/384 cut-off events. [2024-11-10 14:24:15,860 INFO L125 PetriNetUnfolderBase]: For 4/8 co-relation queries the response was YES. [2024-11-10 14:24:15,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 473 conditions, 384 events. 22/384 cut-off events. For 4/8 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 458 event pairs, 0 based on Foata normal form. 0/358 useless extension candidates. Maximal degree in co-relation 392. Up to 19 conditions per place. [2024-11-10 14:24:15,863 INFO L140 encePairwiseOnDemand]: 470/473 looper letters, 0 selfloop transitions, 0 changer transitions 215/215 dead transitions. [2024-11-10 14:24:15,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 215 transitions, 540 flow [2024-11-10 14:24:15,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:24:15,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:24:15,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1255 transitions. [2024-11-10 14:24:15,867 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8844256518675123 [2024-11-10 14:24:15,867 INFO L175 Difference]: Start difference. First operand has 220 places, 216 transitions, 512 flow. Second operand 3 states and 1255 transitions. [2024-11-10 14:24:15,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 215 transitions, 540 flow [2024-11-10 14:24:15,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 215 transitions, 536 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:24:15,870 INFO L231 Difference]: Finished difference. Result has 219 places, 0 transitions, 0 flow [2024-11-10 14:24:15,870 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=219, PETRI_TRANSITIONS=0} [2024-11-10 14:24:15,870 INFO L277 CegarLoopForPetriNet]: 305 programPoint places, -86 predicate places. [2024-11-10 14:24:15,871 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 0 transitions, 0 flow [2024-11-10 14:24:15,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 415.6666666666667) internal successors, (1247), 3 states have internal predecessors, (1247), 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-10 14:24:15,874 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE (38 of 39 remaining) [2024-11-10 14:24:15,875 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE (37 of 39 remaining) [2024-11-10 14:24:15,875 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (36 of 39 remaining) [2024-11-10 14:24:15,875 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (35 of 39 remaining) [2024-11-10 14:24:15,875 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (34 of 39 remaining) [2024-11-10 14:24:15,875 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (33 of 39 remaining) [2024-11-10 14:24:15,877 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (32 of 39 remaining) [2024-11-10 14:24:15,877 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (31 of 39 remaining) [2024-11-10 14:24:15,877 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (30 of 39 remaining) [2024-11-10 14:24:15,877 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (29 of 39 remaining) [2024-11-10 14:24:15,877 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 39 remaining) [2024-11-10 14:24:15,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr11ASSERT_VIOLATIONDATA_RACE (27 of 39 remaining) [2024-11-10 14:24:15,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr1ASSERT_VIOLATIONDATA_RACE (26 of 39 remaining) [2024-11-10 14:24:15,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr0ASSERT_VIOLATIONDATA_RACE (25 of 39 remaining) [2024-11-10 14:24:15,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr10ASSERT_VIOLATIONDATA_RACE (24 of 39 remaining) [2024-11-10 14:24:15,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr7ASSERT_VIOLATIONDATA_RACE (23 of 39 remaining) [2024-11-10 14:24:15,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr2ASSERT_VIOLATIONDATA_RACE (22 of 39 remaining) [2024-11-10 14:24:15,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr6ASSERT_VIOLATIONDATA_RACE (21 of 39 remaining) [2024-11-10 14:24:15,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr9ASSERT_VIOLATIONDATA_RACE (20 of 39 remaining) [2024-11-10 14:24:15,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr5ASSERT_VIOLATIONDATA_RACE (19 of 39 remaining) [2024-11-10 14:24:15,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr4ASSERT_VIOLATIONDATA_RACE (18 of 39 remaining) [2024-11-10 14:24:15,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr3ASSERT_VIOLATIONDATA_RACE (17 of 39 remaining) [2024-11-10 14:24:15,879 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr8ASSERT_VIOLATIONDATA_RACE (16 of 39 remaining) [2024-11-10 14:24:15,879 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 39 remaining) [2024-11-10 14:24:15,879 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE (14 of 39 remaining) [2024-11-10 14:24:15,879 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE (13 of 39 remaining) [2024-11-10 14:24:15,879 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr11ASSERT_VIOLATIONDATA_RACE (12 of 39 remaining) [2024-11-10 14:24:15,879 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr1ASSERT_VIOLATIONDATA_RACE (11 of 39 remaining) [2024-11-10 14:24:15,879 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr0ASSERT_VIOLATIONDATA_RACE (10 of 39 remaining) [2024-11-10 14:24:15,879 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr10ASSERT_VIOLATIONDATA_RACE (9 of 39 remaining) [2024-11-10 14:24:15,879 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr7ASSERT_VIOLATIONDATA_RACE (8 of 39 remaining) [2024-11-10 14:24:15,879 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr2ASSERT_VIOLATIONDATA_RACE (7 of 39 remaining) [2024-11-10 14:24:15,879 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr6ASSERT_VIOLATIONDATA_RACE (6 of 39 remaining) [2024-11-10 14:24:15,880 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr9ASSERT_VIOLATIONDATA_RACE (5 of 39 remaining) [2024-11-10 14:24:15,880 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr5ASSERT_VIOLATIONDATA_RACE (4 of 39 remaining) [2024-11-10 14:24:15,880 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr4ASSERT_VIOLATIONDATA_RACE (3 of 39 remaining) [2024-11-10 14:24:15,880 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr3ASSERT_VIOLATIONDATA_RACE (2 of 39 remaining) [2024-11-10 14:24:15,880 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr8ASSERT_VIOLATIONDATA_RACE (1 of 39 remaining) [2024-11-10 14:24:15,880 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbThread1of1ForFork0Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 39 remaining) [2024-11-10 14:24:15,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 14:24:15,883 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:24:15,889 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-10 14:24:15,889 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 14:24:15,895 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 02:24:15 BasicIcfg [2024-11-10 14:24:15,895 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 14:24:15,896 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 14:24:15,897 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 14:24:15,897 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 14:24:15,898 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:24:07" (3/4) ... [2024-11-10 14:24:15,899 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 14:24:15,903 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread_ath9k [2024-11-10 14:24:15,904 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread_usb [2024-11-10 14:24:15,908 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 24 nodes and edges [2024-11-10 14:24:15,910 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-10 14:24:15,910 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-10 14:24:15,910 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 14:24:16,003 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 14:24:16,004 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 14:24:16,004 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 14:24:16,004 INFO L158 Benchmark]: Toolchain (without parser) took 10526.79ms. Allocated memory was 144.7MB in the beginning and 337.6MB in the end (delta: 192.9MB). Free memory was 99.1MB in the beginning and 269.9MB in the end (delta: -170.8MB). Peak memory consumption was 25.3MB. Max. memory is 16.1GB. [2024-11-10 14:24:16,005 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 100.7MB. Free memory is still 67.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 14:24:16,005 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1047.92ms. Allocated memory is still 144.7MB. Free memory was 98.4MB in the beginning and 39.0MB in the end (delta: 59.4MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2024-11-10 14:24:16,005 INFO L158 Benchmark]: Boogie Procedure Inliner took 107.02ms. Allocated memory is still 144.7MB. Free memory was 39.0MB in the beginning and 110.6MB in the end (delta: -71.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-10 14:24:16,005 INFO L158 Benchmark]: Boogie Preprocessor took 72.64ms. Allocated memory is still 144.7MB. Free memory was 110.6MB in the beginning and 107.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 14:24:16,006 INFO L158 Benchmark]: IcfgBuilder took 971.80ms. Allocated memory is still 144.7MB. Free memory was 107.9MB in the beginning and 83.2MB in the end (delta: 24.7MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB. [2024-11-10 14:24:16,006 INFO L158 Benchmark]: TraceAbstraction took 8212.11ms. Allocated memory was 144.7MB in the beginning and 337.6MB in the end (delta: 192.9MB). Free memory was 83.2MB in the beginning and 275.1MB in the end (delta: -191.9MB). Peak memory consumption was 178.1MB. Max. memory is 16.1GB. [2024-11-10 14:24:16,006 INFO L158 Benchmark]: Witness Printer took 107.90ms. Allocated memory is still 337.6MB. Free memory was 275.1MB in the beginning and 269.9MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 14:24:16,008 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.27ms. Allocated memory is still 100.7MB. Free memory is still 67.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1047.92ms. Allocated memory is still 144.7MB. Free memory was 98.4MB in the beginning and 39.0MB in the end (delta: 59.4MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 107.02ms. Allocated memory is still 144.7MB. Free memory was 39.0MB in the beginning and 110.6MB in the end (delta: -71.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.64ms. Allocated memory is still 144.7MB. Free memory was 110.6MB in the beginning and 107.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 971.80ms. Allocated memory is still 144.7MB. Free memory was 107.9MB in the beginning and 83.2MB in the end (delta: 24.7MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB. * TraceAbstraction took 8212.11ms. Allocated memory was 144.7MB in the beginning and 337.6MB in the end (delta: 192.9MB). Free memory was 83.2MB in the beginning and 275.1MB in the end (delta: -191.9MB). Peak memory consumption was 178.1MB. Max. memory is 16.1GB. * Witness Printer took 107.90ms. Allocated memory is still 337.6MB. Free memory was 275.1MB in the beginning and 269.9MB in the end (delta: 5.2MB). 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: 1772]: 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: 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, 481 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.0s, OverallIterations: 19, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1211 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 446 mSDsluCounter, 185 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 53 mSDsCounter, 90 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1260 IncrementalHoareTripleChecker+Invalid, 1350 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 90 mSolverCounterUnsat, 132 mSDtfsCounter, 1260 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=955occurred in iteration=16, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1557 NumberOfCodeBlocks, 1557 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1538 ConstructedInterpolants, 0 QuantifiedInterpolants, 1658 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 43/43 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-10 14:24:16,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE