./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/ldv-races/race-4_2-thread_local_vars.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d 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_2-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 0f799b8cb369af433cd7b4f4a2ae1c7efd2306d185f06da0302d2727c00c6bf0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:27:13,524 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:27:13,574 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:27:13,577 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:27:13,577 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:27:13,591 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:27:13,591 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:27:13,591 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:27:13,591 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:27:13,591 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:27:13,592 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:27:13,592 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:27:13,592 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:27:13,592 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:27:13,595 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:27:13,595 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:27:13,596 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:27:13,596 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:27:13,596 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:27:13,596 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:27:13,596 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:27:13,596 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:27:13,596 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:27:13,596 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:27:13,596 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:27:13,596 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:27:13,596 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:27:13,596 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:27:13,596 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:27:13,596 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:27:13,596 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:27:13,596 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:27:13,596 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:27:13,596 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:27:13,596 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:27:13,596 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:27:13,596 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:27:13,597 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:27:13,597 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:27:13,597 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:27:13,597 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:27:13,597 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:27:13,597 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 -> 0f799b8cb369af433cd7b4f4a2ae1c7efd2306d185f06da0302d2727c00c6bf0 [2025-02-08 05:27:13,811 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:27:13,817 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:27:13,818 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:27:13,819 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:27:13,819 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:27:13,820 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-4_2-thread_local_vars.i [2025-02-08 05:27:15,038 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/42e8ea6c8/63bb9b6fc2204193b0b72cff6ebaa177/FLAGba1a05575 [2025-02-08 05:27:15,448 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:27:15,450 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-races/race-4_2-thread_local_vars.i [2025-02-08 05:27:15,469 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/42e8ea6c8/63bb9b6fc2204193b0b72cff6ebaa177/FLAGba1a05575 [2025-02-08 05:27:15,626 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/42e8ea6c8/63bb9b6fc2204193b0b72cff6ebaa177 [2025-02-08 05:27:15,628 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:27:15,630 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:27:15,631 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:27:15,631 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:27:15,634 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:27:15,635 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:27:15" (1/1) ... [2025-02-08 05:27:15,636 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@434380c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:27:15, skipping insertion in model container [2025-02-08 05:27:15,636 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:27:15" (1/1) ... [2025-02-08 05:27:15,675 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:27:16,094 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:27:16,107 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:27:16,191 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:27:16,285 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:27:16,285 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:27:16 WrapperNode [2025-02-08 05:27:16,285 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:27:16,286 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:27:16,286 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:27:16,286 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:27:16,290 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:27:16" (1/1) ... [2025-02-08 05:27:16,306 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:27:16" (1/1) ... [2025-02-08 05:27:16,333 INFO L138 Inliner]: procedures = 487, calls = 38, calls flagged for inlining = 17, calls inlined = 23, statements flattened = 290 [2025-02-08 05:27:16,333 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:27:16,336 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:27:16,336 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:27:16,336 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:27:16,341 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:27:16" (1/1) ... [2025-02-08 05:27:16,342 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:27:16" (1/1) ... [2025-02-08 05:27:16,349 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:27:16" (1/1) ... [2025-02-08 05:27:16,350 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:27:16" (1/1) ... [2025-02-08 05:27:16,364 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:27:16" (1/1) ... [2025-02-08 05:27:16,365 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:27:16" (1/1) ... [2025-02-08 05:27:16,368 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:27:16" (1/1) ... [2025-02-08 05:27:16,369 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:27:16" (1/1) ... [2025-02-08 05:27:16,372 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:27:16,376 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:27:16,377 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:27:16,377 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:27:16,377 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:27:16" (1/1) ... [2025-02-08 05:27:16,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:27:16,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:27:16,404 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-02-08 05:27:16,411 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-02-08 05:27:16,427 INFO L130 BoogieDeclarations]: Found specification of procedure thread_usb [2025-02-08 05:27:16,427 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_usb [2025-02-08 05:27:16,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 05:27:16,428 INFO L130 BoogieDeclarations]: Found specification of procedure thread_ath9k [2025-02-08 05:27:16,428 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_ath9k [2025-02-08 05:27:16,428 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 05:27:16,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:27:16,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-08 05:27:16,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:27:16,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:27:16,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 05:27:16,428 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 05:27:16,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:27:16,429 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:27:16,635 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:27:16,637 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:27:16,714 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1700: havoc ldv_assert_#in~expression#1;assume { :end_inline_ldv_assert } true; [2025-02-08 05:27:16,714 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1700-1: havoc ldv_assert_~expression#1; [2025-02-08 05:27:16,714 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1701: havoc ath9k_flush_#t~ret33#1; [2025-02-08 05:27:16,714 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1701-1: [2025-02-08 05:27:16,715 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1701-2: SUMMARY for call ath9k_flush_#t~ret33#1 := #PthreadsMutexUnlock(~#mutex~0.base, ~#mutex~0.offset); srcloc: null [2025-02-08 05:27:16,715 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1701-3: [2025-02-08 05:27:16,718 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1707: havoc ath9k_flush_#t~ret31#1, ath9k_flush_#t~nondet32#1, ath9k_flush_#t~ret33#1;assume { :end_inline_ath9k_flush } true; [2025-02-08 05:27:16,941 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1761: assume #race~pdev~0 == #t~nondet49#1; [2025-02-08 05:27:16,942 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1761: assume !(#race~pdev~0 == #t~nondet49#1); [2025-02-08 05:27:16,942 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1761-1: havoc #t~nondet49#1; [2025-02-08 05:27:16,942 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1761-2: #race~pdev~0 := #t~nondet49#1; [2025-02-08 05:27:16,942 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1761-3: havoc #t~nondet49#1; [2025-02-08 05:27:16,942 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1761-4: ~pdev~0 := 8; [2025-02-08 05:27:16,942 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1753: assume #race~pdev~0 == #t~nondet47#1; [2025-02-08 05:27:16,942 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1753: assume !(#race~pdev~0 == #t~nondet47#1); [2025-02-08 05:27:16,942 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1753-1: havoc #t~nondet47#1; [2025-02-08 05:27:16,942 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1753-2: #race~pdev~0 := #t~nondet47#1; [2025-02-08 05:27:16,942 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1753-3: havoc #t~nondet47#1; [2025-02-08 05:27:16,942 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1753-4: ~pdev~0 := 7; [2025-02-08 05:27:16,942 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1762: havoc ldv_assert_#in~expression#1;assume { :end_inline_ldv_assert } true; [2025-02-08 05:27:16,942 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1762-1: havoc ldv_assert_~expression#1; [2025-02-08 05:27:16,942 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1762-2: havoc ldv_assert_~expression#1; [2025-02-08 05:27:16,942 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1762-3: assume 0 == #race~pdev~0; [2025-02-08 05:27:16,942 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1762-3: assume !(0 == #race~pdev~0); [2025-02-08 05:27:16,942 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1762-4: assume { :begin_inline_ldv_assert } true;ldv_assert_#in~expression#1 := (if 8 == ~pdev~0 then 1 else 0); [2025-02-08 05:27:16,942 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1762-5: #race~pdev~0 := 0; [2025-02-08 05:27:16,942 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1754: havoc ldv_assert_#in~expression#1;assume { :end_inline_ldv_assert } true; [2025-02-08 05:27:16,942 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1754-1: havoc ldv_assert_~expression#1; [2025-02-08 05:27:16,942 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1754-2: havoc ldv_assert_~expression#1; [2025-02-08 05:27:16,942 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1754-3: assume 0 == #race~pdev~0; [2025-02-08 05:27:16,942 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1754-3: assume !(0 == #race~pdev~0); [2025-02-08 05:27:16,943 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1754-4: assume { :begin_inline_ldv_assert } true;ldv_assert_#in~expression#1 := (if 7 == ~pdev~0 then 1 else 0); [2025-02-08 05:27:16,943 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1754-5: #race~pdev~0 := 0; [2025-02-08 05:27:16,943 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1747-1: assume 0 != ~probe_ret~0#1; [2025-02-08 05:27:16,943 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1747-1: assume !(0 != ~probe_ret~0#1); [2025-02-08 05:27:16,943 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1739: assume { :end_inline_ieee80211_deregister_hw } true;assume { :end_inline_ath_ahb_disconnect } true;~ldv_usb_state~0 := 0; [2025-02-08 05:27:16,943 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1739-1: havoc ieee80211_deregister_hw_#t~ret40#1.base, ieee80211_deregister_hw_#t~ret40#1.offset, ieee80211_deregister_hw_~#status~0#1.base, ieee80211_deregister_hw_~#status~0#1.offset; [2025-02-08 05:27:16,943 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1731: havoc ath_ahb_probe_#t~ret41#1; [2025-02-08 05:27:16,943 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1731-1: ath_ahb_probe_~error~0#1 := ath_ahb_probe_#t~ret41#1; [2025-02-08 05:27:16,943 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1731-2: assume { :end_inline_ieee80211_register_hw } true;assume -2147483648 <= ath_ahb_probe_#t~ret41#1 && ath_ahb_probe_#t~ret41#1 <= 2147483647; [2025-02-08 05:27:16,943 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1731-3: havoc ieee80211_register_hw_#t~nondet36#1, ieee80211_register_hw_#t~pre37#1, ieee80211_register_hw_#t~nondet38#1, ieee80211_register_hw_#t~nondet39#1; [2025-02-08 05:27:16,943 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1731-4: ath_ahb_probe_#t~ret41#1 := ieee80211_register_hw_#res#1; [2025-02-08 05:27:16,943 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1732: assume 0 != ath_ahb_probe_~error~0#1; [2025-02-08 05:27:16,943 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1732: assume !(0 != ath_ahb_probe_~error~0#1); [2025-02-08 05:27:16,943 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1724: havoc ieee80211_deregister_hw_~#status~0#1.base, ieee80211_deregister_hw_~#status~0#1.offset; [2025-02-08 05:27:16,943 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1724-1: SUMMARY for call ULTIMATE.dealloc(ieee80211_deregister_hw_~#status~0#1.base, ieee80211_deregister_hw_~#status~0#1.offset); srcloc: null [2025-02-08 05:27:16,943 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1691-2: assume false; [2025-02-08 05:27:16,943 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1691-2: assume !false; [2025-02-08 05:27:16,943 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1691-3: assume false; [2025-02-08 05:27:16,943 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1691-4: assume false; [2025-02-08 05:27:16,943 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1691-4: assume !false; [2025-02-08 05:27:16,943 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1691-5: assume false; [2025-02-08 05:27:16,943 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1749: havoc #t~ret45#1; [2025-02-08 05:27:16,943 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1749-1: ~probe_ret~0#1 := #t~ret45#1; [2025-02-08 05:27:16,943 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1749-2: assume { :end_inline_ath_ahb_probe } true;assume -2147483648 <= #t~ret45#1 && #t~ret45#1 <= 2147483647; [2025-02-08 05:27:16,943 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1749-3: havoc ath_ahb_probe_#t~ret41#1, ath_ahb_probe_~error~0#1; [2025-02-08 05:27:16,943 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1749-4: #t~ret45#1 := ath_ahb_probe_#res#1; [2025-02-08 05:27:16,943 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1734-1: ath_ahb_probe_#res#1 := 0; [2025-02-08 05:27:16,943 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1693-6: assume { :end_inline_reach_error } true;assume false; [2025-02-08 05:27:16,943 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1693-7: havoc reach_error_#t~nondet30#1.base, reach_error_#t~nondet30#1.offset; [2025-02-08 05:27:16,943 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1693-8: assume 0 == ldv_assert_~expression#1; [2025-02-08 05:27:16,944 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1693-8: assume !(0 == ldv_assert_~expression#1); [2025-02-08 05:27:16,944 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1693-9: assume { :begin_inline_reach_error } true;havoc reach_error_#t~nondet30#1.base, reach_error_#t~nondet30#1.offset; [2025-02-08 05:27:16,944 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1693-10: ldv_assert_~expression#1 := ldv_assert_#in~expression#1; [2025-02-08 05:27:16,944 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1693-12: assume { :end_inline_reach_error } true;assume false; [2025-02-08 05:27:16,944 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1693-13: havoc reach_error_#t~nondet30#1.base, reach_error_#t~nondet30#1.offset; [2025-02-08 05:27:16,944 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1693-14: assume 0 == ldv_assert_~expression#1; [2025-02-08 05:27:16,945 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1693-14: assume !(0 == ldv_assert_~expression#1); [2025-02-08 05:27:16,945 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1693-15: assume { :begin_inline_reach_error } true;havoc reach_error_#t~nondet30#1.base, reach_error_#t~nondet30#1.offset; [2025-02-08 05:27:16,945 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1693-16: ldv_assert_~expression#1 := ldv_assert_#in~expression#1; [2025-02-08 05:27:16,945 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1760: assume #race~ldv_usb_state~0 == #t~nondet48#1; [2025-02-08 05:27:16,945 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1760: assume !(#race~ldv_usb_state~0 == #t~nondet48#1); [2025-02-08 05:27:16,945 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1760-1: havoc #t~nondet48#1; [2025-02-08 05:27:16,945 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1760-2: #race~ldv_usb_state~0 := #t~nondet48#1; [2025-02-08 05:27:16,945 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1760-3: havoc #t~nondet48#1; [2025-02-08 05:27:16,945 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1752: assume #race~ldv_usb_state~0 == #t~nondet46#1; [2025-02-08 05:27:16,945 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1752: assume !(#race~ldv_usb_state~0 == #t~nondet46#1); [2025-02-08 05:27:16,945 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1752-1: havoc #t~nondet46#1; [2025-02-08 05:27:16,945 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1752-2: #race~ldv_usb_state~0 := #t~nondet46#1; [2025-02-08 05:27:16,945 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1752-3: havoc #t~nondet46#1; [2025-02-08 05:27:16,946 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1752-4: ~ldv_usb_state~0 := 1; [2025-02-08 05:27:16,946 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1736-1: ath_ahb_probe_#res#1 := -1; [2025-02-08 05:27:16,946 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:27:16,947 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:27:16,964 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:27:16,964 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:27:16,965 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:27:16 BoogieIcfgContainer [2025-02-08 05:27:16,965 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:27:16,966 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:27:16,966 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:27:16,969 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:27:16,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:27:15" (1/3) ... [2025-02-08 05:27:16,970 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f668d5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:27:16, skipping insertion in model container [2025-02-08 05:27:16,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:27:16" (2/3) ... [2025-02-08 05:27:16,970 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f668d5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:27:16, skipping insertion in model container [2025-02-08 05:27:16,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:27:16" (3/3) ... [2025-02-08 05:27:16,971 INFO L128 eAbstractionObserver]: Analyzing ICFG race-4_2-thread_local_vars.i [2025-02-08 05:27:16,980 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:27:16,983 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG race-4_2-thread_local_vars.i that has 3 procedures, 252 locations, 1 initial locations, 2 loop locations, and 24 error locations. [2025-02-08 05:27:16,983 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:27:17,031 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2025-02-08 05:27:17,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 263 places, 271 transitions, 559 flow [2025-02-08 05:27:17,094 INFO L124 PetriNetUnfolderBase]: 12/227 cut-off events. [2025-02-08 05:27:17,096 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:27:17,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 234 conditions, 227 events. 12/227 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 456 event pairs, 0 based on Foata normal form. 0/190 useless extension candidates. Maximal degree in co-relation 185. Up to 3 conditions per place. [2025-02-08 05:27:17,099 INFO L82 GeneralOperation]: Start removeDead. Operand has 263 places, 271 transitions, 559 flow [2025-02-08 05:27:17,102 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 184 places, 183 transitions, 372 flow [2025-02-08 05:27:17,107 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:27:17,114 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;@522e7a19, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:27:17,114 INFO L334 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2025-02-08 05:27:17,119 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:27:17,119 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2025-02-08 05:27:17,119 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:27:17,119 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:17,120 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-02-08 05:27:17,120 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-02-08 05:27:17,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:17,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1744404267, now seen corresponding path program 1 times [2025-02-08 05:27:17,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:17,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869453664] [2025-02-08 05:27:17,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:17,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:17,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 05:27:17,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 05:27:17,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:17,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:17,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:17,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:17,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869453664] [2025-02-08 05:27:17,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869453664] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:17,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:17,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:17,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840060617] [2025-02-08 05:27:17,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:17,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:17,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:17,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:17,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:17,476 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 273 [2025-02-08 05:27:17,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 183 transitions, 372 flow. Second operand has 3 states, 3 states have (on average 233.33333333333334) internal successors, (700), 3 states have internal predecessors, (700), 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-02-08 05:27:17,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:17,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 273 [2025-02-08 05:27:17,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:17,511 INFO L124 PetriNetUnfolderBase]: 2/166 cut-off events. [2025-02-08 05:27:17,511 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:27:17,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 166 events. 2/166 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 227 event pairs, 0 based on Foata normal form. 5/155 useless extension candidates. Maximal degree in co-relation 150. Up to 13 conditions per place. [2025-02-08 05:27:17,513 INFO L140 encePairwiseOnDemand]: 265/273 looper letters, 12 selfloop transitions, 2 changer transitions 6/166 dead transitions. [2025-02-08 05:27:17,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 166 transitions, 366 flow [2025-02-08 05:27:17,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:17,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:17,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 716 transitions. [2025-02-08 05:27:17,522 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8742368742368742 [2025-02-08 05:27:17,524 INFO L175 Difference]: Start difference. First operand has 184 places, 183 transitions, 372 flow. Second operand 3 states and 716 transitions. [2025-02-08 05:27:17,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 166 transitions, 366 flow [2025-02-08 05:27:17,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 166 transitions, 364 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:27:17,530 INFO L231 Difference]: Finished difference. Result has 171 places, 160 transitions, 328 flow [2025-02-08 05:27:17,531 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=328, PETRI_PLACES=171, PETRI_TRANSITIONS=160} [2025-02-08 05:27:17,534 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -13 predicate places. [2025-02-08 05:27:17,534 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 160 transitions, 328 flow [2025-02-08 05:27:17,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 233.33333333333334) internal successors, (700), 3 states have internal predecessors, (700), 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-02-08 05:27:17,534 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:17,534 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-02-08 05:27:17,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:27:17,535 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-02-08 05:27:17,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:17,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1556288302, now seen corresponding path program 1 times [2025-02-08 05:27:17,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:17,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716971981] [2025-02-08 05:27:17,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:17,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:17,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 05:27:17,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 05:27:17,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:17,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:17,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:17,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:17,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716971981] [2025-02-08 05:27:17,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716971981] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:17,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:17,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:17,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112323853] [2025-02-08 05:27:17,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:17,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:17,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:17,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:17,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:17,641 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 273 [2025-02-08 05:27:17,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 160 transitions, 328 flow. Second operand has 3 states, 3 states have (on average 229.0) internal successors, (687), 3 states have internal predecessors, (687), 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-02-08 05:27:17,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:17,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 273 [2025-02-08 05:27:17,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:17,660 INFO L124 PetriNetUnfolderBase]: 2/157 cut-off events. [2025-02-08 05:27:17,660 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:27:17,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177 conditions, 157 events. 2/157 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 201 event pairs, 0 based on Foata normal form. 1/146 useless extension candidates. Maximal degree in co-relation 144. Up to 8 conditions per place. [2025-02-08 05:27:17,661 INFO L140 encePairwiseOnDemand]: 265/273 looper letters, 6 selfloop transitions, 4 changer transitions 3/157 dead transitions. [2025-02-08 05:27:17,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 157 transitions, 344 flow [2025-02-08 05:27:17,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:17,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:17,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 698 transitions. [2025-02-08 05:27:17,663 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8522588522588522 [2025-02-08 05:27:17,663 INFO L175 Difference]: Start difference. First operand has 171 places, 160 transitions, 328 flow. Second operand 3 states and 698 transitions. [2025-02-08 05:27:17,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 157 transitions, 344 flow [2025-02-08 05:27:17,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 157 transitions, 340 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:27:17,666 INFO L231 Difference]: Finished difference. Result has 162 places, 154 transitions, 320 flow [2025-02-08 05:27:17,666 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=320, PETRI_PLACES=162, PETRI_TRANSITIONS=154} [2025-02-08 05:27:17,666 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -22 predicate places. [2025-02-08 05:27:17,667 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 154 transitions, 320 flow [2025-02-08 05:27:17,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 229.0) internal successors, (687), 3 states have internal predecessors, (687), 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-02-08 05:27:17,667 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:17,667 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-02-08 05:27:17,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:27:17,667 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-02-08 05:27:17,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:17,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1114092871, now seen corresponding path program 1 times [2025-02-08 05:27:17,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:17,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555057] [2025-02-08 05:27:17,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:17,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:17,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-08 05:27:17,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-08 05:27:17,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:17,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:17,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:17,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:17,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555057] [2025-02-08 05:27:17,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555057] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:17,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:17,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:17,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310276883] [2025-02-08 05:27:17,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:17,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:17,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:17,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:17,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:17,776 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 273 [2025-02-08 05:27:17,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 154 transitions, 320 flow. Second operand has 3 states, 3 states have (on average 234.0) internal successors, (702), 3 states have internal predecessors, (702), 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-02-08 05:27:17,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:17,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 273 [2025-02-08 05:27:17,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:17,820 INFO L124 PetriNetUnfolderBase]: 2/153 cut-off events. [2025-02-08 05:27:17,820 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:27:17,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177 conditions, 153 events. 2/153 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 195 event pairs, 0 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 110. Up to 12 conditions per place. [2025-02-08 05:27:17,821 INFO L140 encePairwiseOnDemand]: 270/273 looper letters, 11 selfloop transitions, 2 changer transitions 0/153 dead transitions. [2025-02-08 05:27:17,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 153 transitions, 344 flow [2025-02-08 05:27:17,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:17,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:17,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 710 transitions. [2025-02-08 05:27:17,823 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8669108669108669 [2025-02-08 05:27:17,823 INFO L175 Difference]: Start difference. First operand has 162 places, 154 transitions, 320 flow. Second operand 3 states and 710 transitions. [2025-02-08 05:27:17,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 153 transitions, 344 flow [2025-02-08 05:27:17,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 153 transitions, 336 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:27:17,825 INFO L231 Difference]: Finished difference. Result has 158 places, 153 transitions, 314 flow [2025-02-08 05:27:17,826 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=314, PETRI_PLACES=158, PETRI_TRANSITIONS=153} [2025-02-08 05:27:17,826 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -26 predicate places. [2025-02-08 05:27:17,826 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 153 transitions, 314 flow [2025-02-08 05:27:17,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.0) internal successors, (702), 3 states have internal predecessors, (702), 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-02-08 05:27:17,827 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:17,827 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-02-08 05:27:17,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:27:17,827 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-02-08 05:27:17,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:17,828 INFO L85 PathProgramCache]: Analyzing trace with hash 202607613, now seen corresponding path program 1 times [2025-02-08 05:27:17,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:17,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622290372] [2025-02-08 05:27:17,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:17,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:17,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-08 05:27:17,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-08 05:27:17,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:17,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:17,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:17,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:17,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622290372] [2025-02-08 05:27:17,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622290372] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:17,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:17,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:17,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492837101] [2025-02-08 05:27:17,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:17,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:17,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:17,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:17,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:17,898 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 273 [2025-02-08 05:27:17,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 153 transitions, 314 flow. Second operand has 3 states, 3 states have (on average 241.33333333333334) internal successors, (724), 3 states have internal predecessors, (724), 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-02-08 05:27:17,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:17,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 273 [2025-02-08 05:27:17,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:17,918 INFO L124 PetriNetUnfolderBase]: 4/160 cut-off events. [2025-02-08 05:27:17,918 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:27:17,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 160 events. 4/160 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 221 event pairs, 0 based on Foata normal form. 0/151 useless extension candidates. Maximal degree in co-relation 157. Up to 10 conditions per place. [2025-02-08 05:27:17,919 INFO L140 encePairwiseOnDemand]: 270/273 looper letters, 10 selfloop transitions, 2 changer transitions 0/154 dead transitions. [2025-02-08 05:27:17,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 154 transitions, 342 flow [2025-02-08 05:27:17,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:17,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:17,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 733 transitions. [2025-02-08 05:27:17,922 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.894993894993895 [2025-02-08 05:27:17,922 INFO L175 Difference]: Start difference. First operand has 158 places, 153 transitions, 314 flow. Second operand 3 states and 733 transitions. [2025-02-08 05:27:17,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 154 transitions, 342 flow [2025-02-08 05:27:17,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 154 transitions, 338 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:27:17,924 INFO L231 Difference]: Finished difference. Result has 157 places, 152 transitions, 312 flow [2025-02-08 05:27:17,925 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=312, PETRI_PLACES=157, PETRI_TRANSITIONS=152} [2025-02-08 05:27:17,926 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -27 predicate places. [2025-02-08 05:27:17,926 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 152 transitions, 312 flow [2025-02-08 05:27:17,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 241.33333333333334) internal successors, (724), 3 states have internal predecessors, (724), 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-02-08 05:27:17,926 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:17,926 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-02-08 05:27:17,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:27:17,927 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread_usbErr13ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-02-08 05:27:17,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:17,927 INFO L85 PathProgramCache]: Analyzing trace with hash -826248100, now seen corresponding path program 1 times [2025-02-08 05:27:17,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:17,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197037228] [2025-02-08 05:27:17,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:17,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:17,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-08 05:27:17,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-08 05:27:17,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:17,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:17,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:17,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:17,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197037228] [2025-02-08 05:27:17,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197037228] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:17,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:17,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:17,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545004159] [2025-02-08 05:27:17,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:17,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:17,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:17,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:17,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:18,002 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 273 [2025-02-08 05:27:18,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 152 transitions, 312 flow. Second operand has 3 states, 3 states have (on average 241.33333333333334) internal successors, (724), 3 states have internal predecessors, (724), 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-02-08 05:27:18,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:18,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 273 [2025-02-08 05:27:18,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:18,026 INFO L124 PetriNetUnfolderBase]: 2/151 cut-off events. [2025-02-08 05:27:18,026 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:27:18,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 151 events. 2/151 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 186 event pairs, 0 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 93. Up to 9 conditions per place. [2025-02-08 05:27:18,027 INFO L140 encePairwiseOnDemand]: 270/273 looper letters, 8 selfloop transitions, 2 changer transitions 0/151 dead transitions. [2025-02-08 05:27:18,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 151 transitions, 330 flow [2025-02-08 05:27:18,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:18,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:18,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 731 transitions. [2025-02-08 05:27:18,029 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8925518925518926 [2025-02-08 05:27:18,030 INFO L175 Difference]: Start difference. First operand has 157 places, 152 transitions, 312 flow. Second operand 3 states and 731 transitions. [2025-02-08 05:27:18,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 151 transitions, 330 flow [2025-02-08 05:27:18,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 151 transitions, 326 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:27:18,032 INFO L231 Difference]: Finished difference. Result has 156 places, 151 transitions, 310 flow [2025-02-08 05:27:18,032 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=310, PETRI_PLACES=156, PETRI_TRANSITIONS=151} [2025-02-08 05:27:18,033 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -28 predicate places. [2025-02-08 05:27:18,033 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 151 transitions, 310 flow [2025-02-08 05:27:18,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 241.33333333333334) internal successors, (724), 3 states have internal predecessors, (724), 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-02-08 05:27:18,035 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:18,035 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:18,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:27:18,035 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread_usbErr12ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-02-08 05:27:18,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:18,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1124364293, now seen corresponding path program 1 times [2025-02-08 05:27:18,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:18,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734532771] [2025-02-08 05:27:18,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:18,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:18,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-08 05:27:18,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-08 05:27:18,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:18,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:18,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:18,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:18,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734532771] [2025-02-08 05:27:18,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734532771] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:18,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:18,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:18,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018800326] [2025-02-08 05:27:18,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:18,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:18,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:18,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:18,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:18,130 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 273 [2025-02-08 05:27:18,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 151 transitions, 310 flow. Second operand has 3 states, 3 states have (on average 239.33333333333334) internal successors, (718), 3 states have internal predecessors, (718), 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-02-08 05:27:18,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:18,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 273 [2025-02-08 05:27:18,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:18,151 INFO L124 PetriNetUnfolderBase]: 2/148 cut-off events. [2025-02-08 05:27:18,151 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:27:18,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 148 events. 2/148 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 165 event pairs, 0 based on Foata normal form. 1/143 useless extension candidates. Maximal degree in co-relation 89. Up to 7 conditions per place. [2025-02-08 05:27:18,152 INFO L140 encePairwiseOnDemand]: 267/273 looper letters, 6 selfloop transitions, 2 changer transitions 2/148 dead transitions. [2025-02-08 05:27:18,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 148 transitions, 322 flow [2025-02-08 05:27:18,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:18,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:18,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 726 transitions. [2025-02-08 05:27:18,154 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8864468864468864 [2025-02-08 05:27:18,154 INFO L175 Difference]: Start difference. First operand has 156 places, 151 transitions, 310 flow. Second operand 3 states and 726 transitions. [2025-02-08 05:27:18,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 148 transitions, 322 flow [2025-02-08 05:27:18,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 148 transitions, 318 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:27:18,157 INFO L231 Difference]: Finished difference. Result has 153 places, 146 transitions, 300 flow [2025-02-08 05:27:18,157 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=300, PETRI_PLACES=153, PETRI_TRANSITIONS=146} [2025-02-08 05:27:18,158 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -31 predicate places. [2025-02-08 05:27:18,158 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 146 transitions, 300 flow [2025-02-08 05:27:18,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 239.33333333333334) internal successors, (718), 3 states have internal predecessors, (718), 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-02-08 05:27:18,158 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:18,158 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] [2025-02-08 05:27:18,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:27:18,159 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-02-08 05:27:18,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:18,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1673293567, now seen corresponding path program 1 times [2025-02-08 05:27:18,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:18,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224127168] [2025-02-08 05:27:18,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:18,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:18,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-08 05:27:18,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-08 05:27:18,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:18,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:18,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:18,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:18,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224127168] [2025-02-08 05:27:18,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224127168] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:18,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:18,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 05:27:18,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565862364] [2025-02-08 05:27:18,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:18,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 05:27:18,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:18,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 05:27:18,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 05:27:18,293 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 239 out of 273 [2025-02-08 05:27:18,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 146 transitions, 300 flow. Second operand has 4 states, 4 states have (on average 240.5) internal successors, (962), 4 states have internal predecessors, (962), 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-02-08 05:27:18,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:18,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 239 of 273 [2025-02-08 05:27:18,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:18,322 INFO L124 PetriNetUnfolderBase]: 4/144 cut-off events. [2025-02-08 05:27:18,322 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:27:18,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 144 events. 4/144 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 143 event pairs, 2 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 98. Up to 11 conditions per place. [2025-02-08 05:27:18,323 INFO L140 encePairwiseOnDemand]: 270/273 looper letters, 6 selfloop transitions, 0 changer transitions 19/140 dead transitions. [2025-02-08 05:27:18,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 140 transitions, 304 flow [2025-02-08 05:27:18,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 05:27:18,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 05:27:18,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 965 transitions. [2025-02-08 05:27:18,325 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8836996336996337 [2025-02-08 05:27:18,325 INFO L175 Difference]: Start difference. First operand has 153 places, 146 transitions, 300 flow. Second operand 4 states and 965 transitions. [2025-02-08 05:27:18,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 140 transitions, 304 flow [2025-02-08 05:27:18,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 140 transitions, 302 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:27:18,327 INFO L231 Difference]: Finished difference. Result has 147 places, 121 transitions, 248 flow [2025-02-08 05:27:18,327 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=248, PETRI_PLACES=147, PETRI_TRANSITIONS=121} [2025-02-08 05:27:18,328 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -37 predicate places. [2025-02-08 05:27:18,328 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 121 transitions, 248 flow [2025-02-08 05:27:18,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 240.5) internal successors, (962), 4 states have internal predecessors, (962), 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-02-08 05:27:18,329 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:18,329 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-02-08 05:27:18,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:27:18,329 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread_usbErr6ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-02-08 05:27:18,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:18,330 INFO L85 PathProgramCache]: Analyzing trace with hash -699426809, now seen corresponding path program 1 times [2025-02-08 05:27:18,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:18,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926651772] [2025-02-08 05:27:18,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:18,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:18,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-08 05:27:18,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-08 05:27:18,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:18,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:18,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:18,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:18,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926651772] [2025-02-08 05:27:18,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926651772] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:18,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:18,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:27:18,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357345592] [2025-02-08 05:27:18,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:18,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:18,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:18,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:18,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:18,438 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 273 [2025-02-08 05:27:18,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 121 transitions, 248 flow. Second operand has 3 states, 3 states have (on average 242.33333333333334) internal successors, (727), 3 states have internal predecessors, (727), 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-02-08 05:27:18,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:18,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 273 [2025-02-08 05:27:18,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:18,452 INFO L124 PetriNetUnfolderBase]: 2/116 cut-off events. [2025-02-08 05:27:18,452 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:27:18,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 58 event pairs, 0 based on Foata normal form. 1/113 useless extension candidates. Maximal degree in co-relation 128. Up to 6 conditions per place. [2025-02-08 05:27:18,453 INFO L140 encePairwiseOnDemand]: 271/273 looper letters, 5 selfloop transitions, 1 changer transitions 3/116 dead transitions. [2025-02-08 05:27:18,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 116 transitions, 250 flow [2025-02-08 05:27:18,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:18,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:18,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 730 transitions. [2025-02-08 05:27:18,455 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8913308913308914 [2025-02-08 05:27:18,455 INFO L175 Difference]: Start difference. First operand has 147 places, 121 transitions, 248 flow. Second operand 3 states and 730 transitions. [2025-02-08 05:27:18,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 116 transitions, 250 flow [2025-02-08 05:27:18,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 116 transitions, 250 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:27:18,457 INFO L231 Difference]: Finished difference. Result has 123 places, 113 transitions, 233 flow [2025-02-08 05:27:18,457 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=233, PETRI_PLACES=123, PETRI_TRANSITIONS=113} [2025-02-08 05:27:18,457 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -61 predicate places. [2025-02-08 05:27:18,457 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 113 transitions, 233 flow [2025-02-08 05:27:18,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 242.33333333333334) internal successors, (727), 3 states have internal predecessors, (727), 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-02-08 05:27:18,458 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:18,458 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-02-08 05:27:18,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:27:18,458 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread_usbErr11ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-02-08 05:27:18,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:18,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1365623400, now seen corresponding path program 1 times [2025-02-08 05:27:18,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:18,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227580200] [2025-02-08 05:27:18,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:18,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:18,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-08 05:27:18,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-08 05:27:18,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:18,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:18,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:18,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:18,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227580200] [2025-02-08 05:27:18,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227580200] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:18,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:18,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:18,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397625726] [2025-02-08 05:27:18,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:18,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:18,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:18,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:18,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:18,528 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 273 [2025-02-08 05:27:18,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 113 transitions, 233 flow. Second operand has 3 states, 3 states have (on average 242.66666666666666) internal successors, (728), 3 states have internal predecessors, (728), 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-02-08 05:27:18,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:18,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 273 [2025-02-08 05:27:18,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:18,546 INFO L124 PetriNetUnfolderBase]: 3/116 cut-off events. [2025-02-08 05:27:18,546 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:27:18,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 116 events. 3/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 62 event pairs, 0 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 132. Up to 7 conditions per place. [2025-02-08 05:27:18,547 INFO L140 encePairwiseOnDemand]: 270/273 looper letters, 7 selfloop transitions, 2 changer transitions 0/113 dead transitions. [2025-02-08 05:27:18,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 113 transitions, 251 flow [2025-02-08 05:27:18,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:18,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:18,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 733 transitions. [2025-02-08 05:27:18,549 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.894993894993895 [2025-02-08 05:27:18,549 INFO L175 Difference]: Start difference. First operand has 123 places, 113 transitions, 233 flow. Second operand 3 states and 733 transitions. [2025-02-08 05:27:18,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 113 transitions, 251 flow [2025-02-08 05:27:18,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 113 transitions, 250 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:27:18,551 INFO L231 Difference]: Finished difference. Result has 120 places, 112 transitions, 234 flow [2025-02-08 05:27:18,551 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=234, PETRI_PLACES=120, PETRI_TRANSITIONS=112} [2025-02-08 05:27:18,551 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -64 predicate places. [2025-02-08 05:27:18,551 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 112 transitions, 234 flow [2025-02-08 05:27:18,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 242.66666666666666) internal successors, (728), 3 states have internal predecessors, (728), 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-02-08 05:27:18,552 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:18,552 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-02-08 05:27:18,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:27:18,552 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-02-08 05:27:18,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:18,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1189640298, now seen corresponding path program 1 times [2025-02-08 05:27:18,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:18,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98344853] [2025-02-08 05:27:18,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:18,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:18,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-08 05:27:18,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-08 05:27:18,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:18,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:18,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:18,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:18,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98344853] [2025-02-08 05:27:18,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98344853] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:18,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:18,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:18,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644104437] [2025-02-08 05:27:18,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:18,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:18,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:18,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:18,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:18,652 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 273 [2025-02-08 05:27:18,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 112 transitions, 234 flow. Second operand has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 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-02-08 05:27:18,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:18,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 273 [2025-02-08 05:27:18,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:18,667 INFO L124 PetriNetUnfolderBase]: 2/111 cut-off events. [2025-02-08 05:27:18,667 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:27:18,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 45 event pairs, 0 based on Foata normal form. 1/110 useless extension candidates. Maximal degree in co-relation 127. Up to 8 conditions per place. [2025-02-08 05:27:18,667 INFO L140 encePairwiseOnDemand]: 271/273 looper letters, 0 selfloop transitions, 0 changer transitions 111/111 dead transitions. [2025-02-08 05:27:18,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 111 transitions, 248 flow [2025-02-08 05:27:18,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:18,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:18,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 708 transitions. [2025-02-08 05:27:18,669 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8644688644688645 [2025-02-08 05:27:18,669 INFO L175 Difference]: Start difference. First operand has 120 places, 112 transitions, 234 flow. Second operand 3 states and 708 transitions. [2025-02-08 05:27:18,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 111 transitions, 248 flow [2025-02-08 05:27:18,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 111 transitions, 244 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:27:18,670 INFO L231 Difference]: Finished difference. Result has 119 places, 0 transitions, 0 flow [2025-02-08 05:27:18,670 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=119, PETRI_TRANSITIONS=0} [2025-02-08 05:27:18,671 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -65 predicate places. [2025-02-08 05:27:18,671 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 0 transitions, 0 flow [2025-02-08 05:27:18,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 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-02-08 05:27:18,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE (30 of 31 remaining) [2025-02-08 05:27:18,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE (29 of 31 remaining) [2025-02-08 05:27:18,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (28 of 31 remaining) [2025-02-08 05:27:18,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (27 of 31 remaining) [2025-02-08 05:27:18,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (26 of 31 remaining) [2025-02-08 05:27:18,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (25 of 31 remaining) [2025-02-08 05:27:18,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (24 of 31 remaining) [2025-02-08 05:27:18,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (23 of 31 remaining) [2025-02-08 05:27:18,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (22 of 31 remaining) [2025-02-08 05:27:18,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (21 of 31 remaining) [2025-02-08 05:27:18,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 31 remaining) [2025-02-08 05:27:18,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr13ASSERT_VIOLATIONDATA_RACE (19 of 31 remaining) [2025-02-08 05:27:18,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr1ASSERT_VIOLATIONDATA_RACE (18 of 31 remaining) [2025-02-08 05:27:18,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr12ASSERT_VIOLATIONDATA_RACE (17 of 31 remaining) [2025-02-08 05:27:18,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr0ASSERT_VIOLATIONDATA_RACE (16 of 31 remaining) [2025-02-08 05:27:18,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr7ASSERT_VIOLATIONDATA_RACE (15 of 31 remaining) [2025-02-08 05:27:18,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr2ASSERT_VIOLATIONDATA_RACE (14 of 31 remaining) [2025-02-08 05:27:18,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr6ASSERT_VIOLATIONDATA_RACE (13 of 31 remaining) [2025-02-08 05:27:18,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr11ASSERT_VIOLATIONDATA_RACE (12 of 31 remaining) [2025-02-08 05:27:18,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 31 remaining) [2025-02-08 05:27:18,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE (10 of 31 remaining) [2025-02-08 05:27:18,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE (9 of 31 remaining) [2025-02-08 05:27:18,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr13ASSERT_VIOLATIONDATA_RACE (8 of 31 remaining) [2025-02-08 05:27:18,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr1ASSERT_VIOLATIONDATA_RACE (7 of 31 remaining) [2025-02-08 05:27:18,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr12ASSERT_VIOLATIONDATA_RACE (6 of 31 remaining) [2025-02-08 05:27:18,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr0ASSERT_VIOLATIONDATA_RACE (5 of 31 remaining) [2025-02-08 05:27:18,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr7ASSERT_VIOLATIONDATA_RACE (4 of 31 remaining) [2025-02-08 05:27:18,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr2ASSERT_VIOLATIONDATA_RACE (3 of 31 remaining) [2025-02-08 05:27:18,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr6ASSERT_VIOLATIONDATA_RACE (2 of 31 remaining) [2025-02-08 05:27:18,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr11ASSERT_VIOLATIONDATA_RACE (1 of 31 remaining) [2025-02-08 05:27:18,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbThread1of1ForFork1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 31 remaining) [2025-02-08 05:27:18,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:27:18,677 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:18,681 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:27:18,681 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:27:18,685 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:27:18 BasicIcfg [2025-02-08 05:27:18,686 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:27:18,686 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:27:18,686 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:27:18,687 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:27:18,687 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:27:16" (3/4) ... [2025-02-08 05:27:18,689 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:27:18,691 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread_ath9k [2025-02-08 05:27:18,691 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread_usb [2025-02-08 05:27:18,694 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-02-08 05:27:18,694 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 05:27:18,695 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 05:27:18,695 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 05:27:18,751 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:27:18,752 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:27:18,752 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:27:18,753 INFO L158 Benchmark]: Toolchain (without parser) took 3123.24ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 105.6MB in the beginning and 164.7MB in the end (delta: -59.1MB). Peak memory consumption was 227.5MB. Max. memory is 16.1GB. [2025-02-08 05:27:18,753 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 226.5MB. Free memory is still 146.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:27:18,753 INFO L158 Benchmark]: CACSL2BoogieTranslator took 655.02ms. Allocated memory is still 142.6MB. Free memory was 105.6MB in the beginning and 49.2MB in the end (delta: 56.3MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-02-08 05:27:18,753 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.31ms. Allocated memory is still 142.6MB. Free memory was 49.2MB in the beginning and 45.8MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:27:18,753 INFO L158 Benchmark]: Boogie Preprocessor took 35.72ms. Allocated memory is still 142.6MB. Free memory was 45.8MB in the beginning and 43.8MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:27:18,754 INFO L158 Benchmark]: IcfgBuilder took 588.52ms. Allocated memory is still 142.6MB. Free memory was 43.8MB in the beginning and 79.7MB in the end (delta: -35.8MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. [2025-02-08 05:27:18,754 INFO L158 Benchmark]: TraceAbstraction took 1719.46ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 79.0MB in the beginning and 171.9MB in the end (delta: -92.9MB). Peak memory consumption was 187.0MB. Max. memory is 16.1GB. [2025-02-08 05:27:18,754 INFO L158 Benchmark]: Witness Printer took 65.72ms. Allocated memory is still 427.8MB. Free memory was 171.9MB in the beginning and 164.7MB in the end (delta: 7.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:27:18,755 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.20ms. Allocated memory is still 226.5MB. Free memory is still 146.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 655.02ms. Allocated memory is still 142.6MB. Free memory was 105.6MB in the beginning and 49.2MB in the end (delta: 56.3MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.31ms. Allocated memory is still 142.6MB. Free memory was 49.2MB in the beginning and 45.8MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.72ms. Allocated memory is still 142.6MB. Free memory was 45.8MB in the beginning and 43.8MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 588.52ms. Allocated memory is still 142.6MB. Free memory was 43.8MB in the beginning and 79.7MB in the end (delta: -35.8MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1719.46ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 79.0MB in the beginning and 171.9MB in the end (delta: -92.9MB). Peak memory consumption was 187.0MB. Max. memory is 16.1GB. * Witness Printer took 65.72ms. Allocated memory is still 427.8MB. Free memory was 171.9MB in the beginning and 164.7MB in the end (delta: 7.2MB). 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: 1779]: 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: 1785]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1782]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1786]: 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: 1794]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1795]: 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: 1773]: 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: 1774]: 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: 1766]: 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 - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 383 locations, 31 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: 1.6s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 338 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 118 mSDsluCounter, 38 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 315 IncrementalHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 28 mSDtfsCounter, 315 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=372occurred in iteration=0, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 544 NumberOfCodeBlocks, 544 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 534 ConstructedInterpolants, 0 QuantifiedInterpolants, 594 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 24 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 05:27:18,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE