./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/ldv-races/race-4_2-thread_local_vars.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 3061b6dc 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_2-thread_local_vars.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0f799b8cb369af433cd7b4f4a2ae1c7efd2306d185f06da0302d2727c00c6bf0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 05:44:13,558 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 05:44:13,619 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-19 05:44:13,625 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 05:44:13,628 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 05:44:13,653 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 05:44:13,654 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 05:44:13,654 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 05:44:13,654 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 05:44:13,655 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 05:44:13,656 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 05:44:13,656 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 05:44:13,657 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 05:44:13,657 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 05:44:13,658 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 05:44:13,659 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 05:44:13,659 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 05:44:13,659 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 05:44:13,659 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 05:44:13,660 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 05:44:13,662 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 05:44:13,663 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 05:44:13,663 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-19 05:44:13,663 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 05:44:13,664 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 05:44:13,664 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 05:44:13,664 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 05:44:13,664 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 05:44:13,664 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 05:44:13,665 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 05:44:13,665 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 05:44:13,665 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:44:13,665 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 05:44:13,665 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 05:44:13,665 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 05:44:13,666 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 05:44:13,666 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 05:44:13,666 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 05:44:13,666 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 05:44:13,666 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 05:44:13,666 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 05:44:13,668 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0f799b8cb369af433cd7b4f4a2ae1c7efd2306d185f06da0302d2727c00c6bf0 [2024-11-19 05:44:13,887 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 05:44:13,910 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 05:44:13,913 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 05:44:13,914 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 05:44:13,914 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 05:44:13,915 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-4_2-thread_local_vars.i [2024-11-19 05:44:15,280 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 05:44:15,506 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 05:44:15,507 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-4_2-thread_local_vars.i [2024-11-19 05:44:15,527 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b5fd7cd8/18de284dbd004bf4b04aa63145ef438c/FLAG3cf594b25 [2024-11-19 05:44:15,539 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b5fd7cd8/18de284dbd004bf4b04aa63145ef438c [2024-11-19 05:44:15,541 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 05:44:15,542 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 05:44:15,544 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 05:44:15,544 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 05:44:15,549 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 05:44:15,550 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:44:15" (1/1) ... [2024-11-19 05:44:15,550 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30065976 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:44:15, skipping insertion in model container [2024-11-19 05:44:15,550 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:44:15" (1/1) ... [2024-11-19 05:44:15,603 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 05:44:16,231 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:44:16,252 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 05:44:16,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:44:16,402 INFO L204 MainTranslator]: Completed translation [2024-11-19 05:44:16,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:44:16 WrapperNode [2024-11-19 05:44:16,403 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 05:44:16,404 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 05:44:16,405 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 05:44:16,405 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 05:44:16,410 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:44:16" (1/1) ... [2024-11-19 05:44:16,434 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:44:16" (1/1) ... [2024-11-19 05:44:16,469 INFO L138 Inliner]: procedures = 487, calls = 38, calls flagged for inlining = 17, calls inlined = 23, statements flattened = 296 [2024-11-19 05:44:16,470 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 05:44:16,471 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 05:44:16,471 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 05:44:16,471 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 05:44:16,479 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:44:16" (1/1) ... [2024-11-19 05:44:16,479 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:44:16" (1/1) ... [2024-11-19 05:44:16,487 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:44:16" (1/1) ... [2024-11-19 05:44:16,487 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:44:16" (1/1) ... [2024-11-19 05:44:16,501 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:44:16" (1/1) ... [2024-11-19 05:44:16,505 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:44:16" (1/1) ... [2024-11-19 05:44:16,508 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:44:16" (1/1) ... [2024-11-19 05:44:16,509 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:44:16" (1/1) ... [2024-11-19 05:44:16,513 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 05:44:16,514 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 05:44:16,514 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 05:44:16,514 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 05:44:16,515 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:44:16" (1/1) ... [2024-11-19 05:44:16,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:44:16,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:44:16,575 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-19 05:44:16,580 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-19 05:44:16,620 INFO L130 BoogieDeclarations]: Found specification of procedure thread_usb [2024-11-19 05:44:16,620 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_usb [2024-11-19 05:44:16,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 05:44:16,620 INFO L130 BoogieDeclarations]: Found specification of procedure thread_ath9k [2024-11-19 05:44:16,621 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_ath9k [2024-11-19 05:44:16,621 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-19 05:44:16,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 05:44:16,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-19 05:44:16,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 05:44:16,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 05:44:16,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 05:44:16,621 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-19 05:44:16,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-19 05:44:16,624 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 05:44:16,884 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 05:44:16,886 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 05:44:17,155 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 05:44:17,156 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 05:44:17,183 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 05:44:17,184 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 05:44:17,184 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:44:17 BoogieIcfgContainer [2024-11-19 05:44:17,184 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 05:44:17,186 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 05:44:17,186 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 05:44:17,193 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 05:44:17,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:44:15" (1/3) ... [2024-11-19 05:44:17,197 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cc8d908 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:44:17, skipping insertion in model container [2024-11-19 05:44:17,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:44:16" (2/3) ... [2024-11-19 05:44:17,197 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cc8d908 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:44:17, skipping insertion in model container [2024-11-19 05:44:17,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:44:17" (3/3) ... [2024-11-19 05:44:17,198 INFO L112 eAbstractionObserver]: Analyzing ICFG race-4_2-thread_local_vars.i [2024-11-19 05:44:17,219 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 05:44:17,219 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 24 error locations. [2024-11-19 05:44:17,220 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 05:44:17,358 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2024-11-19 05:44:17,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 472 places, 514 transitions, 1055 flow [2024-11-19 05:44:17,539 INFO L124 PetriNetUnfolderBase]: 45/520 cut-off events. [2024-11-19 05:44:17,539 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-19 05:44:17,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 531 conditions, 520 events. 45/520 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1454 event pairs, 0 based on Foata normal form. 0/433 useless extension candidates. Maximal degree in co-relation 367. Up to 11 conditions per place. [2024-11-19 05:44:17,552 INFO L82 GeneralOperation]: Start removeDead. Operand has 472 places, 514 transitions, 1055 flow [2024-11-19 05:44:17,559 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 323 places, 348 transitions, 712 flow [2024-11-19 05:44:17,573 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 05:44:17,579 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;@5917aa1c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 05:44:17,580 INFO L334 AbstractCegarLoop]: Starting to check reachability of 43 error locations. [2024-11-19 05:44:17,585 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 05:44:17,585 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2024-11-19 05:44:17,585 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 05:44:17,586 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:44:17,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] [2024-11-19 05:44:17,587 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-11-19 05:44:17,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:44:17,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1019178130, now seen corresponding path program 1 times [2024-11-19 05:44:17,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:44:17,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83203820] [2024-11-19 05:44:17,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:44:17,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:44:17,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:44:17,956 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-19 05:44:17,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:44:17,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83203820] [2024-11-19 05:44:17,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83203820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:44:17,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:44:17,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:44:17,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217496360] [2024-11-19 05:44:17,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:44:17,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:44:17,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:44:17,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:44:17,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:44:18,105 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 442 out of 514 [2024-11-19 05:44:18,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 348 transitions, 712 flow. Second operand has 3 states, 3 states have (on average 443.3333333333333) internal successors, (1330), 3 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:44:18,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:44:18,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 442 of 514 [2024-11-19 05:44:18,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:44:18,352 INFO L124 PetriNetUnfolderBase]: 122/1234 cut-off events. [2024-11-19 05:44:18,352 INFO L125 PetriNetUnfolderBase]: For 40/47 co-relation queries the response was YES. [2024-11-19 05:44:18,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1444 conditions, 1234 events. 122/1234 cut-off events. For 40/47 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 7314 event pairs, 76 based on Foata normal form. 115/1168 useless extension candidates. Maximal degree in co-relation 1117. Up to 185 conditions per place. [2024-11-19 05:44:18,369 INFO L140 encePairwiseOnDemand]: 493/514 looper letters, 24 selfloop transitions, 2 changer transitions 6/315 dead transitions. [2024-11-19 05:44:18,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 315 transitions, 698 flow [2024-11-19 05:44:18,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:44:18,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:44:18,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1371 transitions. [2024-11-19 05:44:18,388 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8891050583657587 [2024-11-19 05:44:18,390 INFO L175 Difference]: Start difference. First operand has 323 places, 348 transitions, 712 flow. Second operand 3 states and 1371 transitions. [2024-11-19 05:44:18,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 315 transitions, 698 flow [2024-11-19 05:44:18,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 315 transitions, 694 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:44:18,403 INFO L231 Difference]: Finished difference. Result has 308 places, 309 transitions, 634 flow [2024-11-19 05:44:18,406 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=642, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=634, PETRI_PLACES=308, PETRI_TRANSITIONS=309} [2024-11-19 05:44:18,409 INFO L277 CegarLoopForPetriNet]: 323 programPoint places, -15 predicate places. [2024-11-19 05:44:18,410 INFO L471 AbstractCegarLoop]: Abstraction has has 308 places, 309 transitions, 634 flow [2024-11-19 05:44:18,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 443.3333333333333) internal successors, (1330), 3 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:44:18,411 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:44:18,411 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-19 05:44:18,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 05:44:18,412 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-11-19 05:44:18,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:44:18,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1211256555, now seen corresponding path program 1 times [2024-11-19 05:44:18,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:44:18,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577040875] [2024-11-19 05:44:18,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:44:18,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:44:18,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:44:18,518 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-19 05:44:18,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:44:18,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577040875] [2024-11-19 05:44:18,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577040875] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:44:18,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:44:18,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:44:18,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798739591] [2024-11-19 05:44:18,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:44:18,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:44:18,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:44:18,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:44:18,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:44:18,606 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 514 [2024-11-19 05:44:18,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 309 transitions, 634 flow. Second operand has 3 states, 3 states have (on average 429.0) internal successors, (1287), 3 states have internal predecessors, (1287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:44:18,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:44:18,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 514 [2024-11-19 05:44:18,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:44:18,830 INFO L124 PetriNetUnfolderBase]: 161/1710 cut-off events. [2024-11-19 05:44:18,830 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2024-11-19 05:44:18,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1950 conditions, 1710 events. 161/1710 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 11687 event pairs, 29 based on Foata normal form. 0/1468 useless extension candidates. Maximal degree in co-relation 1916. Up to 156 conditions per place. [2024-11-19 05:44:18,841 INFO L140 encePairwiseOnDemand]: 490/514 looper letters, 30 selfloop transitions, 17 changer transitions 0/321 dead transitions. [2024-11-19 05:44:18,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 321 transitions, 753 flow [2024-11-19 05:44:18,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:44:18,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:44:18,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1338 transitions. [2024-11-19 05:44:18,846 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.867704280155642 [2024-11-19 05:44:18,847 INFO L175 Difference]: Start difference. First operand has 308 places, 309 transitions, 634 flow. Second operand 3 states and 1338 transitions. [2024-11-19 05:44:18,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 321 transitions, 753 flow [2024-11-19 05:44:18,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 321 transitions, 749 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:44:18,855 INFO L231 Difference]: Finished difference. Result has 301 places, 318 transitions, 748 flow [2024-11-19 05:44:18,855 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=624, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=748, PETRI_PLACES=301, PETRI_TRANSITIONS=318} [2024-11-19 05:44:18,856 INFO L277 CegarLoopForPetriNet]: 323 programPoint places, -22 predicate places. [2024-11-19 05:44:18,856 INFO L471 AbstractCegarLoop]: Abstraction has has 301 places, 318 transitions, 748 flow [2024-11-19 05:44:18,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 429.0) internal successors, (1287), 3 states have internal predecessors, (1287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:44:18,857 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:44:18,858 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-19 05:44:18,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 05:44:18,858 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-11-19 05:44:18,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:44:18,859 INFO L85 PathProgramCache]: Analyzing trace with hash 357497468, now seen corresponding path program 1 times [2024-11-19 05:44:18,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:44:18,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71813203] [2024-11-19 05:44:18,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:44:18,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:44:18,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:44:18,924 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-19 05:44:18,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:44:18,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71813203] [2024-11-19 05:44:18,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71813203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:44:18,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:44:18,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:44:18,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449642141] [2024-11-19 05:44:18,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:44:18,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:44:18,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:44:18,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:44:18,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:44:18,992 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 442 out of 514 [2024-11-19 05:44:18,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 318 transitions, 748 flow. Second operand has 3 states, 3 states have (on average 444.0) internal successors, (1332), 3 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:44:18,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:44:18,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 442 of 514 [2024-11-19 05:44:18,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:44:19,234 INFO L124 PetriNetUnfolderBase]: 274/2597 cut-off events. [2024-11-19 05:44:19,234 INFO L125 PetriNetUnfolderBase]: For 480/543 co-relation queries the response was YES. [2024-11-19 05:44:19,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3358 conditions, 2597 events. 274/2597 cut-off events. For 480/543 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 20850 event pairs, 99 based on Foata normal form. 0/2232 useless extension candidates. Maximal degree in co-relation 2866. Up to 333 conditions per place. [2024-11-19 05:44:19,246 INFO L140 encePairwiseOnDemand]: 511/514 looper letters, 32 selfloop transitions, 2 changer transitions 0/317 dead transitions. [2024-11-19 05:44:19,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 317 transitions, 814 flow [2024-11-19 05:44:19,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:44:19,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:44:19,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1353 transitions. [2024-11-19 05:44:19,249 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.877431906614786 [2024-11-19 05:44:19,249 INFO L175 Difference]: Start difference. First operand has 301 places, 318 transitions, 748 flow. Second operand 3 states and 1353 transitions. [2024-11-19 05:44:19,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 317 transitions, 814 flow [2024-11-19 05:44:19,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 317 transitions, 780 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:44:19,258 INFO L231 Difference]: Finished difference. Result has 300 places, 317 transitions, 716 flow [2024-11-19 05:44:19,259 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=712, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=716, PETRI_PLACES=300, PETRI_TRANSITIONS=317} [2024-11-19 05:44:19,263 INFO L277 CegarLoopForPetriNet]: 323 programPoint places, -23 predicate places. [2024-11-19 05:44:19,264 INFO L471 AbstractCegarLoop]: Abstraction has has 300 places, 317 transitions, 716 flow [2024-11-19 05:44:19,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 444.0) internal successors, (1332), 3 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:44:19,265 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:44:19,265 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-19 05:44:19,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 05:44:19,265 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-11-19 05:44:19,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:44:19,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1517070653, now seen corresponding path program 1 times [2024-11-19 05:44:19,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:44:19,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176530465] [2024-11-19 05:44:19,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:44:19,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:44:19,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:44:19,346 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-19 05:44:19,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:44:19,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176530465] [2024-11-19 05:44:19,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176530465] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:44:19,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:44:19,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:44:19,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715361432] [2024-11-19 05:44:19,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:44:19,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:44:19,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:44:19,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:44:19,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:44:19,363 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 460 out of 514 [2024-11-19 05:44:19,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 317 transitions, 716 flow. Second operand has 3 states, 3 states have (on average 461.3333333333333) internal successors, (1384), 3 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:44:19,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:44:19,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 514 [2024-11-19 05:44:19,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:44:19,658 INFO L124 PetriNetUnfolderBase]: 264/2775 cut-off events. [2024-11-19 05:44:19,659 INFO L125 PetriNetUnfolderBase]: For 51/81 co-relation queries the response was YES. [2024-11-19 05:44:19,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3215 conditions, 2775 events. 264/2775 cut-off events. For 51/81 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 22463 event pairs, 60 based on Foata normal form. 1/2348 useless extension candidates. Maximal degree in co-relation 3176. Up to 144 conditions per place. [2024-11-19 05:44:19,673 INFO L140 encePairwiseOnDemand]: 511/514 looper letters, 17 selfloop transitions, 2 changer transitions 0/321 dead transitions. [2024-11-19 05:44:19,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 321 transitions, 771 flow [2024-11-19 05:44:19,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:44:19,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:44:19,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1400 transitions. [2024-11-19 05:44:19,676 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9079118028534371 [2024-11-19 05:44:19,676 INFO L175 Difference]: Start difference. First operand has 300 places, 317 transitions, 716 flow. Second operand 3 states and 1400 transitions. [2024-11-19 05:44:19,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 321 transitions, 771 flow [2024-11-19 05:44:19,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 321 transitions, 767 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:44:19,682 INFO L231 Difference]: Finished difference. Result has 299 places, 316 transitions, 714 flow [2024-11-19 05:44:19,682 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=710, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=714, PETRI_PLACES=299, PETRI_TRANSITIONS=316} [2024-11-19 05:44:19,684 INFO L277 CegarLoopForPetriNet]: 323 programPoint places, -24 predicate places. [2024-11-19 05:44:19,684 INFO L471 AbstractCegarLoop]: Abstraction has has 299 places, 316 transitions, 714 flow [2024-11-19 05:44:19,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 461.3333333333333) internal successors, (1384), 3 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:44:19,685 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:44:19,685 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-19 05:44:19,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 05:44:19,686 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread_usbErr0ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-11-19 05:44:19,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:44:19,687 INFO L85 PathProgramCache]: Analyzing trace with hash -375367980, now seen corresponding path program 1 times [2024-11-19 05:44:19,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:44:19,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753177795] [2024-11-19 05:44:19,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:44:19,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:44:19,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:44:19,741 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-19 05:44:19,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:44:19,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753177795] [2024-11-19 05:44:19,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753177795] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:44:19,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:44:19,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:44:19,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361367422] [2024-11-19 05:44:19,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:44:19,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:44:19,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:44:19,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:44:19,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:44:19,785 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 453 out of 514 [2024-11-19 05:44:19,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 316 transitions, 714 flow. Second operand has 3 states, 3 states have (on average 454.3333333333333) internal successors, (1363), 3 states have internal predecessors, (1363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:44:19,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:44:19,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 453 of 514 [2024-11-19 05:44:19,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:44:19,904 INFO L124 PetriNetUnfolderBase]: 123/1436 cut-off events. [2024-11-19 05:44:19,905 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-19 05:44:19,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1683 conditions, 1436 events. 123/1436 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 9200 event pairs, 29 based on Foata normal form. 0/1246 useless extension candidates. Maximal degree in co-relation 1591. Up to 93 conditions per place. [2024-11-19 05:44:19,914 INFO L140 encePairwiseOnDemand]: 511/514 looper letters, 14 selfloop transitions, 2 changer transitions 0/315 dead transitions. [2024-11-19 05:44:19,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 315 transitions, 744 flow [2024-11-19 05:44:19,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:44:19,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:44:19,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1376 transitions. [2024-11-19 05:44:19,916 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8923476005188068 [2024-11-19 05:44:19,917 INFO L175 Difference]: Start difference. First operand has 299 places, 316 transitions, 714 flow. Second operand 3 states and 1376 transitions. [2024-11-19 05:44:19,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 315 transitions, 744 flow [2024-11-19 05:44:19,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 315 transitions, 740 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:44:19,923 INFO L231 Difference]: Finished difference. Result has 298 places, 315 transitions, 712 flow [2024-11-19 05:44:19,923 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=708, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=712, PETRI_PLACES=298, PETRI_TRANSITIONS=315} [2024-11-19 05:44:19,924 INFO L277 CegarLoopForPetriNet]: 323 programPoint places, -25 predicate places. [2024-11-19 05:44:19,924 INFO L471 AbstractCegarLoop]: Abstraction has has 298 places, 315 transitions, 712 flow [2024-11-19 05:44:19,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 454.3333333333333) internal successors, (1363), 3 states have internal predecessors, (1363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:44:19,925 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:44:19,925 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-19 05:44:19,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 05:44:19,926 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-11-19 05:44:19,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:44:19,928 INFO L85 PathProgramCache]: Analyzing trace with hash 929673292, now seen corresponding path program 1 times [2024-11-19 05:44:19,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:44:19,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397146823] [2024-11-19 05:44:19,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:44:19,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:44:19,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:44:20,016 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-19 05:44:20,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:44:20,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397146823] [2024-11-19 05:44:20,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397146823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:44:20,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:44:20,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:44:20,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627406934] [2024-11-19 05:44:20,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:44:20,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:44:20,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:44:20,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:44:20,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:44:20,030 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 464 out of 514 [2024-11-19 05:44:20,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 315 transitions, 712 flow. Second operand has 3 states, 3 states have (on average 465.3333333333333) internal successors, (1396), 3 states have internal predecessors, (1396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:44:20,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:44:20,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 464 of 514 [2024-11-19 05:44:20,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:44:20,210 INFO L124 PetriNetUnfolderBase]: 153/1505 cut-off events. [2024-11-19 05:44:20,211 INFO L125 PetriNetUnfolderBase]: For 33/56 co-relation queries the response was YES. [2024-11-19 05:44:20,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1793 conditions, 1505 events. 153/1505 cut-off events. For 33/56 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 10453 event pairs, 13 based on Foata normal form. 4/1304 useless extension candidates. Maximal degree in co-relation 1695. Up to 97 conditions per place. [2024-11-19 05:44:20,220 INFO L140 encePairwiseOnDemand]: 512/514 looper letters, 14 selfloop transitions, 1 changer transitions 19/319 dead transitions. [2024-11-19 05:44:20,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 319 transitions, 759 flow [2024-11-19 05:44:20,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:44:20,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:44:20,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1408 transitions. [2024-11-19 05:44:20,224 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9130998702983139 [2024-11-19 05:44:20,225 INFO L175 Difference]: Start difference. First operand has 298 places, 315 transitions, 712 flow. Second operand 3 states and 1408 transitions. [2024-11-19 05:44:20,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 319 transitions, 759 flow [2024-11-19 05:44:20,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 319 transitions, 755 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:44:20,230 INFO L231 Difference]: Finished difference. Result has 297 places, 295 transitions, 666 flow [2024-11-19 05:44:20,231 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=706, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=666, PETRI_PLACES=297, PETRI_TRANSITIONS=295} [2024-11-19 05:44:20,232 INFO L277 CegarLoopForPetriNet]: 323 programPoint places, -26 predicate places. [2024-11-19 05:44:20,232 INFO L471 AbstractCegarLoop]: Abstraction has has 297 places, 295 transitions, 666 flow [2024-11-19 05:44:20,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 465.3333333333333) internal successors, (1396), 3 states have internal predecessors, (1396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:44:20,233 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:44:20,234 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:44:20,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 05:44:20,234 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread_usbErr1ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-11-19 05:44:20,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:44:20,234 INFO L85 PathProgramCache]: Analyzing trace with hash 567808721, now seen corresponding path program 1 times [2024-11-19 05:44:20,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:44:20,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577448080] [2024-11-19 05:44:20,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:44:20,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:44:20,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:44:20,308 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-19 05:44:20,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:44:20,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577448080] [2024-11-19 05:44:20,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577448080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:44:20,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:44:20,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:44:20,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104466384] [2024-11-19 05:44:20,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:44:20,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:44:20,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:44:20,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:44:20,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:44:20,364 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 445 out of 514 [2024-11-19 05:44:20,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 295 transitions, 666 flow. Second operand has 3 states, 3 states have (on average 446.3333333333333) internal successors, (1339), 3 states have internal predecessors, (1339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:44:20,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:44:20,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 445 of 514 [2024-11-19 05:44:20,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:44:20,548 INFO L124 PetriNetUnfolderBase]: 147/1605 cut-off events. [2024-11-19 05:44:20,548 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-19 05:44:20,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1896 conditions, 1605 events. 147/1605 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 10895 event pairs, 33 based on Foata normal form. 0/1406 useless extension candidates. Maximal degree in co-relation 1823. Up to 107 conditions per place. [2024-11-19 05:44:20,560 INFO L140 encePairwiseOnDemand]: 506/514 looper letters, 16 selfloop transitions, 5 changer transitions 0/297 dead transitions. [2024-11-19 05:44:20,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 297 transitions, 712 flow [2024-11-19 05:44:20,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:44:20,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:44:20,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1359 transitions. [2024-11-19 05:44:20,564 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8813229571984436 [2024-11-19 05:44:20,565 INFO L175 Difference]: Start difference. First operand has 297 places, 295 transitions, 666 flow. Second operand 3 states and 1359 transitions. [2024-11-19 05:44:20,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 297 transitions, 712 flow [2024-11-19 05:44:20,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 297 transitions, 711 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:44:20,570 INFO L231 Difference]: Finished difference. Result has 278 places, 295 transitions, 686 flow [2024-11-19 05:44:20,570 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=659, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=686, PETRI_PLACES=278, PETRI_TRANSITIONS=295} [2024-11-19 05:44:20,571 INFO L277 CegarLoopForPetriNet]: 323 programPoint places, -45 predicate places. [2024-11-19 05:44:20,572 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 295 transitions, 686 flow [2024-11-19 05:44:20,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 446.3333333333333) internal successors, (1339), 3 states have internal predecessors, (1339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:44:20,573 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:44:20,573 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:44:20,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 05:44:20,573 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread_usbErr7ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-11-19 05:44:20,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:44:20,574 INFO L85 PathProgramCache]: Analyzing trace with hash 336089783, now seen corresponding path program 1 times [2024-11-19 05:44:20,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:44:20,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971061405] [2024-11-19 05:44:20,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:44:20,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:44:20,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:44:20,676 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-19 05:44:20,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:44:20,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971061405] [2024-11-19 05:44:20,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971061405] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:44:20,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:44:20,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 05:44:20,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625939598] [2024-11-19 05:44:20,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:44:20,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:44:20,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:44:20,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:44:20,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:44:20,703 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 452 out of 514 [2024-11-19 05:44:20,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 295 transitions, 686 flow. Second operand has 3 states, 3 states have (on average 453.3333333333333) internal successors, (1360), 3 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:44:20,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:44:20,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 452 of 514 [2024-11-19 05:44:20,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:44:20,859 INFO L124 PetriNetUnfolderBase]: 157/1614 cut-off events. [2024-11-19 05:44:20,860 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2024-11-19 05:44:20,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1954 conditions, 1614 events. 157/1614 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 10872 event pairs, 20 based on Foata normal form. 1/1411 useless extension candidates. Maximal degree in co-relation 1880. Up to 91 conditions per place. [2024-11-19 05:44:20,872 INFO L140 encePairwiseOnDemand]: 506/514 looper letters, 15 selfloop transitions, 5 changer transitions 0/299 dead transitions. [2024-11-19 05:44:20,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 299 transitions, 734 flow [2024-11-19 05:44:20,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:44:20,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:44:20,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1379 transitions. [2024-11-19 05:44:20,875 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8942931258106356 [2024-11-19 05:44:20,876 INFO L175 Difference]: Start difference. First operand has 278 places, 295 transitions, 686 flow. Second operand 3 states and 1379 transitions. [2024-11-19 05:44:20,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 299 transitions, 734 flow [2024-11-19 05:44:20,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 299 transitions, 729 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:44:20,880 INFO L231 Difference]: Finished difference. Result has 281 places, 297 transitions, 715 flow [2024-11-19 05:44:20,880 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=681, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=715, PETRI_PLACES=281, PETRI_TRANSITIONS=297} [2024-11-19 05:44:20,881 INFO L277 CegarLoopForPetriNet]: 323 programPoint places, -42 predicate places. [2024-11-19 05:44:20,881 INFO L471 AbstractCegarLoop]: Abstraction has has 281 places, 297 transitions, 715 flow [2024-11-19 05:44:20,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 453.3333333333333) internal successors, (1360), 3 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:44:20,883 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:44:20,883 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:44:20,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 05:44:20,884 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread_usbErr12ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-11-19 05:44:20,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:44:20,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1864743785, now seen corresponding path program 1 times [2024-11-19 05:44:20,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:44:20,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857552086] [2024-11-19 05:44:20,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:44:20,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:44:20,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:44:20,958 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-19 05:44:20,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:44:20,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857552086] [2024-11-19 05:44:20,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857552086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:44:20,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:44:20,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:44:20,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354703862] [2024-11-19 05:44:20,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:44:20,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:44:20,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:44:20,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:44:20,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:44:21,043 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 445 out of 514 [2024-11-19 05:44:21,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 297 transitions, 715 flow. Second operand has 3 states, 3 states have (on average 447.0) internal successors, (1341), 3 states have internal predecessors, (1341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:44:21,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:44:21,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 445 of 514 [2024-11-19 05:44:21,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:44:21,190 INFO L124 PetriNetUnfolderBase]: 194/1751 cut-off events. [2024-11-19 05:44:21,190 INFO L125 PetriNetUnfolderBase]: For 138/164 co-relation queries the response was YES. [2024-11-19 05:44:21,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2269 conditions, 1751 events. 194/1751 cut-off events. For 138/164 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 12007 event pairs, 36 based on Foata normal form. 2/1543 useless extension candidates. Maximal degree in co-relation 2190. Up to 190 conditions per place. [2024-11-19 05:44:21,202 INFO L140 encePairwiseOnDemand]: 508/514 looper letters, 30 selfloop transitions, 8 changer transitions 0/305 dead transitions. [2024-11-19 05:44:21,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 305 transitions, 817 flow [2024-11-19 05:44:21,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:44:21,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:44:21,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1364 transitions. [2024-11-19 05:44:21,205 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8845654993514915 [2024-11-19 05:44:21,205 INFO L175 Difference]: Start difference. First operand has 281 places, 297 transitions, 715 flow. Second operand 3 states and 1364 transitions. [2024-11-19 05:44:21,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 305 transitions, 817 flow [2024-11-19 05:44:21,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 305 transitions, 807 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:44:21,210 INFO L231 Difference]: Finished difference. Result has 283 places, 303 transitions, 773 flow [2024-11-19 05:44:21,211 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=705, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=773, PETRI_PLACES=283, PETRI_TRANSITIONS=303} [2024-11-19 05:44:21,212 INFO L277 CegarLoopForPetriNet]: 323 programPoint places, -40 predicate places. [2024-11-19 05:44:21,212 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 303 transitions, 773 flow [2024-11-19 05:44:21,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 447.0) internal successors, (1341), 3 states have internal predecessors, (1341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:44:21,213 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:44:21,213 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:44:21,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 05:44:21,213 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread_usbErr2ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-11-19 05:44:21,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:44:21,214 INFO L85 PathProgramCache]: Analyzing trace with hash 241274166, now seen corresponding path program 1 times [2024-11-19 05:44:21,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:44:21,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112552359] [2024-11-19 05:44:21,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:44:21,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:44:21,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:44:21,284 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-19 05:44:21,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:44:21,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112552359] [2024-11-19 05:44:21,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112552359] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:44:21,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:44:21,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:44:21,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330308282] [2024-11-19 05:44:21,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:44:21,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:44:21,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:44:21,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:44:21,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:44:21,303 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 458 out of 514 [2024-11-19 05:44:21,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 303 transitions, 773 flow. Second operand has 3 states, 3 states have (on average 459.6666666666667) internal successors, (1379), 3 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:44:21,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:44:21,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 458 of 514 [2024-11-19 05:44:21,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:44:21,454 INFO L124 PetriNetUnfolderBase]: 175/1811 cut-off events. [2024-11-19 05:44:21,454 INFO L125 PetriNetUnfolderBase]: For 102/113 co-relation queries the response was YES. [2024-11-19 05:44:21,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2309 conditions, 1811 events. 175/1811 cut-off events. For 102/113 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 12591 event pairs, 18 based on Foata normal form. 0/1598 useless extension candidates. Maximal degree in co-relation 2232. Up to 103 conditions per place. [2024-11-19 05:44:21,466 INFO L140 encePairwiseOnDemand]: 511/514 looper letters, 14 selfloop transitions, 2 changer transitions 0/304 dead transitions. [2024-11-19 05:44:21,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 304 transitions, 807 flow [2024-11-19 05:44:21,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:44:21,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:44:21,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1391 transitions. [2024-11-19 05:44:21,469 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9020752269779507 [2024-11-19 05:44:21,469 INFO L175 Difference]: Start difference. First operand has 283 places, 303 transitions, 773 flow. Second operand 3 states and 1391 transitions. [2024-11-19 05:44:21,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 304 transitions, 807 flow [2024-11-19 05:44:21,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 304 transitions, 791 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:44:21,474 INFO L231 Difference]: Finished difference. Result has 282 places, 302 transitions, 759 flow [2024-11-19 05:44:21,475 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=755, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=759, PETRI_PLACES=282, PETRI_TRANSITIONS=302} [2024-11-19 05:44:21,475 INFO L277 CegarLoopForPetriNet]: 323 programPoint places, -41 predicate places. [2024-11-19 05:44:21,475 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 302 transitions, 759 flow [2024-11-19 05:44:21,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 459.6666666666667) internal successors, (1379), 3 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:44:21,476 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:44:21,476 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:44:21,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 05:44:21,477 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread_usbErr3ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-11-19 05:44:21,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:44:21,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1974694377, now seen corresponding path program 1 times [2024-11-19 05:44:21,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:44:21,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486746219] [2024-11-19 05:44:21,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:44:21,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:44:21,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:44:21,541 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-19 05:44:21,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:44:21,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486746219] [2024-11-19 05:44:21,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486746219] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:44:21,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:44:21,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:44:21,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650910125] [2024-11-19 05:44:21,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:44:21,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:44:21,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:44:21,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:44:21,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:44:21,584 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 453 out of 514 [2024-11-19 05:44:21,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 302 transitions, 759 flow. Second operand has 3 states, 3 states have (on average 455.0) internal successors, (1365), 3 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:44:21,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:44:21,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 453 of 514 [2024-11-19 05:44:21,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:44:21,728 INFO L124 PetriNetUnfolderBase]: 193/1832 cut-off events. [2024-11-19 05:44:21,728 INFO L125 PetriNetUnfolderBase]: For 129/142 co-relation queries the response was YES. [2024-11-19 05:44:21,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2362 conditions, 1832 events. 193/1832 cut-off events. For 129/142 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 12981 event pairs, 27 based on Foata normal form. 0/1617 useless extension candidates. Maximal degree in co-relation 2285. Up to 127 conditions per place. [2024-11-19 05:44:21,739 INFO L140 encePairwiseOnDemand]: 511/514 looper letters, 19 selfloop transitions, 2 changer transitions 0/303 dead transitions. [2024-11-19 05:44:21,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 303 transitions, 803 flow [2024-11-19 05:44:21,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:44:21,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:44:21,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1378 transitions. [2024-11-19 05:44:21,743 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.893644617380026 [2024-11-19 05:44:21,743 INFO L175 Difference]: Start difference. First operand has 282 places, 302 transitions, 759 flow. Second operand 3 states and 1378 transitions. [2024-11-19 05:44:21,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 303 transitions, 803 flow [2024-11-19 05:44:21,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 303 transitions, 799 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:44:21,747 INFO L231 Difference]: Finished difference. Result has 281 places, 301 transitions, 757 flow [2024-11-19 05:44:21,748 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=753, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=757, PETRI_PLACES=281, PETRI_TRANSITIONS=301} [2024-11-19 05:44:21,749 INFO L277 CegarLoopForPetriNet]: 323 programPoint places, -42 predicate places. [2024-11-19 05:44:21,749 INFO L471 AbstractCegarLoop]: Abstraction has has 281 places, 301 transitions, 757 flow [2024-11-19 05:44:21,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 455.0) internal successors, (1365), 3 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:44:21,750 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:44:21,750 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:44:21,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 05:44:21,750 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-11-19 05:44:21,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:44:21,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1916310265, now seen corresponding path program 1 times [2024-11-19 05:44:21,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:44:21,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115971756] [2024-11-19 05:44:21,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:44:21,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:44:21,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:44:21,796 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-19 05:44:21,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:44:21,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115971756] [2024-11-19 05:44:21,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115971756] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:44:21,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:44:21,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:44:21,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600007355] [2024-11-19 05:44:21,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:44:21,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:44:21,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:44:21,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:44:21,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:44:21,873 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 442 out of 514 [2024-11-19 05:44:21,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 301 transitions, 757 flow. Second operand has 3 states, 3 states have (on average 445.0) internal successors, (1335), 3 states have internal predecessors, (1335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:44:21,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:44:21,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 442 of 514 [2024-11-19 05:44:21,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:44:22,054 INFO L124 PetriNetUnfolderBase]: 299/2254 cut-off events. [2024-11-19 05:44:22,054 INFO L125 PetriNetUnfolderBase]: For 357/476 co-relation queries the response was YES. [2024-11-19 05:44:22,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3180 conditions, 2254 events. 299/2254 cut-off events. For 357/476 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 17469 event pairs, 53 based on Foata normal form. 9/1995 useless extension candidates. Maximal degree in co-relation 3101. Up to 335 conditions per place. [2024-11-19 05:44:22,069 INFO L140 encePairwiseOnDemand]: 504/514 looper letters, 35 selfloop transitions, 16 changer transitions 0/314 dead transitions. [2024-11-19 05:44:22,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 314 transitions, 914 flow [2024-11-19 05:44:22,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:44:22,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:44:22,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1361 transitions. [2024-11-19 05:44:22,072 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8826199740596627 [2024-11-19 05:44:22,073 INFO L175 Difference]: Start difference. First operand has 281 places, 301 transitions, 757 flow. Second operand 3 states and 1361 transitions. [2024-11-19 05:44:22,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 314 transitions, 914 flow [2024-11-19 05:44:22,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 314 transitions, 910 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:44:22,079 INFO L231 Difference]: Finished difference. Result has 283 places, 313 transitions, 895 flow [2024-11-19 05:44:22,079 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=753, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=895, PETRI_PLACES=283, PETRI_TRANSITIONS=313} [2024-11-19 05:44:22,081 INFO L277 CegarLoopForPetriNet]: 323 programPoint places, -40 predicate places. [2024-11-19 05:44:22,081 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 313 transitions, 895 flow [2024-11-19 05:44:22,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 445.0) internal successors, (1335), 3 states have internal predecessors, (1335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:44:22,082 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:44:22,082 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:44:22,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 05:44:22,083 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread_usbErr4ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-11-19 05:44:22,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:44:22,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1082734402, now seen corresponding path program 1 times [2024-11-19 05:44:22,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:44:22,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856680126] [2024-11-19 05:44:22,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:44:22,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:44:22,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:44:22,140 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-19 05:44:22,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:44:22,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856680126] [2024-11-19 05:44:22,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856680126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:44:22,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:44:22,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:44:22,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749736776] [2024-11-19 05:44:22,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:44:22,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:44:22,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:44:22,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:44:22,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:44:22,214 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 444 out of 514 [2024-11-19 05:44:22,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 313 transitions, 895 flow. Second operand has 3 states, 3 states have (on average 446.0) internal successors, (1338), 3 states have internal predecessors, (1338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:44:22,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:44:22,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 444 of 514 [2024-11-19 05:44:22,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:44:22,437 INFO L124 PetriNetUnfolderBase]: 310/2459 cut-off events. [2024-11-19 05:44:22,438 INFO L125 PetriNetUnfolderBase]: For 900/993 co-relation queries the response was YES. [2024-11-19 05:44:22,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3604 conditions, 2459 events. 310/2459 cut-off events. For 900/993 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 19434 event pairs, 39 based on Foata normal form. 7/2187 useless extension candidates. Maximal degree in co-relation 3524. Up to 289 conditions per place. [2024-11-19 05:44:22,453 INFO L140 encePairwiseOnDemand]: 508/514 looper letters, 44 selfloop transitions, 9 changer transitions 0/320 dead transitions. [2024-11-19 05:44:22,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 320 transitions, 1035 flow [2024-11-19 05:44:22,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:44:22,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:44:22,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1362 transitions. [2024-11-19 05:44:22,456 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8832684824902723 [2024-11-19 05:44:22,456 INFO L175 Difference]: Start difference. First operand has 283 places, 313 transitions, 895 flow. Second operand 3 states and 1362 transitions. [2024-11-19 05:44:22,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 320 transitions, 1035 flow [2024-11-19 05:44:22,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 320 transitions, 999 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:44:22,462 INFO L231 Difference]: Finished difference. Result has 285 places, 318 transitions, 937 flow [2024-11-19 05:44:22,462 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=863, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=937, PETRI_PLACES=285, PETRI_TRANSITIONS=318} [2024-11-19 05:44:22,463 INFO L277 CegarLoopForPetriNet]: 323 programPoint places, -38 predicate places. [2024-11-19 05:44:22,464 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 318 transitions, 937 flow [2024-11-19 05:44:22,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 446.0) internal successors, (1338), 3 states have internal predecessors, (1338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:44:22,465 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:44:22,465 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:44:22,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 05:44:22,465 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-11-19 05:44:22,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:44:22,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1602259071, now seen corresponding path program 1 times [2024-11-19 05:44:22,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:44:22,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918323814] [2024-11-19 05:44:22,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:44:22,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:44:22,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:44:22,514 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-19 05:44:22,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:44:22,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918323814] [2024-11-19 05:44:22,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918323814] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:44:22,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:44:22,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:44:22,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872243707] [2024-11-19 05:44:22,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:44:22,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:44:22,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:44:22,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:44:22,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:44:22,590 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 442 out of 514 [2024-11-19 05:44:22,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 318 transitions, 937 flow. Second operand has 3 states, 3 states have (on average 445.3333333333333) internal successors, (1336), 3 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:44:22,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:44:22,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 442 of 514 [2024-11-19 05:44:22,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:44:22,923 INFO L124 PetriNetUnfolderBase]: 566/3731 cut-off events. [2024-11-19 05:44:22,923 INFO L125 PetriNetUnfolderBase]: For 2189/2477 co-relation queries the response was YES. [2024-11-19 05:44:22,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5915 conditions, 3731 events. 566/3731 cut-off events. For 2189/2477 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 33750 event pairs, 142 based on Foata normal form. 10/3316 useless extension candidates. Maximal degree in co-relation 5448. Up to 601 conditions per place. [2024-11-19 05:44:22,944 INFO L140 encePairwiseOnDemand]: 508/514 looper letters, 49 selfloop transitions, 9 changer transitions 1/325 dead transitions. [2024-11-19 05:44:22,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 325 transitions, 1089 flow [2024-11-19 05:44:22,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:44:22,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:44:22,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1358 transitions. [2024-11-19 05:44:22,947 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.880674448767834 [2024-11-19 05:44:22,948 INFO L175 Difference]: Start difference. First operand has 285 places, 318 transitions, 937 flow. Second operand 3 states and 1358 transitions. [2024-11-19 05:44:22,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 325 transitions, 1089 flow [2024-11-19 05:44:22,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 325 transitions, 1065 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-11-19 05:44:22,955 INFO L231 Difference]: Finished difference. Result has 287 places, 322 transitions, 989 flow [2024-11-19 05:44:22,955 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=913, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=989, PETRI_PLACES=287, PETRI_TRANSITIONS=322} [2024-11-19 05:44:22,955 INFO L277 CegarLoopForPetriNet]: 323 programPoint places, -36 predicate places. [2024-11-19 05:44:22,956 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 322 transitions, 989 flow [2024-11-19 05:44:22,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 445.3333333333333) internal successors, (1336), 3 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:44:22,957 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:44:22,957 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:44:22,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 05:44:22,957 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread_usbErr12ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-11-19 05:44:22,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:44:22,957 INFO L85 PathProgramCache]: Analyzing trace with hash 135680379, now seen corresponding path program 1 times [2024-11-19 05:44:22,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:44:22,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521899696] [2024-11-19 05:44:22,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:44:22,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:44:22,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:44:23,047 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-19 05:44:23,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:44:23,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521899696] [2024-11-19 05:44:23,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521899696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:44:23,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:44:23,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:44:23,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845412450] [2024-11-19 05:44:23,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:44:23,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 05:44:23,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:44:23,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 05:44:23,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 05:44:23,075 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 457 out of 514 [2024-11-19 05:44:23,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 322 transitions, 989 flow. Second operand has 5 states, 5 states have (on average 459.4) internal successors, (2297), 5 states have internal predecessors, (2297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:44:23,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:44:23,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 457 of 514 [2024-11-19 05:44:23,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:44:23,631 INFO L124 PetriNetUnfolderBase]: 557/4613 cut-off events. [2024-11-19 05:44:23,631 INFO L125 PetriNetUnfolderBase]: For 1450/1560 co-relation queries the response was YES. [2024-11-19 05:44:23,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6727 conditions, 4613 events. 557/4613 cut-off events. For 1450/1560 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 38993 event pairs, 50 based on Foata normal form. 8/4117 useless extension candidates. Maximal degree in co-relation 6647. Up to 285 conditions per place. [2024-11-19 05:44:23,658 INFO L140 encePairwiseOnDemand]: 506/514 looper letters, 32 selfloop transitions, 8 changer transitions 0/344 dead transitions. [2024-11-19 05:44:23,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 344 transitions, 1120 flow [2024-11-19 05:44:23,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 05:44:23,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-19 05:44:23,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 3240 transitions. [2024-11-19 05:44:23,664 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9005002779321846 [2024-11-19 05:44:23,664 INFO L175 Difference]: Start difference. First operand has 287 places, 322 transitions, 989 flow. Second operand 7 states and 3240 transitions. [2024-11-19 05:44:23,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 344 transitions, 1120 flow [2024-11-19 05:44:23,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 344 transitions, 1090 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-11-19 05:44:23,672 INFO L231 Difference]: Finished difference. Result has 296 places, 329 transitions, 1017 flow [2024-11-19 05:44:23,672 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=959, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1017, PETRI_PLACES=296, PETRI_TRANSITIONS=329} [2024-11-19 05:44:23,673 INFO L277 CegarLoopForPetriNet]: 323 programPoint places, -27 predicate places. [2024-11-19 05:44:23,673 INFO L471 AbstractCegarLoop]: Abstraction has has 296 places, 329 transitions, 1017 flow [2024-11-19 05:44:23,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 459.4) internal successors, (2297), 5 states have internal predecessors, (2297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:44:23,675 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:44:23,675 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:44:23,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 05:44:23,675 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread_usbErr12ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-11-19 05:44:23,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:44:23,675 INFO L85 PathProgramCache]: Analyzing trace with hash 254624561, now seen corresponding path program 1 times [2024-11-19 05:44:23,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:44:23,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210427314] [2024-11-19 05:44:23,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:44:23,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:44:23,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:44:23,761 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-19 05:44:23,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:44:23,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210427314] [2024-11-19 05:44:23,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210427314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:44:23,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:44:23,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:44:23,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578475797] [2024-11-19 05:44:23,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:44:23,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 05:44:23,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:44:23,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 05:44:23,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 05:44:23,790 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 459 out of 514 [2024-11-19 05:44:23,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 329 transitions, 1017 flow. Second operand has 5 states, 5 states have (on average 461.0) internal successors, (2305), 5 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:44:23,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:44:23,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 459 of 514 [2024-11-19 05:44:23,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:44:24,604 INFO L124 PetriNetUnfolderBase]: 887/7750 cut-off events. [2024-11-19 05:44:24,605 INFO L125 PetriNetUnfolderBase]: For 2419/2620 co-relation queries the response was YES. [2024-11-19 05:44:24,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11498 conditions, 7750 events. 887/7750 cut-off events. For 2419/2620 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 74048 event pairs, 88 based on Foata normal form. 16/6951 useless extension candidates. Maximal degree in co-relation 11414. Up to 550 conditions per place. [2024-11-19 05:44:24,662 INFO L140 encePairwiseOnDemand]: 507/514 looper letters, 34 selfloop transitions, 9 changer transitions 0/356 dead transitions. [2024-11-19 05:44:24,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 356 transitions, 1168 flow [2024-11-19 05:44:24,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 05:44:24,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-19 05:44:24,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 3257 transitions. [2024-11-19 05:44:24,668 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.905225125069483 [2024-11-19 05:44:24,668 INFO L175 Difference]: Start difference. First operand has 296 places, 329 transitions, 1017 flow. Second operand 7 states and 3257 transitions. [2024-11-19 05:44:24,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 356 transitions, 1168 flow [2024-11-19 05:44:24,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 356 transitions, 1168 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:44:24,675 INFO L231 Difference]: Finished difference. Result has 308 places, 337 transitions, 1085 flow [2024-11-19 05:44:24,675 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=1017, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=329, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1085, PETRI_PLACES=308, PETRI_TRANSITIONS=337} [2024-11-19 05:44:24,675 INFO L277 CegarLoopForPetriNet]: 323 programPoint places, -15 predicate places. [2024-11-19 05:44:24,676 INFO L471 AbstractCegarLoop]: Abstraction has has 308 places, 337 transitions, 1085 flow [2024-11-19 05:44:24,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 461.0) internal successors, (2305), 5 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:44:24,677 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:44:24,677 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:44:24,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 05:44:24,677 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-11-19 05:44:24,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:44:24,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1803342996, now seen corresponding path program 1 times [2024-11-19 05:44:24,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:44:24,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714241460] [2024-11-19 05:44:24,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:44:24,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:44:24,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 05:44:24,693 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 05:44:24,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 05:44:24,728 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 05:44:24,729 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 05:44:24,729 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE (42 of 43 remaining) [2024-11-19 05:44:24,744 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE (41 of 43 remaining) [2024-11-19 05:44:24,744 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE (40 of 43 remaining) [2024-11-19 05:44:24,744 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (39 of 43 remaining) [2024-11-19 05:44:24,744 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (38 of 43 remaining) [2024-11-19 05:44:24,744 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (37 of 43 remaining) [2024-11-19 05:44:24,744 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (36 of 43 remaining) [2024-11-19 05:44:24,744 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (35 of 43 remaining) [2024-11-19 05:44:24,744 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (34 of 43 remaining) [2024-11-19 05:44:24,744 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (33 of 43 remaining) [2024-11-19 05:44:24,744 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (32 of 43 remaining) [2024-11-19 05:44:24,744 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 43 remaining) [2024-11-19 05:44:24,745 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr0ASSERT_VIOLATIONDATA_RACE (30 of 43 remaining) [2024-11-19 05:44:24,745 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr12ASSERT_VIOLATIONDATA_RACE (29 of 43 remaining) [2024-11-19 05:44:24,745 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr1ASSERT_VIOLATIONDATA_RACE (28 of 43 remaining) [2024-11-19 05:44:24,745 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr13ASSERT_VIOLATIONDATA_RACE (27 of 43 remaining) [2024-11-19 05:44:24,745 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr6ASSERT_VIOLATIONDATA_RACE (26 of 43 remaining) [2024-11-19 05:44:24,745 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr11ASSERT_VIOLATIONDATA_RACE (25 of 43 remaining) [2024-11-19 05:44:24,745 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr7ASSERT_VIOLATIONDATA_RACE (24 of 43 remaining) [2024-11-19 05:44:24,745 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr2ASSERT_VIOLATIONDATA_RACE (23 of 43 remaining) [2024-11-19 05:44:24,745 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr8ASSERT_VIOLATIONDATA_RACE (22 of 43 remaining) [2024-11-19 05:44:24,746 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr9ASSERT_VIOLATIONDATA_RACE (21 of 43 remaining) [2024-11-19 05:44:24,746 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr10ASSERT_VIOLATIONDATA_RACE (20 of 43 remaining) [2024-11-19 05:44:24,746 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr3ASSERT_VIOLATIONDATA_RACE (19 of 43 remaining) [2024-11-19 05:44:24,746 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr4ASSERT_VIOLATIONDATA_RACE (18 of 43 remaining) [2024-11-19 05:44:24,746 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr5ASSERT_VIOLATIONDATA_RACE (17 of 43 remaining) [2024-11-19 05:44:24,746 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 43 remaining) [2024-11-19 05:44:24,746 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE (15 of 43 remaining) [2024-11-19 05:44:24,746 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr0ASSERT_VIOLATIONDATA_RACE (14 of 43 remaining) [2024-11-19 05:44:24,746 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr12ASSERT_VIOLATIONDATA_RACE (13 of 43 remaining) [2024-11-19 05:44:24,747 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr1ASSERT_VIOLATIONDATA_RACE (12 of 43 remaining) [2024-11-19 05:44:24,747 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr13ASSERT_VIOLATIONDATA_RACE (11 of 43 remaining) [2024-11-19 05:44:24,747 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr6ASSERT_VIOLATIONDATA_RACE (10 of 43 remaining) [2024-11-19 05:44:24,747 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr11ASSERT_VIOLATIONDATA_RACE (9 of 43 remaining) [2024-11-19 05:44:24,747 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr7ASSERT_VIOLATIONDATA_RACE (8 of 43 remaining) [2024-11-19 05:44:24,747 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr2ASSERT_VIOLATIONDATA_RACE (7 of 43 remaining) [2024-11-19 05:44:24,747 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr8ASSERT_VIOLATIONDATA_RACE (6 of 43 remaining) [2024-11-19 05:44:24,747 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr9ASSERT_VIOLATIONDATA_RACE (5 of 43 remaining) [2024-11-19 05:44:24,747 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr10ASSERT_VIOLATIONDATA_RACE (4 of 43 remaining) [2024-11-19 05:44:24,747 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr3ASSERT_VIOLATIONDATA_RACE (3 of 43 remaining) [2024-11-19 05:44:24,747 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr4ASSERT_VIOLATIONDATA_RACE (2 of 43 remaining) [2024-11-19 05:44:24,747 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr5ASSERT_VIOLATIONDATA_RACE (1 of 43 remaining) [2024-11-19 05:44:24,748 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbThread1of1ForFork0Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 43 remaining) [2024-11-19 05:44:24,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 05:44:24,748 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:44:24,812 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-19 05:44:24,812 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 05:44:24,816 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 05:44:24 BasicIcfg [2024-11-19 05:44:24,816 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 05:44:24,816 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 05:44:24,816 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 05:44:24,816 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 05:44:24,817 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:44:17" (3/4) ... [2024-11-19 05:44:24,817 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-19 05:44:24,887 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 05:44:24,887 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 05:44:24,887 INFO L158 Benchmark]: Toolchain (without parser) took 9345.19ms. Allocated memory was 176.2MB in the beginning and 604.0MB in the end (delta: 427.8MB). Free memory was 104.2MB in the beginning and 525.1MB in the end (delta: -420.8MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB. [2024-11-19 05:44:24,888 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 176.2MB. Free memory was 132.8MB in the beginning and 132.6MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 05:44:24,888 INFO L158 Benchmark]: CACSL2BoogieTranslator took 859.55ms. Allocated memory is still 176.2MB. Free memory was 104.1MB in the beginning and 99.7MB in the end (delta: 4.3MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. [2024-11-19 05:44:24,888 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.84ms. Allocated memory is still 176.2MB. Free memory was 99.1MB in the beginning and 95.6MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 05:44:24,888 INFO L158 Benchmark]: Boogie Preprocessor took 42.25ms. Allocated memory is still 176.2MB. Free memory was 95.6MB in the beginning and 92.1MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 05:44:24,888 INFO L158 Benchmark]: RCFGBuilder took 669.92ms. Allocated memory is still 176.2MB. Free memory was 92.1MB in the beginning and 60.7MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-19 05:44:24,889 INFO L158 Benchmark]: TraceAbstraction took 7630.03ms. Allocated memory was 176.2MB in the beginning and 604.0MB in the end (delta: 427.8MB). Free memory was 60.0MB in the beginning and 542.9MB in the end (delta: -482.9MB). Peak memory consumption was 284.6MB. Max. memory is 16.1GB. [2024-11-19 05:44:24,889 INFO L158 Benchmark]: Witness Printer took 70.83ms. Allocated memory is still 604.0MB. Free memory was 542.9MB in the beginning and 525.1MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-19 05:44:24,890 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.18ms. Allocated memory is still 176.2MB. Free memory was 132.8MB in the beginning and 132.6MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 859.55ms. Allocated memory is still 176.2MB. Free memory was 104.1MB in the beginning and 99.7MB in the end (delta: 4.3MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.84ms. Allocated memory is still 176.2MB. Free memory was 99.1MB in the beginning and 95.6MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.25ms. Allocated memory is still 176.2MB. Free memory was 95.6MB in the beginning and 92.1MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 669.92ms. Allocated memory is still 176.2MB. Free memory was 92.1MB in the beginning and 60.7MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 7630.03ms. Allocated memory was 176.2MB in the beginning and 604.0MB in the end (delta: 427.8MB). Free memory was 60.0MB in the beginning and 542.9MB in the end (delta: -482.9MB). Peak memory consumption was 284.6MB. Max. memory is 16.1GB. * Witness Printer took 70.83ms. Allocated memory is still 604.0MB. Free memory was 542.9MB in the beginning and 525.1MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 1699]: Data race detected Data race detected The following path leads to a data race: [L1694] 0 pthread_t t1, t2; VAL [t1=0, t2=0] [L1695] 0 pthread_mutex_t mutex; VAL [mutex={3:0}, t1=0, t2=0] [L1696] 0 int pdev; VAL [mutex={3:0}, pdev=0, t1=0, t2=0] [L1741] 0 int ldv_usb_state; VAL [ldv_usb_state=0, mutex={3:0}, pdev=0, t1=0, t2=0] [L1798] CALL 0 module_init() [L1779] 0 pdev = 1 VAL [ldv_usb_state=0, mutex={3:0}, pdev=1, t1=0, t2=0] [L1780] EXPR 0 pdev==1 [L1780] CALL 0 ldv_assert(pdev==1) [L1693] COND FALSE 0 !(!expression) VAL [\old(expression)=1, expression=1, ldv_usb_state=0, mutex={3:0}, pdev=1, t1=0, t2=0] [L1780] RET 0 ldv_assert(pdev==1) [L1781] COND TRUE 0 __VERIFIER_nondet_int() VAL [ldv_usb_state=0, mutex={3:0}, pdev=1, t1=0, t2=0] [L1782] 0 pthread_create(&t1, ((void *)0), thread_usb, ((void *)0)) VAL [ldv_usb_state=0, mutex={3:0}, pdev=1, t1=-1, t2=0] [L1782] FCALL, FORK 0 pthread_create(&t1, ((void *)0), thread_usb, ((void *)0)) VAL [ldv_usb_state=0, mutex={3:0}, pdev=1, t1=-1, t2=0] [L1743] 1 ldv_usb_state = 0 VAL [\old(arg)={0:0}, arg={0:0}, ldv_usb_state=0, mutex={3:0}, pdev=1, t1=-1, t2=0] [L1744] 1 int probe_ret; VAL [\old(arg)={0:0}, arg={0:0}, ldv_usb_state=0, mutex={3:0}, pdev=1, t1=-1, t2=0] [L1745] COND TRUE 1 1 VAL [\old(arg)={0:0}, arg={0:0}, ldv_usb_state=0, mutex={3:0}, pdev=1, t1=-1, t2=0] [L1747] 1 case 0: VAL [\old(arg)={0:0}, arg={0:0}, ldv_usb_state=0, mutex={3:0}, pdev=1, t1=-1, t2=0] [L1748] 1 ldv_usb_state==0 VAL [\old(arg)={0:0}, arg={0:0}, ldv_usb_state=0, mutex={3:0}, pdev=1, t1=-1, t2=0] [L1747] 1 case 0: [L1749] CALL, EXPR 1 ath_ahb_probe() [L1730] 1 int error; [L1731] CALL, EXPR 1 ieee80211_register_hw() [L1717] COND TRUE 1 __VERIFIER_nondet_int() VAL [ldv_usb_state=0, mutex={3:0}, pdev=1, t1=-1, t2=0] [L1718] 1 pthread_create(&t2, ((void *)0), thread_ath9k, ((void *)0)) VAL [ldv_usb_state=0, mutex={3:0}, pdev=1, t1=-1, t2=0] [L1718] FCALL, FORK 1 pthread_create(&t2, ((void *)0), thread_ath9k, ((void *)0)) VAL [ldv_usb_state=0, mutex={3:0}, pdev=1, t1=-1, t2=0] [L1704] COND TRUE 2 1 VAL [\old(arg)={0:0}, arg={0:0}, ldv_usb_state=0, mutex={3:0}, pdev=1, t1=-1, t2=0] [L1706] 2 case 1: [L1707] CALL 2 ath9k_flush() [L1719] 1 return 0; VAL [\result=0, ldv_usb_state=0, mutex={3:0}, pdev=1, t1=-1, t2=0] [L1731] RET, EXPR 1 ieee80211_register_hw() [L1731] 1 error = ieee80211_register_hw() VAL [error=0, ldv_usb_state=0, mutex={3:0}, pdev=1, t1=-1, t2=0] [L1732] COND FALSE 1 !(\read(error)) VAL [error=0, ldv_usb_state=0, mutex={3:0}, pdev=1, t1=-1, t2=0] [L1734] 1 return 0; VAL [\result=0, error=0, ldv_usb_state=0, mutex={3:0}, pdev=1, t1=-1, t2=0] [L1749] RET, EXPR 1 ath_ahb_probe() [L1749] 1 probe_ret = ath_ahb_probe() VAL [\old(arg)={0:0}, arg={0:0}, ldv_usb_state=0, mutex={3:0}, pdev=1, probe_ret=0, t1=-1, t2=0] [L1747] 1 case 0: VAL [\old(arg)={0:0}, arg={0:0}, ldv_usb_state=0, mutex={3:0}, pdev=1, probe_ret=0, t1=-1, t2=0] [L1752] 1 ldv_usb_state = 1 VAL [\old(arg)={0:0}, arg={0:0}, ldv_usb_state=1, mutex={3:0}, pdev=1, probe_ret=0, t1=-1, t2=0] [L1753] 1 pdev = 7 VAL [\old(arg)={0:0}, arg={0:0}, ldv_usb_state=1, mutex={3:0}, pdev=7, probe_ret=0, t1=-1, t2=0] [L1699] 2 pdev = 6 VAL [ldv_usb_state=1, mutex={3:0}, pdev=6, t1=-1, t2=0] [L1753] 1 pdev = 7 VAL [\old(arg)={0:0}, arg={0:0}, ldv_usb_state=1, mutex={3:0}, pdev=6, probe_ret=0, t1=-1, t2=0] [L1699] 2 pdev = 6 VAL [ldv_usb_state=1, mutex={3:0}, pdev=6, t1=-1, t2=0] Now there is a data race on ~pdev~0 between C: pdev = 7 [1753] and C: pdev = 6 [1699] - UnprovableResult [Line: 1700]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1779]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1780]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1785]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1782]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1786]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1792]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1794]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1795]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1782]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1743]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1773]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1748]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1774]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1758]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1766]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1725]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1718]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1760]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1761]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1762]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1752]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1753]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1754]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1718]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1718]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 517 locations, 43 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.4s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1300 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 454 mSDsluCounter, 275 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 51 mSDsCounter, 78 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1332 IncrementalHoareTripleChecker+Invalid, 1410 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 78 mSolverCounterUnsat, 224 mSDtfsCounter, 1332 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1085occurred in iteration=16, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1230 NumberOfCodeBlocks, 1230 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1099 ConstructedInterpolants, 0 QuantifiedInterpolants, 1179 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-19 05:44:24,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE