./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 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-races/race-4_1-thread_local_vars.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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-?-551b009-m [2025-01-09 21:17:24,517 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:17:24,560 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:17:24,563 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:17:24,563 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:17:24,581 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:17:24,581 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:17:24,581 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:17:24,582 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:17:24,582 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:17:24,582 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:17:24,582 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:17:24,582 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:17:24,582 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:17:24,582 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:17:24,583 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:17:24,583 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:17:24,583 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:17:24,583 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:17:24,583 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:17:24,583 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:17:24,583 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:17:24,583 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:17:24,583 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:17:24,583 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:17:24,583 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:17:24,584 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:17:24,584 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:17:24,584 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:17:24,584 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:17:24,584 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:17:24,584 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:17:24,584 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:17:24,584 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:17:24,584 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:17:24,584 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:17:24,584 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:17:24,584 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:17:24,585 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:17:24,585 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:17:24,585 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:17:24,585 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:17:24,585 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:17:24,585 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:17:24,585 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:17:24,585 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:17:24,585 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-jdk21/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-01-09 21:17:24,827 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:17:24,832 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:17:24,838 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:17:24,839 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:17:24,839 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:17:24,840 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-4_1-thread_local_vars.i [2025-01-09 21:17:26,035 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fad787f68/fe32c109e5c34700b739e597a693bf02/FLAG6395c0a38 [2025-01-09 21:17:26,430 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:17:26,432 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-races/race-4_1-thread_local_vars.i [2025-01-09 21:17:26,456 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fad787f68/fe32c109e5c34700b739e597a693bf02/FLAG6395c0a38 [2025-01-09 21:17:26,615 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fad787f68/fe32c109e5c34700b739e597a693bf02 [2025-01-09 21:17:26,617 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:17:26,618 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:17:26,623 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:17:26,623 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:17:26,626 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:17:26,627 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:17:26" (1/1) ... [2025-01-09 21:17:26,627 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1298cda7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:26, skipping insertion in model container [2025-01-09 21:17:26,628 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:17:26" (1/1) ... [2025-01-09 21:17:26,665 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:17:27,139 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:17:27,149 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:17:27,195 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:17:27,265 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:17:27,266 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:27 WrapperNode [2025-01-09 21:17:27,266 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:17:27,267 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:17:27,267 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:17:27,267 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:17:27,270 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:27" (1/1) ... [2025-01-09 21:17:27,291 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:27" (1/1) ... [2025-01-09 21:17:27,315 INFO L138 Inliner]: procedures = 487, calls = 37, calls flagged for inlining = 16, calls inlined = 21, statements flattened = 274 [2025-01-09 21:17:27,316 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:17:27,316 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:17:27,318 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:17:27,318 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:17:27,324 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:27" (1/1) ... [2025-01-09 21:17:27,324 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:27" (1/1) ... [2025-01-09 21:17:27,328 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:27" (1/1) ... [2025-01-09 21:17:27,328 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:27" (1/1) ... [2025-01-09 21:17:27,336 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:27" (1/1) ... [2025-01-09 21:17:27,337 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:27" (1/1) ... [2025-01-09 21:17:27,339 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:27" (1/1) ... [2025-01-09 21:17:27,342 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:27" (1/1) ... [2025-01-09 21:17:27,343 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:27" (1/1) ... [2025-01-09 21:17:27,348 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:17:27,349 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:17:27,349 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:17:27,349 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:17:27,350 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:27" (1/1) ... [2025-01-09 21:17:27,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:17:27,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:17:27,381 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 21:17:27,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 21:17:27,408 INFO L130 BoogieDeclarations]: Found specification of procedure thread_usb [2025-01-09 21:17:27,409 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_usb [2025-01-09 21:17:27,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 21:17:27,409 INFO L130 BoogieDeclarations]: Found specification of procedure thread_ath9k [2025-01-09 21:17:27,409 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_ath9k [2025-01-09 21:17:27,409 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 21:17:27,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:17:27,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-01-09 21:17:27,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:17:27,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:17:27,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 21:17:27,409 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 21:17:27,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:17:27,410 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:17:27,613 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:17:27,615 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:17:27,905 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:17:27,907 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:17:27,930 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:17:27,930 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 21:17:27,930 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:17:27 BoogieIcfgContainer [2025-01-09 21:17:27,930 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:17:27,932 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:17:27,932 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:17:27,935 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:17:27,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:17:26" (1/3) ... [2025-01-09 21:17:27,935 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@569d1d09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:17:27, skipping insertion in model container [2025-01-09 21:17:27,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:27" (2/3) ... [2025-01-09 21:17:27,935 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@569d1d09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:17:27, skipping insertion in model container [2025-01-09 21:17:27,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:17:27" (3/3) ... [2025-01-09 21:17:27,936 INFO L128 eAbstractionObserver]: Analyzing ICFG race-4_1-thread_local_vars.i [2025-01-09 21:17:27,949 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:17:27,950 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-01-09 21:17:27,951 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:17:28,017 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2025-01-09 21:17:28,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 429 places, 464 transitions, 955 flow [2025-01-09 21:17:28,122 INFO L124 PetriNetUnfolderBase]: 38/470 cut-off events. [2025-01-09 21:17:28,124 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 21:17:28,130 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 1297 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-01-09 21:17:28,131 INFO L82 GeneralOperation]: Start removeDead. Operand has 429 places, 464 transitions, 955 flow [2025-01-09 21:17:28,135 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 301 places, 322 transitions, 660 flow [2025-01-09 21:17:28,140 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:17:28,148 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;@758daea0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:17:28,148 INFO L334 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2025-01-09 21:17:28,153 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:17:28,153 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2025-01-09 21:17:28,153 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:17:28,153 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:28,154 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-01-09 21:17:28,154 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-01-09 21:17:28,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:28,158 INFO L85 PathProgramCache]: Analyzing trace with hash 597245516, now seen corresponding path program 1 times [2025-01-09 21:17:28,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:28,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092281835] [2025-01-09 21:17:28,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:28,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:28,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 21:17:28,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 21:17:28,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:28,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:28,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:17:28,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:28,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092281835] [2025-01-09 21:17:28,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092281835] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:28,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:28,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:17:28,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278794258] [2025-01-09 21:17:28,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:28,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:17:28,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:28,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:17:28,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:17:28,505 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 405 out of 464 [2025-01-09 21:17:28,509 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-01-09 21:17:28,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:28,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 405 of 464 [2025-01-09 21:17:28,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:28,671 INFO L124 PetriNetUnfolderBase]: 82/936 cut-off events. [2025-01-09 21:17:28,671 INFO L125 PetriNetUnfolderBase]: For 35/43 co-relation queries the response was YES. [2025-01-09 21:17:28,674 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 4725 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-01-09 21:17:28,677 INFO L140 encePairwiseOnDemand]: 447/464 looper letters, 22 selfloop transitions, 2 changer transitions 6/295 dead transitions. [2025-01-09 21:17:28,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 295 transitions, 654 flow [2025-01-09 21:17:28,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:17:28,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:17:28,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1254 transitions. [2025-01-09 21:17:28,692 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9008620689655172 [2025-01-09 21:17:28,694 INFO L175 Difference]: Start difference. First operand has 301 places, 322 transitions, 660 flow. Second operand 3 states and 1254 transitions. [2025-01-09 21:17:28,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 295 transitions, 654 flow [2025-01-09 21:17:28,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 295 transitions, 650 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:17:28,705 INFO L231 Difference]: Finished difference. Result has 288 places, 289 transitions, 594 flow [2025-01-09 21:17:28,707 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-01-09 21:17:28,710 INFO L279 CegarLoopForPetriNet]: 301 programPoint places, -13 predicate places. [2025-01-09 21:17:28,712 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 289 transitions, 594 flow [2025-01-09 21:17:28,712 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-01-09 21:17:28,713 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:28,713 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-01-09 21:17:28,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:17:28,714 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-01-09 21:17:28,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:28,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1507615268, now seen corresponding path program 1 times [2025-01-09 21:17:28,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:28,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544911167] [2025-01-09 21:17:28,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:28,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:28,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 21:17:28,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 21:17:28,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:28,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:28,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:17:28,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:28,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544911167] [2025-01-09 21:17:28,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544911167] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:28,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:28,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:17:28,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816743581] [2025-01-09 21:17:28,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:28,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:17:28,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:28,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:17:28,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:17:28,910 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 395 out of 464 [2025-01-09 21:17:28,912 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-01-09 21:17:28,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:28,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 395 of 464 [2025-01-09 21:17:28,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:29,058 INFO L124 PetriNetUnfolderBase]: 83/940 cut-off events. [2025-01-09 21:17:29,058 INFO L125 PetriNetUnfolderBase]: For 14/19 co-relation queries the response was YES. [2025-01-09 21:17:29,060 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 4731 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-01-09 21:17:29,062 INFO L140 encePairwiseOnDemand]: 444/464 looper letters, 26 selfloop transitions, 14 changer transitions 0/298 dead transitions. [2025-01-09 21:17:29,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 298 transitions, 693 flow [2025-01-09 21:17:29,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:17:29,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:17:29,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1231 transitions. [2025-01-09 21:17:29,069 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8843390804597702 [2025-01-09 21:17:29,069 INFO L175 Difference]: Start difference. First operand has 288 places, 289 transitions, 594 flow. Second operand 3 states and 1231 transitions. [2025-01-09 21:17:29,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 298 transitions, 693 flow [2025-01-09 21:17:29,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 298 transitions, 689 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:17:29,081 INFO L231 Difference]: Finished difference. Result has 281 places, 295 transitions, 682 flow [2025-01-09 21:17:29,082 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-01-09 21:17:29,082 INFO L279 CegarLoopForPetriNet]: 301 programPoint places, -20 predicate places. [2025-01-09 21:17:29,082 INFO L471 AbstractCegarLoop]: Abstraction has has 281 places, 295 transitions, 682 flow [2025-01-09 21:17:29,083 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-01-09 21:17:29,083 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:29,083 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-01-09 21:17:29,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:17:29,083 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-01-09 21:17:29,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:29,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1285251569, now seen corresponding path program 1 times [2025-01-09 21:17:29,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:29,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154432577] [2025-01-09 21:17:29,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:29,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:29,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 21:17:29,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 21:17:29,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:29,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:29,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:17:29,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:29,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154432577] [2025-01-09 21:17:29,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154432577] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:29,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:29,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:17:29,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163927089] [2025-01-09 21:17:29,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:29,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:17:29,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:29,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:17:29,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:17:29,263 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 405 out of 464 [2025-01-09 21:17:29,264 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-01-09 21:17:29,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:29,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 405 of 464 [2025-01-09 21:17:29,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:29,429 INFO L124 PetriNetUnfolderBase]: 137/1384 cut-off events. [2025-01-09 21:17:29,429 INFO L125 PetriNetUnfolderBase]: For 277/315 co-relation queries the response was YES. [2025-01-09 21:17:29,435 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 8649 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-01-09 21:17:29,441 INFO L140 encePairwiseOnDemand]: 461/464 looper letters, 28 selfloop transitions, 2 changer transitions 0/294 dead transitions. [2025-01-09 21:17:29,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 294 transitions, 740 flow [2025-01-09 21:17:29,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:17:29,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:17:29,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1240 transitions. [2025-01-09 21:17:29,444 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8908045977011494 [2025-01-09 21:17:29,444 INFO L175 Difference]: Start difference. First operand has 281 places, 295 transitions, 682 flow. Second operand 3 states and 1240 transitions. [2025-01-09 21:17:29,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 294 transitions, 740 flow [2025-01-09 21:17:29,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 294 transitions, 712 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:17:29,452 INFO L231 Difference]: Finished difference. Result has 280 places, 294 transitions, 656 flow [2025-01-09 21:17:29,453 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-01-09 21:17:29,454 INFO L279 CegarLoopForPetriNet]: 301 programPoint places, -21 predicate places. [2025-01-09 21:17:29,454 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 294 transitions, 656 flow [2025-01-09 21:17:29,455 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-01-09 21:17:29,455 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:29,455 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-01-09 21:17:29,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:17:29,455 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-01-09 21:17:29,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:29,456 INFO L85 PathProgramCache]: Analyzing trace with hash -299690660, now seen corresponding path program 1 times [2025-01-09 21:17:29,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:29,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310042124] [2025-01-09 21:17:29,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:29,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:29,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 21:17:29,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 21:17:29,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:29,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:29,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:17:29,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:29,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310042124] [2025-01-09 21:17:29,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310042124] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:29,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:29,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:17:29,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854563950] [2025-01-09 21:17:29,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:29,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:17:29,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:29,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:17:29,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:17:29,546 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 419 out of 464 [2025-01-09 21:17:29,548 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-01-09 21:17:29,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:29,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 419 of 464 [2025-01-09 21:17:29,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:29,665 INFO L124 PetriNetUnfolderBase]: 99/1131 cut-off events. [2025-01-09 21:17:29,666 INFO L125 PetriNetUnfolderBase]: For 24/55 co-relation queries the response was YES. [2025-01-09 21:17:29,669 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 6737 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-01-09 21:17:29,673 INFO L140 encePairwiseOnDemand]: 461/464 looper letters, 17 selfloop transitions, 2 changer transitions 0/298 dead transitions. [2025-01-09 21:17:29,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 298 transitions, 711 flow [2025-01-09 21:17:29,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:17:29,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:17:29,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1277 transitions. [2025-01-09 21:17:29,696 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9173850574712644 [2025-01-09 21:17:29,696 INFO L175 Difference]: Start difference. First operand has 280 places, 294 transitions, 656 flow. Second operand 3 states and 1277 transitions. [2025-01-09 21:17:29,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 298 transitions, 711 flow [2025-01-09 21:17:29,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 298 transitions, 707 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:17:29,700 INFO L231 Difference]: Finished difference. Result has 279 places, 293 transitions, 654 flow [2025-01-09 21:17:29,701 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-01-09 21:17:29,701 INFO L279 CegarLoopForPetriNet]: 301 programPoint places, -22 predicate places. [2025-01-09 21:17:29,701 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 293 transitions, 654 flow [2025-01-09 21:17:29,702 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-01-09 21:17:29,702 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:29,702 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-01-09 21:17:29,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:17:29,702 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread_usbErr0ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-01-09 21:17:29,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:29,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1094121225, now seen corresponding path program 1 times [2025-01-09 21:17:29,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:29,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074770927] [2025-01-09 21:17:29,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:29,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:29,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 21:17:29,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 21:17:29,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:29,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:29,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:17:29,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:29,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074770927] [2025-01-09 21:17:29,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074770927] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:29,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:29,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:17:29,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953697293] [2025-01-09 21:17:29,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:29,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:17:29,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:29,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:17:29,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:17:29,797 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 464 [2025-01-09 21:17:29,799 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-01-09 21:17:29,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:29,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 464 [2025-01-09 21:17:29,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:29,874 INFO L124 PetriNetUnfolderBase]: 78/998 cut-off events. [2025-01-09 21:17:29,874 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-01-09 21:17:29,876 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 5408 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-01-09 21:17:29,879 INFO L140 encePairwiseOnDemand]: 461/464 looper letters, 14 selfloop transitions, 2 changer transitions 0/292 dead transitions. [2025-01-09 21:17:29,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 292 transitions, 684 flow [2025-01-09 21:17:29,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:17:29,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:17:29,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1253 transitions. [2025-01-09 21:17:29,882 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9001436781609196 [2025-01-09 21:17:29,882 INFO L175 Difference]: Start difference. First operand has 279 places, 293 transitions, 654 flow. Second operand 3 states and 1253 transitions. [2025-01-09 21:17:29,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 292 transitions, 684 flow [2025-01-09 21:17:29,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 292 transitions, 680 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:17:29,885 INFO L231 Difference]: Finished difference. Result has 278 places, 292 transitions, 652 flow [2025-01-09 21:17:29,886 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-01-09 21:17:29,886 INFO L279 CegarLoopForPetriNet]: 301 programPoint places, -23 predicate places. [2025-01-09 21:17:29,886 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 292 transitions, 652 flow [2025-01-09 21:17:29,887 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-01-09 21:17:29,887 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:29,887 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-01-09 21:17:29,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:17:29,888 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread_usbErr1ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-01-09 21:17:29,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:29,888 INFO L85 PathProgramCache]: Analyzing trace with hash -922463054, now seen corresponding path program 1 times [2025-01-09 21:17:29,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:29,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678824327] [2025-01-09 21:17:29,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:29,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:29,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-09 21:17:29,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-09 21:17:29,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:29,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:29,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:17:29,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:29,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678824327] [2025-01-09 21:17:29,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678824327] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:29,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:29,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:17:29,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684237909] [2025-01-09 21:17:29,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:29,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:17:29,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:29,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:17:29,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:17:29,969 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 404 out of 464 [2025-01-09 21:17:29,970 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-01-09 21:17:29,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:29,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 404 of 464 [2025-01-09 21:17:29,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:30,060 INFO L124 PetriNetUnfolderBase]: 101/1158 cut-off events. [2025-01-09 21:17:30,061 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-01-09 21:17:30,064 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 6650 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-01-09 21:17:30,067 INFO L140 encePairwiseOnDemand]: 456/464 looper letters, 16 selfloop transitions, 5 changer transitions 0/294 dead transitions. [2025-01-09 21:17:30,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 294 transitions, 698 flow [2025-01-09 21:17:30,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:17:30,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:17:30,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1236 transitions. [2025-01-09 21:17:30,070 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8879310344827587 [2025-01-09 21:17:30,070 INFO L175 Difference]: Start difference. First operand has 278 places, 292 transitions, 652 flow. Second operand 3 states and 1236 transitions. [2025-01-09 21:17:30,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 294 transitions, 698 flow [2025-01-09 21:17:30,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 294 transitions, 694 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:17:30,074 INFO L231 Difference]: Finished difference. Result has 276 places, 292 transitions, 669 flow [2025-01-09 21:17:30,074 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-01-09 21:17:30,075 INFO L279 CegarLoopForPetriNet]: 301 programPoint places, -25 predicate places. [2025-01-09 21:17:30,075 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 292 transitions, 669 flow [2025-01-09 21:17:30,076 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-01-09 21:17:30,076 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:30,076 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-01-09 21:17:30,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:17:30,076 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-01-09 21:17:30,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:30,077 INFO L85 PathProgramCache]: Analyzing trace with hash 996979333, now seen corresponding path program 1 times [2025-01-09 21:17:30,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:30,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135198592] [2025-01-09 21:17:30,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:30,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:30,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-09 21:17:30,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-09 21:17:30,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:30,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:30,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:17:30,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:30,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135198592] [2025-01-09 21:17:30,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135198592] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:30,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:30,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:17:30,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273941294] [2025-01-09 21:17:30,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:30,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:17:30,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:30,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:17:30,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:17:30,141 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 423 out of 464 [2025-01-09 21:17:30,142 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-01-09 21:17:30,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:30,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 423 of 464 [2025-01-09 21:17:30,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:30,239 INFO L124 PetriNetUnfolderBase]: 135/1420 cut-off events. [2025-01-09 21:17:30,239 INFO L125 PetriNetUnfolderBase]: For 26/43 co-relation queries the response was YES. [2025-01-09 21:17:30,242 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 8332 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-01-09 21:17:30,245 INFO L140 encePairwiseOnDemand]: 462/464 looper letters, 14 selfloop transitions, 1 changer transitions 16/296 dead transitions. [2025-01-09 21:17:30,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 296 transitions, 716 flow [2025-01-09 21:17:30,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:17:30,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:17:30,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1285 transitions. [2025-01-09 21:17:30,247 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.923132183908046 [2025-01-09 21:17:30,247 INFO L175 Difference]: Start difference. First operand has 276 places, 292 transitions, 669 flow. Second operand 3 states and 1285 transitions. [2025-01-09 21:17:30,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 296 transitions, 716 flow [2025-01-09 21:17:30,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 296 transitions, 711 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:17:30,251 INFO L231 Difference]: Finished difference. Result has 276 places, 275 transitions, 628 flow [2025-01-09 21:17:30,251 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-01-09 21:17:30,252 INFO L279 CegarLoopForPetriNet]: 301 programPoint places, -25 predicate places. [2025-01-09 21:17:30,252 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 275 transitions, 628 flow [2025-01-09 21:17:30,253 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-01-09 21:17:30,253 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:30,253 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-01-09 21:17:30,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:17:30,253 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread_usbErr5ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-01-09 21:17:30,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:30,254 INFO L85 PathProgramCache]: Analyzing trace with hash -274721492, now seen corresponding path program 1 times [2025-01-09 21:17:30,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:30,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754488684] [2025-01-09 21:17:30,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:30,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:30,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 21:17:30,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 21:17:30,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:30,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:30,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:17:30,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:30,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754488684] [2025-01-09 21:17:30,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754488684] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:30,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:30,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:17:30,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784159570] [2025-01-09 21:17:30,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:30,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:17:30,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:30,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:17:30,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:17:30,349 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 464 [2025-01-09 21:17:30,350 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-01-09 21:17:30,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:30,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 464 [2025-01-09 21:17:30,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:30,431 INFO L124 PetriNetUnfolderBase]: 103/1058 cut-off events. [2025-01-09 21:17:30,431 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-01-09 21:17:30,434 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 5821 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-01-09 21:17:30,437 INFO L140 encePairwiseOnDemand]: 456/464 looper letters, 15 selfloop transitions, 5 changer transitions 3/279 dead transitions. [2025-01-09 21:17:30,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 279 transitions, 676 flow [2025-01-09 21:17:30,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:17:30,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:17:30,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1256 transitions. [2025-01-09 21:17:30,439 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9022988505747126 [2025-01-09 21:17:30,439 INFO L175 Difference]: Start difference. First operand has 276 places, 275 transitions, 628 flow. Second operand 3 states and 1256 transitions. [2025-01-09 21:17:30,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 279 transitions, 676 flow [2025-01-09 21:17:30,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 279 transitions, 675 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:17:30,442 INFO L231 Difference]: Finished difference. Result has 264 places, 274 transitions, 655 flow [2025-01-09 21:17:30,443 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-01-09 21:17:30,443 INFO L279 CegarLoopForPetriNet]: 301 programPoint places, -37 predicate places. [2025-01-09 21:17:30,443 INFO L471 AbstractCegarLoop]: Abstraction has has 264 places, 274 transitions, 655 flow [2025-01-09 21:17:30,444 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-01-09 21:17:30,444 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:30,444 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-01-09 21:17:30,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:17:30,444 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread_usbErr10ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-01-09 21:17:30,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:30,445 INFO L85 PathProgramCache]: Analyzing trace with hash -443861876, now seen corresponding path program 1 times [2025-01-09 21:17:30,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:30,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147401793] [2025-01-09 21:17:30,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:30,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:30,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 21:17:30,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 21:17:30,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:30,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:30,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:17:30,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:30,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147401793] [2025-01-09 21:17:30,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147401793] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:30,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:30,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:17:30,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115920160] [2025-01-09 21:17:30,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:30,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:17:30,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:30,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:17:30,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:17:30,589 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 464 [2025-01-09 21:17:30,591 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-01-09 21:17:30,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:30,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 464 [2025-01-09 21:17:30,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:30,677 INFO L124 PetriNetUnfolderBase]: 120/1086 cut-off events. [2025-01-09 21:17:30,678 INFO L125 PetriNetUnfolderBase]: For 87/100 co-relation queries the response was YES. [2025-01-09 21:17:30,681 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 5894 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-01-09 21:17:30,684 INFO L140 encePairwiseOnDemand]: 458/464 looper letters, 26 selfloop transitions, 8 changer transitions 0/282 dead transitions. [2025-01-09 21:17:30,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 282 transitions, 749 flow [2025-01-09 21:17:30,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:17:30,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:17:30,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1251 transitions. [2025-01-09 21:17:30,688 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8987068965517241 [2025-01-09 21:17:30,688 INFO L175 Difference]: Start difference. First operand has 264 places, 274 transitions, 655 flow. Second operand 3 states and 1251 transitions. [2025-01-09 21:17:30,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 282 transitions, 749 flow [2025-01-09 21:17:30,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 282 transitions, 739 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:17:30,695 INFO L231 Difference]: Finished difference. Result has 263 places, 280 transitions, 713 flow [2025-01-09 21:17:30,695 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-01-09 21:17:30,696 INFO L279 CegarLoopForPetriNet]: 301 programPoint places, -38 predicate places. [2025-01-09 21:17:30,696 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 280 transitions, 713 flow [2025-01-09 21:17:30,697 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-01-09 21:17:30,697 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:30,697 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-01-09 21:17:30,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:17:30,697 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread_usbErr2ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-01-09 21:17:30,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:30,697 INFO L85 PathProgramCache]: Analyzing trace with hash -368286953, now seen corresponding path program 1 times [2025-01-09 21:17:30,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:30,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982481743] [2025-01-09 21:17:30,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:30,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:30,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 21:17:30,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 21:17:30,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:30,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:30,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:17:30,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:30,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982481743] [2025-01-09 21:17:30,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982481743] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:30,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:30,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:17:30,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959164282] [2025-01-09 21:17:30,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:30,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:17:30,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:30,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:17:30,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:17:30,793 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 417 out of 464 [2025-01-09 21:17:30,795 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-01-09 21:17:30,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:30,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 417 of 464 [2025-01-09 21:17:30,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:30,902 INFO L124 PetriNetUnfolderBase]: 127/1248 cut-off events. [2025-01-09 21:17:30,902 INFO L125 PetriNetUnfolderBase]: For 85/96 co-relation queries the response was YES. [2025-01-09 21:17:30,908 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 7262 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-01-09 21:17:30,911 INFO L140 encePairwiseOnDemand]: 461/464 looper letters, 14 selfloop transitions, 2 changer transitions 0/281 dead transitions. [2025-01-09 21:17:30,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 281 transitions, 747 flow [2025-01-09 21:17:30,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:17:30,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:17:30,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1268 transitions. [2025-01-09 21:17:30,914 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9109195402298851 [2025-01-09 21:17:30,914 INFO L175 Difference]: Start difference. First operand has 263 places, 280 transitions, 713 flow. Second operand 3 states and 1268 transitions. [2025-01-09 21:17:30,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 281 transitions, 747 flow [2025-01-09 21:17:30,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 281 transitions, 731 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:17:30,920 INFO L231 Difference]: Finished difference. Result has 262 places, 279 transitions, 699 flow [2025-01-09 21:17:30,921 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-01-09 21:17:30,922 INFO L279 CegarLoopForPetriNet]: 301 programPoint places, -39 predicate places. [2025-01-09 21:17:30,922 INFO L471 AbstractCegarLoop]: Abstraction has has 262 places, 279 transitions, 699 flow [2025-01-09 21:17:30,923 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-01-09 21:17:30,923 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:30,924 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-01-09 21:17:30,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:17:30,924 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread_usbErr3ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-01-09 21:17:30,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:30,926 INFO L85 PathProgramCache]: Analyzing trace with hash 928446154, now seen corresponding path program 1 times [2025-01-09 21:17:30,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:30,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721253368] [2025-01-09 21:17:30,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:30,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:30,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-09 21:17:30,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-09 21:17:30,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:30,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:30,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:17:30,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:30,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721253368] [2025-01-09 21:17:30,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721253368] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:30,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:30,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:17:30,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461970887] [2025-01-09 21:17:30,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:30,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:17:30,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:31,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:17:31,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:17:31,062 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 464 [2025-01-09 21:17:31,064 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-01-09 21:17:31,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:31,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 464 [2025-01-09 21:17:31,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:31,196 INFO L124 PetriNetUnfolderBase]: 136/1214 cut-off events. [2025-01-09 21:17:31,196 INFO L125 PetriNetUnfolderBase]: For 93/112 co-relation queries the response was YES. [2025-01-09 21:17:31,201 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 7103 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-01-09 21:17:31,205 INFO L140 encePairwiseOnDemand]: 461/464 looper letters, 19 selfloop transitions, 2 changer transitions 0/280 dead transitions. [2025-01-09 21:17:31,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 280 transitions, 743 flow [2025-01-09 21:17:31,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:17:31,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:17:31,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1255 transitions. [2025-01-09 21:17:31,208 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9015804597701149 [2025-01-09 21:17:31,208 INFO L175 Difference]: Start difference. First operand has 262 places, 279 transitions, 699 flow. Second operand 3 states and 1255 transitions. [2025-01-09 21:17:31,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 280 transitions, 743 flow [2025-01-09 21:17:31,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 280 transitions, 739 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:17:31,212 INFO L231 Difference]: Finished difference. Result has 261 places, 278 transitions, 697 flow [2025-01-09 21:17:31,213 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-01-09 21:17:31,213 INFO L279 CegarLoopForPetriNet]: 301 programPoint places, -40 predicate places. [2025-01-09 21:17:31,213 INFO L471 AbstractCegarLoop]: Abstraction has has 261 places, 278 transitions, 697 flow [2025-01-09 21:17:31,214 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-01-09 21:17:31,214 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:31,214 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-01-09 21:17:31,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:17:31,214 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-01-09 21:17:31,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:31,215 INFO L85 PathProgramCache]: Analyzing trace with hash -237332995, now seen corresponding path program 1 times [2025-01-09 21:17:31,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:31,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406916527] [2025-01-09 21:17:31,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:31,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:31,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 21:17:31,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 21:17:31,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:31,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:31,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:17:31,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:31,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406916527] [2025-01-09 21:17:31,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406916527] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:31,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:31,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:17:31,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069704687] [2025-01-09 21:17:31,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:31,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:17:31,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:31,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:17:31,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:17:31,327 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 405 out of 464 [2025-01-09 21:17:31,329 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-01-09 21:17:31,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:31,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 405 of 464 [2025-01-09 21:17:31,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:31,418 INFO L124 PetriNetUnfolderBase]: 168/1234 cut-off events. [2025-01-09 21:17:31,418 INFO L125 PetriNetUnfolderBase]: For 243/320 co-relation queries the response was YES. [2025-01-09 21:17:31,421 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 7274 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-01-09 21:17:31,425 INFO L140 encePairwiseOnDemand]: 456/464 looper letters, 31 selfloop transitions, 12 changer transitions 0/287 dead transitions. [2025-01-09 21:17:31,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 287 transitions, 820 flow [2025-01-09 21:17:31,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:17:31,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:17:31,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1246 transitions. [2025-01-09 21:17:31,427 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8951149425287356 [2025-01-09 21:17:31,427 INFO L175 Difference]: Start difference. First operand has 261 places, 278 transitions, 697 flow. Second operand 3 states and 1246 transitions. [2025-01-09 21:17:31,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 287 transitions, 820 flow [2025-01-09 21:17:31,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 287 transitions, 816 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:17:31,431 INFO L231 Difference]: Finished difference. Result has 263 places, 286 transitions, 793 flow [2025-01-09 21:17:31,431 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-01-09 21:17:31,432 INFO L279 CegarLoopForPetriNet]: 301 programPoint places, -38 predicate places. [2025-01-09 21:17:31,432 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 286 transitions, 793 flow [2025-01-09 21:17:31,433 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-01-09 21:17:31,433 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:31,433 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-01-09 21:17:31,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:17:31,433 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-01-09 21:17:31,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:31,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1863652642, now seen corresponding path program 1 times [2025-01-09 21:17:31,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:31,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978574143] [2025-01-09 21:17:31,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:31,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:31,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 21:17:31,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 21:17:31,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:31,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:31,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:17:31,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:31,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978574143] [2025-01-09 21:17:31,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978574143] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:31,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:31,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:17:31,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581835944] [2025-01-09 21:17:31,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:31,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:17:31,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:31,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:17:31,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:17:31,539 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 405 out of 464 [2025-01-09 21:17:31,540 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-01-09 21:17:31,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:31,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 405 of 464 [2025-01-09 21:17:31,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:31,688 INFO L124 PetriNetUnfolderBase]: 278/1818 cut-off events. [2025-01-09 21:17:31,689 INFO L125 PetriNetUnfolderBase]: For 922/1023 co-relation queries the response was YES. [2025-01-09 21:17:31,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2977 conditions, 1818 events. 278/1818 cut-off events. For 922/1023 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 12656 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-01-09 21:17:31,696 INFO L140 encePairwiseOnDemand]: 458/464 looper letters, 38 selfloop transitions, 9 changer transitions 1/293 dead transitions. [2025-01-09 21:17:31,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 293 transitions, 921 flow [2025-01-09 21:17:31,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:17:31,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:17:31,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1245 transitions. [2025-01-09 21:17:31,698 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8943965517241379 [2025-01-09 21:17:31,698 INFO L175 Difference]: Start difference. First operand has 263 places, 286 transitions, 793 flow. Second operand 3 states and 1245 transitions. [2025-01-09 21:17:31,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 293 transitions, 921 flow [2025-01-09 21:17:31,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 293 transitions, 893 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:17:31,704 INFO L231 Difference]: Finished difference. Result has 265 places, 290 transitions, 839 flow [2025-01-09 21:17:31,704 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-01-09 21:17:31,705 INFO L279 CegarLoopForPetriNet]: 301 programPoint places, -36 predicate places. [2025-01-09 21:17:31,705 INFO L471 AbstractCegarLoop]: Abstraction has has 265 places, 290 transitions, 839 flow [2025-01-09 21:17:31,706 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-01-09 21:17:31,706 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:31,706 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-01-09 21:17:31,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:17:31,706 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread_usbErr5ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-01-09 21:17:31,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:31,707 INFO L85 PathProgramCache]: Analyzing trace with hash -463337924, now seen corresponding path program 1 times [2025-01-09 21:17:31,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:31,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194722853] [2025-01-09 21:17:31,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:31,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:31,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 21:17:31,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 21:17:31,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:31,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:31,755 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 21:17:31,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:31,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194722853] [2025-01-09 21:17:31,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194722853] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:31,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:31,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:17:31,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706947144] [2025-01-09 21:17:31,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:31,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:17:31,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:31,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:17:31,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:17:31,769 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 419 out of 464 [2025-01-09 21:17:31,770 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-01-09 21:17:31,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:31,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 419 of 464 [2025-01-09 21:17:31,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:31,873 INFO L124 PetriNetUnfolderBase]: 152/1442 cut-off events. [2025-01-09 21:17:31,873 INFO L125 PetriNetUnfolderBase]: For 391/429 co-relation queries the response was YES. [2025-01-09 21:17:31,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2078 conditions, 1442 events. 152/1442 cut-off events. For 391/429 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 8157 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-01-09 21:17:31,882 INFO L140 encePairwiseOnDemand]: 461/464 looper letters, 11 selfloop transitions, 2 changer transitions 2/294 dead transitions. [2025-01-09 21:17:31,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 294 transitions, 878 flow [2025-01-09 21:17:31,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:17:31,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:17:31,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1273 transitions. [2025-01-09 21:17:31,886 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9145114942528736 [2025-01-09 21:17:31,886 INFO L175 Difference]: Start difference. First operand has 265 places, 290 transitions, 839 flow. Second operand 3 states and 1273 transitions. [2025-01-09 21:17:31,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 294 transitions, 878 flow [2025-01-09 21:17:31,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 294 transitions, 854 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-01-09 21:17:31,891 INFO L231 Difference]: Finished difference. Result has 265 places, 290 transitions, 823 flow [2025-01-09 21:17:31,892 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-01-09 21:17:31,893 INFO L279 CegarLoopForPetriNet]: 301 programPoint places, -36 predicate places. [2025-01-09 21:17:31,893 INFO L471 AbstractCegarLoop]: Abstraction has has 265 places, 290 transitions, 823 flow [2025-01-09 21:17:31,894 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-01-09 21:17:31,894 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:31,894 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-01-09 21:17:31,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:17:31,894 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread_usbErr10ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-01-09 21:17:31,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:31,895 INFO L85 PathProgramCache]: Analyzing trace with hash -2141884433, now seen corresponding path program 1 times [2025-01-09 21:17:31,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:31,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707587940] [2025-01-09 21:17:31,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:31,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:31,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 21:17:31,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 21:17:31,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:31,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:31,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:17:31,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:31,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707587940] [2025-01-09 21:17:31,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707587940] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:31,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:31,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:17:31,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307544479] [2025-01-09 21:17:31,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:31,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:17:31,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:31,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:17:31,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:17:32,016 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 464 [2025-01-09 21:17:32,019 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-01-09 21:17:32,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:32,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 464 [2025-01-09 21:17:32,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:32,281 INFO L124 PetriNetUnfolderBase]: 319/2767 cut-off events. [2025-01-09 21:17:32,281 INFO L125 PetriNetUnfolderBase]: For 561/615 co-relation queries the response was YES. [2025-01-09 21:17:32,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3997 conditions, 2767 events. 319/2767 cut-off events. For 561/615 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 20258 event pairs, 45 based on Foata normal form. 4/2495 useless extension candidates. Maximal degree in co-relation 3917. Up to 205 conditions per place. [2025-01-09 21:17:32,296 INFO L140 encePairwiseOnDemand]: 456/464 looper letters, 32 selfloop transitions, 8 changer transitions 0/312 dead transitions. [2025-01-09 21:17:32,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 312 transitions, 954 flow [2025-01-09 21:17:32,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 21:17:32,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 21:17:32,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2953 transitions. [2025-01-09 21:17:32,301 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9091748768472906 [2025-01-09 21:17:32,301 INFO L175 Difference]: Start difference. First operand has 265 places, 290 transitions, 823 flow. Second operand 7 states and 2953 transitions. [2025-01-09 21:17:32,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 312 transitions, 954 flow [2025-01-09 21:17:32,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 312 transitions, 952 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:17:32,306 INFO L231 Difference]: Finished difference. Result has 275 places, 297 transitions, 879 flow [2025-01-09 21:17:32,306 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-01-09 21:17:32,307 INFO L279 CegarLoopForPetriNet]: 301 programPoint places, -26 predicate places. [2025-01-09 21:17:32,307 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 297 transitions, 879 flow [2025-01-09 21:17:32,308 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-01-09 21:17:32,308 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:32,308 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-01-09 21:17:32,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:17:32,308 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread_usbErr10ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-01-09 21:17:32,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:32,309 INFO L85 PathProgramCache]: Analyzing trace with hash -601549805, now seen corresponding path program 1 times [2025-01-09 21:17:32,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:32,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790360853] [2025-01-09 21:17:32,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:32,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:32,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 21:17:32,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 21:17:32,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:32,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:32,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:17:32,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:32,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790360853] [2025-01-09 21:17:32,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790360853] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:32,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:32,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:17:32,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185295750] [2025-01-09 21:17:32,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:32,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:17:32,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:32,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:17:32,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:17:32,408 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 464 [2025-01-09 21:17:32,410 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-01-09 21:17:32,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:32,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 464 [2025-01-09 21:17:32,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:32,884 INFO L124 PetriNetUnfolderBase]: 583/5209 cut-off events. [2025-01-09 21:17:32,885 INFO L125 PetriNetUnfolderBase]: For 1176/1271 co-relation queries the response was YES. [2025-01-09 21:17:32,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7679 conditions, 5209 events. 583/5209 cut-off events. For 1176/1271 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 46283 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-01-09 21:17:32,913 INFO L140 encePairwiseOnDemand]: 457/464 looper letters, 34 selfloop transitions, 9 changer transitions 0/324 dead transitions. [2025-01-09 21:17:32,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 324 transitions, 1030 flow [2025-01-09 21:17:32,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 21:17:32,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 21:17:32,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2970 transitions. [2025-01-09 21:17:32,918 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9144088669950738 [2025-01-09 21:17:32,918 INFO L175 Difference]: Start difference. First operand has 275 places, 297 transitions, 879 flow. Second operand 7 states and 2970 transitions. [2025-01-09 21:17:32,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 324 transitions, 1030 flow [2025-01-09 21:17:32,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 324 transitions, 1030 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:17:32,967 INFO L231 Difference]: Finished difference. Result has 287 places, 305 transitions, 947 flow [2025-01-09 21:17:32,968 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-01-09 21:17:32,969 INFO L279 CegarLoopForPetriNet]: 301 programPoint places, -14 predicate places. [2025-01-09 21:17:32,969 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 305 transitions, 947 flow [2025-01-09 21:17:32,970 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-01-09 21:17:32,971 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:32,971 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-01-09 21:17:32,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:17:32,971 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread_usbThread1of1ForFork1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-01-09 21:17:32,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:32,972 INFO L85 PathProgramCache]: Analyzing trace with hash -580997156, now seen corresponding path program 1 times [2025-01-09 21:17:32,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:32,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748238281] [2025-01-09 21:17:32,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:32,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:32,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 21:17:32,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 21:17:32,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:32,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:33,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:17:33,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:33,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748238281] [2025-01-09 21:17:33,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748238281] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:33,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:33,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:17:33,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823441684] [2025-01-09 21:17:33,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:33,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:17:33,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:33,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:17:33,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:17:33,069 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 413 out of 464 [2025-01-09 21:17:33,070 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-01-09 21:17:33,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:33,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 413 of 464 [2025-01-09 21:17:33,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:33,139 INFO L124 PetriNetUnfolderBase]: 62/812 cut-off events. [2025-01-09 21:17:33,139 INFO L125 PetriNetUnfolderBase]: For 94/94 co-relation queries the response was YES. [2025-01-09 21:17:33,141 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 2619 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-01-09 21:17:33,143 INFO L140 encePairwiseOnDemand]: 459/464 looper letters, 13 selfloop transitions, 2 changer transitions 55/270 dead transitions. [2025-01-09 21:17:33,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 270 transitions, 772 flow [2025-01-09 21:17:33,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:17:33,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:17:33,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1258 transitions. [2025-01-09 21:17:33,145 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9037356321839081 [2025-01-09 21:17:33,145 INFO L175 Difference]: Start difference. First operand has 287 places, 305 transitions, 947 flow. Second operand 3 states and 1258 transitions. [2025-01-09 21:17:33,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 270 transitions, 772 flow [2025-01-09 21:17:33,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 270 transitions, 710 flow, removed 13 selfloop flow, removed 10 redundant places. [2025-01-09 21:17:33,150 INFO L231 Difference]: Finished difference. Result has 273 places, 213 transitions, 539 flow [2025-01-09 21:17:33,151 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-01-09 21:17:33,151 INFO L279 CegarLoopForPetriNet]: 301 programPoint places, -28 predicate places. [2025-01-09 21:17:33,151 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 213 transitions, 539 flow [2025-01-09 21:17:33,152 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-01-09 21:17:33,152 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:33,152 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-01-09 21:17:33,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:17:33,152 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread_usbErr6ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-01-09 21:17:33,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:33,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1633704496, now seen corresponding path program 1 times [2025-01-09 21:17:33,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:33,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712650789] [2025-01-09 21:17:33,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:33,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:33,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 21:17:33,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 21:17:33,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:33,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:33,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:17:33,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:33,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712650789] [2025-01-09 21:17:33,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712650789] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:33,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:33,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:17:33,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552640606] [2025-01-09 21:17:33,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:33,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:17:33,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:33,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:17:33,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:17:33,248 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 464 [2025-01-09 21:17:33,249 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-01-09 21:17:33,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:33,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 464 [2025-01-09 21:17:33,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:33,293 INFO L124 PetriNetUnfolderBase]: 46/533 cut-off events. [2025-01-09 21:17:33,294 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2025-01-09 21:17:33,296 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-01-09 21:17:33,297 INFO L140 encePairwiseOnDemand]: 461/464 looper letters, 16 selfloop transitions, 2 changer transitions 0/212 dead transitions. [2025-01-09 21:17:33,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 212 transitions, 573 flow [2025-01-09 21:17:33,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:17:33,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:17:33,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1252 transitions. [2025-01-09 21:17:33,299 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8994252873563219 [2025-01-09 21:17:33,299 INFO L175 Difference]: Start difference. First operand has 273 places, 213 transitions, 539 flow. Second operand 3 states and 1252 transitions. [2025-01-09 21:17:33,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 212 transitions, 573 flow [2025-01-09 21:17:33,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 212 transitions, 536 flow, removed 3 selfloop flow, removed 15 redundant places. [2025-01-09 21:17:33,302 INFO L231 Difference]: Finished difference. Result has 216 places, 212 transitions, 504 flow [2025-01-09 21:17:33,303 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-01-09 21:17:33,303 INFO L279 CegarLoopForPetriNet]: 301 programPoint places, -85 predicate places. [2025-01-09 21:17:33,303 INFO L471 AbstractCegarLoop]: Abstraction has has 216 places, 212 transitions, 504 flow [2025-01-09 21:17:33,304 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-01-09 21:17:33,304 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:33,304 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-01-09 21:17:33,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 21:17:33,304 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread_usbErr7ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-01-09 21:17:33,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:33,305 INFO L85 PathProgramCache]: Analyzing trace with hash 585399126, now seen corresponding path program 1 times [2025-01-09 21:17:33,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:33,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959134144] [2025-01-09 21:17:33,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:33,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:33,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 21:17:33,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 21:17:33,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:33,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:33,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:17:33,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:33,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959134144] [2025-01-09 21:17:33,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959134144] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:33,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:33,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:17:33,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157959503] [2025-01-09 21:17:33,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:33,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:17:33,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:33,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:17:33,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:17:33,403 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 407 out of 464 [2025-01-09 21:17:33,404 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-01-09 21:17:33,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:33,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 407 of 464 [2025-01-09 21:17:33,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:33,472 INFO L124 PetriNetUnfolderBase]: 22/368 cut-off events. [2025-01-09 21:17:33,472 INFO L125 PetriNetUnfolderBase]: For 4/8 co-relation queries the response was YES. [2025-01-09 21:17:33,473 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 458 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-01-09 21:17:33,474 INFO L140 encePairwiseOnDemand]: 461/464 looper letters, 0 selfloop transitions, 0 changer transitions 211/211 dead transitions. [2025-01-09 21:17:33,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 211 transitions, 532 flow [2025-01-09 21:17:33,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:17:33,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:17:33,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1237 transitions. [2025-01-09 21:17:33,476 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8886494252873564 [2025-01-09 21:17:33,476 INFO L175 Difference]: Start difference. First operand has 216 places, 212 transitions, 504 flow. Second operand 3 states and 1237 transitions. [2025-01-09 21:17:33,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 211 transitions, 532 flow [2025-01-09 21:17:33,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 211 transitions, 528 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:17:33,479 INFO L231 Difference]: Finished difference. Result has 215 places, 0 transitions, 0 flow [2025-01-09 21:17:33,479 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-01-09 21:17:33,479 INFO L279 CegarLoopForPetriNet]: 301 programPoint places, -86 predicate places. [2025-01-09 21:17:33,479 INFO L471 AbstractCegarLoop]: Abstraction has has 215 places, 0 transitions, 0 flow [2025-01-09 21:17:33,480 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-01-09 21:17:33,482 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE (38 of 39 remaining) [2025-01-09 21:17:33,482 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE (37 of 39 remaining) [2025-01-09 21:17:33,482 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (36 of 39 remaining) [2025-01-09 21:17:33,482 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (35 of 39 remaining) [2025-01-09 21:17:33,483 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (34 of 39 remaining) [2025-01-09 21:17:33,483 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (33 of 39 remaining) [2025-01-09 21:17:33,483 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (32 of 39 remaining) [2025-01-09 21:17:33,483 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (31 of 39 remaining) [2025-01-09 21:17:33,483 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (30 of 39 remaining) [2025-01-09 21:17:33,483 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (29 of 39 remaining) [2025-01-09 21:17:33,483 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 39 remaining) [2025-01-09 21:17:33,483 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr0ASSERT_VIOLATIONDATA_RACE (27 of 39 remaining) [2025-01-09 21:17:33,483 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr10ASSERT_VIOLATIONDATA_RACE (26 of 39 remaining) [2025-01-09 21:17:33,483 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr1ASSERT_VIOLATIONDATA_RACE (25 of 39 remaining) [2025-01-09 21:17:33,483 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr11ASSERT_VIOLATIONDATA_RACE (24 of 39 remaining) [2025-01-09 21:17:33,483 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr4ASSERT_VIOLATIONDATA_RACE (23 of 39 remaining) [2025-01-09 21:17:33,483 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr9ASSERT_VIOLATIONDATA_RACE (22 of 39 remaining) [2025-01-09 21:17:33,484 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr5ASSERT_VIOLATIONDATA_RACE (21 of 39 remaining) [2025-01-09 21:17:33,484 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr2ASSERT_VIOLATIONDATA_RACE (20 of 39 remaining) [2025-01-09 21:17:33,484 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr6ASSERT_VIOLATIONDATA_RACE (19 of 39 remaining) [2025-01-09 21:17:33,484 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr7ASSERT_VIOLATIONDATA_RACE (18 of 39 remaining) [2025-01-09 21:17:33,484 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr8ASSERT_VIOLATIONDATA_RACE (17 of 39 remaining) [2025-01-09 21:17:33,484 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr3ASSERT_VIOLATIONDATA_RACE (16 of 39 remaining) [2025-01-09 21:17:33,484 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 39 remaining) [2025-01-09 21:17:33,484 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE (14 of 39 remaining) [2025-01-09 21:17:33,484 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE (13 of 39 remaining) [2025-01-09 21:17:33,484 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr0ASSERT_VIOLATIONDATA_RACE (12 of 39 remaining) [2025-01-09 21:17:33,484 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr10ASSERT_VIOLATIONDATA_RACE (11 of 39 remaining) [2025-01-09 21:17:33,484 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr1ASSERT_VIOLATIONDATA_RACE (10 of 39 remaining) [2025-01-09 21:17:33,484 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr11ASSERT_VIOLATIONDATA_RACE (9 of 39 remaining) [2025-01-09 21:17:33,484 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr4ASSERT_VIOLATIONDATA_RACE (8 of 39 remaining) [2025-01-09 21:17:33,485 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr9ASSERT_VIOLATIONDATA_RACE (7 of 39 remaining) [2025-01-09 21:17:33,485 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr5ASSERT_VIOLATIONDATA_RACE (6 of 39 remaining) [2025-01-09 21:17:33,485 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr2ASSERT_VIOLATIONDATA_RACE (5 of 39 remaining) [2025-01-09 21:17:33,485 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr6ASSERT_VIOLATIONDATA_RACE (4 of 39 remaining) [2025-01-09 21:17:33,485 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr7ASSERT_VIOLATIONDATA_RACE (3 of 39 remaining) [2025-01-09 21:17:33,485 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr8ASSERT_VIOLATIONDATA_RACE (2 of 39 remaining) [2025-01-09 21:17:33,485 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr3ASSERT_VIOLATIONDATA_RACE (1 of 39 remaining) [2025-01-09 21:17:33,485 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbThread1of1ForFork1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 39 remaining) [2025-01-09 21:17:33,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 21:17:33,485 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-01-09 21:17:33,489 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:17:33,490 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:17:33,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:17:33 BasicIcfg [2025-01-09 21:17:33,494 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:17:33,494 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:17:33,494 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:17:33,495 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:17:33,495 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:17:27" (3/4) ... [2025-01-09 21:17:33,496 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:17:33,499 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread_ath9k [2025-01-09 21:17:33,499 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread_usb [2025-01-09 21:17:33,502 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-01-09 21:17:33,503 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 21:17:33,503 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 21:17:33,503 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 21:17:33,566 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:17:33,566 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:17:33,566 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:17:33,567 INFO L158 Benchmark]: Toolchain (without parser) took 6948.54ms. Allocated memory was 142.6MB in the beginning and 536.9MB in the end (delta: 394.3MB). Free memory was 102.5MB in the beginning and 432.5MB in the end (delta: -330.0MB). Peak memory consumption was 70.1MB. Max. memory is 16.1GB. [2025-01-09 21:17:33,567 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:17:33,567 INFO L158 Benchmark]: CACSL2BoogieTranslator took 643.08ms. Allocated memory is still 142.6MB. Free memory was 102.5MB in the beginning and 46.6MB in the end (delta: 55.9MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-01-09 21:17:33,567 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.39ms. Allocated memory is still 142.6MB. Free memory was 46.6MB in the beginning and 43.2MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:17:33,567 INFO L158 Benchmark]: Boogie Preprocessor took 32.26ms. Allocated memory is still 142.6MB. Free memory was 43.2MB in the beginning and 40.8MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:17:33,567 INFO L158 Benchmark]: RCFGBuilder took 581.07ms. Allocated memory is still 142.6MB. Free memory was 40.2MB in the beginning and 79.0MB in the end (delta: -38.8MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. [2025-01-09 21:17:33,568 INFO L158 Benchmark]: TraceAbstraction took 5562.37ms. Allocated memory was 142.6MB in the beginning and 536.9MB in the end (delta: 394.3MB). Free memory was 78.3MB in the beginning and 437.6MB in the end (delta: -359.3MB). Peak memory consumption was 242.0MB. Max. memory is 16.1GB. [2025-01-09 21:17:33,568 INFO L158 Benchmark]: Witness Printer took 71.71ms. Allocated memory is still 536.9MB. Free memory was 437.6MB in the beginning and 432.5MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:17:33,569 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 643.08ms. Allocated memory is still 142.6MB. Free memory was 102.5MB in the beginning and 46.6MB in the end (delta: 55.9MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.39ms. Allocated memory is still 142.6MB. Free memory was 46.6MB in the beginning and 43.2MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.26ms. Allocated memory is still 142.6MB. Free memory was 43.2MB in the beginning and 40.8MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 581.07ms. Allocated memory is still 142.6MB. Free memory was 40.2MB in the beginning and 79.0MB in the end (delta: -38.8MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. * TraceAbstraction took 5562.37ms. Allocated memory was 142.6MB in the beginning and 536.9MB in the end (delta: 394.3MB). Free memory was 78.3MB in the beginning and 437.6MB in the end (delta: -359.3MB). Peak memory consumption was 242.0MB. Max. memory is 16.1GB. * Witness Printer took 71.71ms. Allocated memory is still 536.9MB. Free memory was 437.6MB in the beginning and 432.5MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. 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: 5.5s, OverallIterations: 19, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1277 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 434 mSDsluCounter, 283 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 59 mSDsCounter, 84 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1329 IncrementalHoareTripleChecker+Invalid, 1413 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 84 mSolverCounterUnsat, 224 mSDtfsCounter, 1329 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.1s SatisfiabilityAnalysisTime, 1.0s 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-01-09 21:17:33,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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