./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 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097d5af2-147e-4ae7-978d-44a6016675ab/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097d5af2-147e-4ae7-978d-44a6016675ab/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097d5af2-147e-4ae7-978d-44a6016675ab/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097d5af2-147e-4ae7-978d-44a6016675ab/bin/uautomizer-Dbtcem3rbc/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_097d5af2-147e-4ae7-978d-44a6016675ab/bin/uautomizer-Dbtcem3rbc/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097d5af2-147e-4ae7-978d-44a6016675ab/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --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 --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:36:08,045 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:36:08,047 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:36:08,086 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:36:08,087 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:36:08,091 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:36:08,093 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:36:08,096 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:36:08,098 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:36:08,103 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:36:08,104 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:36:08,106 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:36:08,107 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:36:08,110 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:36:08,112 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:36:08,113 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:36:08,115 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:36:08,116 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:36:08,117 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:36:08,124 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:36:08,126 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:36:08,127 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:36:08,131 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:36:08,132 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:36:08,136 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:36:08,136 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:36:08,137 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:36:08,138 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:36:08,139 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:36:08,140 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:36:08,141 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:36:08,143 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:36:08,144 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:36:08,144 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:36:08,145 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:36:08,146 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:36:08,146 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:36:08,147 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:36:08,147 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:36:08,148 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:36:08,148 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:36:08,150 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097d5af2-147e-4ae7-978d-44a6016675ab/bin/uautomizer-Dbtcem3rbc/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-02 20:36:08,184 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:36:08,185 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:36:08,185 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:36:08,185 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:36:08,186 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:36:08,186 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:36:08,187 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:36:08,187 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:36:08,188 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:36:08,188 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:36:08,188 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:36:08,189 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:36:08,189 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:36:08,189 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:36:08,189 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:36:08,190 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:36:08,190 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:36:08,190 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:36:08,190 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-02 20:36:08,191 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:36:08,191 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:36:08,191 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:36:08,191 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:36:08,192 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:36:08,192 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:36:08,192 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:36:08,193 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:36:08,193 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:36:08,193 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:36:08,193 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:36:08,194 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:36:08,194 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:36:08,194 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:36:08,194 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:36:08,195 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:36:08,195 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097d5af2-147e-4ae7-978d-44a6016675ab/bin/uautomizer-Dbtcem3rbc/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097d5af2-147e-4ae7-978d-44a6016675ab/bin/uautomizer-Dbtcem3rbc Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 [2022-11-02 20:36:08,475 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:36:08,513 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:36:08,516 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:36:08,518 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:36:08,519 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:36:08,520 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097d5af2-147e-4ae7-978d-44a6016675ab/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/ldv-races/race-4_2-thread_local_vars.i [2022-11-02 20:36:08,608 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097d5af2-147e-4ae7-978d-44a6016675ab/bin/uautomizer-Dbtcem3rbc/data/319213c2c/8a83577556784572980b0609e7440da1/FLAG4b36fef6e [2022-11-02 20:36:09,251 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:36:09,251 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097d5af2-147e-4ae7-978d-44a6016675ab/sv-benchmarks/c/ldv-races/race-4_2-thread_local_vars.i [2022-11-02 20:36:09,276 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097d5af2-147e-4ae7-978d-44a6016675ab/bin/uautomizer-Dbtcem3rbc/data/319213c2c/8a83577556784572980b0609e7440da1/FLAG4b36fef6e [2022-11-02 20:36:09,594 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097d5af2-147e-4ae7-978d-44a6016675ab/bin/uautomizer-Dbtcem3rbc/data/319213c2c/8a83577556784572980b0609e7440da1 [2022-11-02 20:36:09,597 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:36:09,600 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:36:09,604 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:36:09,605 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:36:09,609 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:36:09,609 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:36:09" (1/1) ... [2022-11-02 20:36:09,611 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5de25842 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:36:09, skipping insertion in model container [2022-11-02 20:36:09,611 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:36:09" (1/1) ... [2022-11-02 20:36:09,619 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:36:09,691 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:36:10,695 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097d5af2-147e-4ae7-978d-44a6016675ab/sv-benchmarks/c/ldv-races/race-4_2-thread_local_vars.i[76081,76094] [2022-11-02 20:36:10,764 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:36:10,780 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:36:10,816 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097d5af2-147e-4ae7-978d-44a6016675ab/sv-benchmarks/c/ldv-races/race-4_2-thread_local_vars.i[76081,76094] [2022-11-02 20:36:10,831 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:36:10,932 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:36:10,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:36:10 WrapperNode [2022-11-02 20:36:10,932 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:36:10,933 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:36:10,933 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:36:10,933 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:36:10,941 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:36:10" (1/1) ... [2022-11-02 20:36:10,979 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:36:10" (1/1) ... [2022-11-02 20:36:11,013 INFO L138 Inliner]: procedures = 486, calls = 44, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 279 [2022-11-02 20:36:11,013 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:36:11,014 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:36:11,014 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:36:11,015 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:36:11,024 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:36:10" (1/1) ... [2022-11-02 20:36:11,025 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:36:10" (1/1) ... [2022-11-02 20:36:11,033 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:36:10" (1/1) ... [2022-11-02 20:36:11,045 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:36:10" (1/1) ... [2022-11-02 20:36:11,072 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:36:10" (1/1) ... [2022-11-02 20:36:11,077 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:36:10" (1/1) ... [2022-11-02 20:36:11,081 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:36:10" (1/1) ... [2022-11-02 20:36:11,083 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:36:10" (1/1) ... [2022-11-02 20:36:11,089 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:36:11,090 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:36:11,090 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:36:11,091 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:36:11,092 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:36:10" (1/1) ... [2022-11-02 20:36:11,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:36:11,111 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097d5af2-147e-4ae7-978d-44a6016675ab/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:36:11,125 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097d5af2-147e-4ae7-978d-44a6016675ab/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:36:11,172 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097d5af2-147e-4ae7-978d-44a6016675ab/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:36:11,190 INFO L130 BoogieDeclarations]: Found specification of procedure thread_usb [2022-11-02 20:36:11,190 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_usb [2022-11-02 20:36:11,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:36:11,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:36:11,190 INFO L130 BoogieDeclarations]: Found specification of procedure thread_ath9k [2022-11-02 20:36:11,190 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_ath9k [2022-11-02 20:36:11,190 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-02 20:36:11,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:36:11,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:36:11,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:36:11,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:36:11,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:36:11,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:36:11,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:36:11,193 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-02 20:36:11,548 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:36:11,550 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:36:11,926 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:36:11,937 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:36:11,937 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-02 20:36:11,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:36:11 BoogieIcfgContainer [2022-11-02 20:36:11,940 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:36:11,942 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:36:11,942 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:36:11,945 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:36:11,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:36:09" (1/3) ... [2022-11-02 20:36:11,946 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1abf6754 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:36:11, skipping insertion in model container [2022-11-02 20:36:11,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:36:10" (2/3) ... [2022-11-02 20:36:11,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1abf6754 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:36:11, skipping insertion in model container [2022-11-02 20:36:11,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:36:11" (3/3) ... [2022-11-02 20:36:11,948 INFO L112 eAbstractionObserver]: Analyzing ICFG race-4_2-thread_local_vars.i [2022-11-02 20:36:11,957 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 20:36:11,967 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:36:11,967 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2022-11-02 20:36:11,968 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 20:36:12,081 INFO L144 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2022-11-02 20:36:12,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 452 places, 484 transitions, 998 flow [2022-11-02 20:36:12,380 INFO L130 PetriNetUnfolder]: 35/495 cut-off events. [2022-11-02 20:36:12,381 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-02 20:36:12,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 507 conditions, 495 events. 35/495 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1374 event pairs, 0 based on Foata normal form. 0/421 useless extension candidates. Maximal degree in co-relation 348. Up to 11 conditions per place. [2022-11-02 20:36:12,391 INFO L82 GeneralOperation]: Start removeDead. Operand has 452 places, 484 transitions, 998 flow [2022-11-02 20:36:12,400 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 310 places, 328 transitions, 673 flow [2022-11-02 20:36:12,410 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:36:12,417 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@6b20e392, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:36:12,417 INFO L358 AbstractCegarLoop]: Starting to check reachability of 40 error locations. [2022-11-02 20:36:12,422 INFO L130 PetriNetUnfolder]: 0/34 cut-off events. [2022-11-02 20:36:12,422 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:36:12,423 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:36:12,424 INFO L208 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] [2022-11-02 20:36:12,424 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2022-11-02 20:36:12,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:12,430 INFO L85 PathProgramCache]: Analyzing trace with hash -718903709, now seen corresponding path program 1 times [2022-11-02 20:36:12,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:12,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411818205] [2022-11-02 20:36:12,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:12,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:12,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:12,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:36:12,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:12,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411818205] [2022-11-02 20:36:12,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411818205] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:36:12,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:36:12,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:36:12,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571576755] [2022-11-02 20:36:12,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:36:12,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:36:12,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:12,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:36:12,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:36:12,890 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 484 [2022-11-02 20:36:12,919 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 328 transitions, 673 flow. Second operand has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 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) [2022-11-02 20:36:12,919 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:36:12,920 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 484 [2022-11-02 20:36:12,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:36:13,445 INFO L130 PetriNetUnfolder]: 211/1611 cut-off events. [2022-11-02 20:36:13,445 INFO L131 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2022-11-02 20:36:13,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1967 conditions, 1611 events. 211/1611 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 10528 event pairs, 114 based on Foata normal form. 74/1398 useless extension candidates. Maximal degree in co-relation 1626. Up to 328 conditions per place. [2022-11-02 20:36:13,467 INFO L137 encePairwiseOnDemand]: 470/484 looper letters, 47 selfloop transitions, 2 changer transitions 2/309 dead transitions. [2022-11-02 20:36:13,467 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 309 transitions, 733 flow [2022-11-02 20:36:13,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:36:13,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:36:13,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1222 transitions. [2022-11-02 20:36:13,493 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8415977961432507 [2022-11-02 20:36:13,494 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1222 transitions. [2022-11-02 20:36:13,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1222 transitions. [2022-11-02 20:36:13,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:36:13,502 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1222 transitions. [2022-11-02 20:36:13,509 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 407.3333333333333) internal successors, (1222), 3 states have internal predecessors, (1222), 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) [2022-11-02 20:36:13,519 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 484.0) internal successors, (1936), 4 states have internal predecessors, (1936), 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) [2022-11-02 20:36:13,521 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 484.0) internal successors, (1936), 4 states have internal predecessors, (1936), 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) [2022-11-02 20:36:13,523 INFO L175 Difference]: Start difference. First operand has 310 places, 328 transitions, 673 flow. Second operand 3 states and 1222 transitions. [2022-11-02 20:36:13,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 309 transitions, 733 flow [2022-11-02 20:36:13,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 309 transitions, 729 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:36:13,544 INFO L231 Difference]: Finished difference. Result has 302 places, 307 transitions, 631 flow [2022-11-02 20:36:13,547 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=484, PETRI_DIFFERENCE_MINUEND_FLOW=631, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=631, PETRI_PLACES=302, PETRI_TRANSITIONS=307} [2022-11-02 20:36:13,551 INFO L287 CegarLoopForPetriNet]: 310 programPoint places, -8 predicate places. [2022-11-02 20:36:13,552 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 307 transitions, 631 flow [2022-11-02 20:36:13,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 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) [2022-11-02 20:36:13,553 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:36:13,553 INFO L208 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] [2022-11-02 20:36:13,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:36:13,554 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2022-11-02 20:36:13,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:13,555 INFO L85 PathProgramCache]: Analyzing trace with hash 2142060844, now seen corresponding path program 1 times [2022-11-02 20:36:13,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:13,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833078781] [2022-11-02 20:36:13,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:13,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:13,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:13,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:36:13,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:13,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833078781] [2022-11-02 20:36:13,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833078781] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:36:13,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:36:13,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:36:13,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882082864] [2022-11-02 20:36:13,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:36:13,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:36:13,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:13,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:36:13,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:36:13,719 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 484 [2022-11-02 20:36:13,720 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 307 transitions, 631 flow. Second operand has 3 states, 3 states have (on average 391.3333333333333) internal successors, (1174), 3 states have internal predecessors, (1174), 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) [2022-11-02 20:36:13,726 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:36:13,727 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 484 [2022-11-02 20:36:13,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:36:14,242 INFO L130 PetriNetUnfolder]: 225/1916 cut-off events. [2022-11-02 20:36:14,242 INFO L131 PetriNetUnfolder]: For 19/22 co-relation queries the response was YES. [2022-11-02 20:36:14,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2294 conditions, 1916 events. 225/1916 cut-off events. For 19/22 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 13757 event pairs, 45 based on Foata normal form. 1/1630 useless extension candidates. Maximal degree in co-relation 2250. Up to 194 conditions per place. [2022-11-02 20:36:14,262 INFO L137 encePairwiseOnDemand]: 460/484 looper letters, 47 selfloop transitions, 17 changer transitions 0/325 dead transitions. [2022-11-02 20:36:14,262 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 325 transitions, 796 flow [2022-11-02 20:36:14,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:36:14,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:36:14,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1241 transitions. [2022-11-02 20:36:14,266 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8546831955922864 [2022-11-02 20:36:14,266 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1241 transitions. [2022-11-02 20:36:14,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1241 transitions. [2022-11-02 20:36:14,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:36:14,267 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1241 transitions. [2022-11-02 20:36:14,270 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 413.6666666666667) internal successors, (1241), 3 states have internal predecessors, (1241), 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) [2022-11-02 20:36:14,274 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 484.0) internal successors, (1936), 4 states have internal predecessors, (1936), 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) [2022-11-02 20:36:14,275 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 484.0) internal successors, (1936), 4 states have internal predecessors, (1936), 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) [2022-11-02 20:36:14,275 INFO L175 Difference]: Start difference. First operand has 302 places, 307 transitions, 631 flow. Second operand 3 states and 1241 transitions. [2022-11-02 20:36:14,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 325 transitions, 796 flow [2022-11-02 20:36:14,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 325 transitions, 792 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:36:14,288 INFO L231 Difference]: Finished difference. Result has 299 places, 316 transitions, 745 flow [2022-11-02 20:36:14,289 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=484, PETRI_DIFFERENCE_MINUEND_FLOW=621, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=745, PETRI_PLACES=299, PETRI_TRANSITIONS=316} [2022-11-02 20:36:14,289 INFO L287 CegarLoopForPetriNet]: 310 programPoint places, -11 predicate places. [2022-11-02 20:36:14,290 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 316 transitions, 745 flow [2022-11-02 20:36:14,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 391.3333333333333) internal successors, (1174), 3 states have internal predecessors, (1174), 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) [2022-11-02 20:36:14,291 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:36:14,291 INFO L208 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] [2022-11-02 20:36:14,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:36:14,291 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2022-11-02 20:36:14,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:14,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1784969605, now seen corresponding path program 1 times [2022-11-02 20:36:14,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:14,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845327224] [2022-11-02 20:36:14,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:14,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:14,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:14,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:36:14,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:14,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845327224] [2022-11-02 20:36:14,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845327224] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:36:14,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:36:14,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:36:14,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052692045] [2022-11-02 20:36:14,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:36:14,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:36:14,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:14,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:36:14,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:36:14,464 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 484 [2022-11-02 20:36:14,467 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 316 transitions, 745 flow. Second operand has 3 states, 3 states have (on average 389.6666666666667) internal successors, (1169), 3 states have internal predecessors, (1169), 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) [2022-11-02 20:36:14,467 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:36:14,467 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 484 [2022-11-02 20:36:14,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:36:14,880 INFO L130 PetriNetUnfolder]: 221/1786 cut-off events. [2022-11-02 20:36:14,880 INFO L131 PetriNetUnfolder]: For 370/417 co-relation queries the response was YES. [2022-11-02 20:36:14,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2505 conditions, 1786 events. 221/1786 cut-off events. For 370/417 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 12340 event pairs, 74 based on Foata normal form. 0/1524 useless extension candidates. Maximal degree in co-relation 2156. Up to 359 conditions per place. [2022-11-02 20:36:14,899 INFO L137 encePairwiseOnDemand]: 481/484 looper letters, 55 selfloop transitions, 2 changer transitions 0/315 dead transitions. [2022-11-02 20:36:14,899 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 315 transitions, 857 flow [2022-11-02 20:36:14,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:36:14,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:36:14,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1207 transitions. [2022-11-02 20:36:14,903 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.831267217630854 [2022-11-02 20:36:14,903 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1207 transitions. [2022-11-02 20:36:14,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1207 transitions. [2022-11-02 20:36:14,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:36:14,904 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1207 transitions. [2022-11-02 20:36:14,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 402.3333333333333) internal successors, (1207), 3 states have internal predecessors, (1207), 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) [2022-11-02 20:36:14,911 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 484.0) internal successors, (1936), 4 states have internal predecessors, (1936), 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) [2022-11-02 20:36:14,912 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 484.0) internal successors, (1936), 4 states have internal predecessors, (1936), 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) [2022-11-02 20:36:14,912 INFO L175 Difference]: Start difference. First operand has 299 places, 316 transitions, 745 flow. Second operand 3 states and 1207 transitions. [2022-11-02 20:36:14,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 315 transitions, 857 flow [2022-11-02 20:36:14,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 315 transitions, 823 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:36:14,921 INFO L231 Difference]: Finished difference. Result has 298 places, 315 transitions, 713 flow [2022-11-02 20:36:14,922 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=484, PETRI_DIFFERENCE_MINUEND_FLOW=709, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=713, PETRI_PLACES=298, PETRI_TRANSITIONS=315} [2022-11-02 20:36:14,923 INFO L287 CegarLoopForPetriNet]: 310 programPoint places, -12 predicate places. [2022-11-02 20:36:14,923 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 315 transitions, 713 flow [2022-11-02 20:36:14,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 389.6666666666667) internal successors, (1169), 3 states have internal predecessors, (1169), 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) [2022-11-02 20:36:14,924 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:36:14,924 INFO L208 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] [2022-11-02 20:36:14,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:36:14,925 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread_usbErr0ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2022-11-02 20:36:14,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:14,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1008465667, now seen corresponding path program 1 times [2022-11-02 20:36:14,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:14,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094351446] [2022-11-02 20:36:14,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:14,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:14,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:15,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:36:15,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:15,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094351446] [2022-11-02 20:36:15,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094351446] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:36:15,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:36:15,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:36:15,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865602562] [2022-11-02 20:36:15,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:36:15,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:36:15,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:15,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:36:15,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:36:15,077 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 484 [2022-11-02 20:36:15,079 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 315 transitions, 713 flow. Second operand has 3 states, 3 states have (on average 416.3333333333333) internal successors, (1249), 3 states have internal predecessors, (1249), 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) [2022-11-02 20:36:15,079 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:36:15,079 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 484 [2022-11-02 20:36:15,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:36:15,362 INFO L130 PetriNetUnfolder]: 111/1326 cut-off events. [2022-11-02 20:36:15,363 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-11-02 20:36:15,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1573 conditions, 1326 events. 111/1326 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 7966 event pairs, 13 based on Foata normal form. 0/1141 useless extension candidates. Maximal degree in co-relation 1531. Up to 88 conditions per place. [2022-11-02 20:36:15,374 INFO L137 encePairwiseOnDemand]: 481/484 looper letters, 22 selfloop transitions, 2 changer transitions 0/314 dead transitions. [2022-11-02 20:36:15,374 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 314 transitions, 759 flow [2022-11-02 20:36:15,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:36:15,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:36:15,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1270 transitions. [2022-11-02 20:36:15,378 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8746556473829201 [2022-11-02 20:36:15,378 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1270 transitions. [2022-11-02 20:36:15,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1270 transitions. [2022-11-02 20:36:15,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:36:15,383 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1270 transitions. [2022-11-02 20:36:15,386 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 423.3333333333333) internal successors, (1270), 3 states have internal predecessors, (1270), 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) [2022-11-02 20:36:15,389 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 484.0) internal successors, (1936), 4 states have internal predecessors, (1936), 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) [2022-11-02 20:36:15,390 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 484.0) internal successors, (1936), 4 states have internal predecessors, (1936), 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) [2022-11-02 20:36:15,391 INFO L175 Difference]: Start difference. First operand has 298 places, 315 transitions, 713 flow. Second operand 3 states and 1270 transitions. [2022-11-02 20:36:15,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 314 transitions, 759 flow [2022-11-02 20:36:15,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 314 transitions, 755 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:36:15,398 INFO L231 Difference]: Finished difference. Result has 297 places, 314 transitions, 711 flow [2022-11-02 20:36:15,400 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=484, PETRI_DIFFERENCE_MINUEND_FLOW=707, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=711, PETRI_PLACES=297, PETRI_TRANSITIONS=314} [2022-11-02 20:36:15,401 INFO L287 CegarLoopForPetriNet]: 310 programPoint places, -13 predicate places. [2022-11-02 20:36:15,401 INFO L495 AbstractCegarLoop]: Abstraction has has 297 places, 314 transitions, 711 flow [2022-11-02 20:36:15,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 416.3333333333333) internal successors, (1249), 3 states have internal predecessors, (1249), 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) [2022-11-02 20:36:15,403 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:36:15,403 INFO L208 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] [2022-11-02 20:36:15,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:36:15,404 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread_usbErr1ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2022-11-02 20:36:15,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:15,404 INFO L85 PathProgramCache]: Analyzing trace with hash -954520180, now seen corresponding path program 1 times [2022-11-02 20:36:15,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:15,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278920060] [2022-11-02 20:36:15,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:15,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:15,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:15,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:36:15,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:15,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278920060] [2022-11-02 20:36:15,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278920060] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:36:15,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:36:15,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:36:15,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663776784] [2022-11-02 20:36:15,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:36:15,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:36:15,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:15,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:36:15,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:36:15,523 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 417 out of 484 [2022-11-02 20:36:15,525 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 314 transitions, 711 flow. Second operand has 3 states, 3 states have (on average 418.6666666666667) internal successors, (1256), 3 states have internal predecessors, (1256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:15,525 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:36:15,525 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 417 of 484 [2022-11-02 20:36:15,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:36:15,829 INFO L130 PetriNetUnfolder]: 128/1408 cut-off events. [2022-11-02 20:36:15,829 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-11-02 20:36:15,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1653 conditions, 1408 events. 128/1408 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 8614 event pairs, 13 based on Foata normal form. 0/1223 useless extension candidates. Maximal degree in co-relation 1545. Up to 83 conditions per place. [2022-11-02 20:36:15,845 INFO L137 encePairwiseOnDemand]: 476/484 looper letters, 17 selfloop transitions, 5 changer transitions 0/314 dead transitions. [2022-11-02 20:36:15,845 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 314 transitions, 755 flow [2022-11-02 20:36:15,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:36:15,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:36:15,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1276 transitions. [2022-11-02 20:36:15,850 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8787878787878788 [2022-11-02 20:36:15,850 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1276 transitions. [2022-11-02 20:36:15,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1276 transitions. [2022-11-02 20:36:15,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:36:15,851 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1276 transitions. [2022-11-02 20:36:15,854 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 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) [2022-11-02 20:36:15,857 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 484.0) internal successors, (1936), 4 states have internal predecessors, (1936), 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) [2022-11-02 20:36:15,858 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 484.0) internal successors, (1936), 4 states have internal predecessors, (1936), 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) [2022-11-02 20:36:15,859 INFO L175 Difference]: Start difference. First operand has 297 places, 314 transitions, 711 flow. Second operand 3 states and 1276 transitions. [2022-11-02 20:36:15,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 314 transitions, 755 flow [2022-11-02 20:36:15,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 314 transitions, 751 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:36:15,867 INFO L231 Difference]: Finished difference. Result has 295 places, 314 transitions, 728 flow [2022-11-02 20:36:15,868 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=484, PETRI_DIFFERENCE_MINUEND_FLOW=701, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=728, PETRI_PLACES=295, PETRI_TRANSITIONS=314} [2022-11-02 20:36:15,871 INFO L287 CegarLoopForPetriNet]: 310 programPoint places, -15 predicate places. [2022-11-02 20:36:15,872 INFO L495 AbstractCegarLoop]: Abstraction has has 295 places, 314 transitions, 728 flow [2022-11-02 20:36:15,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 418.6666666666667) internal successors, (1256), 3 states have internal predecessors, (1256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:15,873 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:36:15,873 INFO L208 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] [2022-11-02 20:36:15,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:36:15,874 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2022-11-02 20:36:15,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:15,875 INFO L85 PathProgramCache]: Analyzing trace with hash 139043144, now seen corresponding path program 1 times [2022-11-02 20:36:15,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:15,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513344794] [2022-11-02 20:36:15,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:15,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:15,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:16,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:36:16,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:16,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513344794] [2022-11-02 20:36:16,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513344794] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:36:16,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:36:16,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:36:16,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517463934] [2022-11-02 20:36:16,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:36:16,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:36:16,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:16,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:36:16,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:36:16,485 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 484 [2022-11-02 20:36:16,489 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 314 transitions, 728 flow. Second operand has 6 states, 6 states have (on average 429.6666666666667) internal successors, (2578), 6 states have internal predecessors, (2578), 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) [2022-11-02 20:36:16,489 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:36:16,489 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 484 [2022-11-02 20:36:16,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:36:17,017 INFO L130 PetriNetUnfolder]: 397/2037 cut-off events. [2022-11-02 20:36:17,017 INFO L131 PetriNetUnfolder]: For 61/90 co-relation queries the response was YES. [2022-11-02 20:36:17,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2869 conditions, 2037 events. 397/2037 cut-off events. For 61/90 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 13576 event pairs, 51 based on Foata normal form. 20/1790 useless extension candidates. Maximal degree in co-relation 2060. Up to 171 conditions per place. [2022-11-02 20:36:17,037 INFO L137 encePairwiseOnDemand]: 479/484 looper letters, 52 selfloop transitions, 4 changer transitions 16/349 dead transitions. [2022-11-02 20:36:17,038 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 349 transitions, 946 flow [2022-11-02 20:36:17,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:36:17,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:36:17,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2625 transitions. [2022-11-02 20:36:17,043 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9039256198347108 [2022-11-02 20:36:17,044 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2625 transitions. [2022-11-02 20:36:17,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2625 transitions. [2022-11-02 20:36:17,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:36:17,046 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2625 transitions. [2022-11-02 20:36:17,051 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 437.5) internal successors, (2625), 6 states have internal predecessors, (2625), 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) [2022-11-02 20:36:17,057 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 484.0) internal successors, (3388), 7 states have internal predecessors, (3388), 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) [2022-11-02 20:36:17,059 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 484.0) internal successors, (3388), 7 states have internal predecessors, (3388), 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) [2022-11-02 20:36:17,059 INFO L175 Difference]: Start difference. First operand has 295 places, 314 transitions, 728 flow. Second operand 6 states and 2625 transitions. [2022-11-02 20:36:17,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 349 transitions, 946 flow [2022-11-02 20:36:17,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 349 transitions, 941 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:36:17,067 INFO L231 Difference]: Finished difference. Result has 298 places, 297 transitions, 693 flow [2022-11-02 20:36:17,068 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=484, PETRI_DIFFERENCE_MINUEND_FLOW=721, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=693, PETRI_PLACES=298, PETRI_TRANSITIONS=297} [2022-11-02 20:36:17,068 INFO L287 CegarLoopForPetriNet]: 310 programPoint places, -12 predicate places. [2022-11-02 20:36:17,069 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 297 transitions, 693 flow [2022-11-02 20:36:17,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 429.6666666666667) internal successors, (2578), 6 states have internal predecessors, (2578), 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) [2022-11-02 20:36:17,070 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:36:17,070 INFO L208 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] [2022-11-02 20:36:17,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:36:17,071 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread_usbErr11ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2022-11-02 20:36:17,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:17,071 INFO L85 PathProgramCache]: Analyzing trace with hash -873093179, now seen corresponding path program 1 times [2022-11-02 20:36:17,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:17,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953395980] [2022-11-02 20:36:17,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:17,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:17,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:17,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:36:17,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:17,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953395980] [2022-11-02 20:36:17,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953395980] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:36:17,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:36:17,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:36:17,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716162845] [2022-11-02 20:36:17,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:36:17,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:36:17,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:17,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:36:17,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:36:17,147 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 484 [2022-11-02 20:36:17,148 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 297 transitions, 693 flow. Second operand has 3 states, 3 states have (on average 390.6666666666667) internal successors, (1172), 3 states have internal predecessors, (1172), 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) [2022-11-02 20:36:17,148 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:36:17,148 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 484 [2022-11-02 20:36:17,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:36:17,538 INFO L130 PetriNetUnfolder]: 272/1950 cut-off events. [2022-11-02 20:36:17,538 INFO L131 PetriNetUnfolder]: For 147/180 co-relation queries the response was YES. [2022-11-02 20:36:17,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2665 conditions, 1950 events. 272/1950 cut-off events. For 147/180 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 13831 event pairs, 72 based on Foata normal form. 1/1667 useless extension candidates. Maximal degree in co-relation 2575. Up to 371 conditions per place. [2022-11-02 20:36:17,561 INFO L137 encePairwiseOnDemand]: 478/484 looper letters, 55 selfloop transitions, 7 changer transitions 1/307 dead transitions. [2022-11-02 20:36:17,561 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 307 transitions, 849 flow [2022-11-02 20:36:17,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:36:17,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:36:17,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1213 transitions. [2022-11-02 20:36:17,565 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8353994490358126 [2022-11-02 20:36:17,565 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1213 transitions. [2022-11-02 20:36:17,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1213 transitions. [2022-11-02 20:36:17,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:36:17,566 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1213 transitions. [2022-11-02 20:36:17,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 404.3333333333333) internal successors, (1213), 3 states have internal predecessors, (1213), 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) [2022-11-02 20:36:17,571 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 484.0) internal successors, (1936), 4 states have internal predecessors, (1936), 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) [2022-11-02 20:36:17,572 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 484.0) internal successors, (1936), 4 states have internal predecessors, (1936), 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) [2022-11-02 20:36:17,573 INFO L175 Difference]: Start difference. First operand has 298 places, 297 transitions, 693 flow. Second operand 3 states and 1213 transitions. [2022-11-02 20:36:17,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 307 transitions, 849 flow [2022-11-02 20:36:17,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 307 transitions, 842 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:36:17,580 INFO L231 Difference]: Finished difference. Result has 283 places, 301 transitions, 740 flow [2022-11-02 20:36:17,581 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=484, PETRI_DIFFERENCE_MINUEND_FLOW=686, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=740, PETRI_PLACES=283, PETRI_TRANSITIONS=301} [2022-11-02 20:36:17,581 INFO L287 CegarLoopForPetriNet]: 310 programPoint places, -27 predicate places. [2022-11-02 20:36:17,582 INFO L495 AbstractCegarLoop]: Abstraction has has 283 places, 301 transitions, 740 flow [2022-11-02 20:36:17,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 390.6666666666667) internal successors, (1172), 3 states have internal predecessors, (1172), 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) [2022-11-02 20:36:17,582 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:36:17,583 INFO L208 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] [2022-11-02 20:36:17,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:36:17,583 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread_usbErr6ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2022-11-02 20:36:17,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:17,584 INFO L85 PathProgramCache]: Analyzing trace with hash 349733646, now seen corresponding path program 1 times [2022-11-02 20:36:17,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:17,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503978190] [2022-11-02 20:36:17,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:17,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:17,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:17,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:36:17,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:17,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503978190] [2022-11-02 20:36:17,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503978190] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:36:17,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:36:17,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:36:17,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967202942] [2022-11-02 20:36:17,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:36:17,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:36:17,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:17,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:36:17,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:36:17,709 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 432 out of 484 [2022-11-02 20:36:17,711 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 301 transitions, 740 flow. Second operand has 3 states, 3 states have (on average 433.3333333333333) internal successors, (1300), 3 states have internal predecessors, (1300), 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) [2022-11-02 20:36:17,712 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:36:17,712 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 432 of 484 [2022-11-02 20:36:17,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:36:18,017 INFO L130 PetriNetUnfolder]: 151/1516 cut-off events. [2022-11-02 20:36:18,017 INFO L131 PetriNetUnfolder]: For 97/105 co-relation queries the response was YES. [2022-11-02 20:36:18,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1897 conditions, 1516 events. 151/1516 cut-off events. For 97/105 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 9836 event pairs, 14 based on Foata normal form. 0/1319 useless extension candidates. Maximal degree in co-relation 1812. Up to 90 conditions per place. [2022-11-02 20:36:18,042 INFO L137 encePairwiseOnDemand]: 476/484 looper letters, 13 selfloop transitions, 5 changer transitions 0/304 dead transitions. [2022-11-02 20:36:18,042 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 304 transitions, 782 flow [2022-11-02 20:36:18,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:36:18,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:36:18,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1317 transitions. [2022-11-02 20:36:18,046 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9070247933884298 [2022-11-02 20:36:18,046 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1317 transitions. [2022-11-02 20:36:18,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1317 transitions. [2022-11-02 20:36:18,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:36:18,047 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1317 transitions. [2022-11-02 20:36:18,050 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 439.0) internal successors, (1317), 3 states have internal predecessors, (1317), 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) [2022-11-02 20:36:18,068 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 484.0) internal successors, (1936), 4 states have internal predecessors, (1936), 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) [2022-11-02 20:36:18,070 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 484.0) internal successors, (1936), 4 states have internal predecessors, (1936), 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) [2022-11-02 20:36:18,070 INFO L175 Difference]: Start difference. First operand has 283 places, 301 transitions, 740 flow. Second operand 3 states and 1317 transitions. [2022-11-02 20:36:18,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 304 transitions, 782 flow [2022-11-02 20:36:18,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 304 transitions, 768 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:36:18,077 INFO L231 Difference]: Finished difference. Result has 284 places, 303 transitions, 760 flow [2022-11-02 20:36:18,078 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=484, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=760, PETRI_PLACES=284, PETRI_TRANSITIONS=303} [2022-11-02 20:36:18,080 INFO L287 CegarLoopForPetriNet]: 310 programPoint places, -26 predicate places. [2022-11-02 20:36:18,081 INFO L495 AbstractCegarLoop]: Abstraction has has 284 places, 303 transitions, 760 flow [2022-11-02 20:36:18,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 433.3333333333333) internal successors, (1300), 3 states have internal predecessors, (1300), 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) [2022-11-02 20:36:18,082 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:36:18,083 INFO L208 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] [2022-11-02 20:36:18,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:36:18,083 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2022-11-02 20:36:18,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:18,084 INFO L85 PathProgramCache]: Analyzing trace with hash 991462440, now seen corresponding path program 1 times [2022-11-02 20:36:18,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:18,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594833039] [2022-11-02 20:36:18,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:18,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:18,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:18,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:36:18,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:18,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594833039] [2022-11-02 20:36:18,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594833039] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:36:18,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:36:18,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:36:18,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841766034] [2022-11-02 20:36:18,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:36:18,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:36:18,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:18,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:36:18,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:36:18,173 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 484 [2022-11-02 20:36:18,175 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 303 transitions, 760 flow. Second operand has 3 states, 3 states have (on average 390.3333333333333) internal successors, (1171), 3 states have internal predecessors, (1171), 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) [2022-11-02 20:36:18,175 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:36:18,175 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 484 [2022-11-02 20:36:18,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:36:18,670 INFO L130 PetriNetUnfolder]: 392/2581 cut-off events. [2022-11-02 20:36:18,671 INFO L131 PetriNetUnfolder]: For 334/419 co-relation queries the response was YES. [2022-11-02 20:36:18,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3761 conditions, 2581 events. 392/2581 cut-off events. For 334/419 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 20290 event pairs, 90 based on Foata normal form. 4/2264 useless extension candidates. Maximal degree in co-relation 3670. Up to 467 conditions per place. [2022-11-02 20:36:18,699 INFO L137 encePairwiseOnDemand]: 474/484 looper letters, 70 selfloop transitions, 15 changer transitions 0/331 dead transitions. [2022-11-02 20:36:18,699 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 331 transitions, 1033 flow [2022-11-02 20:36:18,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:36:18,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:36:18,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1224 transitions. [2022-11-02 20:36:18,702 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8429752066115702 [2022-11-02 20:36:18,703 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1224 transitions. [2022-11-02 20:36:18,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1224 transitions. [2022-11-02 20:36:18,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:36:18,704 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1224 transitions. [2022-11-02 20:36:18,706 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 408.0) internal successors, (1224), 3 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:18,709 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 484.0) internal successors, (1936), 4 states have internal predecessors, (1936), 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) [2022-11-02 20:36:18,710 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 484.0) internal successors, (1936), 4 states have internal predecessors, (1936), 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) [2022-11-02 20:36:18,710 INFO L175 Difference]: Start difference. First operand has 284 places, 303 transitions, 760 flow. Second operand 3 states and 1224 transitions. [2022-11-02 20:36:18,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 331 transitions, 1033 flow [2022-11-02 20:36:18,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 331 transitions, 1023 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:36:18,719 INFO L231 Difference]: Finished difference. Result has 286 places, 314 transitions, 878 flow [2022-11-02 20:36:18,720 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=484, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=878, PETRI_PLACES=286, PETRI_TRANSITIONS=314} [2022-11-02 20:36:18,721 INFO L287 CegarLoopForPetriNet]: 310 programPoint places, -24 predicate places. [2022-11-02 20:36:18,721 INFO L495 AbstractCegarLoop]: Abstraction has has 286 places, 314 transitions, 878 flow [2022-11-02 20:36:18,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 390.3333333333333) internal successors, (1171), 3 states have internal predecessors, (1171), 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) [2022-11-02 20:36:18,722 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:36:18,722 INFO L208 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] [2022-11-02 20:36:18,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:36:18,722 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread_usbErr2ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2022-11-02 20:36:18,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:18,723 INFO L85 PathProgramCache]: Analyzing trace with hash -989272766, now seen corresponding path program 1 times [2022-11-02 20:36:18,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:18,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462019648] [2022-11-02 20:36:18,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:18,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:18,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:18,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:36:18,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:18,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462019648] [2022-11-02 20:36:18,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462019648] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:36:18,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:36:18,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:36:18,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134261362] [2022-11-02 20:36:18,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:36:18,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:36:18,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:18,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:36:18,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:36:18,808 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 484 [2022-11-02 20:36:18,810 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 314 transitions, 878 flow. Second operand has 3 states, 3 states have (on average 417.6666666666667) internal successors, (1253), 3 states have internal predecessors, (1253), 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) [2022-11-02 20:36:18,810 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:36:18,810 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 484 [2022-11-02 20:36:18,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:36:19,160 INFO L130 PetriNetUnfolder]: 222/1986 cut-off events. [2022-11-02 20:36:19,161 INFO L131 PetriNetUnfolder]: For 427/469 co-relation queries the response was YES. [2022-11-02 20:36:19,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2821 conditions, 1986 events. 222/1986 cut-off events. For 427/469 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 14570 event pairs, 16 based on Foata normal form. 3/1750 useless extension candidates. Maximal degree in co-relation 2734. Up to 127 conditions per place. [2022-11-02 20:36:19,181 INFO L137 encePairwiseOnDemand]: 481/484 looper letters, 21 selfloop transitions, 2 changer transitions 0/313 dead transitions. [2022-11-02 20:36:19,181 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 313 transitions, 922 flow [2022-11-02 20:36:19,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:36:19,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:36:19,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1266 transitions. [2022-11-02 20:36:19,185 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.871900826446281 [2022-11-02 20:36:19,185 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1266 transitions. [2022-11-02 20:36:19,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1266 transitions. [2022-11-02 20:36:19,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:36:19,186 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1266 transitions. [2022-11-02 20:36:19,189 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 422.0) internal successors, (1266), 3 states have internal predecessors, (1266), 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) [2022-11-02 20:36:19,191 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 484.0) internal successors, (1936), 4 states have internal predecessors, (1936), 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) [2022-11-02 20:36:19,192 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 484.0) internal successors, (1936), 4 states have internal predecessors, (1936), 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) [2022-11-02 20:36:19,192 INFO L175 Difference]: Start difference. First operand has 286 places, 314 transitions, 878 flow. Second operand 3 states and 1266 transitions. [2022-11-02 20:36:19,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 313 transitions, 922 flow [2022-11-02 20:36:19,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 313 transitions, 892 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:36:19,200 INFO L231 Difference]: Finished difference. Result has 285 places, 313 transitions, 850 flow [2022-11-02 20:36:19,202 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=484, PETRI_DIFFERENCE_MINUEND_FLOW=846, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=850, PETRI_PLACES=285, PETRI_TRANSITIONS=313} [2022-11-02 20:36:19,203 INFO L287 CegarLoopForPetriNet]: 310 programPoint places, -25 predicate places. [2022-11-02 20:36:19,203 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 313 transitions, 850 flow [2022-11-02 20:36:19,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 417.6666666666667) internal successors, (1253), 3 states have internal predecessors, (1253), 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) [2022-11-02 20:36:19,204 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:36:19,204 INFO L208 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] [2022-11-02 20:36:19,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:36:19,204 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread_usbErr3ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2022-11-02 20:36:19,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:19,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1524366374, now seen corresponding path program 1 times [2022-11-02 20:36:19,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:19,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701327182] [2022-11-02 20:36:19,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:19,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:19,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:19,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:36:19,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:19,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701327182] [2022-11-02 20:36:19,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701327182] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:36:19,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:36:19,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:36:19,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291039010] [2022-11-02 20:36:19,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:36:19,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:36:19,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:19,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:36:19,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:36:19,288 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 484 [2022-11-02 20:36:19,289 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 313 transitions, 850 flow. Second operand has 3 states, 3 states have (on average 390.6666666666667) internal successors, (1172), 3 states have internal predecessors, (1172), 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) [2022-11-02 20:36:19,289 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:36:19,289 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 484 [2022-11-02 20:36:19,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:36:19,749 INFO L130 PetriNetUnfolder]: 333/2445 cut-off events. [2022-11-02 20:36:19,749 INFO L131 PetriNetUnfolder]: For 666/791 co-relation queries the response was YES. [2022-11-02 20:36:19,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3695 conditions, 2445 events. 333/2445 cut-off events. For 666/791 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 19206 event pairs, 61 based on Foata normal form. 2/2155 useless extension candidates. Maximal degree in co-relation 3604. Up to 409 conditions per place. [2022-11-02 20:36:19,775 INFO L137 encePairwiseOnDemand]: 478/484 looper letters, 68 selfloop transitions, 9 changer transitions 0/324 dead transitions. [2022-11-02 20:36:19,775 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 324 transitions, 1054 flow [2022-11-02 20:36:19,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:36:19,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:36:19,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1213 transitions. [2022-11-02 20:36:19,779 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8353994490358126 [2022-11-02 20:36:19,779 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1213 transitions. [2022-11-02 20:36:19,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1213 transitions. [2022-11-02 20:36:19,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:36:19,780 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1213 transitions. [2022-11-02 20:36:19,783 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 404.3333333333333) internal successors, (1213), 3 states have internal predecessors, (1213), 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) [2022-11-02 20:36:19,785 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 484.0) internal successors, (1936), 4 states have internal predecessors, (1936), 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) [2022-11-02 20:36:19,786 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 484.0) internal successors, (1936), 4 states have internal predecessors, (1936), 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) [2022-11-02 20:36:19,786 INFO L175 Difference]: Start difference. First operand has 285 places, 313 transitions, 850 flow. Second operand 3 states and 1213 transitions. [2022-11-02 20:36:19,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 324 transitions, 1054 flow [2022-11-02 20:36:19,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 324 transitions, 1050 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:36:19,794 INFO L231 Difference]: Finished difference. Result has 287 places, 318 transitions, 920 flow [2022-11-02 20:36:19,795 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=484, PETRI_DIFFERENCE_MINUEND_FLOW=846, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=920, PETRI_PLACES=287, PETRI_TRANSITIONS=318} [2022-11-02 20:36:19,796 INFO L287 CegarLoopForPetriNet]: 310 programPoint places, -23 predicate places. [2022-11-02 20:36:19,796 INFO L495 AbstractCegarLoop]: Abstraction has has 287 places, 318 transitions, 920 flow [2022-11-02 20:36:19,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 390.6666666666667) internal successors, (1172), 3 states have internal predecessors, (1172), 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) [2022-11-02 20:36:19,797 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:36:19,797 INFO L208 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] [2022-11-02 20:36:19,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:36:19,797 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2022-11-02 20:36:19,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:19,798 INFO L85 PathProgramCache]: Analyzing trace with hash 909100273, now seen corresponding path program 1 times [2022-11-02 20:36:19,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:19,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57963433] [2022-11-02 20:36:19,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:19,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:19,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:19,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:36:19,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:19,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57963433] [2022-11-02 20:36:19,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57963433] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:36:19,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:36:19,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:36:19,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325026844] [2022-11-02 20:36:19,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:36:19,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:36:19,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:19,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:36:19,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:36:19,903 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 484 [2022-11-02 20:36:19,904 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 318 transitions, 920 flow. Second operand has 3 states, 3 states have (on average 391.6666666666667) internal successors, (1175), 3 states have internal predecessors, (1175), 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) [2022-11-02 20:36:19,905 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:36:19,905 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 484 [2022-11-02 20:36:19,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:36:20,751 INFO L130 PetriNetUnfolder]: 746/4652 cut-off events. [2022-11-02 20:36:20,751 INFO L131 PetriNetUnfolder]: For 2003/2306 co-relation queries the response was YES. [2022-11-02 20:36:20,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7255 conditions, 4652 events. 746/4652 cut-off events. For 2003/2306 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 44363 event pairs, 231 based on Foata normal form. 7/4142 useless extension candidates. Maximal degree in co-relation 6525. Up to 832 conditions per place. [2022-11-02 20:36:20,800 INFO L137 encePairwiseOnDemand]: 478/484 looper letters, 73 selfloop transitions, 9 changer transitions 1/329 dead transitions. [2022-11-02 20:36:20,800 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 329 transitions, 1140 flow [2022-11-02 20:36:20,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:36:20,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:36:20,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1211 transitions. [2022-11-02 20:36:20,803 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8340220385674931 [2022-11-02 20:36:20,803 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1211 transitions. [2022-11-02 20:36:20,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1211 transitions. [2022-11-02 20:36:20,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:36:20,804 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1211 transitions. [2022-11-02 20:36:20,806 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 403.6666666666667) internal successors, (1211), 3 states have internal predecessors, (1211), 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) [2022-11-02 20:36:20,809 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 484.0) internal successors, (1936), 4 states have internal predecessors, (1936), 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) [2022-11-02 20:36:20,809 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 484.0) internal successors, (1936), 4 states have internal predecessors, (1936), 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) [2022-11-02 20:36:20,810 INFO L175 Difference]: Start difference. First operand has 287 places, 318 transitions, 920 flow. Second operand 3 states and 1211 transitions. [2022-11-02 20:36:20,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 329 transitions, 1140 flow [2022-11-02 20:36:20,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 329 transitions, 1116 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-11-02 20:36:20,821 INFO L231 Difference]: Finished difference. Result has 289 places, 322 transitions, 972 flow [2022-11-02 20:36:20,822 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=484, PETRI_DIFFERENCE_MINUEND_FLOW=896, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=972, PETRI_PLACES=289, PETRI_TRANSITIONS=322} [2022-11-02 20:36:20,822 INFO L287 CegarLoopForPetriNet]: 310 programPoint places, -21 predicate places. [2022-11-02 20:36:20,822 INFO L495 AbstractCegarLoop]: Abstraction has has 289 places, 322 transitions, 972 flow [2022-11-02 20:36:20,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 391.6666666666667) internal successors, (1175), 3 states have internal predecessors, (1175), 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) [2022-11-02 20:36:20,823 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:36:20,823 INFO L208 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] [2022-11-02 20:36:20,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:36:20,823 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread_usbErr11ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2022-11-02 20:36:20,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:20,824 INFO L85 PathProgramCache]: Analyzing trace with hash -2135320134, now seen corresponding path program 1 times [2022-11-02 20:36:20,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:20,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408264838] [2022-11-02 20:36:20,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:20,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:20,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:20,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:36:20,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:20,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408264838] [2022-11-02 20:36:20,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408264838] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:36:20,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:36:20,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:36:20,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376573370] [2022-11-02 20:36:20,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:36:20,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:36:20,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:20,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:36:20,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:36:20,954 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 439 out of 484 [2022-11-02 20:36:20,956 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 322 transitions, 972 flow. Second operand has 5 states, 5 states have (on average 441.2) internal successors, (2206), 5 states have internal predecessors, (2206), 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) [2022-11-02 20:36:20,956 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:36:20,956 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 439 of 484 [2022-11-02 20:36:20,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:36:22,048 INFO L130 PetriNetUnfolder]: 732/5579 cut-off events. [2022-11-02 20:36:22,048 INFO L131 PetriNetUnfolder]: For 2477/2589 co-relation queries the response was YES. [2022-11-02 20:36:22,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8518 conditions, 5579 events. 732/5579 cut-off events. For 2477/2589 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 50027 event pairs, 60 based on Foata normal form. 9/4931 useless extension candidates. Maximal degree in co-relation 8429. Up to 396 conditions per place. [2022-11-02 20:36:22,102 INFO L137 encePairwiseOnDemand]: 476/484 looper letters, 23 selfloop transitions, 8 changer transitions 0/337 dead transitions. [2022-11-02 20:36:22,102 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 337 transitions, 1078 flow [2022-11-02 20:36:22,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:36:22,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-02 20:36:22,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 3105 transitions. [2022-11-02 20:36:22,108 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.916469893742621 [2022-11-02 20:36:22,108 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 3105 transitions. [2022-11-02 20:36:22,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 3105 transitions. [2022-11-02 20:36:22,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:36:22,111 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 3105 transitions. [2022-11-02 20:36:22,117 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 443.57142857142856) internal successors, (3105), 7 states have internal predecessors, (3105), 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) [2022-11-02 20:36:22,122 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 484.0) internal successors, (3872), 8 states have internal predecessors, (3872), 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) [2022-11-02 20:36:22,124 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 484.0) internal successors, (3872), 8 states have internal predecessors, (3872), 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) [2022-11-02 20:36:22,124 INFO L175 Difference]: Start difference. First operand has 289 places, 322 transitions, 972 flow. Second operand 7 states and 3105 transitions. [2022-11-02 20:36:22,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 337 transitions, 1078 flow [2022-11-02 20:36:22,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 337 transitions, 1048 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-11-02 20:36:22,138 INFO L231 Difference]: Finished difference. Result has 298 places, 329 transitions, 1000 flow [2022-11-02 20:36:22,139 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=484, PETRI_DIFFERENCE_MINUEND_FLOW=942, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1000, PETRI_PLACES=298, PETRI_TRANSITIONS=329} [2022-11-02 20:36:22,139 INFO L287 CegarLoopForPetriNet]: 310 programPoint places, -12 predicate places. [2022-11-02 20:36:22,139 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 329 transitions, 1000 flow [2022-11-02 20:36:22,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 441.2) internal successors, (2206), 5 states have internal predecessors, (2206), 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) [2022-11-02 20:36:22,140 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:36:22,141 INFO L208 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] [2022-11-02 20:36:22,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:36:22,141 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2022-11-02 20:36:22,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:22,142 INFO L85 PathProgramCache]: Analyzing trace with hash 391326513, now seen corresponding path program 1 times [2022-11-02 20:36:22,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:22,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489852205] [2022-11-02 20:36:22,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:22,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:22,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:22,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:36:22,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:22,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489852205] [2022-11-02 20:36:22,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489852205] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:36:22,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:36:22,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:36:22,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19782393] [2022-11-02 20:36:22,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:36:22,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:36:22,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:22,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:36:22,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:36:22,272 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 440 out of 484 [2022-11-02 20:36:22,275 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 329 transitions, 1000 flow. Second operand has 5 states, 5 states have (on average 442.0) internal successors, (2210), 5 states have internal predecessors, (2210), 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) [2022-11-02 20:36:22,275 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:36:22,276 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 440 of 484 [2022-11-02 20:36:22,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:36:23,708 INFO L130 PetriNetUnfolder]: 832/6452 cut-off events. [2022-11-02 20:36:23,709 INFO L131 PetriNetUnfolder]: For 2590/2708 co-relation queries the response was YES. [2022-11-02 20:36:23,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9939 conditions, 6452 events. 832/6452 cut-off events. For 2590/2708 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 58764 event pairs, 77 based on Foata normal form. 11/5737 useless extension candidates. Maximal degree in co-relation 9846. Up to 486 conditions per place. [2022-11-02 20:36:23,797 INFO L137 encePairwiseOnDemand]: 477/484 looper letters, 26 selfloop transitions, 9 changer transitions 0/349 dead transitions. [2022-11-02 20:36:23,797 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 349 transitions, 1121 flow [2022-11-02 20:36:23,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:36:23,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-02 20:36:23,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 3116 transitions. [2022-11-02 20:36:23,804 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9197166469893743 [2022-11-02 20:36:23,805 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 3116 transitions. [2022-11-02 20:36:23,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 3116 transitions. [2022-11-02 20:36:23,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:36:23,807 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 3116 transitions. [2022-11-02 20:36:23,814 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 445.14285714285717) internal successors, (3116), 7 states have internal predecessors, (3116), 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) [2022-11-02 20:36:23,821 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 484.0) internal successors, (3872), 8 states have internal predecessors, (3872), 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) [2022-11-02 20:36:23,822 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 484.0) internal successors, (3872), 8 states have internal predecessors, (3872), 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) [2022-11-02 20:36:23,823 INFO L175 Difference]: Start difference. First operand has 298 places, 329 transitions, 1000 flow. Second operand 7 states and 3116 transitions. [2022-11-02 20:36:23,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 349 transitions, 1121 flow [2022-11-02 20:36:23,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 349 transitions, 1121 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:36:23,840 INFO L231 Difference]: Finished difference. Result has 310 places, 337 transitions, 1068 flow [2022-11-02 20:36:23,840 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=484, PETRI_DIFFERENCE_MINUEND_FLOW=1000, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=329, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1068, PETRI_PLACES=310, PETRI_TRANSITIONS=337} [2022-11-02 20:36:23,841 INFO L287 CegarLoopForPetriNet]: 310 programPoint places, 0 predicate places. [2022-11-02 20:36:23,841 INFO L495 AbstractCegarLoop]: Abstraction has has 310 places, 337 transitions, 1068 flow [2022-11-02 20:36:23,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 442.0) internal successors, (2210), 5 states have internal predecessors, (2210), 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) [2022-11-02 20:36:23,842 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:36:23,842 INFO L208 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] [2022-11-02 20:36:23,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:36:23,843 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2022-11-02 20:36:23,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:23,843 INFO L85 PathProgramCache]: Analyzing trace with hash -736200102, now seen corresponding path program 1 times [2022-11-02 20:36:23,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:23,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481696041] [2022-11-02 20:36:23,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:23,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:23,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:36:23,894 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:36:23,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:36:23,975 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:36:23,976 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 20:36:23,977 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE (39 of 40 remaining) [2022-11-02 20:36:23,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE (38 of 40 remaining) [2022-11-02 20:36:23,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE (37 of 40 remaining) [2022-11-02 20:36:23,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (36 of 40 remaining) [2022-11-02 20:36:23,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (35 of 40 remaining) [2022-11-02 20:36:23,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (34 of 40 remaining) [2022-11-02 20:36:23,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (33 of 40 remaining) [2022-11-02 20:36:23,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (32 of 40 remaining) [2022-11-02 20:36:23,982 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (31 of 40 remaining) [2022-11-02 20:36:23,982 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (30 of 40 remaining) [2022-11-02 20:36:23,982 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 40 remaining) [2022-11-02 20:36:23,982 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr0ASSERT_VIOLATIONDATA_RACE (28 of 40 remaining) [2022-11-02 20:36:23,982 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr11ASSERT_VIOLATIONDATA_RACE (27 of 40 remaining) [2022-11-02 20:36:23,983 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr1ASSERT_VIOLATIONDATA_RACE (26 of 40 remaining) [2022-11-02 20:36:23,983 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr12ASSERT_VIOLATIONDATA_RACE (25 of 40 remaining) [2022-11-02 20:36:23,983 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr5ASSERT_VIOLATIONDATA_RACE (24 of 40 remaining) [2022-11-02 20:36:23,983 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr10ASSERT_VIOLATIONDATA_RACE (23 of 40 remaining) [2022-11-02 20:36:23,983 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr6ASSERT_VIOLATIONDATA_RACE (22 of 40 remaining) [2022-11-02 20:36:23,984 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr7ASSERT_VIOLATIONDATA_RACE (21 of 40 remaining) [2022-11-02 20:36:23,984 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr2ASSERT_VIOLATIONDATA_RACE (20 of 40 remaining) [2022-11-02 20:36:23,984 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr8ASSERT_VIOLATIONDATA_RACE (19 of 40 remaining) [2022-11-02 20:36:23,984 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr9ASSERT_VIOLATIONDATA_RACE (18 of 40 remaining) [2022-11-02 20:36:23,984 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr3ASSERT_VIOLATIONDATA_RACE (17 of 40 remaining) [2022-11-02 20:36:23,985 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr4ASSERT_VIOLATIONDATA_RACE (16 of 40 remaining) [2022-11-02 20:36:23,985 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 40 remaining) [2022-11-02 20:36:23,985 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE (14 of 40 remaining) [2022-11-02 20:36:23,985 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr0ASSERT_VIOLATIONDATA_RACE (13 of 40 remaining) [2022-11-02 20:36:23,985 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr11ASSERT_VIOLATIONDATA_RACE (12 of 40 remaining) [2022-11-02 20:36:23,987 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr1ASSERT_VIOLATIONDATA_RACE (11 of 40 remaining) [2022-11-02 20:36:23,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr12ASSERT_VIOLATIONDATA_RACE (10 of 40 remaining) [2022-11-02 20:36:23,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr5ASSERT_VIOLATIONDATA_RACE (9 of 40 remaining) [2022-11-02 20:36:23,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr10ASSERT_VIOLATIONDATA_RACE (8 of 40 remaining) [2022-11-02 20:36:23,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr6ASSERT_VIOLATIONDATA_RACE (7 of 40 remaining) [2022-11-02 20:36:23,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr7ASSERT_VIOLATIONDATA_RACE (6 of 40 remaining) [2022-11-02 20:36:23,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr2ASSERT_VIOLATIONDATA_RACE (5 of 40 remaining) [2022-11-02 20:36:23,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr8ASSERT_VIOLATIONDATA_RACE (4 of 40 remaining) [2022-11-02 20:36:23,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr9ASSERT_VIOLATIONDATA_RACE (3 of 40 remaining) [2022-11-02 20:36:23,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr3ASSERT_VIOLATIONDATA_RACE (2 of 40 remaining) [2022-11-02 20:36:23,990 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr4ASSERT_VIOLATIONDATA_RACE (1 of 40 remaining) [2022-11-02 20:36:23,990 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbThread1of1ForFork1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 40 remaining) [2022-11-02 20:36:23,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:36:23,990 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:36:24,000 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-02 20:36:24,000 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:36:24,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:36:24 BasicIcfg [2022-11-02 20:36:24,155 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:36:24,155 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:36:24,155 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:36:24,156 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:36:24,156 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:36:11" (3/4) ... [2022-11-02 20:36:24,159 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-02 20:36:24,159 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:36:24,160 INFO L158 Benchmark]: Toolchain (without parser) took 14559.98ms. Allocated memory was 113.2MB in the beginning and 675.3MB in the end (delta: 562.0MB). Free memory was 77.5MB in the beginning and 399.8MB in the end (delta: -322.3MB). Peak memory consumption was 238.5MB. Max. memory is 16.1GB. [2022-11-02 20:36:24,160 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 83.9MB. Free memory is still 41.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:36:24,161 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1328.48ms. Allocated memory is still 113.2MB. Free memory was 77.3MB in the beginning and 43.4MB in the end (delta: 33.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2022-11-02 20:36:24,161 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.78ms. Allocated memory is still 113.2MB. Free memory was 43.4MB in the beginning and 39.3MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 20:36:24,162 INFO L158 Benchmark]: Boogie Preprocessor took 75.31ms. Allocated memory is still 113.2MB. Free memory was 39.3MB in the beginning and 88.0MB in the end (delta: -48.7MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. [2022-11-02 20:36:24,162 INFO L158 Benchmark]: RCFGBuilder took 849.82ms. Allocated memory is still 113.2MB. Free memory was 88.0MB in the beginning and 59.3MB in the end (delta: 28.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-11-02 20:36:24,162 INFO L158 Benchmark]: TraceAbstraction took 12212.80ms. Allocated memory was 113.2MB in the beginning and 675.3MB in the end (delta: 562.0MB). Free memory was 58.7MB in the beginning and 400.9MB in the end (delta: -342.2MB). Peak memory consumption was 220.9MB. Max. memory is 16.1GB. [2022-11-02 20:36:24,163 INFO L158 Benchmark]: Witness Printer took 4.29ms. Allocated memory is still 675.3MB. Free memory was 400.9MB in the beginning and 399.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:36:24,164 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 83.9MB. Free memory is still 41.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1328.48ms. Allocated memory is still 113.2MB. Free memory was 77.3MB in the beginning and 43.4MB in the end (delta: 33.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.78ms. Allocated memory is still 113.2MB. Free memory was 43.4MB in the beginning and 39.3MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.31ms. Allocated memory is still 113.2MB. Free memory was 39.3MB in the beginning and 88.0MB in the end (delta: -48.7MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. * RCFGBuilder took 849.82ms. Allocated memory is still 113.2MB. Free memory was 88.0MB in the beginning and 59.3MB in the end (delta: 28.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 12212.80ms. Allocated memory was 113.2MB in the beginning and 675.3MB in the end (delta: 562.0MB). Free memory was 58.7MB in the beginning and 400.9MB in the end (delta: -342.2MB). Peak memory consumption was 220.9MB. Max. memory is 16.1GB. * Witness Printer took 4.29ms. Allocated memory is still 675.3MB. Free memory was 400.9MB in the beginning and 399.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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={3:0}, t2={4:0}] [L1695] 0 pthread_mutex_t mutex; VAL [mutex={5:0}, t1={3:0}, t2={4:0}] [L1696] 0 int pdev; VAL [mutex={5:0}, pdev=0, t1={3:0}, t2={4:0}] [L1741] 0 int ldv_usb_state; VAL [ldv_usb_state=0, mutex={5:0}, pdev=0, t1={3:0}, t2={4:0}] [L1798] CALL 0 module_init() [L1779] 0 pdev = 1 VAL [ldv_usb_state=0, mutex={5:0}, pdev=1, t1={3:0}, t2={4:0}] [L1780] EXPR 0 pdev==1 VAL [ldv_usb_state=0, mutex={5:0}, pdev=1, t1={3:0}, t2={4:0}] [L1780] CALL 0 ldv_assert(pdev==1) [L1693] COND FALSE 0 !(!expression) VAL [\old(expression)=1, expression=1, ldv_usb_state=0, mutex={5:0}, pdev=1, t1={3:0}, t2={4:0}] [L1780] RET 0 ldv_assert(pdev==1) [L1781] COND TRUE 0 __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=1, ldv_usb_state=0, mutex={5:0}, pdev=1, t1={3:0}, t2={4:0}] [L1782] FCALL, FORK 0 pthread_create(&t1, ((void *)0), thread_usb, ((void *)0)) VAL [ldv_usb_state=0, mutex={5:0}, pdev=1, pthread_create(&t1, ((void *)0), thread_usb, ((void *)0))=-1, t1={3:0}, t2={4:0}] [L1743] 1 ldv_usb_state = 0 VAL [arg={0:0}, arg={0:0}, ldv_usb_state=0, mutex={5:0}, pdev=1, t1={3:0}, t2={4:0}] [L1744] 1 int probe_ret; VAL [arg={0:0}, arg={0:0}, ldv_usb_state=0, mutex={5:0}, pdev=1, t1={3:0}, t2={4:0}] [L1745] COND TRUE 1 1 VAL [arg={0:0}, arg={0:0}, ldv_usb_state=0, mutex={5:0}, pdev=1, t1={3:0}, t2={4:0}] [L1747] 1 case 0: VAL [__VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, ldv_usb_state=0, mutex={5:0}, pdev=1, t1={3:0}, t2={4:0}] [L1748] 1 ldv_usb_state==0 VAL [__VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, ldv_usb_state=0, mutex={5:0}, pdev=1, t1={3:0}, t2={4:0}] [L1748] COND TRUE 1 ldv_usb_state==0 VAL [__VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, ldv_usb_state=0, mutex={5:0}, pdev=1, t1={3:0}, t2={4:0}] [L1749] CALL, EXPR 1 ath_ahb_probe() [L1730] 1 int error; VAL [ldv_usb_state=0, mutex={5:0}, pdev=1, t1={3:0}, t2={4:0}] [L1731] CALL, EXPR 1 ieee80211_register_hw() [L1717] COND TRUE 1 __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=1, ldv_usb_state=0, mutex={5:0}, pdev=1, t1={3:0}, t2={4:0}] [L1718] FCALL, FORK 1 pthread_create(&t2, ((void *)0), thread_ath9k, ((void *)0)) VAL [ldv_usb_state=0, mutex={5:0}, pdev=1, pthread_create(&t2, ((void *)0), thread_ath9k, ((void *)0))=0, t1={3:0}, t2={4:0}] [L1704] COND TRUE 2 1 VAL [arg={0:0}, arg={0:0}, ldv_usb_state=0, mutex={5:0}, pdev=1, t1={3:0}, t2={4:0}] [L1706] 2 case 1: VAL [__VERIFIER_nondet_int()=1, arg={0:0}, arg={0:0}, ldv_usb_state=0, mutex={5:0}, pdev=1, t1={3:0}, t2={4:0}] [L1707] CALL 2 ath9k_flush() [L1699] 2 pdev = 6 VAL [ldv_usb_state=0, mutex={5:0}, pdev=6, pdev = 6=1151, t1={3:0}, t2={4:0}] [L1719] 1 return 0; VAL [\result=0, ldv_usb_state=0, mutex={5:0}, pdev=6, t1={3:0}, t2={4:0}] [L1731] RET, EXPR 1 ieee80211_register_hw() [L1731] 1 error = ieee80211_register_hw() VAL [error=0, ieee80211_register_hw()=0, ldv_usb_state=0, mutex={5:0}, pdev=6, t1={3:0}, t2={4:0}] [L1732] COND FALSE 1 !(\read(error)) VAL [error=0, ldv_usb_state=0, mutex={5:0}, pdev=6, t1={3:0}, t2={4:0}] [L1734] 1 return 0; VAL [\result=0, error=0, ldv_usb_state=0, mutex={5:0}, pdev=6, t1={3:0}, t2={4:0}] [L1749] RET, EXPR 1 ath_ahb_probe() [L1749] 1 probe_ret = ath_ahb_probe() VAL [__VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, ath_ahb_probe()=0, ldv_usb_state=0, mutex={5:0}, pdev=6, probe_ret=0, t1={3:0}, t2={4:0}] [L1750] COND FALSE 1 !(probe_ret!=0) VAL [__VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, ldv_usb_state=0, mutex={5:0}, pdev=6, probe_ret=0, t1={3:0}, t2={4:0}] [L1752] 1 ldv_usb_state = 1 VAL [__VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, ldv_usb_state=1, mutex={5:0}, pdev=6, probe_ret=0, t1={3:0}, t2={4:0}] [L1753] 1 pdev = 7 VAL [__VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, ldv_usb_state=1, mutex={5:0}, pdev=7, pdev = 7=1150, probe_ret=0, t1={3:0}, t2={4:0}] [L1699] 2 pdev = 6 VAL [ldv_usb_state=1, mutex={5:0}, pdev=7, pdev = 6=1151, t1={3:0}, t2={4: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: 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, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) 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: 1760]: 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: 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: 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, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1718]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 491 locations, 40 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: 11.9s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 131 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 131 mSDsluCounter, 394 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 133 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 659 IncrementalHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 351 mSDtfsCounter, 659 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1068occurred in iteration=14, InterpolantAutomatonStates: 53, 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.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1192 NumberOfCodeBlocks, 1192 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1062 ConstructedInterpolants, 0 QuantifiedInterpolants, 1215 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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 could not prove your program: unable to determine feasibility of some traces [2022-11-02 20:36:24,367 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097d5af2-147e-4ae7-978d-44a6016675ab/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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