./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 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3546e85a-41e1-471c-9a00-b89d17121a93/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3546e85a-41e1-471c-9a00-b89d17121a93/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3546e85a-41e1-471c-9a00-b89d17121a93/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3546e85a-41e1-471c-9a00-b89d17121a93/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-races/race-4_2-thread_local_vars.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3546e85a-41e1-471c-9a00-b89d17121a93/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3546e85a-41e1-471c-9a00-b89d17121a93/bin/uautomizer-verify-qhAvR1uOyd --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-dev-826ab2b [2024-11-13 16:24:09,638 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 16:24:09,758 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3546e85a-41e1-471c-9a00-b89d17121a93/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-13 16:24:09,768 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 16:24:09,769 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 16:24:09,807 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 16:24:09,811 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 16:24:09,811 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 16:24:09,812 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 16:24:09,812 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 16:24:09,812 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 16:24:09,812 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 16:24:09,813 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 16:24:09,813 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 16:24:09,813 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 16:24:09,813 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 16:24:09,813 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 16:24:09,813 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 16:24:09,816 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 16:24:09,816 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 16:24:09,816 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 16:24:09,816 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 16:24:09,817 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-13 16:24:09,817 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 16:24:09,817 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 16:24:09,817 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 16:24:09,817 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 16:24:09,817 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 16:24:09,818 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 16:24:09,818 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 16:24:09,818 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 16:24:09,818 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 16:24:09,819 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 16:24:09,819 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 16:24:09,819 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 16:24:09,820 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 16:24:09,820 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 16:24:09,820 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 16:24:09,820 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 16:24:09,820 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 16:24:09,821 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 16:24:09,821 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3546e85a-41e1-471c-9a00-b89d17121a93/bin/uautomizer-verify-qhAvR1uOyd Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0f799b8cb369af433cd7b4f4a2ae1c7efd2306d185f06da0302d2727c00c6bf0 [2024-11-13 16:24:10,225 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 16:24:10,238 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 16:24:10,241 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 16:24:10,243 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 16:24:10,243 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 16:24:10,246 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3546e85a-41e1-471c-9a00-b89d17121a93/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/ldv-races/race-4_2-thread_local_vars.i Unable to find full path for "g++" [2024-11-13 16:24:12,466 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 16:24:12,985 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 16:24:12,985 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3546e85a-41e1-471c-9a00-b89d17121a93/sv-benchmarks/c/ldv-races/race-4_2-thread_local_vars.i [2024-11-13 16:24:13,031 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3546e85a-41e1-471c-9a00-b89d17121a93/bin/uautomizer-verify-qhAvR1uOyd/data/b3f3fbc95/6dddfadc8812409397bf5c2127088a53/FLAGdaae2a495 [2024-11-13 16:24:13,067 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3546e85a-41e1-471c-9a00-b89d17121a93/bin/uautomizer-verify-qhAvR1uOyd/data/b3f3fbc95/6dddfadc8812409397bf5c2127088a53 [2024-11-13 16:24:13,071 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 16:24:13,073 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 16:24:13,076 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 16:24:13,076 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 16:24:13,082 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 16:24:13,083 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:24:13" (1/1) ... [2024-11-13 16:24:13,084 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cdb6673 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:24:13, skipping insertion in model container [2024-11-13 16:24:13,085 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:24:13" (1/1) ... [2024-11-13 16:24:13,158 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 16:24:14,221 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:24:14,248 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 16:24:14,366 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:24:14,565 INFO L204 MainTranslator]: Completed translation [2024-11-13 16:24:14,565 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:24:14 WrapperNode [2024-11-13 16:24:14,566 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 16:24:14,566 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 16:24:14,567 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 16:24:14,567 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 16:24:14,576 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:24:14" (1/1) ... [2024-11-13 16:24:14,602 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:24:14" (1/1) ... [2024-11-13 16:24:14,648 INFO L138 Inliner]: procedures = 488, calls = 41, calls flagged for inlining = 17, calls inlined = 23, statements flattened = 297 [2024-11-13 16:24:14,648 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 16:24:14,649 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 16:24:14,649 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 16:24:14,649 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 16:24:14,658 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:24:14" (1/1) ... [2024-11-13 16:24:14,659 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:24:14" (1/1) ... [2024-11-13 16:24:14,670 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:24:14" (1/1) ... [2024-11-13 16:24:14,671 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:24:14" (1/1) ... [2024-11-13 16:24:14,691 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:24:14" (1/1) ... [2024-11-13 16:24:14,703 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:24:14" (1/1) ... [2024-11-13 16:24:14,710 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:24:14" (1/1) ... [2024-11-13 16:24:14,717 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:24:14" (1/1) ... [2024-11-13 16:24:14,729 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 16:24:14,730 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 16:24:14,730 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 16:24:14,730 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 16:24:14,734 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:24:14" (1/1) ... [2024-11-13 16:24:14,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 16:24:14,780 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3546e85a-41e1-471c-9a00-b89d17121a93/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:24:14,798 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3546e85a-41e1-471c-9a00-b89d17121a93/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 16:24:14,806 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3546e85a-41e1-471c-9a00-b89d17121a93/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 16:24:14,839 INFO L130 BoogieDeclarations]: Found specification of procedure thread_usb [2024-11-13 16:24:14,839 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_usb [2024-11-13 16:24:14,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 16:24:14,839 INFO L130 BoogieDeclarations]: Found specification of procedure thread_ath9k [2024-11-13 16:24:14,840 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_ath9k [2024-11-13 16:24:14,840 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-13 16:24:14,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 16:24:14,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-13 16:24:14,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 16:24:14,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 16:24:14,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-13 16:24:14,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-13 16:24:14,840 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-13 16:24:14,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 16:24:14,842 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-13 16:24:15,341 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 16:24:15,343 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 16:24:16,003 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-13 16:24:16,004 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 16:24:16,053 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 16:24:16,053 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-13 16:24:16,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:24:16 BoogieIcfgContainer [2024-11-13 16:24:16,054 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 16:24:16,061 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 16:24:16,061 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 16:24:16,070 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 16:24:16,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 04:24:13" (1/3) ... [2024-11-13 16:24:16,072 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fdcca35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 04:24:16, skipping insertion in model container [2024-11-13 16:24:16,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:24:14" (2/3) ... [2024-11-13 16:24:16,072 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fdcca35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 04:24:16, skipping insertion in model container [2024-11-13 16:24:16,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:24:16" (3/3) ... [2024-11-13 16:24:16,074 INFO L112 eAbstractionObserver]: Analyzing ICFG race-4_2-thread_local_vars.i [2024-11-13 16:24:16,095 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 16:24:16,098 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG race-4_2-thread_local_vars.i that has 3 procedures, 321 locations, 1 initial locations, 2 loop locations, and 24 error locations. [2024-11-13 16:24:16,100 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-13 16:24:16,339 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2024-11-13 16:24:16,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 475 places, 517 transitions, 1061 flow [2024-11-13 16:24:16,704 INFO L124 PetriNetUnfolderBase]: 45/523 cut-off events. [2024-11-13 16:24:16,707 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-13 16:24:16,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 534 conditions, 523 events. 45/523 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1454 event pairs, 0 based on Foata normal form. 0/436 useless extension candidates. Maximal degree in co-relation 367. Up to 11 conditions per place. [2024-11-13 16:24:16,725 INFO L82 GeneralOperation]: Start removeDead. Operand has 475 places, 517 transitions, 1061 flow [2024-11-13 16:24:16,738 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 326 places, 351 transitions, 718 flow [2024-11-13 16:24:16,756 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 16:24:16,782 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;@5f9664de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 16:24:16,783 INFO L334 AbstractCegarLoop]: Starting to check reachability of 43 error locations. [2024-11-13 16:24:16,795 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-13 16:24:16,795 INFO L124 PetriNetUnfolderBase]: 0/28 cut-off events. [2024-11-13 16:24:16,795 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 16:24:16,796 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:24:16,797 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:24:16,797 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-11-13 16:24:16,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:24:16,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1034058338, now seen corresponding path program 1 times [2024-11-13 16:24:16,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:24:16,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769207182] [2024-11-13 16:24:16,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:24:16,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:24:17,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:24:17,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:24:17,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:24:17,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769207182] [2024-11-13 16:24:17,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769207182] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:24:17,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:24:17,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:24:17,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408629388] [2024-11-13 16:24:17,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:24:17,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:24:17,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:24:17,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:24:17,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:24:17,605 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 445 out of 517 [2024-11-13 16:24:17,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 351 transitions, 718 flow. Second operand has 3 states, 3 states have (on average 446.3333333333333) internal successors, (1339), 3 states have internal predecessors, (1339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:24:17,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:24:17,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 445 of 517 [2024-11-13 16:24:17,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:24:18,071 INFO L124 PetriNetUnfolderBase]: 122/1237 cut-off events. [2024-11-13 16:24:18,072 INFO L125 PetriNetUnfolderBase]: For 33/40 co-relation queries the response was YES. [2024-11-13 16:24:18,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1447 conditions, 1237 events. 122/1237 cut-off events. For 33/40 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 7248 event pairs, 76 based on Foata normal form. 115/1171 useless extension candidates. Maximal degree in co-relation 1117. Up to 185 conditions per place. [2024-11-13 16:24:18,098 INFO L140 encePairwiseOnDemand]: 496/517 looper letters, 24 selfloop transitions, 2 changer transitions 6/318 dead transitions. [2024-11-13 16:24:18,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 318 transitions, 704 flow [2024-11-13 16:24:18,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:24:18,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 16:24:18,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1380 transitions. [2024-11-13 16:24:18,127 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8897485493230174 [2024-11-13 16:24:18,130 INFO L175 Difference]: Start difference. First operand has 326 places, 351 transitions, 718 flow. Second operand 3 states and 1380 transitions. [2024-11-13 16:24:18,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 318 transitions, 704 flow [2024-11-13 16:24:18,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 318 transitions, 700 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 16:24:18,158 INFO L231 Difference]: Finished difference. Result has 311 places, 312 transitions, 640 flow [2024-11-13 16:24:18,164 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=517, PETRI_DIFFERENCE_MINUEND_FLOW=648, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=640, PETRI_PLACES=311, PETRI_TRANSITIONS=312} [2024-11-13 16:24:18,169 INFO L277 CegarLoopForPetriNet]: 326 programPoint places, -15 predicate places. [2024-11-13 16:24:18,169 INFO L471 AbstractCegarLoop]: Abstraction has has 311 places, 312 transitions, 640 flow [2024-11-13 16:24:18,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 446.3333333333333) internal successors, (1339), 3 states have internal predecessors, (1339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:24:18,172 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:24:18,173 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:24:18,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 16:24:18,175 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-11-13 16:24:18,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:24:18,175 INFO L85 PathProgramCache]: Analyzing trace with hash 2127100355, now seen corresponding path program 1 times [2024-11-13 16:24:18,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:24:18,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942355883] [2024-11-13 16:24:18,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:24:18,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:24:18,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:24:18,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:24:18,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:24:18,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942355883] [2024-11-13 16:24:18,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942355883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:24:18,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:24:18,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:24:18,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233744623] [2024-11-13 16:24:18,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:24:18,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:24:18,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:24:18,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:24:18,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:24:18,584 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 431 out of 517 [2024-11-13 16:24:18,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 312 transitions, 640 flow. Second operand has 3 states, 3 states have (on average 432.0) internal successors, (1296), 3 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:24:18,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:24:18,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 431 of 517 [2024-11-13 16:24:18,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:24:19,117 INFO L124 PetriNetUnfolderBase]: 161/1713 cut-off events. [2024-11-13 16:24:19,119 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2024-11-13 16:24:19,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1953 conditions, 1713 events. 161/1713 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 11710 event pairs, 29 based on Foata normal form. 0/1471 useless extension candidates. Maximal degree in co-relation 1916. Up to 156 conditions per place. [2024-11-13 16:24:19,142 INFO L140 encePairwiseOnDemand]: 493/517 looper letters, 30 selfloop transitions, 17 changer transitions 0/324 dead transitions. [2024-11-13 16:24:19,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 324 transitions, 759 flow [2024-11-13 16:24:19,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:24:19,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 16:24:19,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1347 transitions. [2024-11-13 16:24:19,147 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8684719535783365 [2024-11-13 16:24:19,151 INFO L175 Difference]: Start difference. First operand has 311 places, 312 transitions, 640 flow. Second operand 3 states and 1347 transitions. [2024-11-13 16:24:19,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 324 transitions, 759 flow [2024-11-13 16:24:19,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 324 transitions, 755 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 16:24:19,163 INFO L231 Difference]: Finished difference. Result has 304 places, 321 transitions, 754 flow [2024-11-13 16:24:19,165 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=517, PETRI_DIFFERENCE_MINUEND_FLOW=630, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=754, PETRI_PLACES=304, PETRI_TRANSITIONS=321} [2024-11-13 16:24:19,166 INFO L277 CegarLoopForPetriNet]: 326 programPoint places, -22 predicate places. [2024-11-13 16:24:19,167 INFO L471 AbstractCegarLoop]: Abstraction has has 304 places, 321 transitions, 754 flow [2024-11-13 16:24:19,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 432.0) internal successors, (1296), 3 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:24:19,168 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:24:19,169 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:24:19,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 16:24:19,169 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-11-13 16:24:19,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:24:19,170 INFO L85 PathProgramCache]: Analyzing trace with hash -434158553, now seen corresponding path program 1 times [2024-11-13 16:24:19,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:24:19,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972484103] [2024-11-13 16:24:19,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:24:19,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:24:19,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:24:19,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:24:19,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:24:19,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972484103] [2024-11-13 16:24:19,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972484103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:24:19,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:24:19,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:24:19,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065477164] [2024-11-13 16:24:19,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:24:19,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:24:19,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:24:19,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:24:19,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:24:19,654 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 445 out of 517 [2024-11-13 16:24:19,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 321 transitions, 754 flow. Second operand has 3 states, 3 states have (on average 447.0) internal successors, (1341), 3 states have internal predecessors, (1341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:24:19,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:24:19,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 445 of 517 [2024-11-13 16:24:19,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:24:20,222 INFO L124 PetriNetUnfolderBase]: 274/2600 cut-off events. [2024-11-13 16:24:20,223 INFO L125 PetriNetUnfolderBase]: For 474/537 co-relation queries the response was YES. [2024-11-13 16:24:20,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3361 conditions, 2600 events. 274/2600 cut-off events. For 474/537 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 20982 event pairs, 99 based on Foata normal form. 0/2235 useless extension candidates. Maximal degree in co-relation 2866. Up to 333 conditions per place. [2024-11-13 16:24:20,247 INFO L140 encePairwiseOnDemand]: 514/517 looper letters, 32 selfloop transitions, 2 changer transitions 0/320 dead transitions. [2024-11-13 16:24:20,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 320 transitions, 820 flow [2024-11-13 16:24:20,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:24:20,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 16:24:20,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1362 transitions. [2024-11-13 16:24:20,252 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8781431334622823 [2024-11-13 16:24:20,252 INFO L175 Difference]: Start difference. First operand has 304 places, 321 transitions, 754 flow. Second operand 3 states and 1362 transitions. [2024-11-13 16:24:20,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 320 transitions, 820 flow [2024-11-13 16:24:20,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 320 transitions, 786 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 16:24:20,262 INFO L231 Difference]: Finished difference. Result has 303 places, 320 transitions, 722 flow [2024-11-13 16:24:20,263 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=517, PETRI_DIFFERENCE_MINUEND_FLOW=718, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=722, PETRI_PLACES=303, PETRI_TRANSITIONS=320} [2024-11-13 16:24:20,264 INFO L277 CegarLoopForPetriNet]: 326 programPoint places, -23 predicate places. [2024-11-13 16:24:20,264 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 320 transitions, 722 flow [2024-11-13 16:24:20,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 447.0) internal successors, (1341), 3 states have internal predecessors, (1341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:24:20,266 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:24:20,266 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:24:20,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 16:24:20,266 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-11-13 16:24:20,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:24:20,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1634219317, now seen corresponding path program 1 times [2024-11-13 16:24:20,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:24:20,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741257010] [2024-11-13 16:24:20,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:24:20,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:24:20,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:24:20,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:24:20,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:24:20,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741257010] [2024-11-13 16:24:20,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741257010] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:24:20,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:24:20,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:24:20,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632961123] [2024-11-13 16:24:20,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:24:20,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:24:20,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:24:20,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:24:20,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:24:20,496 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 463 out of 517 [2024-11-13 16:24:20,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 320 transitions, 722 flow. Second operand has 3 states, 3 states have (on average 464.3333333333333) internal successors, (1393), 3 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:24:20,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:24:20,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 463 of 517 [2024-11-13 16:24:20,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:24:21,133 INFO L124 PetriNetUnfolderBase]: 264/2778 cut-off events. [2024-11-13 16:24:21,134 INFO L125 PetriNetUnfolderBase]: For 40/70 co-relation queries the response was YES. [2024-11-13 16:24:21,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3218 conditions, 2778 events. 264/2778 cut-off events. For 40/70 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 22486 event pairs, 60 based on Foata normal form. 1/2351 useless extension candidates. Maximal degree in co-relation 3179. Up to 144 conditions per place. [2024-11-13 16:24:21,159 INFO L140 encePairwiseOnDemand]: 514/517 looper letters, 17 selfloop transitions, 2 changer transitions 0/324 dead transitions. [2024-11-13 16:24:21,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 324 transitions, 777 flow [2024-11-13 16:24:21,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:24:21,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 16:24:21,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1409 transitions. [2024-11-13 16:24:21,164 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9084461637653127 [2024-11-13 16:24:21,165 INFO L175 Difference]: Start difference. First operand has 303 places, 320 transitions, 722 flow. Second operand 3 states and 1409 transitions. [2024-11-13 16:24:21,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 324 transitions, 777 flow [2024-11-13 16:24:21,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 324 transitions, 773 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 16:24:21,176 INFO L231 Difference]: Finished difference. Result has 302 places, 319 transitions, 720 flow [2024-11-13 16:24:21,177 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=517, PETRI_DIFFERENCE_MINUEND_FLOW=716, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=720, PETRI_PLACES=302, PETRI_TRANSITIONS=319} [2024-11-13 16:24:21,179 INFO L277 CegarLoopForPetriNet]: 326 programPoint places, -24 predicate places. [2024-11-13 16:24:21,180 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 319 transitions, 720 flow [2024-11-13 16:24:21,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 464.3333333333333) internal successors, (1393), 3 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:24:21,181 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:24:21,181 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:24:21,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 16:24:21,183 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread_usbErr0ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-11-13 16:24:21,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:24:21,185 INFO L85 PathProgramCache]: Analyzing trace with hash 770783074, now seen corresponding path program 1 times [2024-11-13 16:24:21,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:24:21,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395440977] [2024-11-13 16:24:21,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:24:21,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:24:21,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:24:21,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:24:21,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:24:21,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395440977] [2024-11-13 16:24:21,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395440977] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:24:21,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:24:21,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:24:21,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083833291] [2024-11-13 16:24:21,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:24:21,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:24:21,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:24:21,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:24:21,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:24:21,433 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 456 out of 517 [2024-11-13 16:24:21,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 319 transitions, 720 flow. Second operand has 3 states, 3 states have (on average 457.3333333333333) internal successors, (1372), 3 states have internal predecessors, (1372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:24:21,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:24:21,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 456 of 517 [2024-11-13 16:24:21,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:24:21,746 INFO L124 PetriNetUnfolderBase]: 123/1439 cut-off events. [2024-11-13 16:24:21,747 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-13 16:24:21,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1686 conditions, 1439 events. 123/1439 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 9206 event pairs, 29 based on Foata normal form. 0/1249 useless extension candidates. Maximal degree in co-relation 1591. Up to 93 conditions per place. [2024-11-13 16:24:21,760 INFO L140 encePairwiseOnDemand]: 514/517 looper letters, 14 selfloop transitions, 2 changer transitions 0/318 dead transitions. [2024-11-13 16:24:21,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 318 transitions, 750 flow [2024-11-13 16:24:21,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:24:21,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 16:24:21,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1385 transitions. [2024-11-13 16:24:21,765 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8929722759509994 [2024-11-13 16:24:21,765 INFO L175 Difference]: Start difference. First operand has 302 places, 319 transitions, 720 flow. Second operand 3 states and 1385 transitions. [2024-11-13 16:24:21,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 318 transitions, 750 flow [2024-11-13 16:24:21,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 318 transitions, 746 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 16:24:21,775 INFO L231 Difference]: Finished difference. Result has 301 places, 318 transitions, 718 flow [2024-11-13 16:24:21,776 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=517, PETRI_DIFFERENCE_MINUEND_FLOW=714, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=718, PETRI_PLACES=301, PETRI_TRANSITIONS=318} [2024-11-13 16:24:21,776 INFO L277 CegarLoopForPetriNet]: 326 programPoint places, -25 predicate places. [2024-11-13 16:24:21,777 INFO L471 AbstractCegarLoop]: Abstraction has has 301 places, 318 transitions, 718 flow [2024-11-13 16:24:21,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 457.3333333333333) internal successors, (1372), 3 states have internal predecessors, (1372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:24:21,779 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:24:21,779 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:24:21,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 16:24:21,780 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-11-13 16:24:21,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:24:21,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1829982042, now seen corresponding path program 1 times [2024-11-13 16:24:21,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:24:21,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662497478] [2024-11-13 16:24:21,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:24:21,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:24:21,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:24:21,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:24:21,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:24:21,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662497478] [2024-11-13 16:24:21,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662497478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:24:21,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:24:21,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:24:21,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023680364] [2024-11-13 16:24:21,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:24:21,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:24:21,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:24:21,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:24:21,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:24:21,962 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 467 out of 517 [2024-11-13 16:24:21,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 318 transitions, 718 flow. Second operand has 3 states, 3 states have (on average 468.3333333333333) internal successors, (1405), 3 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:24:21,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:24:21,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 467 of 517 [2024-11-13 16:24:21,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:24:22,438 INFO L124 PetriNetUnfolderBase]: 241/2505 cut-off events. [2024-11-13 16:24:22,438 INFO L125 PetriNetUnfolderBase]: For 29/49 co-relation queries the response was YES. [2024-11-13 16:24:22,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2893 conditions, 2505 events. 241/2505 cut-off events. For 29/49 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 19003 event pairs, 42 based on Foata normal form. 1/2136 useless extension candidates. Maximal degree in co-relation 2792. Up to 142 conditions per place. [2024-11-13 16:24:22,464 INFO L140 encePairwiseOnDemand]: 515/517 looper letters, 14 selfloop transitions, 1 changer transitions 16/322 dead transitions. [2024-11-13 16:24:22,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 322 transitions, 765 flow [2024-11-13 16:24:22,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:24:22,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 16:24:22,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1417 transitions. [2024-11-13 16:24:22,470 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9136041263700838 [2024-11-13 16:24:22,470 INFO L175 Difference]: Start difference. First operand has 301 places, 318 transitions, 718 flow. Second operand 3 states and 1417 transitions. [2024-11-13 16:24:22,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 322 transitions, 765 flow [2024-11-13 16:24:22,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 322 transitions, 761 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 16:24:22,480 INFO L231 Difference]: Finished difference. Result has 300 places, 301 transitions, 678 flow [2024-11-13 16:24:22,481 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=517, PETRI_DIFFERENCE_MINUEND_FLOW=712, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=678, PETRI_PLACES=300, PETRI_TRANSITIONS=301} [2024-11-13 16:24:22,482 INFO L277 CegarLoopForPetriNet]: 326 programPoint places, -26 predicate places. [2024-11-13 16:24:22,482 INFO L471 AbstractCegarLoop]: Abstraction has has 300 places, 301 transitions, 678 flow [2024-11-13 16:24:22,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 468.3333333333333) internal successors, (1405), 3 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:24:22,483 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:24:22,483 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:24:22,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 16:24:22,484 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread_usbErr1ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-11-13 16:24:22,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:24:22,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1182593031, now seen corresponding path program 1 times [2024-11-13 16:24:22,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:24:22,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970054793] [2024-11-13 16:24:22,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:24:22,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:24:22,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:24:22,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:24:22,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:24:22,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970054793] [2024-11-13 16:24:22,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970054793] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:24:22,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:24:22,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:24:22,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189082656] [2024-11-13 16:24:22,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:24:22,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:24:22,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:24:22,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:24:22,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:24:22,714 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 517 [2024-11-13 16:24:22,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 301 transitions, 678 flow. Second operand has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:24:22,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:24:22,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 517 [2024-11-13 16:24:22,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:24:23,118 INFO L124 PetriNetUnfolderBase]: 147/1611 cut-off events. [2024-11-13 16:24:23,119 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-13 16:24:23,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1902 conditions, 1611 events. 147/1611 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 10955 event pairs, 33 based on Foata normal form. 0/1411 useless extension candidates. Maximal degree in co-relation 1826. Up to 107 conditions per place. [2024-11-13 16:24:23,134 INFO L140 encePairwiseOnDemand]: 509/517 looper letters, 16 selfloop transitions, 5 changer transitions 3/303 dead transitions. [2024-11-13 16:24:23,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 303 transitions, 724 flow [2024-11-13 16:24:23,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:24:23,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 16:24:23,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1368 transitions. [2024-11-13 16:24:23,139 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8820116054158608 [2024-11-13 16:24:23,139 INFO L175 Difference]: Start difference. First operand has 300 places, 301 transitions, 678 flow. Second operand 3 states and 1368 transitions. [2024-11-13 16:24:23,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 303 transitions, 724 flow [2024-11-13 16:24:23,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 303 transitions, 723 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 16:24:23,147 INFO L231 Difference]: Finished difference. Result has 284 places, 298 transitions, 692 flow [2024-11-13 16:24:23,147 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=517, PETRI_DIFFERENCE_MINUEND_FLOW=671, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=692, PETRI_PLACES=284, PETRI_TRANSITIONS=298} [2024-11-13 16:24:23,148 INFO L277 CegarLoopForPetriNet]: 326 programPoint places, -42 predicate places. [2024-11-13 16:24:23,148 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 298 transitions, 692 flow [2024-11-13 16:24:23,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:24:23,150 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:24:23,150 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:24:23,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 16:24:23,151 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread_usbErr7ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-11-13 16:24:23,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:24:23,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1455872837, now seen corresponding path program 1 times [2024-11-13 16:24:23,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:24:23,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092841806] [2024-11-13 16:24:23,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:24:23,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:24:23,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:24:23,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:24:23,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:24:23,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092841806] [2024-11-13 16:24:23,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092841806] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:24:23,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:24:23,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:24:23,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783896829] [2024-11-13 16:24:23,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:24:23,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:24:23,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:24:23,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:24:23,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:24:23,379 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 517 [2024-11-13 16:24:23,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 298 transitions, 692 flow. Second operand has 3 states, 3 states have (on average 456.3333333333333) internal successors, (1369), 3 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:24:23,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:24:23,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 517 [2024-11-13 16:24:23,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:24:23,708 INFO L124 PetriNetUnfolderBase]: 157/1617 cut-off events. [2024-11-13 16:24:23,708 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2024-11-13 16:24:23,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1957 conditions, 1617 events. 157/1617 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 10870 event pairs, 20 based on Foata normal form. 1/1414 useless extension candidates. Maximal degree in co-relation 1880. Up to 91 conditions per place. [2024-11-13 16:24:23,729 INFO L140 encePairwiseOnDemand]: 509/517 looper letters, 15 selfloop transitions, 5 changer transitions 0/302 dead transitions. [2024-11-13 16:24:23,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 302 transitions, 740 flow [2024-11-13 16:24:23,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:24:23,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 16:24:23,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1388 transitions. [2024-11-13 16:24:23,737 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8949065119277885 [2024-11-13 16:24:23,737 INFO L175 Difference]: Start difference. First operand has 284 places, 298 transitions, 692 flow. Second operand 3 states and 1388 transitions. [2024-11-13 16:24:23,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 302 transitions, 740 flow [2024-11-13 16:24:23,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 302 transitions, 735 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 16:24:23,748 INFO L231 Difference]: Finished difference. Result has 284 places, 300 transitions, 721 flow [2024-11-13 16:24:23,748 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=517, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=721, PETRI_PLACES=284, PETRI_TRANSITIONS=300} [2024-11-13 16:24:23,749 INFO L277 CegarLoopForPetriNet]: 326 programPoint places, -42 predicate places. [2024-11-13 16:24:23,750 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 300 transitions, 721 flow [2024-11-13 16:24:23,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 456.3333333333333) internal successors, (1369), 3 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:24:23,753 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:24:23,753 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:24:23,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 16:24:23,754 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread_usbErr12ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-11-13 16:24:23,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:24:23,754 INFO L85 PathProgramCache]: Analyzing trace with hash 504947237, now seen corresponding path program 1 times [2024-11-13 16:24:23,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:24:23,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166023184] [2024-11-13 16:24:23,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:24:23,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:24:23,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:24:23,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:24:23,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:24:23,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166023184] [2024-11-13 16:24:23,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166023184] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:24:23,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:24:23,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:24:23,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831869008] [2024-11-13 16:24:23,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:24:23,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:24:23,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:24:23,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:24:23,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:24:24,074 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 517 [2024-11-13 16:24:24,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 300 transitions, 721 flow. Second operand has 3 states, 3 states have (on average 450.0) internal successors, (1350), 3 states have internal predecessors, (1350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:24:24,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:24:24,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 517 [2024-11-13 16:24:24,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:24:24,434 INFO L124 PetriNetUnfolderBase]: 194/1754 cut-off events. [2024-11-13 16:24:24,434 INFO L125 PetriNetUnfolderBase]: For 135/161 co-relation queries the response was YES. [2024-11-13 16:24:24,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2272 conditions, 1754 events. 194/1754 cut-off events. For 135/161 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 11979 event pairs, 36 based on Foata normal form. 2/1546 useless extension candidates. Maximal degree in co-relation 2190. Up to 190 conditions per place. [2024-11-13 16:24:24,449 INFO L140 encePairwiseOnDemand]: 511/517 looper letters, 30 selfloop transitions, 8 changer transitions 0/308 dead transitions. [2024-11-13 16:24:24,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 308 transitions, 823 flow [2024-11-13 16:24:24,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:24:24,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 16:24:24,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1373 transitions. [2024-11-13 16:24:24,454 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8852353320438426 [2024-11-13 16:24:24,454 INFO L175 Difference]: Start difference. First operand has 284 places, 300 transitions, 721 flow. Second operand 3 states and 1373 transitions. [2024-11-13 16:24:24,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 308 transitions, 823 flow [2024-11-13 16:24:24,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 308 transitions, 813 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 16:24:24,462 INFO L231 Difference]: Finished difference. Result has 286 places, 306 transitions, 779 flow [2024-11-13 16:24:24,463 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=517, PETRI_DIFFERENCE_MINUEND_FLOW=711, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=779, PETRI_PLACES=286, PETRI_TRANSITIONS=306} [2024-11-13 16:24:24,465 INFO L277 CegarLoopForPetriNet]: 326 programPoint places, -40 predicate places. [2024-11-13 16:24:24,465 INFO L471 AbstractCegarLoop]: Abstraction has has 286 places, 306 transitions, 779 flow [2024-11-13 16:24:24,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.0) internal successors, (1350), 3 states have internal predecessors, (1350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:24:24,466 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:24:24,466 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:24:24,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 16:24:24,467 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread_usbErr2ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-11-13 16:24:24,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:24:24,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1366671980, now seen corresponding path program 1 times [2024-11-13 16:24:24,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:24:24,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262503062] [2024-11-13 16:24:24,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:24:24,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:24:24,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:24:24,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:24:24,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:24:24,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262503062] [2024-11-13 16:24:24,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262503062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:24:24,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:24:24,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:24:24,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419760862] [2024-11-13 16:24:24,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:24:24,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:24:24,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:24:24,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:24:24,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:24:24,671 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 461 out of 517 [2024-11-13 16:24:24,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 306 transitions, 779 flow. Second operand has 3 states, 3 states have (on average 462.6666666666667) internal successors, (1388), 3 states have internal predecessors, (1388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:24:24,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:24:24,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 461 of 517 [2024-11-13 16:24:24,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:24:25,069 INFO L124 PetriNetUnfolderBase]: 188/1893 cut-off events. [2024-11-13 16:24:25,069 INFO L125 PetriNetUnfolderBase]: For 109/120 co-relation queries the response was YES. [2024-11-13 16:24:25,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2410 conditions, 1893 events. 188/1893 cut-off events. For 109/120 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 13019 event pairs, 29 based on Foata normal form. 0/1670 useless extension candidates. Maximal degree in co-relation 2330. Up to 105 conditions per place. [2024-11-13 16:24:25,084 INFO L140 encePairwiseOnDemand]: 514/517 looper letters, 14 selfloop transitions, 2 changer transitions 0/307 dead transitions. [2024-11-13 16:24:25,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 307 transitions, 813 flow [2024-11-13 16:24:25,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:24:25,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 16:24:25,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1400 transitions. [2024-11-13 16:24:25,089 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9026434558349452 [2024-11-13 16:24:25,089 INFO L175 Difference]: Start difference. First operand has 286 places, 306 transitions, 779 flow. Second operand 3 states and 1400 transitions. [2024-11-13 16:24:25,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 307 transitions, 813 flow [2024-11-13 16:24:25,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 307 transitions, 797 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 16:24:25,098 INFO L231 Difference]: Finished difference. Result has 285 places, 305 transitions, 765 flow [2024-11-13 16:24:25,100 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=517, PETRI_DIFFERENCE_MINUEND_FLOW=761, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=765, PETRI_PLACES=285, PETRI_TRANSITIONS=305} [2024-11-13 16:24:25,102 INFO L277 CegarLoopForPetriNet]: 326 programPoint places, -41 predicate places. [2024-11-13 16:24:25,102 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 305 transitions, 765 flow [2024-11-13 16:24:25,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 462.6666666666667) internal successors, (1388), 3 states have internal predecessors, (1388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:24:25,103 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:24:25,104 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:24:25,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 16:24:25,104 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread_usbErr3ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-11-13 16:24:25,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:24:25,105 INFO L85 PathProgramCache]: Analyzing trace with hash -703200961, now seen corresponding path program 1 times [2024-11-13 16:24:25,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:24:25,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795738504] [2024-11-13 16:24:25,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:24:25,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:24:25,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:24:25,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:24:25,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:24:25,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795738504] [2024-11-13 16:24:25,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795738504] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:24:25,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:24:25,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:24:25,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711764975] [2024-11-13 16:24:25,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:24:25,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:24:25,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:24:25,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:24:25,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:24:25,341 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 456 out of 517 [2024-11-13 16:24:25,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 305 transitions, 765 flow. Second operand has 3 states, 3 states have (on average 458.0) internal successors, (1374), 3 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:24:25,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:24:25,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 456 of 517 [2024-11-13 16:24:25,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:24:25,732 INFO L124 PetriNetUnfolderBase]: 193/1835 cut-off events. [2024-11-13 16:24:25,732 INFO L125 PetriNetUnfolderBase]: For 129/142 co-relation queries the response was YES. [2024-11-13 16:24:25,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2365 conditions, 1835 events. 193/1835 cut-off events. For 129/142 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 12997 event pairs, 27 based on Foata normal form. 0/1620 useless extension candidates. Maximal degree in co-relation 2285. Up to 127 conditions per place. [2024-11-13 16:24:25,748 INFO L140 encePairwiseOnDemand]: 514/517 looper letters, 19 selfloop transitions, 2 changer transitions 0/306 dead transitions. [2024-11-13 16:24:25,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 306 transitions, 809 flow [2024-11-13 16:24:25,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:24:25,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 16:24:25,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1387 transitions. [2024-11-13 16:24:25,754 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8942617666021921 [2024-11-13 16:24:25,754 INFO L175 Difference]: Start difference. First operand has 285 places, 305 transitions, 765 flow. Second operand 3 states and 1387 transitions. [2024-11-13 16:24:25,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 306 transitions, 809 flow [2024-11-13 16:24:25,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 306 transitions, 805 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 16:24:25,762 INFO L231 Difference]: Finished difference. Result has 284 places, 304 transitions, 763 flow [2024-11-13 16:24:25,764 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=517, PETRI_DIFFERENCE_MINUEND_FLOW=759, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=763, PETRI_PLACES=284, PETRI_TRANSITIONS=304} [2024-11-13 16:24:25,765 INFO L277 CegarLoopForPetriNet]: 326 programPoint places, -42 predicate places. [2024-11-13 16:24:25,765 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 304 transitions, 763 flow [2024-11-13 16:24:25,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 458.0) internal successors, (1374), 3 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:24:25,767 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:24:25,768 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:24:25,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 16:24:25,768 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-11-13 16:24:25,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:24:25,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1889358019, now seen corresponding path program 1 times [2024-11-13 16:24:25,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:24:25,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464007748] [2024-11-13 16:24:25,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:24:25,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:24:25,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:24:25,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:24:25,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:24:25,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464007748] [2024-11-13 16:24:25,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464007748] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:24:25,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:24:25,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:24:25,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092416271] [2024-11-13 16:24:25,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:24:25,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:24:25,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:24:25,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:24:25,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:24:26,067 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 445 out of 517 [2024-11-13 16:24:26,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 304 transitions, 763 flow. Second operand has 3 states, 3 states have (on average 448.0) internal successors, (1344), 3 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:24:26,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:24:26,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 445 of 517 [2024-11-13 16:24:26,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:24:26,570 INFO L124 PetriNetUnfolderBase]: 299/2257 cut-off events. [2024-11-13 16:24:26,571 INFO L125 PetriNetUnfolderBase]: For 349/468 co-relation queries the response was YES. [2024-11-13 16:24:26,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3183 conditions, 2257 events. 299/2257 cut-off events. For 349/468 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 17451 event pairs, 53 based on Foata normal form. 9/1998 useless extension candidates. Maximal degree in co-relation 3101. Up to 335 conditions per place. [2024-11-13 16:24:26,592 INFO L140 encePairwiseOnDemand]: 507/517 looper letters, 35 selfloop transitions, 16 changer transitions 0/317 dead transitions. [2024-11-13 16:24:26,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 317 transitions, 920 flow [2024-11-13 16:24:26,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:24:26,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 16:24:26,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1370 transitions. [2024-11-13 16:24:26,598 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8833010960670535 [2024-11-13 16:24:26,598 INFO L175 Difference]: Start difference. First operand has 284 places, 304 transitions, 763 flow. Second operand 3 states and 1370 transitions. [2024-11-13 16:24:26,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 317 transitions, 920 flow [2024-11-13 16:24:26,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 317 transitions, 916 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 16:24:26,611 INFO L231 Difference]: Finished difference. Result has 286 places, 316 transitions, 901 flow [2024-11-13 16:24:26,612 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=517, PETRI_DIFFERENCE_MINUEND_FLOW=759, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=901, PETRI_PLACES=286, PETRI_TRANSITIONS=316} [2024-11-13 16:24:26,616 INFO L277 CegarLoopForPetriNet]: 326 programPoint places, -40 predicate places. [2024-11-13 16:24:26,616 INFO L471 AbstractCegarLoop]: Abstraction has has 286 places, 316 transitions, 901 flow [2024-11-13 16:24:26,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 448.0) internal successors, (1344), 3 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:24:26,617 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:24:26,618 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:24:26,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-13 16:24:26,618 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread_usbErr4ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-11-13 16:24:26,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:24:26,619 INFO L85 PathProgramCache]: Analyzing trace with hash -464478676, now seen corresponding path program 1 times [2024-11-13 16:24:26,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:24:26,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066909736] [2024-11-13 16:24:26,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:24:26,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:24:26,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:24:26,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:24:26,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:24:26,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066909736] [2024-11-13 16:24:26,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066909736] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:24:26,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:24:26,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:24:26,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540675099] [2024-11-13 16:24:26,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:24:26,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:24:26,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:24:26,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:24:26,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:24:26,918 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 447 out of 517 [2024-11-13 16:24:26,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 316 transitions, 901 flow. Second operand has 3 states, 3 states have (on average 449.0) internal successors, (1347), 3 states have internal predecessors, (1347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:24:26,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:24:26,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 447 of 517 [2024-11-13 16:24:26,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:24:27,444 INFO L124 PetriNetUnfolderBase]: 310/2462 cut-off events. [2024-11-13 16:24:27,444 INFO L125 PetriNetUnfolderBase]: For 907/1014 co-relation queries the response was YES. [2024-11-13 16:24:27,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3607 conditions, 2462 events. 310/2462 cut-off events. For 907/1014 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 19425 event pairs, 39 based on Foata normal form. 7/2190 useless extension candidates. Maximal degree in co-relation 3524. Up to 289 conditions per place. [2024-11-13 16:24:27,461 INFO L140 encePairwiseOnDemand]: 511/517 looper letters, 44 selfloop transitions, 9 changer transitions 0/323 dead transitions. [2024-11-13 16:24:27,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 323 transitions, 1041 flow [2024-11-13 16:24:27,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:24:27,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 16:24:27,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1371 transitions. [2024-11-13 16:24:27,465 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8839458413926499 [2024-11-13 16:24:27,465 INFO L175 Difference]: Start difference. First operand has 286 places, 316 transitions, 901 flow. Second operand 3 states and 1371 transitions. [2024-11-13 16:24:27,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 323 transitions, 1041 flow [2024-11-13 16:24:27,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 323 transitions, 1005 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 16:24:27,476 INFO L231 Difference]: Finished difference. Result has 288 places, 321 transitions, 943 flow [2024-11-13 16:24:27,477 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=517, PETRI_DIFFERENCE_MINUEND_FLOW=869, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=943, PETRI_PLACES=288, PETRI_TRANSITIONS=321} [2024-11-13 16:24:27,478 INFO L277 CegarLoopForPetriNet]: 326 programPoint places, -38 predicate places. [2024-11-13 16:24:27,479 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 321 transitions, 943 flow [2024-11-13 16:24:27,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.0) internal successors, (1347), 3 states have internal predecessors, (1347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:24:27,480 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:24:27,480 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:24:27,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-13 16:24:27,480 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-11-13 16:24:27,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:24:27,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1623769007, now seen corresponding path program 1 times [2024-11-13 16:24:27,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:24:27,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713521037] [2024-11-13 16:24:27,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:24:27,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:24:27,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:24:27,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:24:27,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:24:27,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713521037] [2024-11-13 16:24:27,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713521037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:24:27,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:24:27,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:24:27,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319436121] [2024-11-13 16:24:27,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:24:27,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:24:27,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:24:27,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:24:27,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:24:27,721 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 445 out of 517 [2024-11-13 16:24:27,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 321 transitions, 943 flow. Second operand has 3 states, 3 states have (on average 448.3333333333333) internal successors, (1345), 3 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:24:27,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:24:27,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 445 of 517 [2024-11-13 16:24:27,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:24:28,407 INFO L124 PetriNetUnfolderBase]: 566/3734 cut-off events. [2024-11-13 16:24:28,408 INFO L125 PetriNetUnfolderBase]: For 2145/2433 co-relation queries the response was YES. [2024-11-13 16:24:28,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5918 conditions, 3734 events. 566/3734 cut-off events. For 2145/2433 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 33787 event pairs, 142 based on Foata normal form. 10/3319 useless extension candidates. Maximal degree in co-relation 5448. Up to 601 conditions per place. [2024-11-13 16:24:28,439 INFO L140 encePairwiseOnDemand]: 511/517 looper letters, 49 selfloop transitions, 9 changer transitions 1/328 dead transitions. [2024-11-13 16:24:28,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 328 transitions, 1095 flow [2024-11-13 16:24:28,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:24:28,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 16:24:28,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1367 transitions. [2024-11-13 16:24:28,444 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8813668600902643 [2024-11-13 16:24:28,444 INFO L175 Difference]: Start difference. First operand has 288 places, 321 transitions, 943 flow. Second operand 3 states and 1367 transitions. [2024-11-13 16:24:28,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 328 transitions, 1095 flow [2024-11-13 16:24:28,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 328 transitions, 1071 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-11-13 16:24:28,458 INFO L231 Difference]: Finished difference. Result has 290 places, 325 transitions, 995 flow [2024-11-13 16:24:28,459 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=517, PETRI_DIFFERENCE_MINUEND_FLOW=919, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=995, PETRI_PLACES=290, PETRI_TRANSITIONS=325} [2024-11-13 16:24:28,460 INFO L277 CegarLoopForPetriNet]: 326 programPoint places, -36 predicate places. [2024-11-13 16:24:28,461 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 325 transitions, 995 flow [2024-11-13 16:24:28,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 448.3333333333333) internal successors, (1345), 3 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:24:28,462 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:24:28,462 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:24:28,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-13 16:24:28,463 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread_usbErr12ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-11-13 16:24:28,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:24:28,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1830733477, now seen corresponding path program 1 times [2024-11-13 16:24:28,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:24:28,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817851386] [2024-11-13 16:24:28,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:24:28,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:24:28,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:24:28,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:24:28,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:24:28,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817851386] [2024-11-13 16:24:28,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817851386] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:24:28,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:24:28,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 16:24:28,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559978722] [2024-11-13 16:24:28,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:24:28,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 16:24:28,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:24:28,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 16:24:28,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 16:24:28,700 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 462 out of 517 [2024-11-13 16:24:28,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 325 transitions, 995 flow. Second operand has 5 states, 5 states have (on average 464.0) internal successors, (2320), 5 states have internal predecessors, (2320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:24:28,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:24:28,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 462 of 517 [2024-11-13 16:24:28,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:24:30,005 INFO L124 PetriNetUnfolderBase]: 660/5863 cut-off events. [2024-11-13 16:24:30,006 INFO L125 PetriNetUnfolderBase]: For 2196/2354 co-relation queries the response was YES. [2024-11-13 16:24:30,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8740 conditions, 5863 events. 660/5863 cut-off events. For 2196/2354 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 56939 event pairs, 60 based on Foata normal form. 12/5267 useless extension candidates. Maximal degree in co-relation 8657. Up to 407 conditions per place. [2024-11-13 16:24:30,078 INFO L140 encePairwiseOnDemand]: 510/517 looper letters, 34 selfloop transitions, 9 changer transitions 0/352 dead transitions. [2024-11-13 16:24:30,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 352 transitions, 1146 flow [2024-11-13 16:24:30,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 16:24:30,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-13 16:24:30,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 3278 transitions. [2024-11-13 16:24:30,091 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9057750759878419 [2024-11-13 16:24:30,091 INFO L175 Difference]: Start difference. First operand has 290 places, 325 transitions, 995 flow. Second operand 7 states and 3278 transitions. [2024-11-13 16:24:30,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 352 transitions, 1146 flow [2024-11-13 16:24:30,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 352 transitions, 1116 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-11-13 16:24:30,112 INFO L231 Difference]: Finished difference. Result has 300 places, 333 transitions, 1033 flow [2024-11-13 16:24:30,113 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=517, PETRI_DIFFERENCE_MINUEND_FLOW=965, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1033, PETRI_PLACES=300, PETRI_TRANSITIONS=333} [2024-11-13 16:24:30,114 INFO L277 CegarLoopForPetriNet]: 326 programPoint places, -26 predicate places. [2024-11-13 16:24:30,114 INFO L471 AbstractCegarLoop]: Abstraction has has 300 places, 333 transitions, 1033 flow [2024-11-13 16:24:30,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 464.0) internal successors, (2320), 5 states have internal predecessors, (2320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:24:30,116 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:24:30,116 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:24:30,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-13 16:24:30,116 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread_usbErr12ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-11-13 16:24:30,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:24:30,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1286476091, now seen corresponding path program 1 times [2024-11-13 16:24:30,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:24:30,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711613136] [2024-11-13 16:24:30,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:24:30,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:24:30,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:24:30,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:24:30,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:24:30,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711613136] [2024-11-13 16:24:30,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711613136] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:24:30,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:24:30,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 16:24:30,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885842340] [2024-11-13 16:24:30,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:24:30,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 16:24:30,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:24:30,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 16:24:30,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 16:24:30,432 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 460 out of 517 [2024-11-13 16:24:30,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 333 transitions, 1033 flow. Second operand has 5 states, 5 states have (on average 462.4) internal successors, (2312), 5 states have internal predecessors, (2312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:24:30,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:24:30,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 517 [2024-11-13 16:24:30,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:24:32,001 INFO L124 PetriNetUnfolderBase]: 908/7731 cut-off events. [2024-11-13 16:24:32,002 INFO L125 PetriNetUnfolderBase]: For 2348/2507 co-relation queries the response was YES. [2024-11-13 16:24:32,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11528 conditions, 7731 events. 908/7731 cut-off events. For 2348/2507 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 73021 event pairs, 94 based on Foata normal form. 15/6930 useless extension candidates. Maximal degree in co-relation 11440. Up to 532 conditions per place. [2024-11-13 16:24:32,065 INFO L140 encePairwiseOnDemand]: 509/517 looper letters, 32 selfloop transitions, 8 changer transitions 0/355 dead transitions. [2024-11-13 16:24:32,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 355 transitions, 1164 flow [2024-11-13 16:24:32,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 16:24:32,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-13 16:24:32,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 3261 transitions. [2024-11-13 16:24:32,074 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9010776457584968 [2024-11-13 16:24:32,074 INFO L175 Difference]: Start difference. First operand has 300 places, 333 transitions, 1033 flow. Second operand 7 states and 3261 transitions. [2024-11-13 16:24:32,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 355 transitions, 1164 flow [2024-11-13 16:24:32,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 355 transitions, 1164 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-13 16:24:32,088 INFO L231 Difference]: Finished difference. Result has 311 places, 340 transitions, 1091 flow [2024-11-13 16:24:32,089 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=517, PETRI_DIFFERENCE_MINUEND_FLOW=1033, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1091, PETRI_PLACES=311, PETRI_TRANSITIONS=340} [2024-11-13 16:24:32,090 INFO L277 CegarLoopForPetriNet]: 326 programPoint places, -15 predicate places. [2024-11-13 16:24:32,090 INFO L471 AbstractCegarLoop]: Abstraction has has 311 places, 340 transitions, 1091 flow [2024-11-13 16:24:32,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 462.4) internal successors, (2312), 5 states have internal predecessors, (2312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:24:32,092 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:24:32,092 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:24:32,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-13 16:24:32,093 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-11-13 16:24:32,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:24:32,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1786126990, now seen corresponding path program 1 times [2024-11-13 16:24:32,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:24:32,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089455466] [2024-11-13 16:24:32,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:24:32,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:24:32,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:24:32,126 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 16:24:32,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:24:32,206 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 16:24:32,206 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 16:24:32,208 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE (42 of 43 remaining) [2024-11-13 16:24:32,210 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE (41 of 43 remaining) [2024-11-13 16:24:32,210 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE (40 of 43 remaining) [2024-11-13 16:24:32,211 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (39 of 43 remaining) [2024-11-13 16:24:32,211 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (38 of 43 remaining) [2024-11-13 16:24:32,211 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (37 of 43 remaining) [2024-11-13 16:24:32,211 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (36 of 43 remaining) [2024-11-13 16:24:32,211 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (35 of 43 remaining) [2024-11-13 16:24:32,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (34 of 43 remaining) [2024-11-13 16:24:32,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (33 of 43 remaining) [2024-11-13 16:24:32,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (32 of 43 remaining) [2024-11-13 16:24:32,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 43 remaining) [2024-11-13 16:24:32,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr0ASSERT_VIOLATIONDATA_RACE (30 of 43 remaining) [2024-11-13 16:24:32,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr12ASSERT_VIOLATIONDATA_RACE (29 of 43 remaining) [2024-11-13 16:24:32,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr1ASSERT_VIOLATIONDATA_RACE (28 of 43 remaining) [2024-11-13 16:24:32,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr13ASSERT_VIOLATIONDATA_RACE (27 of 43 remaining) [2024-11-13 16:24:32,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr6ASSERT_VIOLATIONDATA_RACE (26 of 43 remaining) [2024-11-13 16:24:32,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr11ASSERT_VIOLATIONDATA_RACE (25 of 43 remaining) [2024-11-13 16:24:32,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr7ASSERT_VIOLATIONDATA_RACE (24 of 43 remaining) [2024-11-13 16:24:32,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr2ASSERT_VIOLATIONDATA_RACE (23 of 43 remaining) [2024-11-13 16:24:32,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr8ASSERT_VIOLATIONDATA_RACE (22 of 43 remaining) [2024-11-13 16:24:32,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr9ASSERT_VIOLATIONDATA_RACE (21 of 43 remaining) [2024-11-13 16:24:32,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr10ASSERT_VIOLATIONDATA_RACE (20 of 43 remaining) [2024-11-13 16:24:32,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr3ASSERT_VIOLATIONDATA_RACE (19 of 43 remaining) [2024-11-13 16:24:32,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr4ASSERT_VIOLATIONDATA_RACE (18 of 43 remaining) [2024-11-13 16:24:32,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr5ASSERT_VIOLATIONDATA_RACE (17 of 43 remaining) [2024-11-13 16:24:32,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 43 remaining) [2024-11-13 16:24:32,215 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE (15 of 43 remaining) [2024-11-13 16:24:32,215 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr0ASSERT_VIOLATIONDATA_RACE (14 of 43 remaining) [2024-11-13 16:24:32,215 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr12ASSERT_VIOLATIONDATA_RACE (13 of 43 remaining) [2024-11-13 16:24:32,215 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr1ASSERT_VIOLATIONDATA_RACE (12 of 43 remaining) [2024-11-13 16:24:32,215 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr13ASSERT_VIOLATIONDATA_RACE (11 of 43 remaining) [2024-11-13 16:24:32,215 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr6ASSERT_VIOLATIONDATA_RACE (10 of 43 remaining) [2024-11-13 16:24:32,215 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr11ASSERT_VIOLATIONDATA_RACE (9 of 43 remaining) [2024-11-13 16:24:32,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr7ASSERT_VIOLATIONDATA_RACE (8 of 43 remaining) [2024-11-13 16:24:32,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr2ASSERT_VIOLATIONDATA_RACE (7 of 43 remaining) [2024-11-13 16:24:32,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr8ASSERT_VIOLATIONDATA_RACE (6 of 43 remaining) [2024-11-13 16:24:32,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr9ASSERT_VIOLATIONDATA_RACE (5 of 43 remaining) [2024-11-13 16:24:32,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr10ASSERT_VIOLATIONDATA_RACE (4 of 43 remaining) [2024-11-13 16:24:32,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr3ASSERT_VIOLATIONDATA_RACE (3 of 43 remaining) [2024-11-13 16:24:32,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr4ASSERT_VIOLATIONDATA_RACE (2 of 43 remaining) [2024-11-13 16:24:32,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr5ASSERT_VIOLATIONDATA_RACE (1 of 43 remaining) [2024-11-13 16:24:32,217 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbThread1of1ForFork0Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 43 remaining) [2024-11-13 16:24:32,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-13 16:24:32,217 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:24:32,341 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-13 16:24:32,341 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 16:24:32,348 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 04:24:32 BasicIcfg [2024-11-13 16:24:32,348 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 16:24:32,349 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 16:24:32,349 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 16:24:32,349 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 16:24:32,350 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:24:16" (3/4) ... [2024-11-13 16:24:32,351 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-13 16:24:32,480 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3546e85a-41e1-471c-9a00-b89d17121a93/bin/uautomizer-verify-qhAvR1uOyd/witness.graphml [2024-11-13 16:24:32,483 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 16:24:32,484 INFO L158 Benchmark]: Toolchain (without parser) took 19411.60ms. Allocated memory was 117.4MB in the beginning and 444.6MB in the end (delta: 327.2MB). Free memory was 88.9MB in the beginning and 167.8MB in the end (delta: -78.9MB). Peak memory consumption was 246.5MB. Max. memory is 16.1GB. [2024-11-13 16:24:32,484 INFO L158 Benchmark]: CDTParser took 0.57ms. Allocated memory is still 83.9MB. Free memory is still 41.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:24:32,485 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1489.90ms. Allocated memory is still 117.4MB. Free memory was 88.9MB in the beginning and 82.6MB in the end (delta: 6.3MB). Peak memory consumption was 67.0MB. Max. memory is 16.1GB. [2024-11-13 16:24:32,485 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.89ms. Allocated memory is still 117.4MB. Free memory was 82.6MB in the beginning and 79.1MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:24:32,485 INFO L158 Benchmark]: Boogie Preprocessor took 80.04ms. Allocated memory is still 117.4MB. Free memory was 79.1MB in the beginning and 76.1MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 16:24:32,486 INFO L158 Benchmark]: RCFGBuilder took 1324.39ms. Allocated memory is still 117.4MB. Free memory was 76.1MB in the beginning and 46.7MB in the end (delta: 29.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 16:24:32,486 INFO L158 Benchmark]: TraceAbstraction took 16287.88ms. Allocated memory was 117.4MB in the beginning and 444.6MB in the end (delta: 327.2MB). Free memory was 46.0MB in the beginning and 184.5MB in the end (delta: -138.6MB). Peak memory consumption was 188.0MB. Max. memory is 16.1GB. [2024-11-13 16:24:32,486 INFO L158 Benchmark]: Witness Printer took 134.04ms. Allocated memory is still 444.6MB. Free memory was 184.5MB in the beginning and 167.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 16:24:32,492 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.57ms. Allocated memory is still 83.9MB. Free memory is still 41.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1489.90ms. Allocated memory is still 117.4MB. Free memory was 88.9MB in the beginning and 82.6MB in the end (delta: 6.3MB). Peak memory consumption was 67.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.89ms. Allocated memory is still 117.4MB. Free memory was 82.6MB in the beginning and 79.1MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 80.04ms. Allocated memory is still 117.4MB. Free memory was 79.1MB in the beginning and 76.1MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1324.39ms. Allocated memory is still 117.4MB. Free memory was 76.1MB in the beginning and 46.7MB in the end (delta: 29.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 16287.88ms. Allocated memory was 117.4MB in the beginning and 444.6MB in the end (delta: 327.2MB). Free memory was 46.0MB in the beginning and 184.5MB in the end (delta: -138.6MB). Peak memory consumption was 188.0MB. Max. memory is 16.1GB. * Witness Printer took 134.04ms. Allocated memory is still 444.6MB. Free memory was 184.5MB in the beginning and 167.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 1699]: Data race detected Data race detected The following path leads to a data race: [L1694] 0 pthread_t t1, t2; VAL [t1=0, t2=0] [L1695] 0 pthread_mutex_t mutex; VAL [mutex={3:0}, t1=0, t2=0] [L1696] 0 int pdev; VAL [mutex={3:0}, pdev=0, t1=0, t2=0] [L1741] 0 int ldv_usb_state; VAL [ldv_usb_state=0, mutex={3:0}, pdev=0, t1=0, t2=0] [L1798] CALL 0 module_init() [L1779] 0 pdev = 1 VAL [ldv_usb_state=0, mutex={3:0}, pdev=1, t1=0, t2=0] [L1780] EXPR 0 pdev==1 [L1780] CALL 0 ldv_assert(pdev==1) [L1693] COND FALSE 0 !(!expression) VAL [\old(expression)=1, expression=1, ldv_usb_state=0, mutex={3:0}, pdev=1, t1=0, t2=0] [L1780] RET 0 ldv_assert(pdev==1) [L1781] COND TRUE 0 __VERIFIER_nondet_int() VAL [ldv_usb_state=0, mutex={3:0}, pdev=1, t1=0, t2=0] [L1782] 0 pthread_create(&t1, ((void *)0), thread_usb, ((void *)0)) VAL [ldv_usb_state=0, mutex={3:0}, pdev=1, t1=-1, t2=0] [L1782] FCALL, FORK 0 pthread_create(&t1, ((void *)0), thread_usb, ((void *)0)) VAL [ldv_usb_state=0, mutex={3:0}, pdev=1, t1=-1, t2=0] [L1743] 1 ldv_usb_state = 0 VAL [\old(arg)={0:0}, arg={0:0}, ldv_usb_state=0, mutex={3:0}, pdev=1, t1=-1, t2=0] [L1744] 1 int probe_ret; VAL [\old(arg)={0:0}, arg={0:0}, ldv_usb_state=0, mutex={3:0}, pdev=1, t1=-1, t2=0] [L1745] COND TRUE 1 1 VAL [\old(arg)={0:0}, arg={0:0}, ldv_usb_state=0, mutex={3:0}, pdev=1, t1=-1, t2=0] [L1747] 1 case 0: VAL [\old(arg)={0:0}, arg={0:0}, ldv_usb_state=0, mutex={3:0}, pdev=1, t1=-1, t2=0] [L1748] 1 ldv_usb_state==0 VAL [\old(arg)={0:0}, arg={0:0}, ldv_usb_state=0, mutex={3:0}, pdev=1, t1=-1, t2=0] [L1747] 1 case 0: [L1749] CALL, EXPR 1 ath_ahb_probe() [L1730] 1 int error; [L1731] CALL, EXPR 1 ieee80211_register_hw() [L1717] COND TRUE 1 __VERIFIER_nondet_int() VAL [ldv_usb_state=0, mutex={3:0}, pdev=1, t1=-1, t2=0] [L1718] 1 pthread_create(&t2, ((void *)0), thread_ath9k, ((void *)0)) VAL [ldv_usb_state=0, mutex={3:0}, pdev=1, t1=-1, t2=0] [L1718] FCALL, FORK 1 pthread_create(&t2, ((void *)0), thread_ath9k, ((void *)0)) VAL [ldv_usb_state=0, mutex={3:0}, pdev=1, t1=-1, t2=0] [L1719] 1 return 0; VAL [\result=0, ldv_usb_state=0, mutex={3:0}, pdev=1, t1=-1, t2=0] [L1704] COND TRUE 2 1 VAL [\old(arg)={0:0}, arg={0:0}, ldv_usb_state=0, mutex={3:0}, pdev=1, t1=-1, t2=0] [L1706] 2 case 1: [L1707] CALL 2 ath9k_flush() [L1699] 2 pdev = 6 VAL [ldv_usb_state=0, mutex={3:0}, pdev=6, t1=-1, t2=0] [L1731] RET, EXPR 1 ieee80211_register_hw() [L1731] 1 error = ieee80211_register_hw() VAL [error=0, ldv_usb_state=0, mutex={3:0}, pdev=6, t1=-1, t2=0] [L1732] COND FALSE 1 !(\read(error)) VAL [error=0, ldv_usb_state=0, mutex={3:0}, pdev=6, t1=-1, t2=0] [L1734] 1 return 0; VAL [\result=0, error=0, ldv_usb_state=0, mutex={3:0}, pdev=6, t1=-1, t2=0] [L1749] RET, EXPR 1 ath_ahb_probe() [L1749] 1 probe_ret = ath_ahb_probe() VAL [\old(arg)={0:0}, arg={0:0}, ldv_usb_state=0, mutex={3:0}, pdev=6, probe_ret=0, t1=-1, t2=0] [L1747] 1 case 0: VAL [\old(arg)={0:0}, arg={0:0}, ldv_usb_state=0, mutex={3:0}, pdev=6, probe_ret=0, t1=-1, t2=0] [L1752] 1 ldv_usb_state = 1 VAL [\old(arg)={0:0}, arg={0:0}, ldv_usb_state=1, mutex={3:0}, pdev=6, probe_ret=0, t1=-1, t2=0] [L1753] 1 pdev = 7 VAL [\old(arg)={0:0}, arg={0:0}, ldv_usb_state=1, mutex={3:0}, pdev=7, probe_ret=0, t1=-1, t2=0] [L1699] 2 pdev = 6 VAL [ldv_usb_state=1, mutex={3:0}, pdev=7, t1=-1, t2=0] Now there is a data race on ~pdev~0 between C: pdev = 7 [1753] and C: pdev = 6 [1699] - UnprovableResult [Line: 1700]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1779]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1780]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1785]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1782]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1786]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1792]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1794]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1795]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1782]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1743]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1773]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1748]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1774]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1758]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1766]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1725]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1718]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1760]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1761]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1762]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1752]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1753]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1754]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1718]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1718]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 520 locations, 43 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 15.8s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1411 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 461 mSDsluCounter, 301 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 41 mSDsCounter, 88 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1380 IncrementalHoareTripleChecker+Invalid, 1468 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 88 mSolverCounterUnsat, 260 mSDtfsCounter, 1380 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1091occurred in iteration=16, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1281 NumberOfCodeBlocks, 1281 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1147 ConstructedInterpolants, 0 QuantifiedInterpolants, 1227 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-13 16:24:32,537 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3546e85a-41e1-471c-9a00-b89d17121a93/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE