./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/ldv-races/race-4_1-thread_local_vars.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 735b3cc8 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-races/race-4_1-thread_local_vars.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a9552a698db9701543deeff63aa990ab8fc4764b65dba5035623425bdf77554d --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:30:30,108 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:30:30,147 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-14 01:30:30,151 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:30:30,151 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:30:30,174 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:30:30,175 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:30:30,175 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:30:30,175 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:30:30,176 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:30:30,176 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:30:30,176 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:30:30,176 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:30:30,176 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:30:30,176 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:30:30,176 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:30:30,176 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:30:30,176 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:30:30,176 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:30:30,176 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:30:30,176 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:30:30,176 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:30:30,177 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-14 01:30:30,177 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-14 01:30:30,177 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:30:30,177 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:30:30,177 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:30:30,177 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:30:30,177 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:30:30,177 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:30:30,177 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:30:30,177 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:30:30,177 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:30:30,177 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:30:30,177 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:30:30,177 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:30:30,177 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:30:30,177 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:30:30,177 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:30:30,178 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:30:30,178 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:30:30,178 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:30:30,178 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a9552a698db9701543deeff63aa990ab8fc4764b65dba5035623425bdf77554d [2025-03-14 01:30:30,415 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:30:30,422 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:30:30,424 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:30:30,425 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:30:30,425 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:30:30,427 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-4_1-thread_local_vars.i [2025-03-14 01:30:31,624 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9802ca3d/4e3f7445f2504371bc90d36cf24be05b/FLAGc83f2d36f [2025-03-14 01:30:31,934 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:30:31,935 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-4_1-thread_local_vars.i [2025-03-14 01:30:31,956 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9802ca3d/4e3f7445f2504371bc90d36cf24be05b/FLAGc83f2d36f [2025-03-14 01:30:31,969 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9802ca3d/4e3f7445f2504371bc90d36cf24be05b [2025-03-14 01:30:31,971 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:30:31,972 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:30:31,973 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:30:31,973 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:30:31,976 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:30:31,977 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:30:31" (1/1) ... [2025-03-14 01:30:31,977 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7740ce21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:30:31, skipping insertion in model container [2025-03-14 01:30:31,977 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:30:31" (1/1) ... [2025-03-14 01:30:32,018 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:30:32,473 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:30:32,487 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:30:32,537 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:30:32,617 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:30:32,617 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:30:32 WrapperNode [2025-03-14 01:30:32,617 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:30:32,618 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:30:32,618 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:30:32,618 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:30:32,622 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:30:32" (1/1) ... [2025-03-14 01:30:32,638 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:30:32" (1/1) ... [2025-03-14 01:30:32,660 INFO L138 Inliner]: procedures = 487, calls = 37, calls flagged for inlining = 16, calls inlined = 21, statements flattened = 274 [2025-03-14 01:30:32,660 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:30:32,661 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:30:32,661 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:30:32,661 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:30:32,666 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:30:32" (1/1) ... [2025-03-14 01:30:32,666 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:30:32" (1/1) ... [2025-03-14 01:30:32,670 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:30:32" (1/1) ... [2025-03-14 01:30:32,670 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:30:32" (1/1) ... [2025-03-14 01:30:32,679 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:30:32" (1/1) ... [2025-03-14 01:30:32,680 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:30:32" (1/1) ... [2025-03-14 01:30:32,683 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:30:32" (1/1) ... [2025-03-14 01:30:32,685 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:30:32" (1/1) ... [2025-03-14 01:30:32,688 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:30:32,689 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:30:32,689 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:30:32,689 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:30:32,690 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:30:32" (1/1) ... [2025-03-14 01:30:32,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:30:32,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:30:32,732 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) [2025-03-14 01:30:32,735 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 [2025-03-14 01:30:32,754 INFO L130 BoogieDeclarations]: Found specification of procedure thread_usb [2025-03-14 01:30:32,754 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_usb [2025-03-14 01:30:32,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-14 01:30:32,754 INFO L130 BoogieDeclarations]: Found specification of procedure thread_ath9k [2025-03-14 01:30:32,754 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_ath9k [2025-03-14 01:30:32,755 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-14 01:30:32,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:30:32,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-14 01:30:32,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:30:32,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:30:32,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-14 01:30:32,755 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-14 01:30:32,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 01:30:32,756 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:30:32,984 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:30:32,985 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:30:33,263 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L1724: havoc ieee80211_deregister_hw_~#status~0#1.base, ieee80211_deregister_hw_~#status~0#1.offset; [2025-03-14 01:30:33,264 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L1724-1: SUMMARY for call ULTIMATE.dealloc(ieee80211_deregister_hw_~#status~0#1.base, ieee80211_deregister_hw_~#status~0#1.offset); srcloc: null [2025-03-14 01:30:33,265 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:30:33,265 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:30:33,265 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:30:33,292 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:30:33,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:30:33 BoogieIcfgContainer [2025-03-14 01:30:33,293 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:30:33,294 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:30:33,294 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:30:33,297 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:30:33,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:30:31" (1/3) ... [2025-03-14 01:30:33,298 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64e2bdd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:30:33, skipping insertion in model container [2025-03-14 01:30:33,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:30:32" (2/3) ... [2025-03-14 01:30:33,298 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64e2bdd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:30:33, skipping insertion in model container [2025-03-14 01:30:33,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:30:33" (3/3) ... [2025-03-14 01:30:33,299 INFO L128 eAbstractionObserver]: Analyzing ICFG race-4_1-thread_local_vars.i [2025-03-14 01:30:33,309 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:30:33,310 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG race-4_1-thread_local_vars.i that has 3 procedures, 296 locations, 1 initial locations, 2 loop locations, and 22 error locations. [2025-03-14 01:30:33,310 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:30:33,378 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2025-03-14 01:30:33,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 429 places, 464 transitions, 955 flow [2025-03-14 01:30:33,519 INFO L124 PetriNetUnfolderBase]: 38/470 cut-off events. [2025-03-14 01:30:33,521 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-14 01:30:33,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 481 conditions, 470 events. 38/470 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1298 event pairs, 0 based on Foata normal form. 0/394 useless extension candidates. Maximal degree in co-relation 317. Up to 11 conditions per place. [2025-03-14 01:30:33,528 INFO L82 GeneralOperation]: Start removeDead. Operand has 429 places, 464 transitions, 955 flow [2025-03-14 01:30:33,537 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 301 places, 322 transitions, 660 flow [2025-03-14 01:30:33,544 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:30:33,555 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;@7de2e6e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:30:33,555 INFO L334 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2025-03-14 01:30:33,563 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:30:33,563 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2025-03-14 01:30:33,563 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:30:33,563 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:30:33,564 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:30:33,564 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-03-14 01:30:33,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:30:33,569 INFO L85 PathProgramCache]: Analyzing trace with hash -181238959, now seen corresponding path program 1 times [2025-03-14 01:30:33,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:30:33,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529572177] [2025-03-14 01:30:33,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:30:33,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:30:33,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-14 01:30:33,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 01:30:33,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:30:33,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:30:33,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:30:33,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:30:33,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529572177] [2025-03-14 01:30:33,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529572177] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:30:33,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:30:33,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:30:33,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860606387] [2025-03-14 01:30:33,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:30:33,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:30:33,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:30:33,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:30:33,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:30:33,988 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 405 out of 464 [2025-03-14 01:30:33,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 322 transitions, 660 flow. Second operand has 3 states, 3 states have (on average 406.3333333333333) internal successors, (1219), 3 states have internal predecessors, (1219), 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) [2025-03-14 01:30:33,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:30:33,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 405 of 464 [2025-03-14 01:30:33,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:30:34,131 INFO L124 PetriNetUnfolderBase]: 82/936 cut-off events. [2025-03-14 01:30:34,131 INFO L125 PetriNetUnfolderBase]: For 35/43 co-relation queries the response was YES. [2025-03-14 01:30:34,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1082 conditions, 936 events. 82/936 cut-off events. For 35/43 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 4789 event pairs, 48 based on Foata normal form. 72/872 useless extension candidates. Maximal degree in co-relation 758. Up to 125 conditions per place. [2025-03-14 01:30:34,141 INFO L140 encePairwiseOnDemand]: 447/464 looper letters, 22 selfloop transitions, 2 changer transitions 6/295 dead transitions. [2025-03-14 01:30:34,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 295 transitions, 654 flow [2025-03-14 01:30:34,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:30:34,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:30:34,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1254 transitions. [2025-03-14 01:30:34,160 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9008620689655172 [2025-03-14 01:30:34,161 INFO L175 Difference]: Start difference. First operand has 301 places, 322 transitions, 660 flow. Second operand 3 states and 1254 transitions. [2025-03-14 01:30:34,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 295 transitions, 654 flow [2025-03-14 01:30:34,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 295 transitions, 650 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:30:34,175 INFO L231 Difference]: Finished difference. Result has 288 places, 289 transitions, 594 flow [2025-03-14 01:30:34,177 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=464, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=594, PETRI_PLACES=288, PETRI_TRANSITIONS=289} [2025-03-14 01:30:34,183 INFO L279 CegarLoopForPetriNet]: 301 programPoint places, -13 predicate places. [2025-03-14 01:30:34,184 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 289 transitions, 594 flow [2025-03-14 01:30:34,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 406.3333333333333) internal successors, (1219), 3 states have internal predecessors, (1219), 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) [2025-03-14 01:30:34,185 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:30:34,185 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:30:34,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:30:34,186 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-03-14 01:30:34,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:30:34,187 INFO L85 PathProgramCache]: Analyzing trace with hash -515613952, now seen corresponding path program 1 times [2025-03-14 01:30:34,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:30:34,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686654499] [2025-03-14 01:30:34,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:30:34,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:30:34,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-14 01:30:34,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-14 01:30:34,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:30:34,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:30:34,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:30:34,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:30:34,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686654499] [2025-03-14 01:30:34,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686654499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:30:34,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:30:34,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:30:34,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086852876] [2025-03-14 01:30:34,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:30:34,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:30:34,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:30:34,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:30:34,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:30:34,343 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 395 out of 464 [2025-03-14 01:30:34,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 289 transitions, 594 flow. Second operand has 3 states, 3 states have (on average 396.0) internal successors, (1188), 3 states have internal predecessors, (1188), 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) [2025-03-14 01:30:34,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:30:34,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 395 of 464 [2025-03-14 01:30:34,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:30:34,472 INFO L124 PetriNetUnfolderBase]: 83/940 cut-off events. [2025-03-14 01:30:34,472 INFO L125 PetriNetUnfolderBase]: For 14/19 co-relation queries the response was YES. [2025-03-14 01:30:34,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1104 conditions, 940 events. 83/940 cut-off events. For 14/19 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4747 event pairs, 21 based on Foata normal form. 1/826 useless extension candidates. Maximal degree in co-relation 1070. Up to 112 conditions per place. [2025-03-14 01:30:34,479 INFO L140 encePairwiseOnDemand]: 444/464 looper letters, 26 selfloop transitions, 14 changer transitions 0/298 dead transitions. [2025-03-14 01:30:34,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 298 transitions, 693 flow [2025-03-14 01:30:34,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:30:34,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:30:34,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1231 transitions. [2025-03-14 01:30:34,481 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8843390804597702 [2025-03-14 01:30:34,482 INFO L175 Difference]: Start difference. First operand has 288 places, 289 transitions, 594 flow. Second operand 3 states and 1231 transitions. [2025-03-14 01:30:34,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 298 transitions, 693 flow [2025-03-14 01:30:34,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 298 transitions, 689 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:30:34,486 INFO L231 Difference]: Finished difference. Result has 281 places, 295 transitions, 682 flow [2025-03-14 01:30:34,487 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=464, PETRI_DIFFERENCE_MINUEND_FLOW=584, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=682, PETRI_PLACES=281, PETRI_TRANSITIONS=295} [2025-03-14 01:30:34,487 INFO L279 CegarLoopForPetriNet]: 301 programPoint places, -20 predicate places. [2025-03-14 01:30:34,487 INFO L471 AbstractCegarLoop]: Abstraction has has 281 places, 295 transitions, 682 flow [2025-03-14 01:30:34,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 396.0) internal successors, (1188), 3 states have internal predecessors, (1188), 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) [2025-03-14 01:30:34,488 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:30:34,488 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:30:34,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:30:34,488 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-03-14 01:30:34,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:30:34,489 INFO L85 PathProgramCache]: Analyzing trace with hash 528181173, now seen corresponding path program 1 times [2025-03-14 01:30:34,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:30:34,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807779303] [2025-03-14 01:30:34,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:30:34,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:30:34,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-14 01:30:34,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-14 01:30:34,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:30:34,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:30:34,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:30:34,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:30:34,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807779303] [2025-03-14 01:30:34,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807779303] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:30:34,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:30:34,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:30:34,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237578981] [2025-03-14 01:30:34,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:30:34,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:30:34,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:30:34,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:30:34,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:30:34,653 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 405 out of 464 [2025-03-14 01:30:34,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 295 transitions, 682 flow. Second operand has 3 states, 3 states have (on average 407.0) internal successors, (1221), 3 states have internal predecessors, (1221), 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) [2025-03-14 01:30:34,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:30:34,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 405 of 464 [2025-03-14 01:30:34,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:30:34,820 INFO L124 PetriNetUnfolderBase]: 137/1384 cut-off events. [2025-03-14 01:30:34,821 INFO L125 PetriNetUnfolderBase]: For 277/315 co-relation queries the response was YES. [2025-03-14 01:30:34,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1837 conditions, 1384 events. 137/1384 cut-off events. For 277/315 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 8705 event pairs, 61 based on Foata normal form. 0/1212 useless extension candidates. Maximal degree in co-relation 1429. Up to 203 conditions per place. [2025-03-14 01:30:34,835 INFO L140 encePairwiseOnDemand]: 461/464 looper letters, 28 selfloop transitions, 2 changer transitions 0/294 dead transitions. [2025-03-14 01:30:34,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 294 transitions, 740 flow [2025-03-14 01:30:34,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:30:34,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:30:34,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1240 transitions. [2025-03-14 01:30:34,840 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8908045977011494 [2025-03-14 01:30:34,840 INFO L175 Difference]: Start difference. First operand has 281 places, 295 transitions, 682 flow. Second operand 3 states and 1240 transitions. [2025-03-14 01:30:34,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 294 transitions, 740 flow [2025-03-14 01:30:34,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 294 transitions, 712 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:30:34,847 INFO L231 Difference]: Finished difference. Result has 280 places, 294 transitions, 656 flow [2025-03-14 01:30:34,848 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=464, PETRI_DIFFERENCE_MINUEND_FLOW=652, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=656, PETRI_PLACES=280, PETRI_TRANSITIONS=294} [2025-03-14 01:30:34,848 INFO L279 CegarLoopForPetriNet]: 301 programPoint places, -21 predicate places. [2025-03-14 01:30:34,848 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 294 transitions, 656 flow [2025-03-14 01:30:34,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 407.0) internal successors, (1221), 3 states have internal predecessors, (1221), 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) [2025-03-14 01:30:34,849 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:30:34,849 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:30:34,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:30:34,849 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-03-14 01:30:34,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:30:34,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1482687568, now seen corresponding path program 1 times [2025-03-14 01:30:34,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:30:34,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531935604] [2025-03-14 01:30:34,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:30:34,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:30:34,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-14 01:30:34,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-14 01:30:34,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:30:34,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:30:34,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:30:34,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:30:34,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531935604] [2025-03-14 01:30:34,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531935604] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:30:34,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:30:34,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:30:34,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864252603] [2025-03-14 01:30:34,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:30:34,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:30:34,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:30:34,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:30:34,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:30:34,938 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 419 out of 464 [2025-03-14 01:30:34,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 294 transitions, 656 flow. Second operand has 3 states, 3 states have (on average 420.3333333333333) internal successors, (1261), 3 states have internal predecessors, (1261), 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) [2025-03-14 01:30:34,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:30:34,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 419 of 464 [2025-03-14 01:30:34,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:30:35,073 INFO L124 PetriNetUnfolderBase]: 99/1131 cut-off events. [2025-03-14 01:30:35,073 INFO L125 PetriNetUnfolderBase]: For 24/55 co-relation queries the response was YES. [2025-03-14 01:30:35,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1362 conditions, 1131 events. 99/1131 cut-off events. For 24/55 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 6695 event pairs, 9 based on Foata normal form. 4/986 useless extension candidates. Maximal degree in co-relation 1323. Up to 98 conditions per place. [2025-03-14 01:30:35,083 INFO L140 encePairwiseOnDemand]: 461/464 looper letters, 17 selfloop transitions, 2 changer transitions 0/298 dead transitions. [2025-03-14 01:30:35,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 298 transitions, 711 flow [2025-03-14 01:30:35,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:30:35,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:30:35,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1277 transitions. [2025-03-14 01:30:35,086 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9173850574712644 [2025-03-14 01:30:35,086 INFO L175 Difference]: Start difference. First operand has 280 places, 294 transitions, 656 flow. Second operand 3 states and 1277 transitions. [2025-03-14 01:30:35,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 298 transitions, 711 flow [2025-03-14 01:30:35,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 298 transitions, 707 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:30:35,094 INFO L231 Difference]: Finished difference. Result has 279 places, 293 transitions, 654 flow [2025-03-14 01:30:35,095 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=464, PETRI_DIFFERENCE_MINUEND_FLOW=650, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=654, PETRI_PLACES=279, PETRI_TRANSITIONS=293} [2025-03-14 01:30:35,096 INFO L279 CegarLoopForPetriNet]: 301 programPoint places, -22 predicate places. [2025-03-14 01:30:35,096 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 293 transitions, 654 flow [2025-03-14 01:30:35,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 420.3333333333333) internal successors, (1261), 3 states have internal predecessors, (1261), 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) [2025-03-14 01:30:35,097 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:30:35,097 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:30:35,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:30:35,097 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread_usbErr11ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-03-14 01:30:35,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:30:35,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1822165852, now seen corresponding path program 1 times [2025-03-14 01:30:35,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:30:35,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647613728] [2025-03-14 01:30:35,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:30:35,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:30:35,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-14 01:30:35,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-14 01:30:35,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:30:35,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:30:35,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:30:35,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:30:35,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647613728] [2025-03-14 01:30:35,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647613728] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:30:35,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:30:35,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:30:35,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021890879] [2025-03-14 01:30:35,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:30:35,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:30:35,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:30:35,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:30:35,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:30:35,208 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 464 [2025-03-14 01:30:35,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 293 transitions, 654 flow. Second operand has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 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) [2025-03-14 01:30:35,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:30:35,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 464 [2025-03-14 01:30:35,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:30:35,382 INFO L124 PetriNetUnfolderBase]: 78/998 cut-off events. [2025-03-14 01:30:35,383 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-14 01:30:35,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1178 conditions, 998 events. 78/998 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 5417 event pairs, 19 based on Foata normal form. 0/876 useless extension candidates. Maximal degree in co-relation 1086. Up to 67 conditions per place. [2025-03-14 01:30:35,392 INFO L140 encePairwiseOnDemand]: 461/464 looper letters, 14 selfloop transitions, 2 changer transitions 0/292 dead transitions. [2025-03-14 01:30:35,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 292 transitions, 684 flow [2025-03-14 01:30:35,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:30:35,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:30:35,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1253 transitions. [2025-03-14 01:30:35,395 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9001436781609196 [2025-03-14 01:30:35,395 INFO L175 Difference]: Start difference. First operand has 279 places, 293 transitions, 654 flow. Second operand 3 states and 1253 transitions. [2025-03-14 01:30:35,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 292 transitions, 684 flow [2025-03-14 01:30:35,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 292 transitions, 680 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:30:35,402 INFO L231 Difference]: Finished difference. Result has 278 places, 292 transitions, 652 flow [2025-03-14 01:30:35,402 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=464, PETRI_DIFFERENCE_MINUEND_FLOW=648, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=652, PETRI_PLACES=278, PETRI_TRANSITIONS=292} [2025-03-14 01:30:35,403 INFO L279 CegarLoopForPetriNet]: 301 programPoint places, -23 predicate places. [2025-03-14 01:30:35,403 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 292 transitions, 652 flow [2025-03-14 01:30:35,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 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) [2025-03-14 01:30:35,404 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:30:35,404 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:30:35,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:30:35,404 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread_usbErr10ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-03-14 01:30:35,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:30:35,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1337295355, now seen corresponding path program 1 times [2025-03-14 01:30:35,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:30:35,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103663714] [2025-03-14 01:30:35,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:30:35,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:30:35,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-14 01:30:35,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-14 01:30:35,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:30:35,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:30:35,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:30:35,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:30:35,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103663714] [2025-03-14 01:30:35,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103663714] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:30:35,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:30:35,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:30:35,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072003262] [2025-03-14 01:30:35,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:30:35,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:30:35,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:30:35,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:30:35,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:30:35,528 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 404 out of 464 [2025-03-14 01:30:35,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 292 transitions, 652 flow. Second operand has 3 states, 3 states have (on average 405.3333333333333) internal successors, (1216), 3 states have internal predecessors, (1216), 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) [2025-03-14 01:30:35,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:30:35,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 404 of 464 [2025-03-14 01:30:35,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:30:35,646 INFO L124 PetriNetUnfolderBase]: 101/1158 cut-off events. [2025-03-14 01:30:35,647 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-03-14 01:30:35,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1373 conditions, 1158 events. 101/1158 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 6686 event pairs, 23 based on Foata normal form. 0/1020 useless extension candidates. Maximal degree in co-relation 1276. Up to 83 conditions per place. [2025-03-14 01:30:35,657 INFO L140 encePairwiseOnDemand]: 456/464 looper letters, 16 selfloop transitions, 5 changer transitions 0/294 dead transitions. [2025-03-14 01:30:35,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 294 transitions, 698 flow [2025-03-14 01:30:35,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:30:35,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:30:35,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1236 transitions. [2025-03-14 01:30:35,660 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8879310344827587 [2025-03-14 01:30:35,660 INFO L175 Difference]: Start difference. First operand has 278 places, 292 transitions, 652 flow. Second operand 3 states and 1236 transitions. [2025-03-14 01:30:35,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 294 transitions, 698 flow [2025-03-14 01:30:35,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 294 transitions, 694 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:30:35,665 INFO L231 Difference]: Finished difference. Result has 276 places, 292 transitions, 669 flow [2025-03-14 01:30:35,666 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=464, PETRI_DIFFERENCE_MINUEND_FLOW=642, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=669, PETRI_PLACES=276, PETRI_TRANSITIONS=292} [2025-03-14 01:30:35,668 INFO L279 CegarLoopForPetriNet]: 301 programPoint places, -25 predicate places. [2025-03-14 01:30:35,668 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 292 transitions, 669 flow [2025-03-14 01:30:35,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 405.3333333333333) internal successors, (1216), 3 states have internal predecessors, (1216), 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) [2025-03-14 01:30:35,669 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:30:35,669 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:30:35,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:30:35,669 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-03-14 01:30:35,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:30:35,670 INFO L85 PathProgramCache]: Analyzing trace with hash 670120897, now seen corresponding path program 1 times [2025-03-14 01:30:35,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:30:35,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164671731] [2025-03-14 01:30:35,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:30:35,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:30:35,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-14 01:30:35,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-14 01:30:35,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:30:35,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:30:35,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:30:35,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:30:35,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164671731] [2025-03-14 01:30:35,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164671731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:30:35,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:30:35,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:30:35,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974446321] [2025-03-14 01:30:35,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:30:35,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:30:35,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:30:35,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:30:35,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:30:35,754 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 423 out of 464 [2025-03-14 01:30:35,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 292 transitions, 669 flow. Second operand has 3 states, 3 states have (on average 424.3333333333333) internal successors, (1273), 3 states have internal predecessors, (1273), 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) [2025-03-14 01:30:35,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:30:35,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 423 of 464 [2025-03-14 01:30:35,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:30:35,891 INFO L124 PetriNetUnfolderBase]: 135/1420 cut-off events. [2025-03-14 01:30:35,892 INFO L125 PetriNetUnfolderBase]: For 26/43 co-relation queries the response was YES. [2025-03-14 01:30:35,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1710 conditions, 1420 events. 135/1420 cut-off events. For 26/43 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 8320 event pairs, 28 based on Foata normal form. 1/1239 useless extension candidates. Maximal degree in co-relation 1137. Up to 90 conditions per place. [2025-03-14 01:30:35,902 INFO L140 encePairwiseOnDemand]: 462/464 looper letters, 14 selfloop transitions, 1 changer transitions 16/296 dead transitions. [2025-03-14 01:30:35,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 296 transitions, 716 flow [2025-03-14 01:30:35,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:30:35,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:30:35,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1285 transitions. [2025-03-14 01:30:35,905 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.923132183908046 [2025-03-14 01:30:35,905 INFO L175 Difference]: Start difference. First operand has 276 places, 292 transitions, 669 flow. Second operand 3 states and 1285 transitions. [2025-03-14 01:30:35,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 296 transitions, 716 flow [2025-03-14 01:30:35,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 296 transitions, 711 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:30:35,910 INFO L231 Difference]: Finished difference. Result has 276 places, 275 transitions, 628 flow [2025-03-14 01:30:35,911 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=464, PETRI_DIFFERENCE_MINUEND_FLOW=662, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=628, PETRI_PLACES=276, PETRI_TRANSITIONS=275} [2025-03-14 01:30:35,911 INFO L279 CegarLoopForPetriNet]: 301 programPoint places, -25 predicate places. [2025-03-14 01:30:35,911 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 275 transitions, 628 flow [2025-03-14 01:30:35,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 424.3333333333333) internal successors, (1273), 3 states have internal predecessors, (1273), 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) [2025-03-14 01:30:35,912 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:30:35,912 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:30:35,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:30:35,912 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread_usbErr6ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-03-14 01:30:35,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:30:35,913 INFO L85 PathProgramCache]: Analyzing trace with hash 856369397, now seen corresponding path program 1 times [2025-03-14 01:30:35,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:30:35,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709572698] [2025-03-14 01:30:35,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:30:35,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:30:35,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-14 01:30:35,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-14 01:30:35,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:30:35,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:30:36,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:30:36,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:30:36,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709572698] [2025-03-14 01:30:36,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709572698] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:30:36,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:30:36,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:30:36,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232855060] [2025-03-14 01:30:36,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:30:36,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:30:36,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:30:36,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:30:36,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:30:36,024 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 464 [2025-03-14 01:30:36,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 275 transitions, 628 flow. Second operand has 3 states, 3 states have (on average 412.3333333333333) internal successors, (1237), 3 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:30:36,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:30:36,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 464 [2025-03-14 01:30:36,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:30:36,128 INFO L124 PetriNetUnfolderBase]: 103/1058 cut-off events. [2025-03-14 01:30:36,128 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-03-14 01:30:36,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1273 conditions, 1058 events. 103/1058 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 5796 event pairs, 14 based on Foata normal form. 1/928 useless extension candidates. Maximal degree in co-relation 1198. Up to 63 conditions per place. [2025-03-14 01:30:36,136 INFO L140 encePairwiseOnDemand]: 456/464 looper letters, 15 selfloop transitions, 5 changer transitions 3/279 dead transitions. [2025-03-14 01:30:36,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 279 transitions, 676 flow [2025-03-14 01:30:36,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:30:36,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:30:36,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1256 transitions. [2025-03-14 01:30:36,139 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9022988505747126 [2025-03-14 01:30:36,139 INFO L175 Difference]: Start difference. First operand has 276 places, 275 transitions, 628 flow. Second operand 3 states and 1256 transitions. [2025-03-14 01:30:36,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 279 transitions, 676 flow [2025-03-14 01:30:36,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 279 transitions, 675 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:30:36,145 INFO L231 Difference]: Finished difference. Result has 264 places, 274 transitions, 655 flow [2025-03-14 01:30:36,145 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=464, PETRI_DIFFERENCE_MINUEND_FLOW=627, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=655, PETRI_PLACES=264, PETRI_TRANSITIONS=274} [2025-03-14 01:30:36,146 INFO L279 CegarLoopForPetriNet]: 301 programPoint places, -37 predicate places. [2025-03-14 01:30:36,146 INFO L471 AbstractCegarLoop]: Abstraction has has 264 places, 274 transitions, 655 flow [2025-03-14 01:30:36,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 412.3333333333333) internal successors, (1237), 3 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:30:36,147 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:30:36,147 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:30:36,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:30:36,147 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread_usbErr1ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-03-14 01:30:36,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:30:36,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1622026902, now seen corresponding path program 1 times [2025-03-14 01:30:36,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:30:36,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338827576] [2025-03-14 01:30:36,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:30:36,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:30:36,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-14 01:30:36,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-14 01:30:36,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:30:36,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:30:36,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:30:36,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:30:36,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338827576] [2025-03-14 01:30:36,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338827576] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:30:36,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:30:36,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:30:36,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106230972] [2025-03-14 01:30:36,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:30:36,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:30:36,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:30:36,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:30:36,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:30:36,296 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 464 [2025-03-14 01:30:36,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 274 transitions, 655 flow. Second operand has 3 states, 3 states have (on average 410.0) internal successors, (1230), 3 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:30:36,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:30:36,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 464 [2025-03-14 01:30:36,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:30:36,401 INFO L124 PetriNetUnfolderBase]: 120/1086 cut-off events. [2025-03-14 01:30:36,401 INFO L125 PetriNetUnfolderBase]: For 87/100 co-relation queries the response was YES. [2025-03-14 01:30:36,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1431 conditions, 1086 events. 120/1086 cut-off events. For 87/100 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 5879 event pairs, 28 based on Foata normal form. 2/962 useless extension candidates. Maximal degree in co-relation 1352. Up to 137 conditions per place. [2025-03-14 01:30:36,410 INFO L140 encePairwiseOnDemand]: 458/464 looper letters, 26 selfloop transitions, 8 changer transitions 0/282 dead transitions. [2025-03-14 01:30:36,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 282 transitions, 749 flow [2025-03-14 01:30:36,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:30:36,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:30:36,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1251 transitions. [2025-03-14 01:30:36,414 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8987068965517241 [2025-03-14 01:30:36,414 INFO L175 Difference]: Start difference. First operand has 264 places, 274 transitions, 655 flow. Second operand 3 states and 1251 transitions. [2025-03-14 01:30:36,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 282 transitions, 749 flow [2025-03-14 01:30:36,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 282 transitions, 739 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:30:36,420 INFO L231 Difference]: Finished difference. Result has 263 places, 280 transitions, 713 flow [2025-03-14 01:30:36,420 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=464, PETRI_DIFFERENCE_MINUEND_FLOW=645, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=713, PETRI_PLACES=263, PETRI_TRANSITIONS=280} [2025-03-14 01:30:36,421 INFO L279 CegarLoopForPetriNet]: 301 programPoint places, -38 predicate places. [2025-03-14 01:30:36,421 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 280 transitions, 713 flow [2025-03-14 01:30:36,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 410.0) internal successors, (1230), 3 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:30:36,422 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:30:36,422 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:30:36,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 01:30:36,422 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread_usbErr9ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-03-14 01:30:36,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:30:36,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1917019884, now seen corresponding path program 1 times [2025-03-14 01:30:36,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:30:36,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73782703] [2025-03-14 01:30:36,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:30:36,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:30:36,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-14 01:30:36,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-14 01:30:36,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:30:36,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:30:36,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:30:36,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:30:36,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73782703] [2025-03-14 01:30:36,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73782703] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:30:36,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:30:36,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:30:36,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549872912] [2025-03-14 01:30:36,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:30:36,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:30:36,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:30:36,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:30:36,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:30:36,521 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 417 out of 464 [2025-03-14 01:30:36,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 280 transitions, 713 flow. Second operand has 3 states, 3 states have (on average 418.6666666666667) internal successors, (1256), 3 states have internal predecessors, (1256), 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) [2025-03-14 01:30:36,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:30:36,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 417 of 464 [2025-03-14 01:30:36,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:30:36,622 INFO L124 PetriNetUnfolderBase]: 127/1248 cut-off events. [2025-03-14 01:30:36,623 INFO L125 PetriNetUnfolderBase]: For 85/96 co-relation queries the response was YES. [2025-03-14 01:30:36,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1614 conditions, 1248 events. 127/1248 cut-off events. For 85/96 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 7285 event pairs, 24 based on Foata normal form. 0/1107 useless extension candidates. Maximal degree in co-relation 1537. Up to 75 conditions per place. [2025-03-14 01:30:36,632 INFO L140 encePairwiseOnDemand]: 461/464 looper letters, 14 selfloop transitions, 2 changer transitions 0/281 dead transitions. [2025-03-14 01:30:36,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 281 transitions, 747 flow [2025-03-14 01:30:36,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:30:36,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:30:36,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1268 transitions. [2025-03-14 01:30:36,635 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9109195402298851 [2025-03-14 01:30:36,636 INFO L175 Difference]: Start difference. First operand has 263 places, 280 transitions, 713 flow. Second operand 3 states and 1268 transitions. [2025-03-14 01:30:36,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 281 transitions, 747 flow [2025-03-14 01:30:36,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 281 transitions, 731 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:30:36,640 INFO L231 Difference]: Finished difference. Result has 262 places, 279 transitions, 699 flow [2025-03-14 01:30:36,640 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=464, PETRI_DIFFERENCE_MINUEND_FLOW=695, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=699, PETRI_PLACES=262, PETRI_TRANSITIONS=279} [2025-03-14 01:30:36,641 INFO L279 CegarLoopForPetriNet]: 301 programPoint places, -39 predicate places. [2025-03-14 01:30:36,641 INFO L471 AbstractCegarLoop]: Abstraction has has 262 places, 279 transitions, 699 flow [2025-03-14 01:30:36,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 418.6666666666667) internal successors, (1256), 3 states have internal predecessors, (1256), 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) [2025-03-14 01:30:36,642 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:30:36,642 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:30:36,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 01:30:36,642 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread_usbErr8ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-03-14 01:30:36,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:30:36,643 INFO L85 PathProgramCache]: Analyzing trace with hash -2047706529, now seen corresponding path program 1 times [2025-03-14 01:30:36,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:30:36,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293515842] [2025-03-14 01:30:36,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:30:36,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:30:36,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-14 01:30:36,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-14 01:30:36,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:30:36,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:30:36,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:30:36,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:30:36,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293515842] [2025-03-14 01:30:36,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293515842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:30:36,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:30:36,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:30:36,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096137942] [2025-03-14 01:30:36,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:30:36,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:30:36,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:30:36,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:30:36,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:30:36,745 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 464 [2025-03-14 01:30:36,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 279 transitions, 699 flow. Second operand has 3 states, 3 states have (on average 414.0) internal successors, (1242), 3 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:30:36,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:30:36,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 464 [2025-03-14 01:30:36,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:30:36,849 INFO L124 PetriNetUnfolderBase]: 136/1214 cut-off events. [2025-03-14 01:30:36,849 INFO L125 PetriNetUnfolderBase]: For 93/112 co-relation queries the response was YES. [2025-03-14 01:30:36,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1593 conditions, 1214 events. 136/1214 cut-off events. For 93/112 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 7095 event pairs, 22 based on Foata normal form. 0/1070 useless extension candidates. Maximal degree in co-relation 1516. Up to 92 conditions per place. [2025-03-14 01:30:36,859 INFO L140 encePairwiseOnDemand]: 461/464 looper letters, 19 selfloop transitions, 2 changer transitions 0/280 dead transitions. [2025-03-14 01:30:36,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 280 transitions, 743 flow [2025-03-14 01:30:36,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:30:36,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:30:36,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1255 transitions. [2025-03-14 01:30:36,862 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9015804597701149 [2025-03-14 01:30:36,862 INFO L175 Difference]: Start difference. First operand has 262 places, 279 transitions, 699 flow. Second operand 3 states and 1255 transitions. [2025-03-14 01:30:36,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 280 transitions, 743 flow [2025-03-14 01:30:36,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 280 transitions, 739 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:30:36,866 INFO L231 Difference]: Finished difference. Result has 261 places, 278 transitions, 697 flow [2025-03-14 01:30:36,866 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=464, PETRI_DIFFERENCE_MINUEND_FLOW=693, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=697, PETRI_PLACES=261, PETRI_TRANSITIONS=278} [2025-03-14 01:30:36,867 INFO L279 CegarLoopForPetriNet]: 301 programPoint places, -40 predicate places. [2025-03-14 01:30:36,867 INFO L471 AbstractCegarLoop]: Abstraction has has 261 places, 278 transitions, 697 flow [2025-03-14 01:30:36,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 414.0) internal successors, (1242), 3 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:30:36,868 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:30:36,868 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:30:36,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 01:30:36,868 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-03-14 01:30:36,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:30:36,869 INFO L85 PathProgramCache]: Analyzing trace with hash 2002724871, now seen corresponding path program 1 times [2025-03-14 01:30:36,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:30:36,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067385534] [2025-03-14 01:30:36,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:30:36,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:30:36,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-14 01:30:36,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-14 01:30:36,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:30:36,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:30:36,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:30:36,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:30:36,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067385534] [2025-03-14 01:30:36,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067385534] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:30:36,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:30:36,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:30:36,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392324072] [2025-03-14 01:30:36,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:30:36,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:30:36,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:30:36,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:30:36,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:30:36,980 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 405 out of 464 [2025-03-14 01:30:36,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 278 transitions, 697 flow. Second operand has 3 states, 3 states have (on average 408.0) internal successors, (1224), 3 states have internal predecessors, (1224), 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) [2025-03-14 01:30:36,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:30:36,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 405 of 464 [2025-03-14 01:30:36,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:30:37,079 INFO L124 PetriNetUnfolderBase]: 168/1234 cut-off events. [2025-03-14 01:30:37,080 INFO L125 PetriNetUnfolderBase]: For 243/320 co-relation queries the response was YES. [2025-03-14 01:30:37,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1834 conditions, 1234 events. 168/1234 cut-off events. For 243/320 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 7218 event pairs, 39 based on Foata normal form. 8/1109 useless extension candidates. Maximal degree in co-relation 1755. Up to 236 conditions per place. [2025-03-14 01:30:37,087 INFO L140 encePairwiseOnDemand]: 456/464 looper letters, 31 selfloop transitions, 12 changer transitions 0/287 dead transitions. [2025-03-14 01:30:37,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 287 transitions, 820 flow [2025-03-14 01:30:37,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:30:37,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:30:37,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1246 transitions. [2025-03-14 01:30:37,090 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8951149425287356 [2025-03-14 01:30:37,090 INFO L175 Difference]: Start difference. First operand has 261 places, 278 transitions, 697 flow. Second operand 3 states and 1246 transitions. [2025-03-14 01:30:37,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 287 transitions, 820 flow [2025-03-14 01:30:37,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 287 transitions, 816 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:30:37,094 INFO L231 Difference]: Finished difference. Result has 263 places, 286 transitions, 793 flow [2025-03-14 01:30:37,094 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=464, PETRI_DIFFERENCE_MINUEND_FLOW=693, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=793, PETRI_PLACES=263, PETRI_TRANSITIONS=286} [2025-03-14 01:30:37,095 INFO L279 CegarLoopForPetriNet]: 301 programPoint places, -38 predicate places. [2025-03-14 01:30:37,095 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 286 transitions, 793 flow [2025-03-14 01:30:37,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 408.0) internal successors, (1224), 3 states have internal predecessors, (1224), 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) [2025-03-14 01:30:37,096 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:30:37,096 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:30:37,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-14 01:30:37,096 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-03-14 01:30:37,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:30:37,096 INFO L85 PathProgramCache]: Analyzing trace with hash -836881469, now seen corresponding path program 1 times [2025-03-14 01:30:37,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:30:37,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493728324] [2025-03-14 01:30:37,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:30:37,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:30:37,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-14 01:30:37,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-14 01:30:37,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:30:37,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:30:37,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:30:37,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:30:37,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493728324] [2025-03-14 01:30:37,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493728324] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:30:37,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:30:37,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:30:37,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5196722] [2025-03-14 01:30:37,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:30:37,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:30:37,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:30:37,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:30:37,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:30:37,214 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 405 out of 464 [2025-03-14 01:30:37,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 286 transitions, 793 flow. Second operand has 3 states, 3 states have (on average 408.3333333333333) internal successors, (1225), 3 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:30:37,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:30:37,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 405 of 464 [2025-03-14 01:30:37,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:30:37,387 INFO L124 PetriNetUnfolderBase]: 278/1818 cut-off events. [2025-03-14 01:30:37,387 INFO L125 PetriNetUnfolderBase]: For 909/1010 co-relation queries the response was YES. [2025-03-14 01:30:37,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2977 conditions, 1818 events. 278/1818 cut-off events. For 909/1010 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 12588 event pairs, 86 based on Foata normal form. 8/1645 useless extension candidates. Maximal degree in co-relation 2590. Up to 358 conditions per place. [2025-03-14 01:30:37,400 INFO L140 encePairwiseOnDemand]: 458/464 looper letters, 38 selfloop transitions, 9 changer transitions 1/293 dead transitions. [2025-03-14 01:30:37,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 293 transitions, 921 flow [2025-03-14 01:30:37,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:30:37,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:30:37,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1245 transitions. [2025-03-14 01:30:37,403 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8943965517241379 [2025-03-14 01:30:37,403 INFO L175 Difference]: Start difference. First operand has 263 places, 286 transitions, 793 flow. Second operand 3 states and 1245 transitions. [2025-03-14 01:30:37,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 293 transitions, 921 flow [2025-03-14 01:30:37,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 293 transitions, 893 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:30:37,409 INFO L231 Difference]: Finished difference. Result has 265 places, 290 transitions, 839 flow [2025-03-14 01:30:37,410 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=464, PETRI_DIFFERENCE_MINUEND_FLOW=769, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=839, PETRI_PLACES=265, PETRI_TRANSITIONS=290} [2025-03-14 01:30:37,410 INFO L279 CegarLoopForPetriNet]: 301 programPoint places, -36 predicate places. [2025-03-14 01:30:37,410 INFO L471 AbstractCegarLoop]: Abstraction has has 265 places, 290 transitions, 839 flow [2025-03-14 01:30:37,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 408.3333333333333) internal successors, (1225), 3 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:30:37,411 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:30:37,412 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:30:37,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-14 01:30:37,412 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread_usbErr6ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-03-14 01:30:37,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:30:37,413 INFO L85 PathProgramCache]: Analyzing trace with hash -357200819, now seen corresponding path program 1 times [2025-03-14 01:30:37,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:30:37,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286940282] [2025-03-14 01:30:37,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:30:37,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:30:37,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-14 01:30:37,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-14 01:30:37,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:30:37,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:30:37,468 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-14 01:30:37,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:30:37,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286940282] [2025-03-14 01:30:37,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286940282] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:30:37,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:30:37,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:30:37,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876405265] [2025-03-14 01:30:37,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:30:37,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:30:37,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:30:37,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:30:37,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:30:37,483 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 419 out of 464 [2025-03-14 01:30:37,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 290 transitions, 839 flow. Second operand has 3 states, 3 states have (on average 420.0) internal successors, (1260), 3 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:30:37,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:30:37,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 419 of 464 [2025-03-14 01:30:37,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:30:37,610 INFO L124 PetriNetUnfolderBase]: 152/1442 cut-off events. [2025-03-14 01:30:37,610 INFO L125 PetriNetUnfolderBase]: For 390/428 co-relation queries the response was YES. [2025-03-14 01:30:37,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2078 conditions, 1442 events. 152/1442 cut-off events. For 390/428 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 8176 event pairs, 16 based on Foata normal form. 2/1299 useless extension candidates. Maximal degree in co-relation 1999. Up to 104 conditions per place. [2025-03-14 01:30:37,621 INFO L140 encePairwiseOnDemand]: 461/464 looper letters, 11 selfloop transitions, 2 changer transitions 2/294 dead transitions. [2025-03-14 01:30:37,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 294 transitions, 878 flow [2025-03-14 01:30:37,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:30:37,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:30:37,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1273 transitions. [2025-03-14 01:30:37,624 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9145114942528736 [2025-03-14 01:30:37,624 INFO L175 Difference]: Start difference. First operand has 265 places, 290 transitions, 839 flow. Second operand 3 states and 1273 transitions. [2025-03-14 01:30:37,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 294 transitions, 878 flow [2025-03-14 01:30:37,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 294 transitions, 854 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-14 01:30:37,630 INFO L231 Difference]: Finished difference. Result has 265 places, 290 transitions, 823 flow [2025-03-14 01:30:37,631 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=464, PETRI_DIFFERENCE_MINUEND_FLOW=813, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=823, PETRI_PLACES=265, PETRI_TRANSITIONS=290} [2025-03-14 01:30:37,631 INFO L279 CegarLoopForPetriNet]: 301 programPoint places, -36 predicate places. [2025-03-14 01:30:37,631 INFO L471 AbstractCegarLoop]: Abstraction has has 265 places, 290 transitions, 823 flow [2025-03-14 01:30:37,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 420.0) internal successors, (1260), 3 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:30:37,632 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:30:37,632 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:30:37,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-14 01:30:37,633 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread_usbErr1ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-03-14 01:30:37,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:30:37,633 INFO L85 PathProgramCache]: Analyzing trace with hash 961770269, now seen corresponding path program 1 times [2025-03-14 01:30:37,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:30:37,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888416349] [2025-03-14 01:30:37,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:30:37,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:30:37,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-14 01:30:37,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-14 01:30:37,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:30:37,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:30:37,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:30:37,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:30:37,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888416349] [2025-03-14 01:30:37,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888416349] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:30:37,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:30:37,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:30:37,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725218116] [2025-03-14 01:30:37,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:30:37,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:30:37,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:30:37,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:30:37,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:30:37,748 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 464 [2025-03-14 01:30:37,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 290 transitions, 823 flow. Second operand has 5 states, 5 states have (on average 418.4) internal successors, (2092), 5 states have internal predecessors, (2092), 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) [2025-03-14 01:30:37,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:30:37,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 464 [2025-03-14 01:30:37,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:30:38,026 INFO L124 PetriNetUnfolderBase]: 341/2805 cut-off events. [2025-03-14 01:30:38,026 INFO L125 PetriNetUnfolderBase]: For 565/619 co-relation queries the response was YES. [2025-03-14 01:30:38,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4060 conditions, 2805 events. 341/2805 cut-off events. For 565/619 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 20493 event pairs, 33 based on Foata normal form. 4/2528 useless extension candidates. Maximal degree in co-relation 3980. Up to 205 conditions per place. [2025-03-14 01:30:38,043 INFO L140 encePairwiseOnDemand]: 456/464 looper letters, 32 selfloop transitions, 8 changer transitions 0/312 dead transitions. [2025-03-14 01:30:38,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 312 transitions, 954 flow [2025-03-14 01:30:38,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-14 01:30:38,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-14 01:30:38,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2953 transitions. [2025-03-14 01:30:38,048 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9091748768472906 [2025-03-14 01:30:38,048 INFO L175 Difference]: Start difference. First operand has 265 places, 290 transitions, 823 flow. Second operand 7 states and 2953 transitions. [2025-03-14 01:30:38,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 312 transitions, 954 flow [2025-03-14 01:30:38,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 312 transitions, 952 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:30:38,053 INFO L231 Difference]: Finished difference. Result has 275 places, 297 transitions, 879 flow [2025-03-14 01:30:38,053 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=464, PETRI_DIFFERENCE_MINUEND_FLOW=821, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=879, PETRI_PLACES=275, PETRI_TRANSITIONS=297} [2025-03-14 01:30:38,053 INFO L279 CegarLoopForPetriNet]: 301 programPoint places, -26 predicate places. [2025-03-14 01:30:38,054 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 297 transitions, 879 flow [2025-03-14 01:30:38,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 418.4) internal successors, (2092), 5 states have internal predecessors, (2092), 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) [2025-03-14 01:30:38,055 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:30:38,055 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:30:38,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-14 01:30:38,055 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread_usbErr1ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-03-14 01:30:38,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:30:38,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1211075167, now seen corresponding path program 1 times [2025-03-14 01:30:38,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:30:38,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354008556] [2025-03-14 01:30:38,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:30:38,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:30:38,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-14 01:30:38,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-14 01:30:38,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:30:38,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:30:38,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:30:38,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:30:38,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354008556] [2025-03-14 01:30:38,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354008556] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:30:38,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:30:38,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:30:38,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066701214] [2025-03-14 01:30:38,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:30:38,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:30:38,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:30:38,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:30:38,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:30:38,174 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 464 [2025-03-14 01:30:38,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 297 transitions, 879 flow. Second operand has 5 states, 5 states have (on average 420.0) internal successors, (2100), 5 states have internal predecessors, (2100), 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) [2025-03-14 01:30:38,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:30:38,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 464 [2025-03-14 01:30:38,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:30:38,785 INFO L124 PetriNetUnfolderBase]: 583/5209 cut-off events. [2025-03-14 01:30:38,785 INFO L125 PetriNetUnfolderBase]: For 1172/1267 co-relation queries the response was YES. [2025-03-14 01:30:38,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7679 conditions, 5209 events. 583/5209 cut-off events. For 1172/1267 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 46266 event pairs, 49 based on Foata normal form. 8/4716 useless extension candidates. Maximal degree in co-relation 7595. Up to 424 conditions per place. [2025-03-14 01:30:38,828 INFO L140 encePairwiseOnDemand]: 457/464 looper letters, 34 selfloop transitions, 9 changer transitions 0/324 dead transitions. [2025-03-14 01:30:38,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 324 transitions, 1030 flow [2025-03-14 01:30:38,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-14 01:30:38,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-14 01:30:38,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2970 transitions. [2025-03-14 01:30:38,833 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9144088669950738 [2025-03-14 01:30:38,834 INFO L175 Difference]: Start difference. First operand has 275 places, 297 transitions, 879 flow. Second operand 7 states and 2970 transitions. [2025-03-14 01:30:38,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 324 transitions, 1030 flow [2025-03-14 01:30:38,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 324 transitions, 1030 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:30:38,841 INFO L231 Difference]: Finished difference. Result has 287 places, 305 transitions, 947 flow [2025-03-14 01:30:38,842 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=464, PETRI_DIFFERENCE_MINUEND_FLOW=879, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=947, PETRI_PLACES=287, PETRI_TRANSITIONS=305} [2025-03-14 01:30:38,842 INFO L279 CegarLoopForPetriNet]: 301 programPoint places, -14 predicate places. [2025-03-14 01:30:38,842 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 305 transitions, 947 flow [2025-03-14 01:30:38,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 420.0) internal successors, (2100), 5 states have internal predecessors, (2100), 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) [2025-03-14 01:30:38,843 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:30:38,843 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:30:38,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-14 01:30:38,844 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread_usbThread1of1ForFork1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-03-14 01:30:38,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:30:38,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1738958419, now seen corresponding path program 1 times [2025-03-14 01:30:38,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:30:38,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247226703] [2025-03-14 01:30:38,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:30:38,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:30:38,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-14 01:30:38,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-14 01:30:38,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:30:38,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:30:38,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:30:38,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:30:38,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247226703] [2025-03-14 01:30:38,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247226703] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:30:38,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:30:38,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:30:38,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801614694] [2025-03-14 01:30:38,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:30:38,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:30:38,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:30:38,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:30:38,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:30:38,962 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 413 out of 464 [2025-03-14 01:30:38,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 305 transitions, 947 flow. Second operand has 3 states, 3 states have (on average 415.3333333333333) internal successors, (1246), 3 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:30:38,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:30:38,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 413 of 464 [2025-03-14 01:30:38,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:30:39,035 INFO L124 PetriNetUnfolderBase]: 62/812 cut-off events. [2025-03-14 01:30:39,035 INFO L125 PetriNetUnfolderBase]: For 94/94 co-relation queries the response was YES. [2025-03-14 01:30:39,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1124 conditions, 812 events. 62/812 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2617 event pairs, 0 based on Foata normal form. 21/762 useless extension candidates. Maximal degree in co-relation 1033. Up to 54 conditions per place. [2025-03-14 01:30:39,041 INFO L140 encePairwiseOnDemand]: 459/464 looper letters, 13 selfloop transitions, 2 changer transitions 55/270 dead transitions. [2025-03-14 01:30:39,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 270 transitions, 772 flow [2025-03-14 01:30:39,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:30:39,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:30:39,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1258 transitions. [2025-03-14 01:30:39,044 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9037356321839081 [2025-03-14 01:30:39,044 INFO L175 Difference]: Start difference. First operand has 287 places, 305 transitions, 947 flow. Second operand 3 states and 1258 transitions. [2025-03-14 01:30:39,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 270 transitions, 772 flow [2025-03-14 01:30:39,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 270 transitions, 710 flow, removed 13 selfloop flow, removed 10 redundant places. [2025-03-14 01:30:39,049 INFO L231 Difference]: Finished difference. Result has 273 places, 213 transitions, 539 flow [2025-03-14 01:30:39,049 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=464, PETRI_DIFFERENCE_MINUEND_FLOW=674, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=539, PETRI_PLACES=273, PETRI_TRANSITIONS=213} [2025-03-14 01:30:39,050 INFO L279 CegarLoopForPetriNet]: 301 programPoint places, -28 predicate places. [2025-03-14 01:30:39,050 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 213 transitions, 539 flow [2025-03-14 01:30:39,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 415.3333333333333) internal successors, (1246), 3 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:30:39,050 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:30:39,051 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:30:39,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-14 01:30:39,051 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread_usbErr5ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-03-14 01:30:39,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:30:39,052 INFO L85 PathProgramCache]: Analyzing trace with hash -751713697, now seen corresponding path program 1 times [2025-03-14 01:30:39,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:30:39,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063761309] [2025-03-14 01:30:39,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:30:39,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:30:39,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-14 01:30:39,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-14 01:30:39,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:30:39,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:30:39,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:30:39,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:30:39,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063761309] [2025-03-14 01:30:39,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063761309] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:30:39,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:30:39,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:30:39,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216161093] [2025-03-14 01:30:39,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:30:39,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:30:39,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:30:39,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:30:39,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:30:39,146 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 464 [2025-03-14 01:30:39,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 213 transitions, 539 flow. Second operand has 3 states, 3 states have (on average 415.3333333333333) internal successors, (1246), 3 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:30:39,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:30:39,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 464 [2025-03-14 01:30:39,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:30:39,191 INFO L124 PetriNetUnfolderBase]: 46/533 cut-off events. [2025-03-14 01:30:39,191 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2025-03-14 01:30:39,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 709 conditions, 533 events. 46/533 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1358 event pairs, 8 based on Foata normal form. 0/486 useless extension candidates. Maximal degree in co-relation 623. Up to 60 conditions per place. [2025-03-14 01:30:39,196 INFO L140 encePairwiseOnDemand]: 461/464 looper letters, 16 selfloop transitions, 2 changer transitions 0/212 dead transitions. [2025-03-14 01:30:39,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 212 transitions, 573 flow [2025-03-14 01:30:39,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:30:39,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:30:39,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1252 transitions. [2025-03-14 01:30:39,198 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8994252873563219 [2025-03-14 01:30:39,199 INFO L175 Difference]: Start difference. First operand has 273 places, 213 transitions, 539 flow. Second operand 3 states and 1252 transitions. [2025-03-14 01:30:39,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 212 transitions, 573 flow [2025-03-14 01:30:39,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 212 transitions, 536 flow, removed 3 selfloop flow, removed 15 redundant places. [2025-03-14 01:30:39,202 INFO L231 Difference]: Finished difference. Result has 216 places, 212 transitions, 504 flow [2025-03-14 01:30:39,202 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=464, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=504, PETRI_PLACES=216, PETRI_TRANSITIONS=212} [2025-03-14 01:30:39,203 INFO L279 CegarLoopForPetriNet]: 301 programPoint places, -85 predicate places. [2025-03-14 01:30:39,203 INFO L471 AbstractCegarLoop]: Abstraction has has 216 places, 212 transitions, 504 flow [2025-03-14 01:30:39,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 415.3333333333333) internal successors, (1246), 3 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:30:39,203 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:30:39,203 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:30:39,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-14 01:30:39,203 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread_usbErr4ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-03-14 01:30:39,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:30:39,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1001463347, now seen corresponding path program 1 times [2025-03-14 01:30:39,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:30:39,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688010023] [2025-03-14 01:30:39,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:30:39,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:30:39,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-14 01:30:39,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-14 01:30:39,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:30:39,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:30:39,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:30:39,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:30:39,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688010023] [2025-03-14 01:30:39,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688010023] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:30:39,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:30:39,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:30:39,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422998815] [2025-03-14 01:30:39,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:30:39,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:30:39,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:30:39,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:30:39,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:30:39,307 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 407 out of 464 [2025-03-14 01:30:39,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 212 transitions, 504 flow. Second operand has 3 states, 3 states have (on average 409.6666666666667) internal successors, (1229), 3 states have internal predecessors, (1229), 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) [2025-03-14 01:30:39,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:30:39,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 407 of 464 [2025-03-14 01:30:39,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:30:39,338 INFO L124 PetriNetUnfolderBase]: 22/368 cut-off events. [2025-03-14 01:30:39,338 INFO L125 PetriNetUnfolderBase]: For 4/8 co-relation queries the response was YES. [2025-03-14 01:30:39,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 457 conditions, 368 events. 22/368 cut-off events. For 4/8 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 456 event pairs, 0 based on Foata normal form. 0/342 useless extension candidates. Maximal degree in co-relation 376. Up to 19 conditions per place. [2025-03-14 01:30:39,341 INFO L140 encePairwiseOnDemand]: 461/464 looper letters, 0 selfloop transitions, 0 changer transitions 211/211 dead transitions. [2025-03-14 01:30:39,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 211 transitions, 532 flow [2025-03-14 01:30:39,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:30:39,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:30:39,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1237 transitions. [2025-03-14 01:30:39,343 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8886494252873564 [2025-03-14 01:30:39,343 INFO L175 Difference]: Start difference. First operand has 216 places, 212 transitions, 504 flow. Second operand 3 states and 1237 transitions. [2025-03-14 01:30:39,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 211 transitions, 532 flow [2025-03-14 01:30:39,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 211 transitions, 528 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:30:39,346 INFO L231 Difference]: Finished difference. Result has 215 places, 0 transitions, 0 flow [2025-03-14 01:30:39,346 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=464, PETRI_DIFFERENCE_MINUEND_FLOW=498, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=215, PETRI_TRANSITIONS=0} [2025-03-14 01:30:39,346 INFO L279 CegarLoopForPetriNet]: 301 programPoint places, -86 predicate places. [2025-03-14 01:30:39,346 INFO L471 AbstractCegarLoop]: Abstraction has has 215 places, 0 transitions, 0 flow [2025-03-14 01:30:39,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 409.6666666666667) internal successors, (1229), 3 states have internal predecessors, (1229), 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) [2025-03-14 01:30:39,349 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE (38 of 39 remaining) [2025-03-14 01:30:39,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE (37 of 39 remaining) [2025-03-14 01:30:39,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (36 of 39 remaining) [2025-03-14 01:30:39,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (35 of 39 remaining) [2025-03-14 01:30:39,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (34 of 39 remaining) [2025-03-14 01:30:39,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (33 of 39 remaining) [2025-03-14 01:30:39,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (32 of 39 remaining) [2025-03-14 01:30:39,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (31 of 39 remaining) [2025-03-14 01:30:39,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (30 of 39 remaining) [2025-03-14 01:30:39,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (29 of 39 remaining) [2025-03-14 01:30:39,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 39 remaining) [2025-03-14 01:30:39,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr11ASSERT_VIOLATIONDATA_RACE (27 of 39 remaining) [2025-03-14 01:30:39,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr1ASSERT_VIOLATIONDATA_RACE (26 of 39 remaining) [2025-03-14 01:30:39,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr10ASSERT_VIOLATIONDATA_RACE (25 of 39 remaining) [2025-03-14 01:30:39,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr0ASSERT_VIOLATIONDATA_RACE (24 of 39 remaining) [2025-03-14 01:30:39,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr7ASSERT_VIOLATIONDATA_RACE (23 of 39 remaining) [2025-03-14 01:30:39,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr2ASSERT_VIOLATIONDATA_RACE (22 of 39 remaining) [2025-03-14 01:30:39,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr6ASSERT_VIOLATIONDATA_RACE (21 of 39 remaining) [2025-03-14 01:30:39,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr9ASSERT_VIOLATIONDATA_RACE (20 of 39 remaining) [2025-03-14 01:30:39,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr5ASSERT_VIOLATIONDATA_RACE (19 of 39 remaining) [2025-03-14 01:30:39,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr4ASSERT_VIOLATIONDATA_RACE (18 of 39 remaining) [2025-03-14 01:30:39,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr3ASSERT_VIOLATIONDATA_RACE (17 of 39 remaining) [2025-03-14 01:30:39,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr8ASSERT_VIOLATIONDATA_RACE (16 of 39 remaining) [2025-03-14 01:30:39,351 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 39 remaining) [2025-03-14 01:30:39,351 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE (14 of 39 remaining) [2025-03-14 01:30:39,351 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE (13 of 39 remaining) [2025-03-14 01:30:39,351 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr11ASSERT_VIOLATIONDATA_RACE (12 of 39 remaining) [2025-03-14 01:30:39,351 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr1ASSERT_VIOLATIONDATA_RACE (11 of 39 remaining) [2025-03-14 01:30:39,351 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr10ASSERT_VIOLATIONDATA_RACE (10 of 39 remaining) [2025-03-14 01:30:39,351 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr0ASSERT_VIOLATIONDATA_RACE (9 of 39 remaining) [2025-03-14 01:30:39,351 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr7ASSERT_VIOLATIONDATA_RACE (8 of 39 remaining) [2025-03-14 01:30:39,351 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr2ASSERT_VIOLATIONDATA_RACE (7 of 39 remaining) [2025-03-14 01:30:39,351 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr6ASSERT_VIOLATIONDATA_RACE (6 of 39 remaining) [2025-03-14 01:30:39,351 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr9ASSERT_VIOLATIONDATA_RACE (5 of 39 remaining) [2025-03-14 01:30:39,351 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr5ASSERT_VIOLATIONDATA_RACE (4 of 39 remaining) [2025-03-14 01:30:39,351 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr4ASSERT_VIOLATIONDATA_RACE (3 of 39 remaining) [2025-03-14 01:30:39,351 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr3ASSERT_VIOLATIONDATA_RACE (2 of 39 remaining) [2025-03-14 01:30:39,351 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr8ASSERT_VIOLATIONDATA_RACE (1 of 39 remaining) [2025-03-14 01:30:39,351 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbThread1of1ForFork1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 39 remaining) [2025-03-14 01:30:39,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-14 01:30:39,351 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:30:39,356 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-14 01:30:39,357 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-14 01:30:39,364 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.03 01:30:39 BasicIcfg [2025-03-14 01:30:39,364 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-14 01:30:39,365 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-14 01:30:39,365 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-14 01:30:39,365 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-14 01:30:39,365 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:30:33" (3/4) ... [2025-03-14 01:30:39,367 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-14 01:30:39,369 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread_ath9k [2025-03-14 01:30:39,369 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread_usb [2025-03-14 01:30:39,372 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-14 01:30:39,373 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-14 01:30:39,373 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-14 01:30:39,373 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-14 01:30:39,446 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-14 01:30:39,446 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-14 01:30:39,446 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-14 01:30:39,447 INFO L158 Benchmark]: Toolchain (without parser) took 7474.64ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 102.6MB in the beginning and 175.2MB in the end (delta: -72.6MB). Peak memory consumption was 211.3MB. Max. memory is 16.1GB. [2025-03-14 01:30:39,448 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 117.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:30:39,448 INFO L158 Benchmark]: CACSL2BoogieTranslator took 644.52ms. Allocated memory is still 142.6MB. Free memory was 102.6MB in the beginning and 46.7MB in the end (delta: 55.9MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-14 01:30:39,448 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.31ms. Allocated memory is still 142.6MB. Free memory was 46.7MB in the beginning and 43.4MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:30:39,449 INFO L158 Benchmark]: Boogie Preprocessor took 27.34ms. Allocated memory is still 142.6MB. Free memory was 43.4MB in the beginning and 40.9MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 01:30:39,449 INFO L158 Benchmark]: IcfgBuilder took 603.91ms. Allocated memory is still 142.6MB. Free memory was 40.9MB in the beginning and 76.9MB in the end (delta: -36.1MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. [2025-03-14 01:30:39,450 INFO L158 Benchmark]: TraceAbstraction took 6069.98ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 76.2MB in the beginning and 179.4MB in the end (delta: -103.2MB). Peak memory consumption was 178.6MB. Max. memory is 16.1GB. [2025-03-14 01:30:39,450 INFO L158 Benchmark]: Witness Printer took 81.37ms. Allocated memory is still 427.8MB. Free memory was 179.4MB in the beginning and 175.2MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:30:39,451 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.24ms. Allocated memory is still 201.3MB. Free memory is still 117.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 644.52ms. Allocated memory is still 142.6MB. Free memory was 102.6MB in the beginning and 46.7MB in the end (delta: 55.9MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.31ms. Allocated memory is still 142.6MB. Free memory was 46.7MB in the beginning and 43.4MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.34ms. Allocated memory is still 142.6MB. Free memory was 43.4MB in the beginning and 40.9MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 603.91ms. Allocated memory is still 142.6MB. Free memory was 40.9MB in the beginning and 76.9MB in the end (delta: -36.1MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. * TraceAbstraction took 6069.98ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 76.2MB in the beginning and 179.4MB in the end (delta: -103.2MB). Peak memory consumption was 178.6MB. Max. memory is 16.1GB. * Witness Printer took 81.37ms. Allocated memory is still 427.8MB. Free memory was 179.4MB in the beginning and 175.2MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1699]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1700]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1777]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1778]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1783]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1780]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1784]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1790]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1792]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1793]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1743]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1771]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1748]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1772]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1756]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1764]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1725]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1718]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1758]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1759]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1760]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1752]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 473 locations, 39 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.0s, OverallIterations: 19, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1280 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 437 mSDsluCounter, 279 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 57 mSDsCounter, 84 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1323 IncrementalHoareTripleChecker+Invalid, 1407 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 84 mSolverCounterUnsat, 222 mSDtfsCounter, 1323 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=947occurred in iteration=16, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1513 NumberOfCodeBlocks, 1513 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1494 ConstructedInterpolants, 0 QuantifiedInterpolants, 1606 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 4/4 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, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 22 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-14 01:30:39,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE